/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_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 12:35:15,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 12:35:15,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 12:35:15,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 12:35:15,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 12:35:15,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 12:35:15,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 12:35:15,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 12:35:15,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 12:35:15,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 12:35:15,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 12:35:15,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 12:35:15,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 12:35:15,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 12:35:15,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 12:35:15,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 12:35:15,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 12:35:15,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 12:35:15,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 12:35:15,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 12:35:15,242 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 12:35:15,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 12:35:15,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 12:35:15,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 12:35:15,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 12:35:15,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 12:35:15,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 12:35:15,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 12:35:15,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 12:35:15,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 12:35:15,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 12:35:15,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 12:35:15,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 12:35:15,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 12:35:15,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 12:35:15,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 12:35:15,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 12:35:15,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 12:35:15,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 12:35:15,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 12:35:15,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 12:35:15,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 12:35:15,255 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 12:35:15,261 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 12:35:15,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 12:35:15,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 12:35:15,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 12:35:15,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 12:35:15,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 12:35:15,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 12:35:15,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 12:35:15,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 12:35:15,263 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 12:35:15,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 12:35:15,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 12:35:15,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 12:35:15,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 12:35:15,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 12:35:15,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:35:15,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 12:35:15,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 12:35:15,264 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 12:35:15,264 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 12:35:15,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 12:35:15,265 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 12:35:15,265 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 12:35:15,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 12:35:15,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 12:35:15,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 12:35:15,495 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 12:35:15,495 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 12:35:15,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2022-04-08 12:35:15,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d429743f/be9d70358d404c7899c74087239f185c/FLAG4d5cc4adf [2022-04-08 12:35:15,935 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 12:35:15,935 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2022-04-08 12:35:15,945 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d429743f/be9d70358d404c7899c74087239f185c/FLAG4d5cc4adf [2022-04-08 12:35:15,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d429743f/be9d70358d404c7899c74087239f185c [2022-04-08 12:35:15,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 12:35:15,964 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 12:35:15,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 12:35:15,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 12:35:15,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 12:35:15,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:35:15" (1/1) ... [2022-04-08 12:35:15,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599df675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:15, skipping insertion in model container [2022-04-08 12:35:15,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:35:15" (1/1) ... [2022-04-08 12:35:15,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 12:35:15,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 12:35:16,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c[535,548] [2022-04-08 12:35:16,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:35:16,163 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 12:35:16,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c[535,548] [2022-04-08 12:35:16,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:35:16,196 INFO L208 MainTranslator]: Completed translation [2022-04-08 12:35:16,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:16 WrapperNode [2022-04-08 12:35:16,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 12:35:16,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 12:35:16,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 12:35:16,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 12:35:16,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:16" (1/1) ... [2022-04-08 12:35:16,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:16" (1/1) ... [2022-04-08 12:35:16,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:16" (1/1) ... [2022-04-08 12:35:16,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:16" (1/1) ... [2022-04-08 12:35:16,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:16" (1/1) ... [2022-04-08 12:35:16,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:16" (1/1) ... [2022-04-08 12:35:16,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:16" (1/1) ... [2022-04-08 12:35:16,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 12:35:16,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 12:35:16,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 12:35:16,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 12:35:16,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:16" (1/1) ... [2022-04-08 12:35:16,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:35:16,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:35:16,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 12:35:16,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 12:35:16,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 12:35:16,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 12:35:16,323 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 12:35:16,323 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 12:35:16,324 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 12:35:16,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 12:35:16,324 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 12:35:16,324 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 12:35:16,324 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 12:35:16,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 12:35:16,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 12:35:16,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 12:35:16,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 12:35:16,325 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 12:35:16,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 12:35:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 12:35:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 12:35:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 12:35:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 12:35:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 12:35:16,377 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 12:35:16,378 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 12:35:16,517 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 12:35:16,523 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 12:35:16,523 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 12:35:16,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:35:16 BoogieIcfgContainer [2022-04-08 12:35:16,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 12:35:16,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 12:35:16,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 12:35:16,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 12:35:16,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:35:15" (1/3) ... [2022-04-08 12:35:16,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c47d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:35:16, skipping insertion in model container [2022-04-08 12:35:16,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:16" (2/3) ... [2022-04-08 12:35:16,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c47d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:35:16, skipping insertion in model container [2022-04-08 12:35:16,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:35:16" (3/3) ... [2022-04-08 12:35:16,531 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound100.c [2022-04-08 12:35:16,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 12:35:16,536 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 12:35:16,574 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 12:35:16,579 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 12:35:16,580 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 12:35:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 12:35:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 12:35:16,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:35:16,601 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:35:16,601 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:35:16,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:35:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-08 12:35:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:16,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [480708406] [2022-04-08 12:35:16,620 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:35:16,621 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-08 12:35:16,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:35:16,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320708015] [2022-04-08 12:35:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:35:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:35:16,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:35:16,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [648487539] [2022-04-08 12:35:16,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:35:16,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:16,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:35:16,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:35:16,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 12:35:16,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:35:16,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:35:16,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-08 12:35:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:35:16,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:35:16,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-08 12:35:16,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-08 12:35:16,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 12:35:16,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-08 12:35:16,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-08 12:35:16,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-08 12:35:16,928 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-08 12:35:16,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:35:16,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-08 12:35:16,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 12:35:16,929 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-08 12:35:16,929 INFO L272 TraceCheckUtils]: 11: Hoare triple {40#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40#true} is VALID [2022-04-08 12:35:16,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:35:16,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 12:35:16,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 12:35:16,931 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-08 12:35:16,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-08 12:35:16,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-08 12:35:16,932 INFO L272 TraceCheckUtils]: 18: Hoare triple {41#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41#false} is VALID [2022-04-08 12:35:16,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-08 12:35:16,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-08 12:35:16,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-08 12:35:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 12:35:16,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:35:16,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:35:16,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320708015] [2022-04-08 12:35:16,934 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:35:16,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648487539] [2022-04-08 12:35:16,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648487539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:16,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:16,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 12:35:16,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:35:16,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [480708406] [2022-04-08 12:35:16,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [480708406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:16,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:16,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 12:35:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039654209] [2022-04-08 12:35:16,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:35:16,944 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 12:35:16,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:35:16,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:35:16,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:16,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-08 12:35:16,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-08 12:35:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 12:35:16,995 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:35:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:17,099 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-08 12:35:17,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-08 12:35:17,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 12:35:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:35:17,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:35:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-08 12:35:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:35:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-08 12:35:17,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-08 12:35:17,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:17,231 INFO L225 Difference]: With dead ends: 67 [2022-04-08 12:35:17,232 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 12:35:17,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 12:35:17,242 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:35:17,243 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:35:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 12:35:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 12:35:17,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:35:17,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:35:17,277 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:35:17,278 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:35:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:17,286 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 12:35:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 12:35:17,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:17,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:17,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-08 12:35:17,298 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-08 12:35:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:17,302 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 12:35:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 12:35:17,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:17,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:17,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:35:17,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:35:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:35:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 12:35:17,307 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-08 12:35:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:35:17,307 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 12:35:17,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:35:17,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-08 12:35:17,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 12:35:17,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 12:35:17,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:35:17,346 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:35:17,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 12:35:17,570 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-08 12:35:17,570 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:35:17,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:35:17,571 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-08 12:35:17,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:17,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [58870049] [2022-04-08 12:35:17,576 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:35:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-08 12:35:17,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:35:17,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000289503] [2022-04-08 12:35:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:35:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:35:17,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:35:17,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962431846] [2022-04-08 12:35:17,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:35:17,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:17,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:35:17,597 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:35:17,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 12:35:17,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:35:17,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:35:17,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 12:35:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:35:17,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:35:17,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-08 12:35:17,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,879 INFO L272 TraceCheckUtils]: 6: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,881 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,881 INFO L272 TraceCheckUtils]: 11: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,886 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {377#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:17,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {426#(<= |main_#t~post6| 0)} is VALID [2022-04-08 12:35:17,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {370#false} is VALID [2022-04-08 12:35:17,888 INFO L272 TraceCheckUtils]: 19: Hoare triple {370#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {370#false} is VALID [2022-04-08 12:35:17,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-08 12:35:17,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-08 12:35:17,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-08 12:35:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:35:17,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:35:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:35:17,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000289503] [2022-04-08 12:35:17,890 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:35:17,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962431846] [2022-04-08 12:35:17,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962431846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:17,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:17,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:35:17,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:35:17,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [58870049] [2022-04-08 12:35:17,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [58870049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:17,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:17,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:35:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117031390] [2022-04-08 12:35:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:35:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 12:35:17,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:35:17,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:35:17,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:17,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:35:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:17,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:35:17,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:35:17,922 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:35:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:18,037 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-08 12:35:18,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 12:35:18,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 12:35:18,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:35:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:35:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 12:35:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:35:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 12:35:18,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-08 12:35:18,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:18,098 INFO L225 Difference]: With dead ends: 41 [2022-04-08 12:35:18,098 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 12:35:18,098 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:35:18,106 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:35:18,106 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:35:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 12:35:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 12:35:18,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:35:18,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:35:18,125 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:35:18,125 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:35:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:18,128 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 12:35:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 12:35:18,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:18,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:18,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-08 12:35:18,129 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-08 12:35:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:18,131 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 12:35:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 12:35:18,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:18,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:18,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:35:18,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:35:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:35:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-08 12:35:18,135 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-08 12:35:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:35:18,135 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-08 12:35:18,135 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:35:18,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-08 12:35:18,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 12:35:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 12:35:18,182 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:35:18,182 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:35:18,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 12:35:18,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-08 12:35:18,383 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:35:18,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:35:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-08 12:35:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:18,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [491356915] [2022-04-08 12:35:18,385 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:35:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-08 12:35:18,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:35:18,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480865281] [2022-04-08 12:35:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:35:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:35:18,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:35:18,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457738522] [2022-04-08 12:35:18,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:35:18,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:18,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:35:18,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:35:18,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 12:35:18,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:35:18,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:35:18,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 12:35:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:35:18,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:35:18,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-08 12:35:18,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {659#true} is VALID [2022-04-08 12:35:18,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 12:35:18,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-08 12:35:18,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-08 12:35:18,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {659#true} is VALID [2022-04-08 12:35:18,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {659#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {659#true} is VALID [2022-04-08 12:35:18,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-08 12:35:18,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-08 12:35:18,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 12:35:18,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-08 12:35:18,806 INFO L272 TraceCheckUtils]: 11: Hoare triple {659#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {659#true} is VALID [2022-04-08 12:35:18,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-08 12:35:18,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-08 12:35:18,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 12:35:18,807 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-08 12:35:20,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {659#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-08 12:35:20,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-08 12:35:20,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-08 12:35:20,777 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:35:20,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:35:20,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-08 12:35:20,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-08 12:35:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:35:20,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:35:20,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:35:20,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480865281] [2022-04-08 12:35:20,779 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:35:20,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457738522] [2022-04-08 12:35:20,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457738522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:20,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:20,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:35:20,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:35:20,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [491356915] [2022-04-08 12:35:20,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [491356915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:20,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:20,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:35:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295464106] [2022-04-08 12:35:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:35:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-08 12:35:20,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:35:20,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:35:24,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:24,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:35:24,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:24,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:35:24,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:35:24,195 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:35:25,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:35:29,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:35:31,343 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:35:33,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:35:38,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:38,114 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-08 12:35:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:35:38,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-08 12:35:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:35:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:35:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 12:35:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:35:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 12:35:38,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-08 12:35:41,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:41,838 INFO L225 Difference]: With dead ends: 53 [2022-04-08 12:35:41,838 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 12:35:41,839 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 12:35:41,839 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-04-08 12:35:41,840 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2022-04-08 12:35:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 12:35:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-08 12:35:41,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:35:41,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 12:35:41,872 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 12:35:41,872 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 12:35:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:41,877 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 12:35:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-08 12:35:41,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:41,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:41,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-08 12:35:41,882 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-08 12:35:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:41,884 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 12:35:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-08 12:35:41,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:41,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:41,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:35:41,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:35:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 12:35:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-08 12:35:41,888 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-08 12:35:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:35:41,888 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-08 12:35:41,888 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:35:41,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-08 12:35:49,961 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-08 12:35:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-08 12:35:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 12:35:49,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:35:49,962 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:35:49,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 12:35:50,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:50,172 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:35:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:35:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-08 12:35:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:50,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1684796570] [2022-04-08 12:35:50,173 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:35:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-08 12:35:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:35:50,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278928940] [2022-04-08 12:35:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:35:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:35:50,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:35:50,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1293656704] [2022-04-08 12:35:50,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:35:50,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:50,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:35:50,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:35:50,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 12:35:50,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:35:50,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:35:50,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 12:35:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:35:50,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:35:50,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-08 12:35:50,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1042#true} is VALID [2022-04-08 12:35:50,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 12:35:50,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-08 12:35:50,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-08 12:35:50,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1042#true} is VALID [2022-04-08 12:35:50,420 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-08 12:35:50,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 12:35:50,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 12:35:50,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 12:35:50,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-08 12:35:50,420 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1042#true} is VALID [2022-04-08 12:35:50,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 12:35:50,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 12:35:50,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 12:35:50,421 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-08 12:35:50,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-08 12:35:50,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-08 12:35:50,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 100);havoc #t~post6; {1042#true} is VALID [2022-04-08 12:35:50,421 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1042#true} is VALID [2022-04-08 12:35:50,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:35:50,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:35:50,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:35:50,424 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1118#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-08 12:35:50,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {1118#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-08 12:35:50,425 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:35:50,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:35:50,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-08 12:35:50,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-08 12:35:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:35:50,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:35:50,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-08 12:35:50,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-08 12:35:50,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:35:50,857 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:35:50,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-08 12:35:50,858 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1149#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-08 12:35:50,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:35:50,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:35:50,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:35:50,866 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1042#true} is VALID [2022-04-08 12:35:50,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 100);havoc #t~post6; {1042#true} is VALID [2022-04-08 12:35:50,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-08 12:35:50,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-08 12:35:50,867 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-08 12:35:50,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 12:35:50,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 12:35:50,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 12:35:50,868 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1042#true} is VALID [2022-04-08 12:35:50,868 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-08 12:35:50,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 12:35:50,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 12:35:50,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 12:35:50,868 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-08 12:35:50,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1042#true} is VALID [2022-04-08 12:35:50,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-08 12:35:50,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-08 12:35:50,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 12:35:50,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1042#true} is VALID [2022-04-08 12:35:50,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-08 12:35:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:35:50,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:35:50,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278928940] [2022-04-08 12:35:50,870 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:35:50,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293656704] [2022-04-08 12:35:50,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293656704] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:35:50,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:35:50,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 12:35:50,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:35:50,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1684796570] [2022-04-08 12:35:50,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1684796570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:50,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:50,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:35:50,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610492337] [2022-04-08 12:35:50,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:35:50,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-08 12:35:50,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:35:50,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 12:35:50,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:50,891 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:35:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:50,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:35:50,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:35:50,892 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 12:35:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:51,302 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-08 12:35:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 12:35:51,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-08 12:35:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:35:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 12:35:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 12:35:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 12:35:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 12:35:51,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 12:35:51,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:51,359 INFO L225 Difference]: With dead ends: 57 [2022-04-08 12:35:51,359 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 12:35:51,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 12:35:51,360 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:35:51,361 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:35:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 12:35:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-08 12:35:51,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:35:51,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:35:51,381 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:35:51,381 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:35:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:51,387 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 12:35:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 12:35:51,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:51,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:51,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-08 12:35:51,390 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-08 12:35:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:51,397 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 12:35:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 12:35:51,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:51,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:51,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:35:51,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:35:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:35:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-08 12:35:51,399 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-08 12:35:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:35:51,400 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-08 12:35:51,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 12:35:51,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-08 12:35:53,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-08 12:35:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 12:35:53,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:35:53,378 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:35:53,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 12:35:53,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:53,579 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:35:53,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:35:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-08 12:35:53,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:53,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [318579001] [2022-04-08 12:35:53,580 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:35:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-08 12:35:53,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:35:53,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471096511] [2022-04-08 12:35:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:35:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:35:53,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:35:53,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736124909] [2022-04-08 12:35:53,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:35:53,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:53,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:35:53,601 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:35:53,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 12:35:53,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:35:53,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:35:53,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 12:35:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:35:53,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:35:53,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-08 12:35:53,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#(<= ~counter~0 0)} {1521#true} #102#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#(<= ~counter~0 0)} call #t~ret9 := main(); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,956 INFO L272 TraceCheckUtils]: 6: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,958 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #90#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,958 INFO L272 TraceCheckUtils]: 11: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,960 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #92#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:53,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {1529#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:53,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {1578#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:53,962 INFO L272 TraceCheckUtils]: 19: Hoare triple {1578#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:53,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {1578#(<= ~counter~0 1)} ~cond := #in~cond; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:53,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {1578#(<= ~counter~0 1)} assume !(0 == ~cond); {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:53,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {1578#(<= ~counter~0 1)} assume true; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:53,964 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1578#(<= ~counter~0 1)} {1578#(<= ~counter~0 1)} #94#return; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:53,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:53,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {1578#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1603#(<= |main_#t~post7| 1)} is VALID [2022-04-08 12:35:53,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {1522#false} is VALID [2022-04-08 12:35:53,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1522#false} is VALID [2022-04-08 12:35:53,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !(#t~post8 < 100);havoc #t~post8; {1522#false} is VALID [2022-04-08 12:35:53,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {1522#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1522#false} is VALID [2022-04-08 12:35:53,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {1522#false} assume !(#t~post6 < 100);havoc #t~post6; {1522#false} is VALID [2022-04-08 12:35:53,965 INFO L272 TraceCheckUtils]: 31: Hoare triple {1522#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1522#false} is VALID [2022-04-08 12:35:53,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-08 12:35:53,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-08 12:35:53,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-08 12:35:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:35:53,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:35:53,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:35:53,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471096511] [2022-04-08 12:35:53,978 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:35:53,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736124909] [2022-04-08 12:35:53,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736124909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:53,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:53,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:35:53,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:35:53,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [318579001] [2022-04-08 12:35:53,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [318579001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:53,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:53,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:35:53,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878614321] [2022-04-08 12:35:53,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:35:53,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-08 12:35:53,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:35:53,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 12:35:54,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:54,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:35:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:54,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:35:54,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:35:54,008 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 12:35:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:54,130 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-08 12:35:54,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:35:54,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-08 12:35:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:35:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 12:35:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-08 12:35:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 12:35:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-08 12:35:54,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-08 12:35:54,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:54,198 INFO L225 Difference]: With dead ends: 65 [2022-04-08 12:35:54,198 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 12:35:54,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:35:54,199 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:35:54,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:35:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 12:35:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 12:35:54,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:35:54,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 12:35:54,229 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 12:35:54,229 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 12:35:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:54,231 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 12:35:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 12:35:54,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:54,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:54,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 12:35:54,232 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 12:35:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:54,233 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 12:35:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 12:35:54,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:54,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:54,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:35:54,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:35:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 12:35:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-08 12:35:54,236 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-08 12:35:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:35:54,236 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-08 12:35:54,236 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 12:35:54,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2022-04-08 12:35:54,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 12:35:54,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 12:35:54,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:35:54,841 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:35:54,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 12:35:55,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:55,046 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:35:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:35:55,047 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-08 12:35:55,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:55,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370963296] [2022-04-08 12:35:55,047 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:35:55,047 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-08 12:35:55,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:35:55,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565715338] [2022-04-08 12:35:55,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:35:55,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:35:55,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:35:55,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633280749] [2022-04-08 12:35:55,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:35:55,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:55,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:35:55,076 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:35:55,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 12:35:55,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:35:55,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:35:55,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:35:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:35:55,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:35:55,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-08 12:35:55,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#(<= ~counter~0 0)} {1936#true} #102#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#(<= ~counter~0 0)} call #t~ret9 := main(); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,375 INFO L272 TraceCheckUtils]: 6: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #90#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,377 INFO L272 TraceCheckUtils]: 11: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,380 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #92#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:55,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {1993#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:55,382 INFO L272 TraceCheckUtils]: 19: Hoare triple {1993#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:55,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} ~cond := #in~cond; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:55,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} assume !(0 == ~cond); {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:55,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} assume true; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:55,386 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} #94#return; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:55,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:55,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {1993#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:55,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {2018#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:55,391 INFO L272 TraceCheckUtils]: 27: Hoare triple {2018#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:55,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(<= ~counter~0 2)} ~cond := #in~cond; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:55,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#(<= ~counter~0 2)} assume !(0 == ~cond); {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:55,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:55,392 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2018#(<= ~counter~0 2)} {2018#(<= ~counter~0 2)} #96#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:55,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(<= ~counter~0 2)} assume !(~r~0 > 0); {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:55,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {2018#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2043#(<= |main_#t~post8| 2)} is VALID [2022-04-08 12:35:55,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(<= |main_#t~post8| 2)} assume !(#t~post8 < 100);havoc #t~post8; {1937#false} is VALID [2022-04-08 12:35:55,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-08 12:35:55,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 100);havoc #t~post6; {1937#false} is VALID [2022-04-08 12:35:55,394 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1937#false} is VALID [2022-04-08 12:35:55,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-08 12:35:55,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-08 12:35:55,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-08 12:35:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:35:55,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:35:55,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-08 12:35:55,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-08 12:35:55,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-08 12:35:55,633 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1937#false} is VALID [2022-04-08 12:35:55,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 100);havoc #t~post6; {1937#false} is VALID [2022-04-08 12:35:55,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-08 12:35:55,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {2083#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {1937#false} is VALID [2022-04-08 12:35:55,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {2087#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2083#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:35:55,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {2087#(< ~counter~0 100)} assume !(~r~0 > 0); {2087#(< ~counter~0 100)} is VALID [2022-04-08 12:35:55,635 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1936#true} {2087#(< ~counter~0 100)} #96#return; {2087#(< ~counter~0 100)} is VALID [2022-04-08 12:35:55,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 12:35:55,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 12:35:55,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 12:35:55,635 INFO L272 TraceCheckUtils]: 27: Hoare triple {2087#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1936#true} is VALID [2022-04-08 12:35:55,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {2087#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {2087#(< ~counter~0 100)} is VALID [2022-04-08 12:35:55,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {2112#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2087#(< ~counter~0 100)} is VALID [2022-04-08 12:35:55,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(< ~counter~0 99)} assume !!(0 != ~r~0); {2112#(< ~counter~0 99)} is VALID [2022-04-08 12:35:55,637 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1936#true} {2112#(< ~counter~0 99)} #94#return; {2112#(< ~counter~0 99)} is VALID [2022-04-08 12:35:55,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 12:35:55,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 12:35:55,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 12:35:55,638 INFO L272 TraceCheckUtils]: 19: Hoare triple {2112#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1936#true} is VALID [2022-04-08 12:35:55,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {2112#(< ~counter~0 99)} is VALID [2022-04-08 12:35:55,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {2137#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2112#(< ~counter~0 99)} is VALID [2022-04-08 12:35:55,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {2137#(< ~counter~0 98)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2137#(< ~counter~0 98)} is VALID [2022-04-08 12:35:55,640 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1936#true} {2137#(< ~counter~0 98)} #92#return; {2137#(< ~counter~0 98)} is VALID [2022-04-08 12:35:55,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 12:35:55,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 12:35:55,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 12:35:55,640 INFO L272 TraceCheckUtils]: 11: Hoare triple {2137#(< ~counter~0 98)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1936#true} is VALID [2022-04-08 12:35:55,641 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#true} {2137#(< ~counter~0 98)} #90#return; {2137#(< ~counter~0 98)} is VALID [2022-04-08 12:35:55,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 12:35:55,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 12:35:55,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 12:35:55,641 INFO L272 TraceCheckUtils]: 6: Hoare triple {2137#(< ~counter~0 98)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1936#true} is VALID [2022-04-08 12:35:55,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#(< ~counter~0 98)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2137#(< ~counter~0 98)} is VALID [2022-04-08 12:35:55,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#(< ~counter~0 98)} call #t~ret9 := main(); {2137#(< ~counter~0 98)} is VALID [2022-04-08 12:35:55,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#(< ~counter~0 98)} {1936#true} #102#return; {2137#(< ~counter~0 98)} is VALID [2022-04-08 12:35:55,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#(< ~counter~0 98)} assume true; {2137#(< ~counter~0 98)} is VALID [2022-04-08 12:35:55,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2137#(< ~counter~0 98)} is VALID [2022-04-08 12:35:55,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-08 12:35:55,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 12:35:55,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:35:55,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565715338] [2022-04-08 12:35:55,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:35:55,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633280749] [2022-04-08 12:35:55,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633280749] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 12:35:55,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:35:55,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-08 12:35:55,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:35:55,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [370963296] [2022-04-08 12:35:55,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [370963296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:55,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:55,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:35:55,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601091410] [2022-04-08 12:35:55,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:35:55,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-08 12:35:55,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:35:55,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 12:35:55,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:55,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:35:55,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:55,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:35:55,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:35:55,681 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 12:35:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:55,860 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-08 12:35:55,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 12:35:55,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-08 12:35:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:35:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 12:35:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-08 12:35:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 12:35:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-08 12:35:55,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-08 12:35:55,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:55,942 INFO L225 Difference]: With dead ends: 74 [2022-04-08 12:35:55,942 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 12:35:55,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:35:55,944 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:35:55,944 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:35:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 12:35:55,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-08 12:35:55,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:35:55,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 12:35:55,994 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 12:35:55,994 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 12:35:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:55,996 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 12:35:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-08 12:35:55,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:55,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:55,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-08 12:35:55,997 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-08 12:35:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:55,999 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 12:35:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-08 12:35:55,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:55,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:55,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:35:55,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:35:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 12:35:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-08 12:35:56,002 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-08 12:35:56,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:35:56,003 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-08 12:35:56,003 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 12:35:56,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-08 12:35:58,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 59 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-08 12:35:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 12:35:58,073 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:35:58,073 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:35:58,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 12:35:58,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:58,279 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:35:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:35:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-08 12:35:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:58,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [684506029] [2022-04-08 12:35:58,291 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:35:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-08 12:35:58,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:35:58,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960644016] [2022-04-08 12:35:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:35:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:35:58,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:35:58,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [546416670] [2022-04-08 12:35:58,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:35:58,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:58,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:35:58,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:35:58,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 12:35:58,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:35:58,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:35:58,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:35:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:35:58,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:35:58,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-08 12:35:58,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2557#(<= ~counter~0 0)} {2549#true} #102#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {2557#(<= ~counter~0 0)} call #t~ret9 := main(); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {2557#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {2557#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,605 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #90#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,605 INFO L272 TraceCheckUtils]: 11: Hoare triple {2557#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,607 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #92#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {2557#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:58,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {2557#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:58,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {2606#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:58,609 INFO L272 TraceCheckUtils]: 19: Hoare triple {2606#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:58,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {2606#(<= ~counter~0 1)} ~cond := #in~cond; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:58,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {2606#(<= ~counter~0 1)} assume !(0 == ~cond); {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:58,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {2606#(<= ~counter~0 1)} assume true; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:58,611 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2606#(<= ~counter~0 1)} {2606#(<= ~counter~0 1)} #94#return; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:58,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {2606#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:35:58,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {2606#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:58,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {2631#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:58,613 INFO L272 TraceCheckUtils]: 27: Hoare triple {2631#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2631#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:58,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {2631#(<= ~counter~0 2)} ~cond := #in~cond; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:58,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {2631#(<= ~counter~0 2)} assume !(0 == ~cond); {2631#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:58,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {2631#(<= ~counter~0 2)} assume true; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:58,614 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2631#(<= ~counter~0 2)} {2631#(<= ~counter~0 2)} #96#return; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:58,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {2631#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 12:35:58,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {2631#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2656#(<= |main_#t~post7| 2)} is VALID [2022-04-08 12:35:58,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {2656#(<= |main_#t~post7| 2)} assume !(#t~post7 < 100);havoc #t~post7; {2550#false} is VALID [2022-04-08 12:35:58,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-08 12:35:58,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 100);havoc #t~post8; {2550#false} is VALID [2022-04-08 12:35:58,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-08 12:35:58,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 100);havoc #t~post6; {2550#false} is VALID [2022-04-08 12:35:58,616 INFO L272 TraceCheckUtils]: 39: Hoare triple {2550#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2550#false} is VALID [2022-04-08 12:35:58,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-08 12:35:58,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-08 12:35:58,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-08 12:35:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:35:58,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:35:58,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-08 12:35:58,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-08 12:35:58,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-08 12:35:58,845 INFO L272 TraceCheckUtils]: 39: Hoare triple {2550#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2550#false} is VALID [2022-04-08 12:35:58,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 100);havoc #t~post6; {2550#false} is VALID [2022-04-08 12:35:58,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-08 12:35:58,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 100);havoc #t~post8; {2550#false} is VALID [2022-04-08 12:35:58,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-08 12:35:58,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {2708#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {2550#false} is VALID [2022-04-08 12:35:58,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {2712#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2708#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:35:58,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {2712#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2712#(< ~counter~0 100)} is VALID [2022-04-08 12:35:58,848 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2549#true} {2712#(< ~counter~0 100)} #96#return; {2712#(< ~counter~0 100)} is VALID [2022-04-08 12:35:58,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 12:35:58,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 12:35:58,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 12:35:58,848 INFO L272 TraceCheckUtils]: 27: Hoare triple {2712#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2549#true} is VALID [2022-04-08 12:35:58,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {2712#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {2712#(< ~counter~0 100)} is VALID [2022-04-08 12:35:58,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {2737#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2712#(< ~counter~0 100)} is VALID [2022-04-08 12:35:58,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {2737#(< ~counter~0 99)} assume !!(0 != ~r~0); {2737#(< ~counter~0 99)} is VALID [2022-04-08 12:35:58,850 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2549#true} {2737#(< ~counter~0 99)} #94#return; {2737#(< ~counter~0 99)} is VALID [2022-04-08 12:35:58,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 12:35:58,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 12:35:58,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 12:35:58,851 INFO L272 TraceCheckUtils]: 19: Hoare triple {2737#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2549#true} is VALID [2022-04-08 12:35:58,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {2737#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {2737#(< ~counter~0 99)} is VALID [2022-04-08 12:35:58,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {2762#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2737#(< ~counter~0 99)} is VALID [2022-04-08 12:35:58,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#(< ~counter~0 98)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2762#(< ~counter~0 98)} is VALID [2022-04-08 12:35:58,853 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2549#true} {2762#(< ~counter~0 98)} #92#return; {2762#(< ~counter~0 98)} is VALID [2022-04-08 12:35:58,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 12:35:58,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 12:35:58,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 12:35:58,854 INFO L272 TraceCheckUtils]: 11: Hoare triple {2762#(< ~counter~0 98)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2549#true} is VALID [2022-04-08 12:35:58,854 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2549#true} {2762#(< ~counter~0 98)} #90#return; {2762#(< ~counter~0 98)} is VALID [2022-04-08 12:35:58,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 12:35:58,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 12:35:58,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 12:35:58,855 INFO L272 TraceCheckUtils]: 6: Hoare triple {2762#(< ~counter~0 98)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2549#true} is VALID [2022-04-08 12:35:58,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#(< ~counter~0 98)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2762#(< ~counter~0 98)} is VALID [2022-04-08 12:35:58,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#(< ~counter~0 98)} call #t~ret9 := main(); {2762#(< ~counter~0 98)} is VALID [2022-04-08 12:35:58,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#(< ~counter~0 98)} {2549#true} #102#return; {2762#(< ~counter~0 98)} is VALID [2022-04-08 12:35:58,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#(< ~counter~0 98)} assume true; {2762#(< ~counter~0 98)} is VALID [2022-04-08 12:35:58,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2762#(< ~counter~0 98)} is VALID [2022-04-08 12:35:58,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-08 12:35:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 12:35:58,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:35:58,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960644016] [2022-04-08 12:35:58,862 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:35:58,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546416670] [2022-04-08 12:35:58,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546416670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:35:58,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:35:58,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 12:35:58,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:35:58,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [684506029] [2022-04-08 12:35:58,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [684506029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:58,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:58,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:35:58,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747730681] [2022-04-08 12:35:58,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:35:58,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-08 12:35:58,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:35:58,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 12:35:58,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:58,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:35:58,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:58,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:35:58,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:35:58,897 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 12:35:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:59,098 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-08 12:35:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 12:35:59,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-08 12:35:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:35:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 12:35:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-08 12:35:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 12:35:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-08 12:35:59,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-08 12:35:59,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:35:59,172 INFO L225 Difference]: With dead ends: 75 [2022-04-08 12:35:59,172 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 12:35:59,172 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-08 12:35:59,173 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:35:59,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:35:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 12:35:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 12:35:59,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:35:59,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 12:35:59,227 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 12:35:59,228 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 12:35:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:59,230 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 12:35:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-08 12:35:59,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:59,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:59,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 12:35:59,230 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 12:35:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:59,232 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 12:35:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-08 12:35:59,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:59,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:59,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:35:59,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:35:59,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 12:35:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-04-08 12:35:59,234 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-04-08 12:35:59,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:35:59,235 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-04-08 12:35:59,235 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 12:35:59,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 62 transitions. [2022-04-08 12:36:00,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-08 12:36:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 12:36:00,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:00,755 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:00,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 12:36:00,956 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:00,956 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:00,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-08 12:36:00,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:00,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [97390111] [2022-04-08 12:36:00,957 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:00,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-08 12:36:00,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:00,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36285648] [2022-04-08 12:36:00,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:00,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:00,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:00,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1308598996] [2022-04-08 12:36:00,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:00,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:00,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:00,991 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:01,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 12:36:01,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:01,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:01,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 12:36:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:01,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:01,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3184#true} is VALID [2022-04-08 12:36:01,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3184#true} is VALID [2022-04-08 12:36:01,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 12:36:01,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #102#return; {3184#true} is VALID [2022-04-08 12:36:01,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret9 := main(); {3184#true} is VALID [2022-04-08 12:36:01,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3184#true} is VALID [2022-04-08 12:36:01,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {3184#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3184#true} is VALID [2022-04-08 12:36:01,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 12:36:01,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 12:36:01,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 12:36:01,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3184#true} {3184#true} #90#return; {3184#true} is VALID [2022-04-08 12:36:01,237 INFO L272 TraceCheckUtils]: 11: Hoare triple {3184#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3184#true} is VALID [2022-04-08 12:36:01,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 12:36:01,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 12:36:01,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 12:36:01,238 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3184#true} {3184#true} #92#return; {3184#true} is VALID [2022-04-08 12:36:01,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {3184#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3184#true} is VALID [2022-04-08 12:36:01,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {3184#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3184#true} is VALID [2022-04-08 12:36:01,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#true} assume !!(#t~post6 < 100);havoc #t~post6; {3184#true} is VALID [2022-04-08 12:36:01,238 INFO L272 TraceCheckUtils]: 19: Hoare triple {3184#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3184#true} is VALID [2022-04-08 12:36:01,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 12:36:01,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 12:36:01,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 12:36:01,238 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3184#true} {3184#true} #94#return; {3184#true} is VALID [2022-04-08 12:36:01,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#true} assume !!(0 != ~r~0); {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 12:36:01,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {3261#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 12:36:01,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {3261#(not (= main_~r~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 12:36:01,240 INFO L272 TraceCheckUtils]: 27: Hoare triple {3261#(not (= main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3184#true} is VALID [2022-04-08 12:36:01,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 12:36:01,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 12:36:01,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 12:36:01,241 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3184#true} {3261#(not (= main_~r~0 0))} #96#return; {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 12:36:01,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {3261#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:36:01,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:36:01,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:36:01,242 INFO L272 TraceCheckUtils]: 35: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3184#true} is VALID [2022-04-08 12:36:01,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 12:36:01,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 12:36:01,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 12:36:01,248 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3184#true} {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:36:01,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3185#false} is VALID [2022-04-08 12:36:01,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {3185#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3185#false} is VALID [2022-04-08 12:36:01,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {3185#false} assume !(#t~post6 < 100);havoc #t~post6; {3185#false} is VALID [2022-04-08 12:36:01,252 INFO L272 TraceCheckUtils]: 43: Hoare triple {3185#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3185#false} is VALID [2022-04-08 12:36:01,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-08 12:36:01,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-08 12:36:01,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-08 12:36:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 12:36:01,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:36:01,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:01,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36285648] [2022-04-08 12:36:01,253 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:01,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308598996] [2022-04-08 12:36:01,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308598996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:01,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:01,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:36:01,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:01,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [97390111] [2022-04-08 12:36:01,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [97390111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:01,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:01,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:36:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853079500] [2022-04-08 12:36:01,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:01,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-08 12:36:01,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:01,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 12:36:01,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:01,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:36:01,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:01,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:36:01,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:36:01,298 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 12:36:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:01,471 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-08 12:36:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 12:36:01,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-08 12:36:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 12:36:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 12:36:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 12:36:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 12:36:01,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-08 12:36:01,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:01,561 INFO L225 Difference]: With dead ends: 101 [2022-04-08 12:36:01,561 INFO L226 Difference]: Without dead ends: 80 [2022-04-08 12:36:01,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:36:01,562 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:01,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:36:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-08 12:36:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-04-08 12:36:01,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:01,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 12:36:01,625 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 12:36:01,626 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 12:36:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:01,630 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-08 12:36:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-08 12:36:01,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:01,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:01,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-08 12:36:01,631 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-08 12:36:01,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:01,634 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-08 12:36:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-08 12:36:01,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:01,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:01,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:01,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 12:36:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-08 12:36:01,645 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-08 12:36:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:01,645 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-08 12:36:01,646 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 12:36:01,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-08 12:36:03,773 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-08 12:36:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-08 12:36:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 12:36:03,774 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:03,774 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:03,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:03,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-08 12:36:03,975 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:03,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:03,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-08 12:36:03,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:03,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [253401953] [2022-04-08 12:36:03,976 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:03,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-08 12:36:03,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:03,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427238844] [2022-04-08 12:36:03,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:03,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:03,988 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:03,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695511769] [2022-04-08 12:36:03,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:03,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:03,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:03,989 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:03,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 12:36:04,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:04,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:04,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:36:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:04,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:04,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-08 12:36:04,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3838#(<= ~counter~0 0)} {3830#true} #102#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {3838#(<= ~counter~0 0)} call #t~ret9 := main(); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {3838#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,306 INFO L272 TraceCheckUtils]: 6: Hoare triple {3838#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #90#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,308 INFO L272 TraceCheckUtils]: 11: Hoare triple {3838#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,309 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #92#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {3838#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:04,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {3838#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:04,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {3887#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:04,311 INFO L272 TraceCheckUtils]: 19: Hoare triple {3887#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:04,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {3887#(<= ~counter~0 1)} ~cond := #in~cond; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:04,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {3887#(<= ~counter~0 1)} assume !(0 == ~cond); {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:04,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {3887#(<= ~counter~0 1)} assume true; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:04,313 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3887#(<= ~counter~0 1)} {3887#(<= ~counter~0 1)} #94#return; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:04,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {3887#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:04,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {3887#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:04,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {3912#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:04,315 INFO L272 TraceCheckUtils]: 27: Hoare triple {3912#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:04,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {3912#(<= ~counter~0 2)} ~cond := #in~cond; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:04,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {3912#(<= ~counter~0 2)} assume !(0 == ~cond); {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:04,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {3912#(<= ~counter~0 2)} assume true; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:04,317 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3912#(<= ~counter~0 2)} {3912#(<= ~counter~0 2)} #96#return; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:04,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {3912#(<= ~counter~0 2)} assume !(~r~0 > 0); {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:04,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {3912#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:04,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {3937#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:04,319 INFO L272 TraceCheckUtils]: 35: Hoare triple {3937#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3937#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:04,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {3937#(<= ~counter~0 3)} ~cond := #in~cond; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:04,320 INFO L290 TraceCheckUtils]: 37: Hoare triple {3937#(<= ~counter~0 3)} assume !(0 == ~cond); {3937#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:04,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {3937#(<= ~counter~0 3)} assume true; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:04,321 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3937#(<= ~counter~0 3)} {3937#(<= ~counter~0 3)} #98#return; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:04,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {3937#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:04,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {3937#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3962#(<= |main_#t~post8| 3)} is VALID [2022-04-08 12:36:04,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {3962#(<= |main_#t~post8| 3)} assume !(#t~post8 < 100);havoc #t~post8; {3831#false} is VALID [2022-04-08 12:36:04,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-08 12:36:04,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 100);havoc #t~post6; {3831#false} is VALID [2022-04-08 12:36:04,323 INFO L272 TraceCheckUtils]: 45: Hoare triple {3831#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3831#false} is VALID [2022-04-08 12:36:04,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-08 12:36:04,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-08 12:36:04,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-08 12:36:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:04,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:04,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-08 12:36:04,584 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-08 12:36:04,584 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-08 12:36:04,584 INFO L272 TraceCheckUtils]: 45: Hoare triple {3831#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3831#false} is VALID [2022-04-08 12:36:04,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 100);havoc #t~post6; {3831#false} is VALID [2022-04-08 12:36:04,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-08 12:36:04,584 INFO L290 TraceCheckUtils]: 42: Hoare triple {4002#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {3831#false} is VALID [2022-04-08 12:36:04,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {4006#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4002#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:36:04,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {4006#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4006#(< ~counter~0 100)} is VALID [2022-04-08 12:36:04,588 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3830#true} {4006#(< ~counter~0 100)} #98#return; {4006#(< ~counter~0 100)} is VALID [2022-04-08 12:36:04,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 12:36:04,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 12:36:04,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 12:36:04,588 INFO L272 TraceCheckUtils]: 35: Hoare triple {4006#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3830#true} is VALID [2022-04-08 12:36:04,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {4006#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {4006#(< ~counter~0 100)} is VALID [2022-04-08 12:36:04,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {4031#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4006#(< ~counter~0 100)} is VALID [2022-04-08 12:36:04,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {4031#(< ~counter~0 99)} assume !(~r~0 > 0); {4031#(< ~counter~0 99)} is VALID [2022-04-08 12:36:04,591 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3830#true} {4031#(< ~counter~0 99)} #96#return; {4031#(< ~counter~0 99)} is VALID [2022-04-08 12:36:04,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 12:36:04,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 12:36:04,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 12:36:04,591 INFO L272 TraceCheckUtils]: 27: Hoare triple {4031#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3830#true} is VALID [2022-04-08 12:36:04,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {4031#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {4031#(< ~counter~0 99)} is VALID [2022-04-08 12:36:04,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {4056#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4031#(< ~counter~0 99)} is VALID [2022-04-08 12:36:04,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {4056#(< ~counter~0 98)} assume !!(0 != ~r~0); {4056#(< ~counter~0 98)} is VALID [2022-04-08 12:36:04,592 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3830#true} {4056#(< ~counter~0 98)} #94#return; {4056#(< ~counter~0 98)} is VALID [2022-04-08 12:36:04,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 12:36:04,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 12:36:04,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 12:36:04,593 INFO L272 TraceCheckUtils]: 19: Hoare triple {4056#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3830#true} is VALID [2022-04-08 12:36:04,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {4056#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {4056#(< ~counter~0 98)} is VALID [2022-04-08 12:36:04,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {4081#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4056#(< ~counter~0 98)} is VALID [2022-04-08 12:36:04,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {4081#(< ~counter~0 97)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4081#(< ~counter~0 97)} is VALID [2022-04-08 12:36:04,594 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3830#true} {4081#(< ~counter~0 97)} #92#return; {4081#(< ~counter~0 97)} is VALID [2022-04-08 12:36:04,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 12:36:04,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 12:36:04,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 12:36:04,594 INFO L272 TraceCheckUtils]: 11: Hoare triple {4081#(< ~counter~0 97)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3830#true} is VALID [2022-04-08 12:36:04,595 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3830#true} {4081#(< ~counter~0 97)} #90#return; {4081#(< ~counter~0 97)} is VALID [2022-04-08 12:36:04,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 12:36:04,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 12:36:04,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 12:36:04,595 INFO L272 TraceCheckUtils]: 6: Hoare triple {4081#(< ~counter~0 97)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-08 12:36:04,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {4081#(< ~counter~0 97)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4081#(< ~counter~0 97)} is VALID [2022-04-08 12:36:04,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {4081#(< ~counter~0 97)} call #t~ret9 := main(); {4081#(< ~counter~0 97)} is VALID [2022-04-08 12:36:04,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4081#(< ~counter~0 97)} {3830#true} #102#return; {4081#(< ~counter~0 97)} is VALID [2022-04-08 12:36:04,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {4081#(< ~counter~0 97)} assume true; {4081#(< ~counter~0 97)} is VALID [2022-04-08 12:36:04,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4081#(< ~counter~0 97)} is VALID [2022-04-08 12:36:04,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-08 12:36:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 12:36:04,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:04,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427238844] [2022-04-08 12:36:04,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:04,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695511769] [2022-04-08 12:36:04,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695511769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:04,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:04,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 12:36:04,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:04,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [253401953] [2022-04-08 12:36:04,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [253401953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:04,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:04,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 12:36:04,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401323618] [2022-04-08 12:36:04,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:04,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-08 12:36:04,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:04,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 12:36:04,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:04,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 12:36:04,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 12:36:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 12:36:04,646 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 12:36:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:04,902 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-08 12:36:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 12:36:04,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-08 12:36:04,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 12:36:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 12:36:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 12:36:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 12:36:04,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-08 12:36:04,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:04,989 INFO L225 Difference]: With dead ends: 118 [2022-04-08 12:36:04,989 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 12:36:04,990 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-08 12:36:04,991 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:04,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 135 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:36:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 12:36:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-08 12:36:05,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:05,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 12:36:05,065 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 12:36:05,065 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 12:36:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:05,068 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 12:36:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 12:36:05,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:05,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:05,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-08 12:36:05,069 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-08 12:36:05,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:05,070 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 12:36:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 12:36:05,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:05,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:05,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:05,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 12:36:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-08 12:36:05,073 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-08 12:36:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:05,073 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-08 12:36:05,073 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 12:36:05,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-08 12:36:07,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-08 12:36:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 12:36:07,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:07,199 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:07,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:07,400 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:07,400 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:07,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:07,400 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-08 12:36:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:07,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1789283358] [2022-04-08 12:36:07,401 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-08 12:36:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:07,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363948046] [2022-04-08 12:36:07,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:07,417 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:07,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905041489] [2022-04-08 12:36:07,418 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:36:07,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:07,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:07,420 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:07,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 12:36:07,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:36:07,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:07,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:36:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:07,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:07,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-08 12:36:07,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {4695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4703#(<= ~counter~0 0)} {4695#true} #102#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {4703#(<= ~counter~0 0)} call #t~ret9 := main(); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {4703#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,750 INFO L272 TraceCheckUtils]: 6: Hoare triple {4703#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,751 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #90#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,751 INFO L272 TraceCheckUtils]: 11: Hoare triple {4703#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,753 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #92#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {4703#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:07,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {4703#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:07,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {4752#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:07,754 INFO L272 TraceCheckUtils]: 19: Hoare triple {4752#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:07,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {4752#(<= ~counter~0 1)} ~cond := #in~cond; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:07,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {4752#(<= ~counter~0 1)} assume !(0 == ~cond); {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:07,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {4752#(<= ~counter~0 1)} assume true; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:07,756 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4752#(<= ~counter~0 1)} {4752#(<= ~counter~0 1)} #94#return; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:07,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {4752#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:07,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {4752#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:07,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {4777#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:07,757 INFO L272 TraceCheckUtils]: 27: Hoare triple {4777#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4777#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:07,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {4777#(<= ~counter~0 2)} ~cond := #in~cond; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:07,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {4777#(<= ~counter~0 2)} assume !(0 == ~cond); {4777#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:07,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {4777#(<= ~counter~0 2)} assume true; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:07,759 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4777#(<= ~counter~0 2)} {4777#(<= ~counter~0 2)} #96#return; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:07,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {4777#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:07,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {4777#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:07,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {4802#(<= ~counter~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:07,762 INFO L272 TraceCheckUtils]: 35: Hoare triple {4802#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4802#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:07,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {4802#(<= ~counter~0 3)} ~cond := #in~cond; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:07,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {4802#(<= ~counter~0 3)} assume !(0 == ~cond); {4802#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:07,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {4802#(<= ~counter~0 3)} assume true; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:07,766 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4802#(<= ~counter~0 3)} {4802#(<= ~counter~0 3)} #96#return; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:07,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {4802#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:07,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {4802#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4827#(<= |main_#t~post7| 3)} is VALID [2022-04-08 12:36:07,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {4827#(<= |main_#t~post7| 3)} assume !(#t~post7 < 100);havoc #t~post7; {4696#false} is VALID [2022-04-08 12:36:07,767 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-08 12:36:07,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 100);havoc #t~post8; {4696#false} is VALID [2022-04-08 12:36:07,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-08 12:36:07,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 100);havoc #t~post6; {4696#false} is VALID [2022-04-08 12:36:07,767 INFO L272 TraceCheckUtils]: 47: Hoare triple {4696#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4696#false} is VALID [2022-04-08 12:36:07,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-08 12:36:07,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-08 12:36:07,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-08 12:36:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:07,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:08,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-08 12:36:08,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-08 12:36:08,016 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-08 12:36:08,016 INFO L272 TraceCheckUtils]: 47: Hoare triple {4696#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4696#false} is VALID [2022-04-08 12:36:08,016 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 100);havoc #t~post6; {4696#false} is VALID [2022-04-08 12:36:08,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-08 12:36:08,017 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 100);havoc #t~post8; {4696#false} is VALID [2022-04-08 12:36:08,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-08 12:36:08,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {4879#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {4696#false} is VALID [2022-04-08 12:36:08,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {4883#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4879#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:36:08,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {4883#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4883#(< ~counter~0 100)} is VALID [2022-04-08 12:36:08,018 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4695#true} {4883#(< ~counter~0 100)} #96#return; {4883#(< ~counter~0 100)} is VALID [2022-04-08 12:36:08,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 12:36:08,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 12:36:08,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 12:36:08,019 INFO L272 TraceCheckUtils]: 35: Hoare triple {4883#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4695#true} is VALID [2022-04-08 12:36:08,022 INFO L290 TraceCheckUtils]: 34: Hoare triple {4883#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {4883#(< ~counter~0 100)} is VALID [2022-04-08 12:36:08,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {4908#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4883#(< ~counter~0 100)} is VALID [2022-04-08 12:36:08,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {4908#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4908#(< ~counter~0 99)} is VALID [2022-04-08 12:36:08,024 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4695#true} {4908#(< ~counter~0 99)} #96#return; {4908#(< ~counter~0 99)} is VALID [2022-04-08 12:36:08,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 12:36:08,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 12:36:08,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 12:36:08,024 INFO L272 TraceCheckUtils]: 27: Hoare triple {4908#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4695#true} is VALID [2022-04-08 12:36:08,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {4908#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {4908#(< ~counter~0 99)} is VALID [2022-04-08 12:36:08,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {4933#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4908#(< ~counter~0 99)} is VALID [2022-04-08 12:36:08,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 98)} assume !!(0 != ~r~0); {4933#(< ~counter~0 98)} is VALID [2022-04-08 12:36:08,025 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4695#true} {4933#(< ~counter~0 98)} #94#return; {4933#(< ~counter~0 98)} is VALID [2022-04-08 12:36:08,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 12:36:08,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 12:36:08,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 12:36:08,026 INFO L272 TraceCheckUtils]: 19: Hoare triple {4933#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4695#true} is VALID [2022-04-08 12:36:08,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {4933#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {4933#(< ~counter~0 98)} is VALID [2022-04-08 12:36:08,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {4958#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4933#(< ~counter~0 98)} is VALID [2022-04-08 12:36:08,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {4958#(< ~counter~0 97)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4958#(< ~counter~0 97)} is VALID [2022-04-08 12:36:08,027 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4695#true} {4958#(< ~counter~0 97)} #92#return; {4958#(< ~counter~0 97)} is VALID [2022-04-08 12:36:08,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 12:36:08,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 12:36:08,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 12:36:08,027 INFO L272 TraceCheckUtils]: 11: Hoare triple {4958#(< ~counter~0 97)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4695#true} is VALID [2022-04-08 12:36:08,028 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4695#true} {4958#(< ~counter~0 97)} #90#return; {4958#(< ~counter~0 97)} is VALID [2022-04-08 12:36:08,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 12:36:08,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 12:36:08,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 12:36:08,028 INFO L272 TraceCheckUtils]: 6: Hoare triple {4958#(< ~counter~0 97)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4695#true} is VALID [2022-04-08 12:36:08,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {4958#(< ~counter~0 97)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4958#(< ~counter~0 97)} is VALID [2022-04-08 12:36:08,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {4958#(< ~counter~0 97)} call #t~ret9 := main(); {4958#(< ~counter~0 97)} is VALID [2022-04-08 12:36:08,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4958#(< ~counter~0 97)} {4695#true} #102#return; {4958#(< ~counter~0 97)} is VALID [2022-04-08 12:36:08,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {4958#(< ~counter~0 97)} assume true; {4958#(< ~counter~0 97)} is VALID [2022-04-08 12:36:08,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {4695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4958#(< ~counter~0 97)} is VALID [2022-04-08 12:36:08,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-08 12:36:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 12:36:08,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:08,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363948046] [2022-04-08 12:36:08,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:08,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905041489] [2022-04-08 12:36:08,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905041489] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:08,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:08,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 12:36:08,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:08,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1789283358] [2022-04-08 12:36:08,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1789283358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:08,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:08,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 12:36:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537132183] [2022-04-08 12:36:08,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:08,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-08 12:36:08,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:08,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 12:36:08,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:08,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 12:36:08,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:08,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 12:36:08,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 12:36:08,064 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 12:36:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:08,319 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-08 12:36:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 12:36:08,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-08 12:36:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 12:36:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-08 12:36:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 12:36:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-08 12:36:08,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-08 12:36:08,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:08,403 INFO L225 Difference]: With dead ends: 119 [2022-04-08 12:36:08,403 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 12:36:08,404 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-04-08 12:36:08,404 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:08,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:36:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 12:36:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-08 12:36:08,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:08,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 12:36:08,491 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 12:36:08,491 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 12:36:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:08,493 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 12:36:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 12:36:08,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:08,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:08,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-08 12:36:08,494 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-08 12:36:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:08,495 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 12:36:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 12:36:08,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:08,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:08,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:08,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 12:36:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-08 12:36:08,498 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-08 12:36:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:08,498 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-08 12:36:08,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 12:36:08,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-08 12:36:09,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 12:36:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 12:36:09,657 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:09,657 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:09,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:09,857 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 12:36:09,858 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:09,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-08 12:36:09,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:09,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1356238134] [2022-04-08 12:36:09,858 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:09,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-08 12:36:09,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:09,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812622172] [2022-04-08 12:36:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:09,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:09,872 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:09,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1535361017] [2022-04-08 12:36:09,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:09,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:09,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:09,874 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:09,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 12:36:09,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:09,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:09,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 12:36:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:09,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:10,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 12:36:10,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#(<= ~counter~0 0)} {5582#true} #102#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#(<= ~counter~0 0)} call #t~ret9 := main(); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {5590#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,215 INFO L272 TraceCheckUtils]: 6: Hoare triple {5590#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #90#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,216 INFO L272 TraceCheckUtils]: 11: Hoare triple {5590#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,217 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #92#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {5590#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:10,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {5590#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:10,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {5639#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:10,219 INFO L272 TraceCheckUtils]: 19: Hoare triple {5639#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:10,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {5639#(<= ~counter~0 1)} ~cond := #in~cond; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:10,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {5639#(<= ~counter~0 1)} assume !(0 == ~cond); {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:10,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {5639#(<= ~counter~0 1)} assume true; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:10,220 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5639#(<= ~counter~0 1)} {5639#(<= ~counter~0 1)} #94#return; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:10,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {5639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:10,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {5639#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:10,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {5664#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:10,222 INFO L272 TraceCheckUtils]: 27: Hoare triple {5664#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:10,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {5664#(<= ~counter~0 2)} ~cond := #in~cond; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:10,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {5664#(<= ~counter~0 2)} assume !(0 == ~cond); {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:10,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {5664#(<= ~counter~0 2)} assume true; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:10,223 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5664#(<= ~counter~0 2)} {5664#(<= ~counter~0 2)} #96#return; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:10,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {5664#(<= ~counter~0 2)} assume !(~r~0 > 0); {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:10,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {5664#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:10,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {5689#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:10,225 INFO L272 TraceCheckUtils]: 35: Hoare triple {5689#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:10,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {5689#(<= ~counter~0 3)} ~cond := #in~cond; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:10,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {5689#(<= ~counter~0 3)} assume !(0 == ~cond); {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:10,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {5689#(<= ~counter~0 3)} assume true; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:10,226 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5689#(<= ~counter~0 3)} {5689#(<= ~counter~0 3)} #98#return; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:10,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {5689#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:10,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {5689#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:10,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {5714#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:10,227 INFO L272 TraceCheckUtils]: 43: Hoare triple {5714#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:10,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {5714#(<= ~counter~0 4)} ~cond := #in~cond; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:10,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {5714#(<= ~counter~0 4)} assume !(0 == ~cond); {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:10,228 INFO L290 TraceCheckUtils]: 46: Hoare triple {5714#(<= ~counter~0 4)} assume true; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:10,229 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5714#(<= ~counter~0 4)} {5714#(<= ~counter~0 4)} #98#return; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:10,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {5714#(<= ~counter~0 4)} assume !(~r~0 < 0); {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:10,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {5714#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5739#(<= |main_#t~post6| 4)} is VALID [2022-04-08 12:36:10,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {5739#(<= |main_#t~post6| 4)} assume !(#t~post6 < 100);havoc #t~post6; {5583#false} is VALID [2022-04-08 12:36:10,230 INFO L272 TraceCheckUtils]: 51: Hoare triple {5583#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5583#false} is VALID [2022-04-08 12:36:10,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-08 12:36:10,230 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-08 12:36:10,230 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 12:36:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:10,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:10,528 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 12:36:10,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-08 12:36:10,528 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-08 12:36:10,528 INFO L272 TraceCheckUtils]: 51: Hoare triple {5583#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5583#false} is VALID [2022-04-08 12:36:10,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {5767#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {5583#false} is VALID [2022-04-08 12:36:10,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {5771#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5767#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:36:10,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {5771#(< ~counter~0 100)} assume !(~r~0 < 0); {5771#(< ~counter~0 100)} is VALID [2022-04-08 12:36:10,530 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5582#true} {5771#(< ~counter~0 100)} #98#return; {5771#(< ~counter~0 100)} is VALID [2022-04-08 12:36:10,530 INFO L290 TraceCheckUtils]: 46: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 12:36:10,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 12:36:10,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 12:36:10,530 INFO L272 TraceCheckUtils]: 43: Hoare triple {5771#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-08 12:36:10,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {5771#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {5771#(< ~counter~0 100)} is VALID [2022-04-08 12:36:10,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {5796#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5771#(< ~counter~0 100)} is VALID [2022-04-08 12:36:10,531 INFO L290 TraceCheckUtils]: 40: Hoare triple {5796#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5796#(< ~counter~0 99)} is VALID [2022-04-08 12:36:10,532 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5582#true} {5796#(< ~counter~0 99)} #98#return; {5796#(< ~counter~0 99)} is VALID [2022-04-08 12:36:10,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 12:36:10,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 12:36:10,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 12:36:10,532 INFO L272 TraceCheckUtils]: 35: Hoare triple {5796#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-08 12:36:10,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {5796#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {5796#(< ~counter~0 99)} is VALID [2022-04-08 12:36:10,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {5821#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5796#(< ~counter~0 99)} is VALID [2022-04-08 12:36:10,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {5821#(< ~counter~0 98)} assume !(~r~0 > 0); {5821#(< ~counter~0 98)} is VALID [2022-04-08 12:36:10,567 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5582#true} {5821#(< ~counter~0 98)} #96#return; {5821#(< ~counter~0 98)} is VALID [2022-04-08 12:36:10,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 12:36:10,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 12:36:10,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 12:36:10,567 INFO L272 TraceCheckUtils]: 27: Hoare triple {5821#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-08 12:36:10,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {5821#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {5821#(< ~counter~0 98)} is VALID [2022-04-08 12:36:10,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {5846#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5821#(< ~counter~0 98)} is VALID [2022-04-08 12:36:10,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {5846#(< ~counter~0 97)} assume !!(0 != ~r~0); {5846#(< ~counter~0 97)} is VALID [2022-04-08 12:36:10,569 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5582#true} {5846#(< ~counter~0 97)} #94#return; {5846#(< ~counter~0 97)} is VALID [2022-04-08 12:36:10,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 12:36:10,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 12:36:10,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 12:36:10,569 INFO L272 TraceCheckUtils]: 19: Hoare triple {5846#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-08 12:36:10,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {5846#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {5846#(< ~counter~0 97)} is VALID [2022-04-08 12:36:10,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {5871#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5846#(< ~counter~0 97)} is VALID [2022-04-08 12:36:10,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {5871#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5871#(< ~counter~0 96)} is VALID [2022-04-08 12:36:10,570 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#true} {5871#(< ~counter~0 96)} #92#return; {5871#(< ~counter~0 96)} is VALID [2022-04-08 12:36:10,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 12:36:10,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 12:36:10,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 12:36:10,571 INFO L272 TraceCheckUtils]: 11: Hoare triple {5871#(< ~counter~0 96)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {5582#true} is VALID [2022-04-08 12:36:10,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#true} {5871#(< ~counter~0 96)} #90#return; {5871#(< ~counter~0 96)} is VALID [2022-04-08 12:36:10,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 12:36:10,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 12:36:10,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 12:36:10,571 INFO L272 TraceCheckUtils]: 6: Hoare triple {5871#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5582#true} is VALID [2022-04-08 12:36:10,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {5871#(< ~counter~0 96)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5871#(< ~counter~0 96)} is VALID [2022-04-08 12:36:10,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#(< ~counter~0 96)} call #t~ret9 := main(); {5871#(< ~counter~0 96)} is VALID [2022-04-08 12:36:10,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#(< ~counter~0 96)} {5582#true} #102#return; {5871#(< ~counter~0 96)} is VALID [2022-04-08 12:36:10,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#(< ~counter~0 96)} assume true; {5871#(< ~counter~0 96)} is VALID [2022-04-08 12:36:10,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5871#(< ~counter~0 96)} is VALID [2022-04-08 12:36:10,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 12:36:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 12:36:10,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:10,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812622172] [2022-04-08 12:36:10,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:10,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535361017] [2022-04-08 12:36:10,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535361017] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:10,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:10,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 12:36:10,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:10,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1356238134] [2022-04-08 12:36:10,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1356238134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:10,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:10,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:36:10,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883487072] [2022-04-08 12:36:10,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:10,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-08 12:36:10,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:10,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:10,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:10,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:36:10,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:10,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:36:10,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 12:36:10,610 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:10,916 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-08 12:36:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 12:36:10,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-08 12:36:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 12:36:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 12:36:10,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-08 12:36:10,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:10,988 INFO L225 Difference]: With dead ends: 99 [2022-04-08 12:36:10,988 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 12:36:10,988 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-08 12:36:10,989 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:10,989 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 149 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:36:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 12:36:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-08 12:36:11,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:11,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:36:11,081 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:36:11,081 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:36:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:11,083 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-08 12:36:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 12:36:11,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:11,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:11,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-08 12:36:11,084 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-08 12:36:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:11,086 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-08 12:36:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 12:36:11,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:11,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:11,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:11,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:36:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-08 12:36:11,088 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-08 12:36:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:11,089 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-08 12:36:11,089 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:11,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-08 12:36:13,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 111 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-08 12:36:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 12:36:13,260 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:13,260 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:13,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-08 12:36:13,463 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 12:36:13,463 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:13,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-08 12:36:13,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:13,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383881963] [2022-04-08 12:36:13,464 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:13,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-08 12:36:13,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:13,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219574838] [2022-04-08 12:36:13,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:13,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:13,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:13,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201861113] [2022-04-08 12:36:13,475 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:36:13,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:13,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:13,476 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:13,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 12:36:13,522 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:36:13,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:13,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 12:36:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:13,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:13,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-08 12:36:13,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {6495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6503#(<= ~counter~0 0)} {6495#true} #102#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {6503#(<= ~counter~0 0)} call #t~ret9 := main(); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {6503#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,788 INFO L272 TraceCheckUtils]: 6: Hoare triple {6503#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,791 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #90#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,791 INFO L272 TraceCheckUtils]: 11: Hoare triple {6503#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,792 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #92#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {6503#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:13,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {6503#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:13,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {6552#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:13,794 INFO L272 TraceCheckUtils]: 19: Hoare triple {6552#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:13,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {6552#(<= ~counter~0 1)} ~cond := #in~cond; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:13,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {6552#(<= ~counter~0 1)} assume !(0 == ~cond); {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:13,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {6552#(<= ~counter~0 1)} assume true; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:13,795 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6552#(<= ~counter~0 1)} {6552#(<= ~counter~0 1)} #94#return; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:13,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {6552#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:13,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {6552#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:13,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {6577#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:13,796 INFO L272 TraceCheckUtils]: 27: Hoare triple {6577#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:13,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {6577#(<= ~counter~0 2)} ~cond := #in~cond; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:13,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {6577#(<= ~counter~0 2)} assume !(0 == ~cond); {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:13,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {6577#(<= ~counter~0 2)} assume true; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:13,798 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6577#(<= ~counter~0 2)} {6577#(<= ~counter~0 2)} #96#return; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:13,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {6577#(<= ~counter~0 2)} assume !(~r~0 > 0); {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:13,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {6577#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:13,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {6602#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:13,799 INFO L272 TraceCheckUtils]: 35: Hoare triple {6602#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6602#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:13,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {6602#(<= ~counter~0 3)} ~cond := #in~cond; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:13,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {6602#(<= ~counter~0 3)} assume !(0 == ~cond); {6602#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:13,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {6602#(<= ~counter~0 3)} assume true; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:13,800 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6602#(<= ~counter~0 3)} {6602#(<= ~counter~0 3)} #98#return; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:13,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {6602#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:13,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {6602#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:13,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {6627#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:13,802 INFO L272 TraceCheckUtils]: 43: Hoare triple {6627#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6627#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:13,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {6627#(<= ~counter~0 4)} ~cond := #in~cond; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:13,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {6627#(<= ~counter~0 4)} assume !(0 == ~cond); {6627#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:13,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {6627#(<= ~counter~0 4)} assume true; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:13,803 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6627#(<= ~counter~0 4)} {6627#(<= ~counter~0 4)} #98#return; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:13,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {6627#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:13,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {6627#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6652#(<= |main_#t~post8| 4)} is VALID [2022-04-08 12:36:13,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {6652#(<= |main_#t~post8| 4)} assume !(#t~post8 < 100);havoc #t~post8; {6496#false} is VALID [2022-04-08 12:36:13,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-08 12:36:13,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 100);havoc #t~post6; {6496#false} is VALID [2022-04-08 12:36:13,804 INFO L272 TraceCheckUtils]: 53: Hoare triple {6496#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6496#false} is VALID [2022-04-08 12:36:13,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-08 12:36:13,804 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-08 12:36:13,805 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-08 12:36:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:13,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:14,098 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-08 12:36:14,099 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-08 12:36:14,099 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-08 12:36:14,099 INFO L272 TraceCheckUtils]: 53: Hoare triple {6496#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6496#false} is VALID [2022-04-08 12:36:14,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 100);havoc #t~post6; {6496#false} is VALID [2022-04-08 12:36:14,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-08 12:36:14,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {6692#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {6496#false} is VALID [2022-04-08 12:36:14,100 INFO L290 TraceCheckUtils]: 49: Hoare triple {6696#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6692#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:36:14,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {6696#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6696#(< ~counter~0 100)} is VALID [2022-04-08 12:36:14,100 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6495#true} {6696#(< ~counter~0 100)} #98#return; {6696#(< ~counter~0 100)} is VALID [2022-04-08 12:36:14,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 12:36:14,100 INFO L290 TraceCheckUtils]: 45: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 12:36:14,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 12:36:14,101 INFO L272 TraceCheckUtils]: 43: Hoare triple {6696#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-08 12:36:14,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {6696#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {6696#(< ~counter~0 100)} is VALID [2022-04-08 12:36:14,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {6721#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6696#(< ~counter~0 100)} is VALID [2022-04-08 12:36:14,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {6721#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6721#(< ~counter~0 99)} is VALID [2022-04-08 12:36:14,102 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6495#true} {6721#(< ~counter~0 99)} #98#return; {6721#(< ~counter~0 99)} is VALID [2022-04-08 12:36:14,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 12:36:14,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 12:36:14,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 12:36:14,102 INFO L272 TraceCheckUtils]: 35: Hoare triple {6721#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-08 12:36:14,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {6721#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {6721#(< ~counter~0 99)} is VALID [2022-04-08 12:36:14,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {6746#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6721#(< ~counter~0 99)} is VALID [2022-04-08 12:36:14,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {6746#(< ~counter~0 98)} assume !(~r~0 > 0); {6746#(< ~counter~0 98)} is VALID [2022-04-08 12:36:14,105 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6495#true} {6746#(< ~counter~0 98)} #96#return; {6746#(< ~counter~0 98)} is VALID [2022-04-08 12:36:14,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 12:36:14,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 12:36:14,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 12:36:14,105 INFO L272 TraceCheckUtils]: 27: Hoare triple {6746#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-08 12:36:14,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {6746#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {6746#(< ~counter~0 98)} is VALID [2022-04-08 12:36:14,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {6771#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6746#(< ~counter~0 98)} is VALID [2022-04-08 12:36:14,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {6771#(< ~counter~0 97)} assume !!(0 != ~r~0); {6771#(< ~counter~0 97)} is VALID [2022-04-08 12:36:14,107 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6495#true} {6771#(< ~counter~0 97)} #94#return; {6771#(< ~counter~0 97)} is VALID [2022-04-08 12:36:14,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 12:36:14,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 12:36:14,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 12:36:14,107 INFO L272 TraceCheckUtils]: 19: Hoare triple {6771#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-08 12:36:14,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {6771#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {6771#(< ~counter~0 97)} is VALID [2022-04-08 12:36:14,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {6796#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6771#(< ~counter~0 97)} is VALID [2022-04-08 12:36:14,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {6796#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6796#(< ~counter~0 96)} is VALID [2022-04-08 12:36:14,110 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6495#true} {6796#(< ~counter~0 96)} #92#return; {6796#(< ~counter~0 96)} is VALID [2022-04-08 12:36:14,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 12:36:14,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 12:36:14,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 12:36:14,110 INFO L272 TraceCheckUtils]: 11: Hoare triple {6796#(< ~counter~0 96)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {6495#true} is VALID [2022-04-08 12:36:14,110 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6495#true} {6796#(< ~counter~0 96)} #90#return; {6796#(< ~counter~0 96)} is VALID [2022-04-08 12:36:14,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 12:36:14,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 12:36:14,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 12:36:14,111 INFO L272 TraceCheckUtils]: 6: Hoare triple {6796#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6495#true} is VALID [2022-04-08 12:36:14,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {6796#(< ~counter~0 96)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {6796#(< ~counter~0 96)} is VALID [2022-04-08 12:36:14,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {6796#(< ~counter~0 96)} call #t~ret9 := main(); {6796#(< ~counter~0 96)} is VALID [2022-04-08 12:36:14,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6796#(< ~counter~0 96)} {6495#true} #102#return; {6796#(< ~counter~0 96)} is VALID [2022-04-08 12:36:14,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {6796#(< ~counter~0 96)} assume true; {6796#(< ~counter~0 96)} is VALID [2022-04-08 12:36:14,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {6495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6796#(< ~counter~0 96)} is VALID [2022-04-08 12:36:14,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-08 12:36:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 12:36:14,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:14,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219574838] [2022-04-08 12:36:14,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:14,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201861113] [2022-04-08 12:36:14,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201861113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:14,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:14,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 12:36:14,114 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:14,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383881963] [2022-04-08 12:36:14,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383881963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:14,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:14,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:36:14,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53694896] [2022-04-08 12:36:14,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:14,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-08 12:36:14,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:14,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:14,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:14,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:36:14,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:14,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:36:14,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 12:36:14,159 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:14,440 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-08 12:36:14,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 12:36:14,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-08 12:36:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-08 12:36:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-08 12:36:14,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-08 12:36:14,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:14,542 INFO L225 Difference]: With dead ends: 132 [2022-04-08 12:36:14,542 INFO L226 Difference]: Without dead ends: 95 [2022-04-08 12:36:14,542 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-08 12:36:14,543 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:14,543 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 160 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:36:14,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-08 12:36:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-08 12:36:14,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:14,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:36:14,619 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:36:14,620 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:36:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:14,622 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-08 12:36:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-08 12:36:14,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:14,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:14,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-08 12:36:14,623 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-08 12:36:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:14,625 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-08 12:36:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-08 12:36:14,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:14,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:14,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:14,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:36:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-08 12:36:14,627 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-08 12:36:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:14,627 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-08 12:36:14,628 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:14,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-08 12:36:16,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 12:36:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 12:36:16,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:16,661 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:16,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:16,863 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 12:36:16,863 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:16,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:16,864 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-08 12:36:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:16,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [165369038] [2022-04-08 12:36:16,864 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:16,864 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-08 12:36:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:16,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076763294] [2022-04-08 12:36:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:16,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:16,877 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:16,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1569774884] [2022-04-08 12:36:16,877 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:36:16,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:16,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:16,879 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:16,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 12:36:16,957 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 12:36:16,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:16,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 12:36:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:16,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:17,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-08 12:36:17,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7504#(<= ~counter~0 0)} {7496#true} #102#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {7504#(<= ~counter~0 0)} call #t~ret9 := main(); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {7504#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,249 INFO L272 TraceCheckUtils]: 6: Hoare triple {7504#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #90#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,251 INFO L272 TraceCheckUtils]: 11: Hoare triple {7504#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,255 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #92#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {7504#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:17,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {7504#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:17,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {7553#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:17,256 INFO L272 TraceCheckUtils]: 19: Hoare triple {7553#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:17,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {7553#(<= ~counter~0 1)} ~cond := #in~cond; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:17,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {7553#(<= ~counter~0 1)} assume !(0 == ~cond); {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:17,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {7553#(<= ~counter~0 1)} assume true; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:17,257 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7553#(<= ~counter~0 1)} {7553#(<= ~counter~0 1)} #94#return; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:17,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {7553#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:17,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {7553#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:17,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {7578#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:17,259 INFO L272 TraceCheckUtils]: 27: Hoare triple {7578#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7578#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:17,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {7578#(<= ~counter~0 2)} ~cond := #in~cond; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:17,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {7578#(<= ~counter~0 2)} assume !(0 == ~cond); {7578#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:17,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {7578#(<= ~counter~0 2)} assume true; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:17,264 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7578#(<= ~counter~0 2)} {7578#(<= ~counter~0 2)} #96#return; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:17,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {7578#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:17,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {7578#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:17,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {7603#(<= ~counter~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:17,265 INFO L272 TraceCheckUtils]: 35: Hoare triple {7603#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7603#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:17,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {7603#(<= ~counter~0 3)} ~cond := #in~cond; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:17,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {7603#(<= ~counter~0 3)} assume !(0 == ~cond); {7603#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:17,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {7603#(<= ~counter~0 3)} assume true; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:17,267 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7603#(<= ~counter~0 3)} {7603#(<= ~counter~0 3)} #96#return; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:17,268 INFO L290 TraceCheckUtils]: 40: Hoare triple {7603#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:17,268 INFO L290 TraceCheckUtils]: 41: Hoare triple {7603#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:17,269 INFO L290 TraceCheckUtils]: 42: Hoare triple {7628#(<= ~counter~0 4)} assume !!(#t~post7 < 100);havoc #t~post7; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:17,269 INFO L272 TraceCheckUtils]: 43: Hoare triple {7628#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7628#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:17,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {7628#(<= ~counter~0 4)} ~cond := #in~cond; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:17,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {7628#(<= ~counter~0 4)} assume !(0 == ~cond); {7628#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:17,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {7628#(<= ~counter~0 4)} assume true; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:17,271 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7628#(<= ~counter~0 4)} {7628#(<= ~counter~0 4)} #96#return; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:17,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {7628#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:17,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {7628#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7653#(<= |main_#t~post7| 4)} is VALID [2022-04-08 12:36:17,272 INFO L290 TraceCheckUtils]: 50: Hoare triple {7653#(<= |main_#t~post7| 4)} assume !(#t~post7 < 100);havoc #t~post7; {7497#false} is VALID [2022-04-08 12:36:17,272 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-08 12:36:17,272 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 100);havoc #t~post8; {7497#false} is VALID [2022-04-08 12:36:17,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-08 12:36:17,273 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 100);havoc #t~post6; {7497#false} is VALID [2022-04-08 12:36:17,273 INFO L272 TraceCheckUtils]: 55: Hoare triple {7497#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7497#false} is VALID [2022-04-08 12:36:17,273 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-08 12:36:17,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-08 12:36:17,273 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-08 12:36:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:17,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:17,563 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-08 12:36:17,563 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-08 12:36:17,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-08 12:36:17,563 INFO L272 TraceCheckUtils]: 55: Hoare triple {7497#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7497#false} is VALID [2022-04-08 12:36:17,563 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 100);havoc #t~post6; {7497#false} is VALID [2022-04-08 12:36:17,563 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-08 12:36:17,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 100);havoc #t~post8; {7497#false} is VALID [2022-04-08 12:36:17,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-08 12:36:17,564 INFO L290 TraceCheckUtils]: 50: Hoare triple {7705#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {7497#false} is VALID [2022-04-08 12:36:17,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {7709#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7705#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:36:17,564 INFO L290 TraceCheckUtils]: 48: Hoare triple {7709#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7709#(< ~counter~0 100)} is VALID [2022-04-08 12:36:17,565 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7496#true} {7709#(< ~counter~0 100)} #96#return; {7709#(< ~counter~0 100)} is VALID [2022-04-08 12:36:17,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 12:36:17,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 12:36:17,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 12:36:17,565 INFO L272 TraceCheckUtils]: 43: Hoare triple {7709#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-08 12:36:17,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {7709#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {7709#(< ~counter~0 100)} is VALID [2022-04-08 12:36:17,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {7734#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7709#(< ~counter~0 100)} is VALID [2022-04-08 12:36:17,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {7734#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7734#(< ~counter~0 99)} is VALID [2022-04-08 12:36:17,569 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7496#true} {7734#(< ~counter~0 99)} #96#return; {7734#(< ~counter~0 99)} is VALID [2022-04-08 12:36:17,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 12:36:17,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 12:36:17,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 12:36:17,569 INFO L272 TraceCheckUtils]: 35: Hoare triple {7734#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-08 12:36:17,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {7734#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {7734#(< ~counter~0 99)} is VALID [2022-04-08 12:36:17,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {7759#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7734#(< ~counter~0 99)} is VALID [2022-04-08 12:36:17,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {7759#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7759#(< ~counter~0 98)} is VALID [2022-04-08 12:36:17,571 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7496#true} {7759#(< ~counter~0 98)} #96#return; {7759#(< ~counter~0 98)} is VALID [2022-04-08 12:36:17,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 12:36:17,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 12:36:17,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 12:36:17,571 INFO L272 TraceCheckUtils]: 27: Hoare triple {7759#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-08 12:36:17,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {7759#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {7759#(< ~counter~0 98)} is VALID [2022-04-08 12:36:17,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {7784#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7759#(< ~counter~0 98)} is VALID [2022-04-08 12:36:17,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {7784#(< ~counter~0 97)} assume !!(0 != ~r~0); {7784#(< ~counter~0 97)} is VALID [2022-04-08 12:36:17,573 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7496#true} {7784#(< ~counter~0 97)} #94#return; {7784#(< ~counter~0 97)} is VALID [2022-04-08 12:36:17,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 12:36:17,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 12:36:17,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 12:36:17,573 INFO L272 TraceCheckUtils]: 19: Hoare triple {7784#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-08 12:36:17,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {7784#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {7784#(< ~counter~0 97)} is VALID [2022-04-08 12:36:17,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {7809#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7784#(< ~counter~0 97)} is VALID [2022-04-08 12:36:17,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {7809#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7809#(< ~counter~0 96)} is VALID [2022-04-08 12:36:17,575 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7496#true} {7809#(< ~counter~0 96)} #92#return; {7809#(< ~counter~0 96)} is VALID [2022-04-08 12:36:17,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 12:36:17,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 12:36:17,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 12:36:17,576 INFO L272 TraceCheckUtils]: 11: Hoare triple {7809#(< ~counter~0 96)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {7496#true} is VALID [2022-04-08 12:36:17,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7496#true} {7809#(< ~counter~0 96)} #90#return; {7809#(< ~counter~0 96)} is VALID [2022-04-08 12:36:17,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 12:36:17,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 12:36:17,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 12:36:17,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {7809#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7496#true} is VALID [2022-04-08 12:36:17,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#(< ~counter~0 96)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {7809#(< ~counter~0 96)} is VALID [2022-04-08 12:36:17,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#(< ~counter~0 96)} call #t~ret9 := main(); {7809#(< ~counter~0 96)} is VALID [2022-04-08 12:36:17,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#(< ~counter~0 96)} {7496#true} #102#return; {7809#(< ~counter~0 96)} is VALID [2022-04-08 12:36:17,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#(< ~counter~0 96)} assume true; {7809#(< ~counter~0 96)} is VALID [2022-04-08 12:36:17,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7809#(< ~counter~0 96)} is VALID [2022-04-08 12:36:17,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-08 12:36:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 12:36:17,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:17,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076763294] [2022-04-08 12:36:17,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:17,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569774884] [2022-04-08 12:36:17,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569774884] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:17,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:17,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 12:36:17,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:17,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [165369038] [2022-04-08 12:36:17,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [165369038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:17,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:17,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:36:17,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161830207] [2022-04-08 12:36:17,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:17,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 12:36:17,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:17,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:17,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:17,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:36:17,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:17,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:36:17,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 12:36:17,617 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:17,897 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-08 12:36:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 12:36:17,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 12:36:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-08 12:36:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-08 12:36:17,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-08 12:36:17,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:17,993 INFO L225 Difference]: With dead ends: 133 [2022-04-08 12:36:17,993 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 12:36:17,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-08 12:36:17,994 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:17,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:36:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 12:36:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-08 12:36:18,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:18,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:36:18,090 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:36:18,090 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:36:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:18,092 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-08 12:36:18,092 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 12:36:18,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:18,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:18,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-08 12:36:18,093 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-08 12:36:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:18,095 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-08 12:36:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 12:36:18,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:18,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:18,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:18,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:36:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-08 12:36:18,098 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-08 12:36:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:18,098 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-08 12:36:18,098 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 12:36:18,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-08 12:36:20,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 12:36:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 12:36:20,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:20,231 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:20,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:20,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 12:36:20,435 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:20,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-08 12:36:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:20,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [404562801] [2022-04-08 12:36:20,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-08 12:36:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:20,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986673983] [2022-04-08 12:36:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:20,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:20,447 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:20,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853980510] [2022-04-08 12:36:20,447 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:36:20,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:20,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:20,448 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:20,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 12:36:20,505 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:36:20,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:20,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 12:36:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:20,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:20,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-08 12:36:20,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8527#(<= ~counter~0 0)} {8519#true} #102#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {8527#(<= ~counter~0 0)} call #t~ret9 := main(); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {8527#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,800 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #90#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,801 INFO L272 TraceCheckUtils]: 11: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,802 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #92#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {8527#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:20,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {8527#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:20,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {8576#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:20,803 INFO L272 TraceCheckUtils]: 19: Hoare triple {8576#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:20,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {8576#(<= ~counter~0 1)} ~cond := #in~cond; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:20,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {8576#(<= ~counter~0 1)} assume !(0 == ~cond); {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:20,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {8576#(<= ~counter~0 1)} assume true; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:20,805 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8576#(<= ~counter~0 1)} {8576#(<= ~counter~0 1)} #94#return; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:20,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {8576#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:20,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {8576#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:20,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {8601#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:20,806 INFO L272 TraceCheckUtils]: 27: Hoare triple {8601#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:20,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {8601#(<= ~counter~0 2)} ~cond := #in~cond; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:20,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {8601#(<= ~counter~0 2)} assume !(0 == ~cond); {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:20,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {8601#(<= ~counter~0 2)} assume true; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:20,807 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8601#(<= ~counter~0 2)} {8601#(<= ~counter~0 2)} #96#return; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:20,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {8601#(<= ~counter~0 2)} assume !(~r~0 > 0); {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:20,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {8601#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:20,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {8626#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:20,809 INFO L272 TraceCheckUtils]: 35: Hoare triple {8626#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8626#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:20,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {8626#(<= ~counter~0 3)} ~cond := #in~cond; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:20,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {8626#(<= ~counter~0 3)} assume !(0 == ~cond); {8626#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:20,809 INFO L290 TraceCheckUtils]: 38: Hoare triple {8626#(<= ~counter~0 3)} assume true; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:20,810 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8626#(<= ~counter~0 3)} {8626#(<= ~counter~0 3)} #98#return; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:20,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {8626#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:20,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {8626#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:20,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {8651#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:20,811 INFO L272 TraceCheckUtils]: 43: Hoare triple {8651#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8651#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:20,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {8651#(<= ~counter~0 4)} ~cond := #in~cond; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:20,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {8651#(<= ~counter~0 4)} assume !(0 == ~cond); {8651#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:20,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {8651#(<= ~counter~0 4)} assume true; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:20,813 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8651#(<= ~counter~0 4)} {8651#(<= ~counter~0 4)} #98#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:20,813 INFO L290 TraceCheckUtils]: 48: Hoare triple {8651#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:20,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {8651#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:20,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {8676#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:20,814 INFO L272 TraceCheckUtils]: 51: Hoare triple {8676#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:20,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {8676#(<= ~counter~0 5)} ~cond := #in~cond; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:20,814 INFO L290 TraceCheckUtils]: 53: Hoare triple {8676#(<= ~counter~0 5)} assume !(0 == ~cond); {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:20,815 INFO L290 TraceCheckUtils]: 54: Hoare triple {8676#(<= ~counter~0 5)} assume true; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:20,815 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8676#(<= ~counter~0 5)} {8676#(<= ~counter~0 5)} #98#return; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:20,815 INFO L290 TraceCheckUtils]: 56: Hoare triple {8676#(<= ~counter~0 5)} assume !(~r~0 < 0); {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:20,816 INFO L290 TraceCheckUtils]: 57: Hoare triple {8676#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8701#(<= |main_#t~post6| 5)} is VALID [2022-04-08 12:36:20,816 INFO L290 TraceCheckUtils]: 58: Hoare triple {8701#(<= |main_#t~post6| 5)} assume !(#t~post6 < 100);havoc #t~post6; {8520#false} is VALID [2022-04-08 12:36:20,816 INFO L272 TraceCheckUtils]: 59: Hoare triple {8520#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8520#false} is VALID [2022-04-08 12:36:20,816 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-08 12:36:20,816 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-08 12:36:20,816 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-08 12:36:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:20,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:21,139 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-08 12:36:21,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-08 12:36:21,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-08 12:36:21,140 INFO L272 TraceCheckUtils]: 59: Hoare triple {8520#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8520#false} is VALID [2022-04-08 12:36:21,140 INFO L290 TraceCheckUtils]: 58: Hoare triple {8729#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {8520#false} is VALID [2022-04-08 12:36:21,140 INFO L290 TraceCheckUtils]: 57: Hoare triple {8733#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8729#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:36:21,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {8733#(< ~counter~0 100)} assume !(~r~0 < 0); {8733#(< ~counter~0 100)} is VALID [2022-04-08 12:36:21,141 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8519#true} {8733#(< ~counter~0 100)} #98#return; {8733#(< ~counter~0 100)} is VALID [2022-04-08 12:36:21,141 INFO L290 TraceCheckUtils]: 54: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:21,141 INFO L290 TraceCheckUtils]: 53: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:21,141 INFO L290 TraceCheckUtils]: 52: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:21,141 INFO L272 TraceCheckUtils]: 51: Hoare triple {8733#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 12:36:21,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {8733#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {8733#(< ~counter~0 100)} is VALID [2022-04-08 12:36:21,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {8758#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8733#(< ~counter~0 100)} is VALID [2022-04-08 12:36:21,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {8758#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8758#(< ~counter~0 99)} is VALID [2022-04-08 12:36:21,143 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8519#true} {8758#(< ~counter~0 99)} #98#return; {8758#(< ~counter~0 99)} is VALID [2022-04-08 12:36:21,143 INFO L290 TraceCheckUtils]: 46: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:21,143 INFO L290 TraceCheckUtils]: 45: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:21,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:21,143 INFO L272 TraceCheckUtils]: 43: Hoare triple {8758#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 12:36:21,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {8758#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {8758#(< ~counter~0 99)} is VALID [2022-04-08 12:36:21,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {8783#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8758#(< ~counter~0 99)} is VALID [2022-04-08 12:36:21,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {8783#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8783#(< ~counter~0 98)} is VALID [2022-04-08 12:36:21,145 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8519#true} {8783#(< ~counter~0 98)} #98#return; {8783#(< ~counter~0 98)} is VALID [2022-04-08 12:36:21,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:21,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:21,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:21,145 INFO L272 TraceCheckUtils]: 35: Hoare triple {8783#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 12:36:21,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {8783#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {8783#(< ~counter~0 98)} is VALID [2022-04-08 12:36:21,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {8808#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8783#(< ~counter~0 98)} is VALID [2022-04-08 12:36:21,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {8808#(< ~counter~0 97)} assume !(~r~0 > 0); {8808#(< ~counter~0 97)} is VALID [2022-04-08 12:36:21,146 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8519#true} {8808#(< ~counter~0 97)} #96#return; {8808#(< ~counter~0 97)} is VALID [2022-04-08 12:36:21,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:21,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:21,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:21,146 INFO L272 TraceCheckUtils]: 27: Hoare triple {8808#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 12:36:21,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {8808#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {8808#(< ~counter~0 97)} is VALID [2022-04-08 12:36:21,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {8833#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8808#(< ~counter~0 97)} is VALID [2022-04-08 12:36:21,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {8833#(< ~counter~0 96)} assume !!(0 != ~r~0); {8833#(< ~counter~0 96)} is VALID [2022-04-08 12:36:21,148 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8519#true} {8833#(< ~counter~0 96)} #94#return; {8833#(< ~counter~0 96)} is VALID [2022-04-08 12:36:21,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:21,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:21,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:21,148 INFO L272 TraceCheckUtils]: 19: Hoare triple {8833#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 12:36:21,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {8833#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {8833#(< ~counter~0 96)} is VALID [2022-04-08 12:36:21,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {8858#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8833#(< ~counter~0 96)} is VALID [2022-04-08 12:36:21,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {8858#(< ~counter~0 95)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8858#(< ~counter~0 95)} is VALID [2022-04-08 12:36:21,149 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8519#true} {8858#(< ~counter~0 95)} #92#return; {8858#(< ~counter~0 95)} is VALID [2022-04-08 12:36:21,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:21,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:21,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:21,150 INFO L272 TraceCheckUtils]: 11: Hoare triple {8858#(< ~counter~0 95)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8519#true} is VALID [2022-04-08 12:36:21,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8519#true} {8858#(< ~counter~0 95)} #90#return; {8858#(< ~counter~0 95)} is VALID [2022-04-08 12:36:21,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:21,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:21,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:21,150 INFO L272 TraceCheckUtils]: 6: Hoare triple {8858#(< ~counter~0 95)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 12:36:21,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {8858#(< ~counter~0 95)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {8858#(< ~counter~0 95)} is VALID [2022-04-08 12:36:21,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {8858#(< ~counter~0 95)} call #t~ret9 := main(); {8858#(< ~counter~0 95)} is VALID [2022-04-08 12:36:21,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8858#(< ~counter~0 95)} {8519#true} #102#return; {8858#(< ~counter~0 95)} is VALID [2022-04-08 12:36:21,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {8858#(< ~counter~0 95)} assume true; {8858#(< ~counter~0 95)} is VALID [2022-04-08 12:36:21,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8858#(< ~counter~0 95)} is VALID [2022-04-08 12:36:21,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-08 12:36:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 12:36:21,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:21,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986673983] [2022-04-08 12:36:21,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:21,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853980510] [2022-04-08 12:36:21,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853980510] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:21,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:21,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 12:36:21,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:21,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [404562801] [2022-04-08 12:36:21,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [404562801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:21,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:21,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:36:21,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312337786] [2022-04-08 12:36:21,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:21,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-08 12:36:21,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:21,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:21,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:21,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:36:21,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:21,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:36:21,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 12:36:21,199 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:21,562 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-04-08 12:36:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 12:36:21,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-08 12:36:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-08 12:36:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-08 12:36:21,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-08 12:36:21,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:21,664 INFO L225 Difference]: With dead ends: 116 [2022-04-08 12:36:21,664 INFO L226 Difference]: Without dead ends: 111 [2022-04-08 12:36:21,664 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-08 12:36:21,665 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:21,665 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:36:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-08 12:36:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-04-08 12:36:21,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:21,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:36:21,765 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:36:21,765 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:36:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:21,767 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-08 12:36:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-08 12:36:21,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:21,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:21,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-08 12:36:21,768 INFO L87 Difference]: Start difference. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-08 12:36:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:21,771 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-08 12:36:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-08 12:36:21,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:21,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:21,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:21,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:36:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-08 12:36:21,774 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 63 [2022-04-08 12:36:21,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:21,774 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-08 12:36:21,774 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:21,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-08 12:36:23,966 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-08 12:36:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-08 12:36:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 12:36:23,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:23,967 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:23,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:24,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:24,175 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:24,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-08 12:36:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:24,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [637975360] [2022-04-08 12:36:24,176 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-08 12:36:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:24,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852194916] [2022-04-08 12:36:24,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:24,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:24,193 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:24,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294475893] [2022-04-08 12:36:24,193 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:36:24,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:24,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:24,194 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:24,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 12:36:24,259 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 12:36:24,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:24,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 12:36:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:24,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:24,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2022-04-08 12:36:24,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {9582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9590#(<= ~counter~0 0)} {9582#true} #102#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {9590#(<= ~counter~0 0)} call #t~ret9 := main(); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {9590#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,557 INFO L272 TraceCheckUtils]: 6: Hoare triple {9590#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {9590#(<= ~counter~0 0)} ~cond := #in~cond; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {9590#(<= ~counter~0 0)} assume !(0 == ~cond); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9590#(<= ~counter~0 0)} {9590#(<= ~counter~0 0)} #90#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,558 INFO L272 TraceCheckUtils]: 11: Hoare triple {9590#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {9590#(<= ~counter~0 0)} ~cond := #in~cond; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {9590#(<= ~counter~0 0)} assume !(0 == ~cond); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,559 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9590#(<= ~counter~0 0)} {9590#(<= ~counter~0 0)} #92#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {9590#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:24,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {9590#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:24,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {9639#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:24,561 INFO L272 TraceCheckUtils]: 19: Hoare triple {9639#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:24,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {9639#(<= ~counter~0 1)} ~cond := #in~cond; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:24,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {9639#(<= ~counter~0 1)} assume !(0 == ~cond); {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:24,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {9639#(<= ~counter~0 1)} assume true; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:24,562 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9639#(<= ~counter~0 1)} {9639#(<= ~counter~0 1)} #94#return; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:24,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {9639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:24,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {9639#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:24,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {9664#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:24,564 INFO L272 TraceCheckUtils]: 27: Hoare triple {9664#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:24,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {9664#(<= ~counter~0 2)} ~cond := #in~cond; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:24,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {9664#(<= ~counter~0 2)} assume !(0 == ~cond); {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:24,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {9664#(<= ~counter~0 2)} assume true; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:24,565 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9664#(<= ~counter~0 2)} {9664#(<= ~counter~0 2)} #96#return; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:24,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {9664#(<= ~counter~0 2)} assume !(~r~0 > 0); {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:24,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {9664#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:24,566 INFO L290 TraceCheckUtils]: 34: Hoare triple {9689#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:24,566 INFO L272 TraceCheckUtils]: 35: Hoare triple {9689#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:24,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {9689#(<= ~counter~0 3)} ~cond := #in~cond; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:24,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {9689#(<= ~counter~0 3)} assume !(0 == ~cond); {9689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:24,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {9689#(<= ~counter~0 3)} assume true; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:24,568 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9689#(<= ~counter~0 3)} {9689#(<= ~counter~0 3)} #98#return; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:24,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {9689#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:24,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {9689#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:24,569 INFO L290 TraceCheckUtils]: 42: Hoare triple {9714#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:24,569 INFO L272 TraceCheckUtils]: 43: Hoare triple {9714#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:24,569 INFO L290 TraceCheckUtils]: 44: Hoare triple {9714#(<= ~counter~0 4)} ~cond := #in~cond; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:24,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {9714#(<= ~counter~0 4)} assume !(0 == ~cond); {9714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:24,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {9714#(<= ~counter~0 4)} assume true; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:24,574 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9714#(<= ~counter~0 4)} {9714#(<= ~counter~0 4)} #98#return; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:24,574 INFO L290 TraceCheckUtils]: 48: Hoare triple {9714#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:24,575 INFO L290 TraceCheckUtils]: 49: Hoare triple {9714#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:24,575 INFO L290 TraceCheckUtils]: 50: Hoare triple {9739#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:24,575 INFO L272 TraceCheckUtils]: 51: Hoare triple {9739#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9739#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:24,576 INFO L290 TraceCheckUtils]: 52: Hoare triple {9739#(<= ~counter~0 5)} ~cond := #in~cond; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:24,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {9739#(<= ~counter~0 5)} assume !(0 == ~cond); {9739#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:24,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {9739#(<= ~counter~0 5)} assume true; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:24,577 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9739#(<= ~counter~0 5)} {9739#(<= ~counter~0 5)} #98#return; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:24,577 INFO L290 TraceCheckUtils]: 56: Hoare triple {9739#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:24,577 INFO L290 TraceCheckUtils]: 57: Hoare triple {9739#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9764#(<= |main_#t~post8| 5)} is VALID [2022-04-08 12:36:24,578 INFO L290 TraceCheckUtils]: 58: Hoare triple {9764#(<= |main_#t~post8| 5)} assume !(#t~post8 < 100);havoc #t~post8; {9583#false} is VALID [2022-04-08 12:36:24,578 INFO L290 TraceCheckUtils]: 59: Hoare triple {9583#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9583#false} is VALID [2022-04-08 12:36:24,578 INFO L290 TraceCheckUtils]: 60: Hoare triple {9583#false} assume !(#t~post6 < 100);havoc #t~post6; {9583#false} is VALID [2022-04-08 12:36:24,578 INFO L272 TraceCheckUtils]: 61: Hoare triple {9583#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9583#false} is VALID [2022-04-08 12:36:24,578 INFO L290 TraceCheckUtils]: 62: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-08 12:36:24,578 INFO L290 TraceCheckUtils]: 63: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-08 12:36:24,578 INFO L290 TraceCheckUtils]: 64: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-08 12:36:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:24,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:24,925 INFO L290 TraceCheckUtils]: 64: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-08 12:36:24,926 INFO L290 TraceCheckUtils]: 63: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-08 12:36:24,926 INFO L290 TraceCheckUtils]: 62: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-08 12:36:24,926 INFO L272 TraceCheckUtils]: 61: Hoare triple {9583#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9583#false} is VALID [2022-04-08 12:36:24,926 INFO L290 TraceCheckUtils]: 60: Hoare triple {9583#false} assume !(#t~post6 < 100);havoc #t~post6; {9583#false} is VALID [2022-04-08 12:36:24,926 INFO L290 TraceCheckUtils]: 59: Hoare triple {9583#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9583#false} is VALID [2022-04-08 12:36:24,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {9804#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {9583#false} is VALID [2022-04-08 12:36:24,927 INFO L290 TraceCheckUtils]: 57: Hoare triple {9808#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9804#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:36:24,927 INFO L290 TraceCheckUtils]: 56: Hoare triple {9808#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9808#(< ~counter~0 100)} is VALID [2022-04-08 12:36:24,927 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9582#true} {9808#(< ~counter~0 100)} #98#return; {9808#(< ~counter~0 100)} is VALID [2022-04-08 12:36:24,927 INFO L290 TraceCheckUtils]: 54: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:24,927 INFO L290 TraceCheckUtils]: 53: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:24,928 INFO L290 TraceCheckUtils]: 52: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:24,928 INFO L272 TraceCheckUtils]: 51: Hoare triple {9808#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-08 12:36:24,929 INFO L290 TraceCheckUtils]: 50: Hoare triple {9808#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {9808#(< ~counter~0 100)} is VALID [2022-04-08 12:36:24,930 INFO L290 TraceCheckUtils]: 49: Hoare triple {9833#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9808#(< ~counter~0 100)} is VALID [2022-04-08 12:36:24,930 INFO L290 TraceCheckUtils]: 48: Hoare triple {9833#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9833#(< ~counter~0 99)} is VALID [2022-04-08 12:36:24,930 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9582#true} {9833#(< ~counter~0 99)} #98#return; {9833#(< ~counter~0 99)} is VALID [2022-04-08 12:36:24,931 INFO L290 TraceCheckUtils]: 46: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:24,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:24,931 INFO L290 TraceCheckUtils]: 44: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:24,931 INFO L272 TraceCheckUtils]: 43: Hoare triple {9833#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-08 12:36:24,931 INFO L290 TraceCheckUtils]: 42: Hoare triple {9833#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {9833#(< ~counter~0 99)} is VALID [2022-04-08 12:36:24,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {9858#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9833#(< ~counter~0 99)} is VALID [2022-04-08 12:36:24,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {9858#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9858#(< ~counter~0 98)} is VALID [2022-04-08 12:36:24,932 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9582#true} {9858#(< ~counter~0 98)} #98#return; {9858#(< ~counter~0 98)} is VALID [2022-04-08 12:36:24,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:24,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:24,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:24,932 INFO L272 TraceCheckUtils]: 35: Hoare triple {9858#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-08 12:36:24,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {9858#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {9858#(< ~counter~0 98)} is VALID [2022-04-08 12:36:24,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {9883#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9858#(< ~counter~0 98)} is VALID [2022-04-08 12:36:24,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {9883#(< ~counter~0 97)} assume !(~r~0 > 0); {9883#(< ~counter~0 97)} is VALID [2022-04-08 12:36:24,934 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9582#true} {9883#(< ~counter~0 97)} #96#return; {9883#(< ~counter~0 97)} is VALID [2022-04-08 12:36:24,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:24,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:24,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:24,934 INFO L272 TraceCheckUtils]: 27: Hoare triple {9883#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-08 12:36:24,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {9883#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {9883#(< ~counter~0 97)} is VALID [2022-04-08 12:36:24,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {9908#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9883#(< ~counter~0 97)} is VALID [2022-04-08 12:36:24,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {9908#(< ~counter~0 96)} assume !!(0 != ~r~0); {9908#(< ~counter~0 96)} is VALID [2022-04-08 12:36:24,935 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9582#true} {9908#(< ~counter~0 96)} #94#return; {9908#(< ~counter~0 96)} is VALID [2022-04-08 12:36:24,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:24,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:24,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:24,936 INFO L272 TraceCheckUtils]: 19: Hoare triple {9908#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-08 12:36:24,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {9908#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {9908#(< ~counter~0 96)} is VALID [2022-04-08 12:36:24,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {9933#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9908#(< ~counter~0 96)} is VALID [2022-04-08 12:36:24,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {9933#(< ~counter~0 95)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9933#(< ~counter~0 95)} is VALID [2022-04-08 12:36:24,937 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9582#true} {9933#(< ~counter~0 95)} #92#return; {9933#(< ~counter~0 95)} is VALID [2022-04-08 12:36:24,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:24,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:24,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:24,937 INFO L272 TraceCheckUtils]: 11: Hoare triple {9933#(< ~counter~0 95)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {9582#true} is VALID [2022-04-08 12:36:24,938 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9582#true} {9933#(< ~counter~0 95)} #90#return; {9933#(< ~counter~0 95)} is VALID [2022-04-08 12:36:24,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:24,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:24,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:24,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {9933#(< ~counter~0 95)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9582#true} is VALID [2022-04-08 12:36:24,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {9933#(< ~counter~0 95)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {9933#(< ~counter~0 95)} is VALID [2022-04-08 12:36:24,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {9933#(< ~counter~0 95)} call #t~ret9 := main(); {9933#(< ~counter~0 95)} is VALID [2022-04-08 12:36:24,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9933#(< ~counter~0 95)} {9582#true} #102#return; {9933#(< ~counter~0 95)} is VALID [2022-04-08 12:36:24,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {9933#(< ~counter~0 95)} assume true; {9933#(< ~counter~0 95)} is VALID [2022-04-08 12:36:24,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {9582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9933#(< ~counter~0 95)} is VALID [2022-04-08 12:36:24,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2022-04-08 12:36:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 12:36:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:24,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852194916] [2022-04-08 12:36:24,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:24,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294475893] [2022-04-08 12:36:24,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294475893] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:24,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:24,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 12:36:24,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:24,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [637975360] [2022-04-08 12:36:24,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [637975360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:24,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:24,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:36:24,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183079802] [2022-04-08 12:36:24,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:24,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-08 12:36:24,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:24,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:24,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:24,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:36:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:24,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:36:24,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 12:36:24,985 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:25,366 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2022-04-08 12:36:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 12:36:25,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-08 12:36:25,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-08 12:36:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-08 12:36:25,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-08 12:36:25,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:25,463 INFO L225 Difference]: With dead ends: 149 [2022-04-08 12:36:25,463 INFO L226 Difference]: Without dead ends: 112 [2022-04-08 12:36:25,463 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-04-08 12:36:25,463 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 55 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:25,464 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 155 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:36:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-08 12:36:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-08 12:36:25,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:25,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:36:25,570 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:36:25,570 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:36:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:25,573 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-08 12:36:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-08 12:36:25,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:25,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:25,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-08 12:36:25,574 INFO L87 Difference]: Start difference. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-08 12:36:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:25,576 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-08 12:36:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-08 12:36:25,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:25,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:25,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:25,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:36:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-08 12:36:25,579 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 65 [2022-04-08 12:36:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:25,579 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-08 12:36:25,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:25,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-08 12:36:27,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-08 12:36:27,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 12:36:27,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:27,554 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:27,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:27,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 12:36:27,763 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:27,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:27,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-08 12:36:27,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:27,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1072802114] [2022-04-08 12:36:27,765 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-08 12:36:27,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:27,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38248714] [2022-04-08 12:36:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:27,776 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:27,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784160652] [2022-04-08 12:36:27,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:27,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:27,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:27,778 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:27,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 12:36:27,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:27,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:27,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 12:36:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:27,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:28,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {10733#true} call ULTIMATE.init(); {10733#true} is VALID [2022-04-08 12:36:28,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {10733#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10741#(<= ~counter~0 0)} {10733#true} #102#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {10741#(<= ~counter~0 0)} call #t~ret9 := main(); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {10741#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,163 INFO L272 TraceCheckUtils]: 6: Hoare triple {10741#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {10741#(<= ~counter~0 0)} ~cond := #in~cond; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {10741#(<= ~counter~0 0)} assume !(0 == ~cond); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10741#(<= ~counter~0 0)} {10741#(<= ~counter~0 0)} #90#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,164 INFO L272 TraceCheckUtils]: 11: Hoare triple {10741#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {10741#(<= ~counter~0 0)} ~cond := #in~cond; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {10741#(<= ~counter~0 0)} assume !(0 == ~cond); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,166 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10741#(<= ~counter~0 0)} {10741#(<= ~counter~0 0)} #92#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {10741#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:28,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {10741#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:28,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {10790#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:28,167 INFO L272 TraceCheckUtils]: 19: Hoare triple {10790#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:28,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {10790#(<= ~counter~0 1)} ~cond := #in~cond; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:28,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {10790#(<= ~counter~0 1)} assume !(0 == ~cond); {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:28,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {10790#(<= ~counter~0 1)} assume true; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:28,169 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10790#(<= ~counter~0 1)} {10790#(<= ~counter~0 1)} #94#return; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:28,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {10790#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:28,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {10790#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:28,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {10815#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:28,170 INFO L272 TraceCheckUtils]: 27: Hoare triple {10815#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:28,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {10815#(<= ~counter~0 2)} ~cond := #in~cond; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:28,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {10815#(<= ~counter~0 2)} assume !(0 == ~cond); {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:28,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {10815#(<= ~counter~0 2)} assume true; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:28,171 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10815#(<= ~counter~0 2)} {10815#(<= ~counter~0 2)} #96#return; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:28,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {10815#(<= ~counter~0 2)} assume !(~r~0 > 0); {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:28,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {10815#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:28,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {10840#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:28,173 INFO L272 TraceCheckUtils]: 35: Hoare triple {10840#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10840#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:28,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {10840#(<= ~counter~0 3)} ~cond := #in~cond; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:28,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {10840#(<= ~counter~0 3)} assume !(0 == ~cond); {10840#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:28,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {10840#(<= ~counter~0 3)} assume true; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:28,174 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10840#(<= ~counter~0 3)} {10840#(<= ~counter~0 3)} #98#return; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:28,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {10840#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:28,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {10840#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:28,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {10865#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:28,176 INFO L272 TraceCheckUtils]: 43: Hoare triple {10865#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:28,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {10865#(<= ~counter~0 4)} ~cond := #in~cond; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:28,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {10865#(<= ~counter~0 4)} assume !(0 == ~cond); {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:28,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {10865#(<= ~counter~0 4)} assume true; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:28,177 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10865#(<= ~counter~0 4)} {10865#(<= ~counter~0 4)} #98#return; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:28,177 INFO L290 TraceCheckUtils]: 48: Hoare triple {10865#(<= ~counter~0 4)} assume !(~r~0 < 0); {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:28,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {10865#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:28,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {10890#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:28,178 INFO L272 TraceCheckUtils]: 51: Hoare triple {10890#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:28,179 INFO L290 TraceCheckUtils]: 52: Hoare triple {10890#(<= ~counter~0 5)} ~cond := #in~cond; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:28,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {10890#(<= ~counter~0 5)} assume !(0 == ~cond); {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:28,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {10890#(<= ~counter~0 5)} assume true; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:28,180 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10890#(<= ~counter~0 5)} {10890#(<= ~counter~0 5)} #94#return; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:28,180 INFO L290 TraceCheckUtils]: 56: Hoare triple {10890#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:28,180 INFO L290 TraceCheckUtils]: 57: Hoare triple {10890#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10915#(<= |main_#t~post7| 5)} is VALID [2022-04-08 12:36:28,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {10915#(<= |main_#t~post7| 5)} assume !(#t~post7 < 100);havoc #t~post7; {10734#false} is VALID [2022-04-08 12:36:28,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {10734#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10734#false} is VALID [2022-04-08 12:36:28,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {10734#false} assume !(#t~post8 < 100);havoc #t~post8; {10734#false} is VALID [2022-04-08 12:36:28,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {10734#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10734#false} is VALID [2022-04-08 12:36:28,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {10734#false} assume !(#t~post6 < 100);havoc #t~post6; {10734#false} is VALID [2022-04-08 12:36:28,181 INFO L272 TraceCheckUtils]: 63: Hoare triple {10734#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10734#false} is VALID [2022-04-08 12:36:28,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {10734#false} ~cond := #in~cond; {10734#false} is VALID [2022-04-08 12:36:28,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {10734#false} assume 0 == ~cond; {10734#false} is VALID [2022-04-08 12:36:28,181 INFO L290 TraceCheckUtils]: 66: Hoare triple {10734#false} assume !false; {10734#false} is VALID [2022-04-08 12:36:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:28,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:28,525 INFO L290 TraceCheckUtils]: 66: Hoare triple {10734#false} assume !false; {10734#false} is VALID [2022-04-08 12:36:28,526 INFO L290 TraceCheckUtils]: 65: Hoare triple {10734#false} assume 0 == ~cond; {10734#false} is VALID [2022-04-08 12:36:28,526 INFO L290 TraceCheckUtils]: 64: Hoare triple {10734#false} ~cond := #in~cond; {10734#false} is VALID [2022-04-08 12:36:28,526 INFO L272 TraceCheckUtils]: 63: Hoare triple {10734#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10734#false} is VALID [2022-04-08 12:36:28,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {10734#false} assume !(#t~post6 < 100);havoc #t~post6; {10734#false} is VALID [2022-04-08 12:36:28,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {10734#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10734#false} is VALID [2022-04-08 12:36:28,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {10734#false} assume !(#t~post8 < 100);havoc #t~post8; {10734#false} is VALID [2022-04-08 12:36:28,526 INFO L290 TraceCheckUtils]: 59: Hoare triple {10734#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10734#false} is VALID [2022-04-08 12:36:28,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {10967#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {10734#false} is VALID [2022-04-08 12:36:28,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {10971#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10967#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:36:28,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {10971#(< ~counter~0 100)} assume !!(0 != ~r~0); {10971#(< ~counter~0 100)} is VALID [2022-04-08 12:36:28,527 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10733#true} {10971#(< ~counter~0 100)} #94#return; {10971#(< ~counter~0 100)} is VALID [2022-04-08 12:36:28,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:28,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:28,528 INFO L290 TraceCheckUtils]: 52: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:28,528 INFO L272 TraceCheckUtils]: 51: Hoare triple {10971#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-08 12:36:28,528 INFO L290 TraceCheckUtils]: 50: Hoare triple {10971#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {10971#(< ~counter~0 100)} is VALID [2022-04-08 12:36:28,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {10996#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10971#(< ~counter~0 100)} is VALID [2022-04-08 12:36:28,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {10996#(< ~counter~0 99)} assume !(~r~0 < 0); {10996#(< ~counter~0 99)} is VALID [2022-04-08 12:36:28,529 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10733#true} {10996#(< ~counter~0 99)} #98#return; {10996#(< ~counter~0 99)} is VALID [2022-04-08 12:36:28,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:28,529 INFO L290 TraceCheckUtils]: 45: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:28,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:28,529 INFO L272 TraceCheckUtils]: 43: Hoare triple {10996#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-08 12:36:28,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {10996#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {10996#(< ~counter~0 99)} is VALID [2022-04-08 12:36:28,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {11021#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10996#(< ~counter~0 99)} is VALID [2022-04-08 12:36:28,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {11021#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11021#(< ~counter~0 98)} is VALID [2022-04-08 12:36:28,531 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10733#true} {11021#(< ~counter~0 98)} #98#return; {11021#(< ~counter~0 98)} is VALID [2022-04-08 12:36:28,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:28,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:28,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:28,531 INFO L272 TraceCheckUtils]: 35: Hoare triple {11021#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-08 12:36:28,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {11021#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {11021#(< ~counter~0 98)} is VALID [2022-04-08 12:36:28,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {11046#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11021#(< ~counter~0 98)} is VALID [2022-04-08 12:36:28,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {11046#(< ~counter~0 97)} assume !(~r~0 > 0); {11046#(< ~counter~0 97)} is VALID [2022-04-08 12:36:28,533 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10733#true} {11046#(< ~counter~0 97)} #96#return; {11046#(< ~counter~0 97)} is VALID [2022-04-08 12:36:28,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:28,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:28,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:28,533 INFO L272 TraceCheckUtils]: 27: Hoare triple {11046#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-08 12:36:28,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {11046#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {11046#(< ~counter~0 97)} is VALID [2022-04-08 12:36:28,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {11071#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11046#(< ~counter~0 97)} is VALID [2022-04-08 12:36:28,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {11071#(< ~counter~0 96)} assume !!(0 != ~r~0); {11071#(< ~counter~0 96)} is VALID [2022-04-08 12:36:28,534 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10733#true} {11071#(< ~counter~0 96)} #94#return; {11071#(< ~counter~0 96)} is VALID [2022-04-08 12:36:28,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:28,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:28,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:28,535 INFO L272 TraceCheckUtils]: 19: Hoare triple {11071#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-08 12:36:28,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {11071#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {11071#(< ~counter~0 96)} is VALID [2022-04-08 12:36:28,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {11096#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11071#(< ~counter~0 96)} is VALID [2022-04-08 12:36:28,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {11096#(< ~counter~0 95)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11096#(< ~counter~0 95)} is VALID [2022-04-08 12:36:28,536 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10733#true} {11096#(< ~counter~0 95)} #92#return; {11096#(< ~counter~0 95)} is VALID [2022-04-08 12:36:28,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:28,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:28,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:28,536 INFO L272 TraceCheckUtils]: 11: Hoare triple {11096#(< ~counter~0 95)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10733#true} is VALID [2022-04-08 12:36:28,536 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10733#true} {11096#(< ~counter~0 95)} #90#return; {11096#(< ~counter~0 95)} is VALID [2022-04-08 12:36:28,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:28,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:28,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:28,537 INFO L272 TraceCheckUtils]: 6: Hoare triple {11096#(< ~counter~0 95)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10733#true} is VALID [2022-04-08 12:36:28,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {11096#(< ~counter~0 95)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {11096#(< ~counter~0 95)} is VALID [2022-04-08 12:36:28,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {11096#(< ~counter~0 95)} call #t~ret9 := main(); {11096#(< ~counter~0 95)} is VALID [2022-04-08 12:36:28,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11096#(< ~counter~0 95)} {10733#true} #102#return; {11096#(< ~counter~0 95)} is VALID [2022-04-08 12:36:28,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {11096#(< ~counter~0 95)} assume true; {11096#(< ~counter~0 95)} is VALID [2022-04-08 12:36:28,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {10733#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11096#(< ~counter~0 95)} is VALID [2022-04-08 12:36:28,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {10733#true} call ULTIMATE.init(); {10733#true} is VALID [2022-04-08 12:36:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 12:36:28,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:28,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38248714] [2022-04-08 12:36:28,542 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:28,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784160652] [2022-04-08 12:36:28,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784160652] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:28,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:28,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 12:36:28,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:28,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1072802114] [2022-04-08 12:36:28,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1072802114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:28,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:28,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:36:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773369249] [2022-04-08 12:36:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:28,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-08 12:36:28,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:28,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:28,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:28,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:36:28,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:28,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:36:28,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 12:36:28,592 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:28,931 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2022-04-08 12:36:28,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 12:36:28,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-08 12:36:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-08 12:36:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-08 12:36:28,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-08 12:36:29,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:29,072 INFO L225 Difference]: With dead ends: 151 [2022-04-08 12:36:29,072 INFO L226 Difference]: Without dead ends: 114 [2022-04-08 12:36:29,072 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=228, Unknown=0, NotChecked=0, Total=380 [2022-04-08 12:36:29,073 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 38 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:29,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 182 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:36:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-08 12:36:29,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-04-08 12:36:29,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:29,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:36:29,193 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:36:29,194 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:36:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:29,200 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-08 12:36:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 12:36:29,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:29,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:29,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-08 12:36:29,201 INFO L87 Difference]: Start difference. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-08 12:36:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:29,203 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-08 12:36:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 12:36:29,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:29,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:29,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:29,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:36:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2022-04-08 12:36:29,207 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 67 [2022-04-08 12:36:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:29,207 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2022-04-08 12:36:29,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 12:36:29,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 140 transitions. [2022-04-08 12:36:29,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 12:36:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 12:36:29,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:29,769 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:29,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:29,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 12:36:29,991 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:29,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:29,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-08 12:36:29,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:29,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [975687119] [2022-04-08 12:36:29,992 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:29,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-08 12:36:29,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:29,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783787486] [2022-04-08 12:36:29,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:29,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:30,003 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:30,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [196322540] [2022-04-08 12:36:30,004 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:36:30,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:30,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:30,005 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:30,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 12:36:30,076 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 12:36:30,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:30,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 12:36:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:30,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:30,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {11916#true} call ULTIMATE.init(); {11916#true} is VALID [2022-04-08 12:36:30,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {11916#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11924#(<= ~counter~0 0)} {11916#true} #102#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {11924#(<= ~counter~0 0)} call #t~ret9 := main(); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {11924#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,461 INFO L272 TraceCheckUtils]: 6: Hoare triple {11924#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {11924#(<= ~counter~0 0)} ~cond := #in~cond; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {11924#(<= ~counter~0 0)} assume !(0 == ~cond); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,462 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11924#(<= ~counter~0 0)} {11924#(<= ~counter~0 0)} #90#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,462 INFO L272 TraceCheckUtils]: 11: Hoare triple {11924#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {11924#(<= ~counter~0 0)} ~cond := #in~cond; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {11924#(<= ~counter~0 0)} assume !(0 == ~cond); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,463 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11924#(<= ~counter~0 0)} {11924#(<= ~counter~0 0)} #92#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {11924#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:30,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {11924#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:30,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {11973#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:30,465 INFO L272 TraceCheckUtils]: 19: Hoare triple {11973#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:30,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {11973#(<= ~counter~0 1)} ~cond := #in~cond; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:30,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {11973#(<= ~counter~0 1)} assume !(0 == ~cond); {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:30,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {11973#(<= ~counter~0 1)} assume true; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:30,466 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11973#(<= ~counter~0 1)} {11973#(<= ~counter~0 1)} #94#return; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:30,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {11973#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:30,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {11973#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:30,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {11998#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:30,468 INFO L272 TraceCheckUtils]: 27: Hoare triple {11998#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:30,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {11998#(<= ~counter~0 2)} ~cond := #in~cond; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:30,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {11998#(<= ~counter~0 2)} assume !(0 == ~cond); {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:30,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {11998#(<= ~counter~0 2)} assume true; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:30,469 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11998#(<= ~counter~0 2)} {11998#(<= ~counter~0 2)} #96#return; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:30,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {11998#(<= ~counter~0 2)} assume !(~r~0 > 0); {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:30,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {11998#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:30,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {12023#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:30,470 INFO L272 TraceCheckUtils]: 35: Hoare triple {12023#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12023#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:30,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {12023#(<= ~counter~0 3)} ~cond := #in~cond; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:30,471 INFO L290 TraceCheckUtils]: 37: Hoare triple {12023#(<= ~counter~0 3)} assume !(0 == ~cond); {12023#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:30,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {12023#(<= ~counter~0 3)} assume true; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:30,472 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12023#(<= ~counter~0 3)} {12023#(<= ~counter~0 3)} #98#return; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:30,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {12023#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:30,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {12023#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:30,473 INFO L290 TraceCheckUtils]: 42: Hoare triple {12048#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:30,473 INFO L272 TraceCheckUtils]: 43: Hoare triple {12048#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12048#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:30,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {12048#(<= ~counter~0 4)} ~cond := #in~cond; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:30,474 INFO L290 TraceCheckUtils]: 45: Hoare triple {12048#(<= ~counter~0 4)} assume !(0 == ~cond); {12048#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:30,474 INFO L290 TraceCheckUtils]: 46: Hoare triple {12048#(<= ~counter~0 4)} assume true; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:30,474 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12048#(<= ~counter~0 4)} {12048#(<= ~counter~0 4)} #98#return; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:30,475 INFO L290 TraceCheckUtils]: 48: Hoare triple {12048#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:30,475 INFO L290 TraceCheckUtils]: 49: Hoare triple {12048#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:30,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {12073#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:30,476 INFO L272 TraceCheckUtils]: 51: Hoare triple {12073#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12073#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:30,476 INFO L290 TraceCheckUtils]: 52: Hoare triple {12073#(<= ~counter~0 5)} ~cond := #in~cond; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:30,476 INFO L290 TraceCheckUtils]: 53: Hoare triple {12073#(<= ~counter~0 5)} assume !(0 == ~cond); {12073#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:30,477 INFO L290 TraceCheckUtils]: 54: Hoare triple {12073#(<= ~counter~0 5)} assume true; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:30,477 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12073#(<= ~counter~0 5)} {12073#(<= ~counter~0 5)} #98#return; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:30,477 INFO L290 TraceCheckUtils]: 56: Hoare triple {12073#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:30,478 INFO L290 TraceCheckUtils]: 57: Hoare triple {12073#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:30,478 INFO L290 TraceCheckUtils]: 58: Hoare triple {12098#(<= ~counter~0 6)} assume !!(#t~post8 < 100);havoc #t~post8; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:30,479 INFO L272 TraceCheckUtils]: 59: Hoare triple {12098#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:30,479 INFO L290 TraceCheckUtils]: 60: Hoare triple {12098#(<= ~counter~0 6)} ~cond := #in~cond; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:30,479 INFO L290 TraceCheckUtils]: 61: Hoare triple {12098#(<= ~counter~0 6)} assume !(0 == ~cond); {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:30,479 INFO L290 TraceCheckUtils]: 62: Hoare triple {12098#(<= ~counter~0 6)} assume true; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:30,480 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12098#(<= ~counter~0 6)} {12098#(<= ~counter~0 6)} #98#return; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:30,480 INFO L290 TraceCheckUtils]: 64: Hoare triple {12098#(<= ~counter~0 6)} assume !(~r~0 < 0); {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:30,481 INFO L290 TraceCheckUtils]: 65: Hoare triple {12098#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12123#(<= |main_#t~post6| 6)} is VALID [2022-04-08 12:36:30,481 INFO L290 TraceCheckUtils]: 66: Hoare triple {12123#(<= |main_#t~post6| 6)} assume !(#t~post6 < 100);havoc #t~post6; {11917#false} is VALID [2022-04-08 12:36:30,481 INFO L272 TraceCheckUtils]: 67: Hoare triple {11917#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11917#false} is VALID [2022-04-08 12:36:30,481 INFO L290 TraceCheckUtils]: 68: Hoare triple {11917#false} ~cond := #in~cond; {11917#false} is VALID [2022-04-08 12:36:30,481 INFO L290 TraceCheckUtils]: 69: Hoare triple {11917#false} assume 0 == ~cond; {11917#false} is VALID [2022-04-08 12:36:30,481 INFO L290 TraceCheckUtils]: 70: Hoare triple {11917#false} assume !false; {11917#false} is VALID [2022-04-08 12:36:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 86 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:30,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:30,894 INFO L290 TraceCheckUtils]: 70: Hoare triple {11917#false} assume !false; {11917#false} is VALID [2022-04-08 12:36:30,894 INFO L290 TraceCheckUtils]: 69: Hoare triple {11917#false} assume 0 == ~cond; {11917#false} is VALID [2022-04-08 12:36:30,894 INFO L290 TraceCheckUtils]: 68: Hoare triple {11917#false} ~cond := #in~cond; {11917#false} is VALID [2022-04-08 12:36:30,895 INFO L272 TraceCheckUtils]: 67: Hoare triple {11917#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11917#false} is VALID [2022-04-08 12:36:30,895 INFO L290 TraceCheckUtils]: 66: Hoare triple {12151#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {11917#false} is VALID [2022-04-08 12:36:30,895 INFO L290 TraceCheckUtils]: 65: Hoare triple {12155#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12151#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:36:30,895 INFO L290 TraceCheckUtils]: 64: Hoare triple {12155#(< ~counter~0 100)} assume !(~r~0 < 0); {12155#(< ~counter~0 100)} is VALID [2022-04-08 12:36:30,896 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11916#true} {12155#(< ~counter~0 100)} #98#return; {12155#(< ~counter~0 100)} is VALID [2022-04-08 12:36:30,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:36:30,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:36:30,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:36:30,896 INFO L272 TraceCheckUtils]: 59: Hoare triple {12155#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 12:36:30,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {12155#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {12155#(< ~counter~0 100)} is VALID [2022-04-08 12:36:30,897 INFO L290 TraceCheckUtils]: 57: Hoare triple {12180#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12155#(< ~counter~0 100)} is VALID [2022-04-08 12:36:30,897 INFO L290 TraceCheckUtils]: 56: Hoare triple {12180#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12180#(< ~counter~0 99)} is VALID [2022-04-08 12:36:30,898 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11916#true} {12180#(< ~counter~0 99)} #98#return; {12180#(< ~counter~0 99)} is VALID [2022-04-08 12:36:30,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:36:30,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:36:30,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:36:30,898 INFO L272 TraceCheckUtils]: 51: Hoare triple {12180#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 12:36:30,898 INFO L290 TraceCheckUtils]: 50: Hoare triple {12180#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {12180#(< ~counter~0 99)} is VALID [2022-04-08 12:36:30,899 INFO L290 TraceCheckUtils]: 49: Hoare triple {12205#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12180#(< ~counter~0 99)} is VALID [2022-04-08 12:36:30,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {12205#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12205#(< ~counter~0 98)} is VALID [2022-04-08 12:36:30,899 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11916#true} {12205#(< ~counter~0 98)} #98#return; {12205#(< ~counter~0 98)} is VALID [2022-04-08 12:36:30,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:36:30,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:36:30,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:36:30,900 INFO L272 TraceCheckUtils]: 43: Hoare triple {12205#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 12:36:30,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {12205#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {12205#(< ~counter~0 98)} is VALID [2022-04-08 12:36:30,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {12230#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12205#(< ~counter~0 98)} is VALID [2022-04-08 12:36:30,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {12230#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12230#(< ~counter~0 97)} is VALID [2022-04-08 12:36:30,901 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11916#true} {12230#(< ~counter~0 97)} #98#return; {12230#(< ~counter~0 97)} is VALID [2022-04-08 12:36:30,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:36:30,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:36:30,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:36:30,901 INFO L272 TraceCheckUtils]: 35: Hoare triple {12230#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 12:36:30,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {12230#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {12230#(< ~counter~0 97)} is VALID [2022-04-08 12:36:30,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {12255#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12230#(< ~counter~0 97)} is VALID [2022-04-08 12:36:30,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {12255#(< ~counter~0 96)} assume !(~r~0 > 0); {12255#(< ~counter~0 96)} is VALID [2022-04-08 12:36:30,903 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11916#true} {12255#(< ~counter~0 96)} #96#return; {12255#(< ~counter~0 96)} is VALID [2022-04-08 12:36:30,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:36:30,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:36:30,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:36:30,903 INFO L272 TraceCheckUtils]: 27: Hoare triple {12255#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 12:36:30,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {12255#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {12255#(< ~counter~0 96)} is VALID [2022-04-08 12:36:30,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {12280#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12255#(< ~counter~0 96)} is VALID [2022-04-08 12:36:30,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {12280#(< ~counter~0 95)} assume !!(0 != ~r~0); {12280#(< ~counter~0 95)} is VALID [2022-04-08 12:36:30,904 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11916#true} {12280#(< ~counter~0 95)} #94#return; {12280#(< ~counter~0 95)} is VALID [2022-04-08 12:36:30,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:36:30,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:36:30,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:36:30,905 INFO L272 TraceCheckUtils]: 19: Hoare triple {12280#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 12:36:30,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {12280#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {12280#(< ~counter~0 95)} is VALID [2022-04-08 12:36:30,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {12305#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12280#(< ~counter~0 95)} is VALID [2022-04-08 12:36:30,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {12305#(< ~counter~0 94)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12305#(< ~counter~0 94)} is VALID [2022-04-08 12:36:30,906 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11916#true} {12305#(< ~counter~0 94)} #92#return; {12305#(< ~counter~0 94)} is VALID [2022-04-08 12:36:30,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:36:30,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:36:30,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:36:30,906 INFO L272 TraceCheckUtils]: 11: Hoare triple {12305#(< ~counter~0 94)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {11916#true} is VALID [2022-04-08 12:36:30,907 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11916#true} {12305#(< ~counter~0 94)} #90#return; {12305#(< ~counter~0 94)} is VALID [2022-04-08 12:36:30,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:36:30,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:36:30,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:36:30,907 INFO L272 TraceCheckUtils]: 6: Hoare triple {12305#(< ~counter~0 94)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 12:36:30,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {12305#(< ~counter~0 94)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {12305#(< ~counter~0 94)} is VALID [2022-04-08 12:36:30,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {12305#(< ~counter~0 94)} call #t~ret9 := main(); {12305#(< ~counter~0 94)} is VALID [2022-04-08 12:36:30,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12305#(< ~counter~0 94)} {11916#true} #102#return; {12305#(< ~counter~0 94)} is VALID [2022-04-08 12:36:30,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {12305#(< ~counter~0 94)} assume true; {12305#(< ~counter~0 94)} is VALID [2022-04-08 12:36:30,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {11916#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12305#(< ~counter~0 94)} is VALID [2022-04-08 12:36:30,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {11916#true} call ULTIMATE.init(); {11916#true} is VALID [2022-04-08 12:36:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 12:36:30,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:30,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783787486] [2022-04-08 12:36:30,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:30,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196322540] [2022-04-08 12:36:30,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196322540] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:30,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:30,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 12:36:30,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:30,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [975687119] [2022-04-08 12:36:30,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [975687119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:30,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:30,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 12:36:30,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433516061] [2022-04-08 12:36:30,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:30,910 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-08 12:36:30,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:30,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:30,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:30,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 12:36:30,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:30,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 12:36:30,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 12:36:30,957 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:31,370 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-08 12:36:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 12:36:31,370 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-08 12:36:31,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-08 12:36:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-08 12:36:31,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-08 12:36:31,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:31,474 INFO L225 Difference]: With dead ends: 137 [2022-04-08 12:36:31,474 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 12:36:31,475 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=250, Unknown=0, NotChecked=0, Total=420 [2022-04-08 12:36:31,475 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 61 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:31,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 189 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:36:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 12:36:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2022-04-08 12:36:31,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:31,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 12:36:31,599 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 12:36:31,599 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 12:36:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:31,602 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 12:36:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 12:36:31,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:31,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:31,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-08 12:36:31,603 INFO L87 Difference]: Start difference. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-08 12:36:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:31,607 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 12:36:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 12:36:31,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:31,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:31,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:31,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 12:36:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2022-04-08 12:36:31,610 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 71 [2022-04-08 12:36:31,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:31,612 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2022-04-08 12:36:31,612 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:31,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 155 transitions. [2022-04-08 12:36:32,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-04-08 12:36:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 12:36:32,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:32,155 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:32,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:32,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 12:36:32,368 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:32,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:32,368 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-08 12:36:32,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:32,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [634193549] [2022-04-08 12:36:32,368 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:32,368 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-08 12:36:32,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:32,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238533506] [2022-04-08 12:36:32,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:32,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:32,379 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:32,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599098909] [2022-04-08 12:36:32,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:32,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:32,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:32,380 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:32,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 12:36:32,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:32,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:32,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 12:36:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:32,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:32,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-08 12:36:32,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13153#true} is VALID [2022-04-08 12:36:32,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:36:32,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #102#return; {13153#true} is VALID [2022-04-08 12:36:32,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret9 := main(); {13153#true} is VALID [2022-04-08 12:36:32,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {13153#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13153#true} {13153#true} #90#return; {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L272 TraceCheckUtils]: 11: Hoare triple {13153#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13153#true} {13153#true} #92#return; {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {13153#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {13153#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {13153#true} assume !!(#t~post6 < 100);havoc #t~post6; {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L272 TraceCheckUtils]: 19: Hoare triple {13153#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:36:32,635 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13153#true} {13153#true} #94#return; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {13153#true} assume !!(0 != ~r~0); {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {13153#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {13153#true} assume !!(#t~post7 < 100);havoc #t~post7; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L272 TraceCheckUtils]: 27: Hoare triple {13153#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13153#true} {13153#true} #96#return; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {13153#true} assume !(~r~0 > 0); {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {13153#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {13153#true} assume !!(#t~post8 < 100);havoc #t~post8; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L272 TraceCheckUtils]: 35: Hoare triple {13153#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13153#true} {13153#true} #98#return; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {13153#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {13153#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13153#true} is VALID [2022-04-08 12:36:32,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {13153#true} assume !!(#t~post8 < 100);havoc #t~post8; {13153#true} is VALID [2022-04-08 12:36:32,637 INFO L272 TraceCheckUtils]: 43: Hoare triple {13153#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-08 12:36:32,637 INFO L290 TraceCheckUtils]: 44: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:36:32,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:36:32,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:36:32,637 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13153#true} {13153#true} #98#return; {13153#true} is VALID [2022-04-08 12:36:32,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {13153#true} assume !(~r~0 < 0); {13302#(not (< main_~r~0 0))} is VALID [2022-04-08 12:36:32,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {13302#(not (< main_~r~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13302#(not (< main_~r~0 0))} is VALID [2022-04-08 12:36:32,638 INFO L290 TraceCheckUtils]: 50: Hoare triple {13302#(not (< main_~r~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {13302#(not (< main_~r~0 0))} is VALID [2022-04-08 12:36:32,638 INFO L272 TraceCheckUtils]: 51: Hoare triple {13302#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-08 12:36:32,638 INFO L290 TraceCheckUtils]: 52: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:36:32,638 INFO L290 TraceCheckUtils]: 53: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:36:32,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:36:32,638 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13153#true} {13302#(not (< main_~r~0 0))} #94#return; {13302#(not (< main_~r~0 0))} is VALID [2022-04-08 12:36:32,639 INFO L290 TraceCheckUtils]: 56: Hoare triple {13302#(not (< main_~r~0 0))} assume !!(0 != ~r~0); {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 12:36:32,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 12:36:32,639 INFO L290 TraceCheckUtils]: 58: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 100);havoc #t~post7; {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 12:36:32,639 INFO L272 TraceCheckUtils]: 59: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-08 12:36:32,639 INFO L290 TraceCheckUtils]: 60: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:36:32,639 INFO L290 TraceCheckUtils]: 61: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:36:32,639 INFO L290 TraceCheckUtils]: 62: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:36:32,640 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13153#true} {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #96#return; {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 12:36:32,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {13154#false} is VALID [2022-04-08 12:36:32,640 INFO L290 TraceCheckUtils]: 65: Hoare triple {13154#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13154#false} is VALID [2022-04-08 12:36:32,640 INFO L290 TraceCheckUtils]: 66: Hoare triple {13154#false} assume !(#t~post8 < 100);havoc #t~post8; {13154#false} is VALID [2022-04-08 12:36:32,640 INFO L290 TraceCheckUtils]: 67: Hoare triple {13154#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13154#false} is VALID [2022-04-08 12:36:32,640 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} assume !(#t~post6 < 100);havoc #t~post6; {13154#false} is VALID [2022-04-08 12:36:32,641 INFO L272 TraceCheckUtils]: 69: Hoare triple {13154#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13154#false} is VALID [2022-04-08 12:36:32,641 INFO L290 TraceCheckUtils]: 70: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-08 12:36:32,641 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-08 12:36:32,641 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-08 12:36:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-08 12:36:32,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:36:32,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:32,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238533506] [2022-04-08 12:36:32,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:32,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599098909] [2022-04-08 12:36:32,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599098909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:32,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:32,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:36:32,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:32,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [634193549] [2022-04-08 12:36:32,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [634193549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:32,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:32,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:36:32,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764082879] [2022-04-08 12:36:32,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:32,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-08 12:36:32,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:32,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:36:32,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:32,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:36:32,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:32,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:36:32,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:36:32,677 INFO L87 Difference]: Start difference. First operand 125 states and 155 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:36:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:32,884 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2022-04-08 12:36:32,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 12:36:32,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-08 12:36:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:36:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 12:36:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:36:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 12:36:32,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-08 12:36:32,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:32,971 INFO L225 Difference]: With dead ends: 180 [2022-04-08 12:36:32,971 INFO L226 Difference]: Without dead ends: 143 [2022-04-08 12:36:32,971 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:36:32,971 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:32,972 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 93 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:36:32,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-08 12:36:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-04-08 12:36:33,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:33,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:36:33,111 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:36:33,112 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:36:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:33,115 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-08 12:36:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-08 12:36:33,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:33,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:33,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-08 12:36:33,116 INFO L87 Difference]: Start difference. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-08 12:36:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:33,119 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-08 12:36:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-08 12:36:33,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:33,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:33,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:33,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:36:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2022-04-08 12:36:33,123 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 73 [2022-04-08 12:36:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:33,123 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2022-04-08 12:36:33,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:36:33,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 173 transitions. [2022-04-08 12:36:35,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 172 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2022-04-08 12:36:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 12:36:35,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:35,401 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:35,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:35,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 12:36:35,624 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-08 12:36:35,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:35,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1186064602] [2022-04-08 12:36:35,624 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-08 12:36:35,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:35,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239852572] [2022-04-08 12:36:35,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:35,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:35,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:35,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124646561] [2022-04-08 12:36:35,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:35,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:35,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:35,641 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:35,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 12:36:35,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:35,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:35,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 12:36:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:35,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:36,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14295#true} is VALID [2022-04-08 12:36:36,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {14295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14303#(<= ~counter~0 0)} {14295#true} #102#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {14303#(<= ~counter~0 0)} call #t~ret9 := main(); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {14303#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {14303#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {14303#(<= ~counter~0 0)} ~cond := #in~cond; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {14303#(<= ~counter~0 0)} assume !(0 == ~cond); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14303#(<= ~counter~0 0)} {14303#(<= ~counter~0 0)} #90#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,061 INFO L272 TraceCheckUtils]: 11: Hoare triple {14303#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {14303#(<= ~counter~0 0)} ~cond := #in~cond; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {14303#(<= ~counter~0 0)} assume !(0 == ~cond); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,063 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14303#(<= ~counter~0 0)} {14303#(<= ~counter~0 0)} #92#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {14303#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:36,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {14303#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:36,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {14352#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:36,064 INFO L272 TraceCheckUtils]: 19: Hoare triple {14352#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:36,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {14352#(<= ~counter~0 1)} ~cond := #in~cond; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:36,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {14352#(<= ~counter~0 1)} assume !(0 == ~cond); {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:36,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {14352#(<= ~counter~0 1)} assume true; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:36,066 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14352#(<= ~counter~0 1)} {14352#(<= ~counter~0 1)} #94#return; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:36,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {14352#(<= ~counter~0 1)} assume !!(0 != ~r~0); {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:36,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {14352#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:36,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {14377#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:36,067 INFO L272 TraceCheckUtils]: 27: Hoare triple {14377#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:36,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {14377#(<= ~counter~0 2)} ~cond := #in~cond; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:36,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {14377#(<= ~counter~0 2)} assume !(0 == ~cond); {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:36,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {14377#(<= ~counter~0 2)} assume true; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:36,069 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14377#(<= ~counter~0 2)} {14377#(<= ~counter~0 2)} #96#return; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:36,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {14377#(<= ~counter~0 2)} assume !(~r~0 > 0); {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:36,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {14377#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:36,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {14402#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:36,070 INFO L272 TraceCheckUtils]: 35: Hoare triple {14402#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14402#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:36,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {14402#(<= ~counter~0 3)} ~cond := #in~cond; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:36,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {14402#(<= ~counter~0 3)} assume !(0 == ~cond); {14402#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:36,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {14402#(<= ~counter~0 3)} assume true; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:36,072 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14402#(<= ~counter~0 3)} {14402#(<= ~counter~0 3)} #98#return; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:36,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {14402#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:36,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {14402#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:36,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {14427#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:36,073 INFO L272 TraceCheckUtils]: 43: Hoare triple {14427#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14427#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:36,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {14427#(<= ~counter~0 4)} ~cond := #in~cond; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:36,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {14427#(<= ~counter~0 4)} assume !(0 == ~cond); {14427#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:36,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {14427#(<= ~counter~0 4)} assume true; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:36,075 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14427#(<= ~counter~0 4)} {14427#(<= ~counter~0 4)} #98#return; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:36,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {14427#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:36,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {14427#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:36,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {14452#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:36,077 INFO L272 TraceCheckUtils]: 51: Hoare triple {14452#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14452#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:36,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {14452#(<= ~counter~0 5)} ~cond := #in~cond; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:36,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {14452#(<= ~counter~0 5)} assume !(0 == ~cond); {14452#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:36,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {14452#(<= ~counter~0 5)} assume true; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:36,078 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14452#(<= ~counter~0 5)} {14452#(<= ~counter~0 5)} #98#return; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:36,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {14452#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:36,079 INFO L290 TraceCheckUtils]: 57: Hoare triple {14452#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:36,079 INFO L290 TraceCheckUtils]: 58: Hoare triple {14477#(<= ~counter~0 6)} assume !!(#t~post8 < 100);havoc #t~post8; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:36,079 INFO L272 TraceCheckUtils]: 59: Hoare triple {14477#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14477#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:36,080 INFO L290 TraceCheckUtils]: 60: Hoare triple {14477#(<= ~counter~0 6)} ~cond := #in~cond; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:36,080 INFO L290 TraceCheckUtils]: 61: Hoare triple {14477#(<= ~counter~0 6)} assume !(0 == ~cond); {14477#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:36,080 INFO L290 TraceCheckUtils]: 62: Hoare triple {14477#(<= ~counter~0 6)} assume true; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:36,081 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14477#(<= ~counter~0 6)} {14477#(<= ~counter~0 6)} #98#return; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:36,081 INFO L290 TraceCheckUtils]: 64: Hoare triple {14477#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:36,081 INFO L290 TraceCheckUtils]: 65: Hoare triple {14477#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14502#(<= |main_#t~post8| 6)} is VALID [2022-04-08 12:36:36,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {14502#(<= |main_#t~post8| 6)} assume !(#t~post8 < 100);havoc #t~post8; {14296#false} is VALID [2022-04-08 12:36:36,082 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14296#false} is VALID [2022-04-08 12:36:36,082 INFO L290 TraceCheckUtils]: 68: Hoare triple {14296#false} assume !(#t~post6 < 100);havoc #t~post6; {14296#false} is VALID [2022-04-08 12:36:36,082 INFO L272 TraceCheckUtils]: 69: Hoare triple {14296#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14296#false} is VALID [2022-04-08 12:36:36,082 INFO L290 TraceCheckUtils]: 70: Hoare triple {14296#false} ~cond := #in~cond; {14296#false} is VALID [2022-04-08 12:36:36,082 INFO L290 TraceCheckUtils]: 71: Hoare triple {14296#false} assume 0 == ~cond; {14296#false} is VALID [2022-04-08 12:36:36,082 INFO L290 TraceCheckUtils]: 72: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-08 12:36:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:36,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:36,445 INFO L290 TraceCheckUtils]: 72: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-08 12:36:36,446 INFO L290 TraceCheckUtils]: 71: Hoare triple {14296#false} assume 0 == ~cond; {14296#false} is VALID [2022-04-08 12:36:36,446 INFO L290 TraceCheckUtils]: 70: Hoare triple {14296#false} ~cond := #in~cond; {14296#false} is VALID [2022-04-08 12:36:36,446 INFO L272 TraceCheckUtils]: 69: Hoare triple {14296#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14296#false} is VALID [2022-04-08 12:36:36,446 INFO L290 TraceCheckUtils]: 68: Hoare triple {14296#false} assume !(#t~post6 < 100);havoc #t~post6; {14296#false} is VALID [2022-04-08 12:36:36,446 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14296#false} is VALID [2022-04-08 12:36:36,446 INFO L290 TraceCheckUtils]: 66: Hoare triple {14542#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {14296#false} is VALID [2022-04-08 12:36:36,447 INFO L290 TraceCheckUtils]: 65: Hoare triple {14546#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14542#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:36:36,447 INFO L290 TraceCheckUtils]: 64: Hoare triple {14546#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14546#(< ~counter~0 100)} is VALID [2022-04-08 12:36:36,447 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14295#true} {14546#(< ~counter~0 100)} #98#return; {14546#(< ~counter~0 100)} is VALID [2022-04-08 12:36:36,447 INFO L290 TraceCheckUtils]: 62: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:36:36,447 INFO L290 TraceCheckUtils]: 61: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:36:36,448 INFO L290 TraceCheckUtils]: 60: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:36:36,448 INFO L272 TraceCheckUtils]: 59: Hoare triple {14546#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 12:36:36,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {14546#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {14546#(< ~counter~0 100)} is VALID [2022-04-08 12:36:36,448 INFO L290 TraceCheckUtils]: 57: Hoare triple {14571#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14546#(< ~counter~0 100)} is VALID [2022-04-08 12:36:36,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {14571#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14571#(< ~counter~0 99)} is VALID [2022-04-08 12:36:36,449 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14295#true} {14571#(< ~counter~0 99)} #98#return; {14571#(< ~counter~0 99)} is VALID [2022-04-08 12:36:36,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:36:36,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:36:36,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:36:36,449 INFO L272 TraceCheckUtils]: 51: Hoare triple {14571#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 12:36:36,450 INFO L290 TraceCheckUtils]: 50: Hoare triple {14571#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {14571#(< ~counter~0 99)} is VALID [2022-04-08 12:36:36,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {14596#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14571#(< ~counter~0 99)} is VALID [2022-04-08 12:36:36,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {14596#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14596#(< ~counter~0 98)} is VALID [2022-04-08 12:36:36,451 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14295#true} {14596#(< ~counter~0 98)} #98#return; {14596#(< ~counter~0 98)} is VALID [2022-04-08 12:36:36,451 INFO L290 TraceCheckUtils]: 46: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:36:36,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:36:36,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:36:36,451 INFO L272 TraceCheckUtils]: 43: Hoare triple {14596#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 12:36:36,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {14596#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {14596#(< ~counter~0 98)} is VALID [2022-04-08 12:36:36,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {14621#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14596#(< ~counter~0 98)} is VALID [2022-04-08 12:36:36,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {14621#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14621#(< ~counter~0 97)} is VALID [2022-04-08 12:36:36,453 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14295#true} {14621#(< ~counter~0 97)} #98#return; {14621#(< ~counter~0 97)} is VALID [2022-04-08 12:36:36,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:36:36,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:36:36,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:36:36,453 INFO L272 TraceCheckUtils]: 35: Hoare triple {14621#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 12:36:36,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {14621#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {14621#(< ~counter~0 97)} is VALID [2022-04-08 12:36:36,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {14646#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14621#(< ~counter~0 97)} is VALID [2022-04-08 12:36:36,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {14646#(< ~counter~0 96)} assume !(~r~0 > 0); {14646#(< ~counter~0 96)} is VALID [2022-04-08 12:36:36,454 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14295#true} {14646#(< ~counter~0 96)} #96#return; {14646#(< ~counter~0 96)} is VALID [2022-04-08 12:36:36,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:36:36,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:36:36,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:36:36,455 INFO L272 TraceCheckUtils]: 27: Hoare triple {14646#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 12:36:36,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {14646#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {14646#(< ~counter~0 96)} is VALID [2022-04-08 12:36:36,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {14671#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14646#(< ~counter~0 96)} is VALID [2022-04-08 12:36:36,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {14671#(< ~counter~0 95)} assume !!(0 != ~r~0); {14671#(< ~counter~0 95)} is VALID [2022-04-08 12:36:36,456 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14295#true} {14671#(< ~counter~0 95)} #94#return; {14671#(< ~counter~0 95)} is VALID [2022-04-08 12:36:36,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:36:36,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:36:36,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:36:36,456 INFO L272 TraceCheckUtils]: 19: Hoare triple {14671#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 12:36:36,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {14671#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {14671#(< ~counter~0 95)} is VALID [2022-04-08 12:36:36,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {14696#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14671#(< ~counter~0 95)} is VALID [2022-04-08 12:36:36,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {14696#(< ~counter~0 94)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14696#(< ~counter~0 94)} is VALID [2022-04-08 12:36:36,458 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14295#true} {14696#(< ~counter~0 94)} #92#return; {14696#(< ~counter~0 94)} is VALID [2022-04-08 12:36:36,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:36:36,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:36:36,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:36:36,458 INFO L272 TraceCheckUtils]: 11: Hoare triple {14696#(< ~counter~0 94)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {14295#true} is VALID [2022-04-08 12:36:36,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14295#true} {14696#(< ~counter~0 94)} #90#return; {14696#(< ~counter~0 94)} is VALID [2022-04-08 12:36:36,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:36:36,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:36:36,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:36:36,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {14696#(< ~counter~0 94)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 12:36:36,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {14696#(< ~counter~0 94)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {14696#(< ~counter~0 94)} is VALID [2022-04-08 12:36:36,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {14696#(< ~counter~0 94)} call #t~ret9 := main(); {14696#(< ~counter~0 94)} is VALID [2022-04-08 12:36:36,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14696#(< ~counter~0 94)} {14295#true} #102#return; {14696#(< ~counter~0 94)} is VALID [2022-04-08 12:36:36,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {14696#(< ~counter~0 94)} assume true; {14696#(< ~counter~0 94)} is VALID [2022-04-08 12:36:36,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {14295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14696#(< ~counter~0 94)} is VALID [2022-04-08 12:36:36,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14295#true} is VALID [2022-04-08 12:36:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 12:36:36,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:36,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239852572] [2022-04-08 12:36:36,461 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:36,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124646561] [2022-04-08 12:36:36,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124646561] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:36,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:36,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 12:36:36,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:36,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1186064602] [2022-04-08 12:36:36,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1186064602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:36,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:36,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 12:36:36,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798183211] [2022-04-08 12:36:36,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:36,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-08 12:36:36,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:36,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:36,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:36,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 12:36:36,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:36,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 12:36:36,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 12:36:36,511 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:37,021 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-04-08 12:36:37,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 12:36:37,021 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-08 12:36:37,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-08 12:36:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-08 12:36:37,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-08 12:36:37,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:37,151 INFO L225 Difference]: With dead ends: 193 [2022-04-08 12:36:37,151 INFO L226 Difference]: Without dead ends: 144 [2022-04-08 12:36:37,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=277, Unknown=0, NotChecked=0, Total=462 [2022-04-08 12:36:37,151 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 53 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:37,152 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 197 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:36:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-08 12:36:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-04-08 12:36:37,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:37,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:36:37,285 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:36:37,286 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:36:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:37,288 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-08 12:36:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-08 12:36:37,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:37,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:37,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-08 12:36:37,290 INFO L87 Difference]: Start difference. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-08 12:36:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:37,292 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-08 12:36:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-08 12:36:37,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:37,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:37,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:37,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:36:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2022-04-08 12:36:37,296 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 73 [2022-04-08 12:36:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:37,296 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2022-04-08 12:36:37,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:37,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 177 transitions. [2022-04-08 12:36:39,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 176 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-08 12:36:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 12:36:39,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:39,629 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:39,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:39,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:39,829 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-08 12:36:39,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:39,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [569430768] [2022-04-08 12:36:39,830 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-08 12:36:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:39,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81994878] [2022-04-08 12:36:39,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:39,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:39,841 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:39,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925254235] [2022-04-08 12:36:39,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:39,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:39,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:39,843 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:39,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 12:36:39,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:39,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:39,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 12:36:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:39,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:40,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {15712#true} call ULTIMATE.init(); {15712#true} is VALID [2022-04-08 12:36:40,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {15712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15720#(<= ~counter~0 0)} {15712#true} #102#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {15720#(<= ~counter~0 0)} call #t~ret9 := main(); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {15720#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {15720#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {15720#(<= ~counter~0 0)} ~cond := #in~cond; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {15720#(<= ~counter~0 0)} assume !(0 == ~cond); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15720#(<= ~counter~0 0)} {15720#(<= ~counter~0 0)} #90#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,231 INFO L272 TraceCheckUtils]: 11: Hoare triple {15720#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {15720#(<= ~counter~0 0)} ~cond := #in~cond; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {15720#(<= ~counter~0 0)} assume !(0 == ~cond); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,232 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15720#(<= ~counter~0 0)} {15720#(<= ~counter~0 0)} #92#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {15720#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:40,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {15720#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:40,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {15769#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:40,234 INFO L272 TraceCheckUtils]: 19: Hoare triple {15769#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:40,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {15769#(<= ~counter~0 1)} ~cond := #in~cond; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:40,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {15769#(<= ~counter~0 1)} assume !(0 == ~cond); {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:40,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {15769#(<= ~counter~0 1)} assume true; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:40,236 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15769#(<= ~counter~0 1)} {15769#(<= ~counter~0 1)} #94#return; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:40,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {15769#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:40,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {15769#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:40,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {15794#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:40,238 INFO L272 TraceCheckUtils]: 27: Hoare triple {15794#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:40,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {15794#(<= ~counter~0 2)} ~cond := #in~cond; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:40,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {15794#(<= ~counter~0 2)} assume !(0 == ~cond); {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:40,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {15794#(<= ~counter~0 2)} assume true; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:40,240 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15794#(<= ~counter~0 2)} {15794#(<= ~counter~0 2)} #96#return; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:40,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {15794#(<= ~counter~0 2)} assume !(~r~0 > 0); {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:40,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {15794#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:40,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {15819#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:40,241 INFO L272 TraceCheckUtils]: 35: Hoare triple {15819#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15819#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:40,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {15819#(<= ~counter~0 3)} ~cond := #in~cond; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:40,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {15819#(<= ~counter~0 3)} assume !(0 == ~cond); {15819#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:40,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {15819#(<= ~counter~0 3)} assume true; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:40,243 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15819#(<= ~counter~0 3)} {15819#(<= ~counter~0 3)} #98#return; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:40,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {15819#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:40,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {15819#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:40,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {15844#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:40,245 INFO L272 TraceCheckUtils]: 43: Hoare triple {15844#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:40,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {15844#(<= ~counter~0 4)} ~cond := #in~cond; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:40,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {15844#(<= ~counter~0 4)} assume !(0 == ~cond); {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:40,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {15844#(<= ~counter~0 4)} assume true; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:40,247 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15844#(<= ~counter~0 4)} {15844#(<= ~counter~0 4)} #98#return; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:40,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {15844#(<= ~counter~0 4)} assume !(~r~0 < 0); {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:40,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {15844#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:40,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {15869#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:40,249 INFO L272 TraceCheckUtils]: 51: Hoare triple {15869#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:40,250 INFO L290 TraceCheckUtils]: 52: Hoare triple {15869#(<= ~counter~0 5)} ~cond := #in~cond; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:40,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {15869#(<= ~counter~0 5)} assume !(0 == ~cond); {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:40,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {15869#(<= ~counter~0 5)} assume true; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:40,251 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15869#(<= ~counter~0 5)} {15869#(<= ~counter~0 5)} #94#return; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:40,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {15869#(<= ~counter~0 5)} assume !!(0 != ~r~0); {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:40,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {15869#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:40,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {15894#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:40,253 INFO L272 TraceCheckUtils]: 59: Hoare triple {15894#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15894#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:40,253 INFO L290 TraceCheckUtils]: 60: Hoare triple {15894#(<= ~counter~0 6)} ~cond := #in~cond; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:40,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {15894#(<= ~counter~0 6)} assume !(0 == ~cond); {15894#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:40,254 INFO L290 TraceCheckUtils]: 62: Hoare triple {15894#(<= ~counter~0 6)} assume true; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:40,255 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15894#(<= ~counter~0 6)} {15894#(<= ~counter~0 6)} #96#return; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:40,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {15894#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:40,255 INFO L290 TraceCheckUtils]: 65: Hoare triple {15894#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15919#(<= |main_#t~post7| 6)} is VALID [2022-04-08 12:36:40,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {15919#(<= |main_#t~post7| 6)} assume !(#t~post7 < 100);havoc #t~post7; {15713#false} is VALID [2022-04-08 12:36:40,256 INFO L290 TraceCheckUtils]: 67: Hoare triple {15713#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15713#false} is VALID [2022-04-08 12:36:40,256 INFO L290 TraceCheckUtils]: 68: Hoare triple {15713#false} assume !(#t~post8 < 100);havoc #t~post8; {15713#false} is VALID [2022-04-08 12:36:40,256 INFO L290 TraceCheckUtils]: 69: Hoare triple {15713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15713#false} is VALID [2022-04-08 12:36:40,256 INFO L290 TraceCheckUtils]: 70: Hoare triple {15713#false} assume !(#t~post6 < 100);havoc #t~post6; {15713#false} is VALID [2022-04-08 12:36:40,256 INFO L272 TraceCheckUtils]: 71: Hoare triple {15713#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15713#false} is VALID [2022-04-08 12:36:40,256 INFO L290 TraceCheckUtils]: 72: Hoare triple {15713#false} ~cond := #in~cond; {15713#false} is VALID [2022-04-08 12:36:40,256 INFO L290 TraceCheckUtils]: 73: Hoare triple {15713#false} assume 0 == ~cond; {15713#false} is VALID [2022-04-08 12:36:40,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {15713#false} assume !false; {15713#false} is VALID [2022-04-08 12:36:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:40,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:40,624 INFO L290 TraceCheckUtils]: 74: Hoare triple {15713#false} assume !false; {15713#false} is VALID [2022-04-08 12:36:40,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {15713#false} assume 0 == ~cond; {15713#false} is VALID [2022-04-08 12:36:40,625 INFO L290 TraceCheckUtils]: 72: Hoare triple {15713#false} ~cond := #in~cond; {15713#false} is VALID [2022-04-08 12:36:40,625 INFO L272 TraceCheckUtils]: 71: Hoare triple {15713#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15713#false} is VALID [2022-04-08 12:36:40,625 INFO L290 TraceCheckUtils]: 70: Hoare triple {15713#false} assume !(#t~post6 < 100);havoc #t~post6; {15713#false} is VALID [2022-04-08 12:36:40,625 INFO L290 TraceCheckUtils]: 69: Hoare triple {15713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15713#false} is VALID [2022-04-08 12:36:40,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {15713#false} assume !(#t~post8 < 100);havoc #t~post8; {15713#false} is VALID [2022-04-08 12:36:40,625 INFO L290 TraceCheckUtils]: 67: Hoare triple {15713#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15713#false} is VALID [2022-04-08 12:36:40,625 INFO L290 TraceCheckUtils]: 66: Hoare triple {15971#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {15713#false} is VALID [2022-04-08 12:36:40,627 INFO L290 TraceCheckUtils]: 65: Hoare triple {15975#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15971#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:36:40,631 INFO L290 TraceCheckUtils]: 64: Hoare triple {15975#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15975#(< ~counter~0 100)} is VALID [2022-04-08 12:36:40,632 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15712#true} {15975#(< ~counter~0 100)} #96#return; {15975#(< ~counter~0 100)} is VALID [2022-04-08 12:36:40,632 INFO L290 TraceCheckUtils]: 62: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:36:40,632 INFO L290 TraceCheckUtils]: 61: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:36:40,632 INFO L290 TraceCheckUtils]: 60: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:36:40,632 INFO L272 TraceCheckUtils]: 59: Hoare triple {15975#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 12:36:40,632 INFO L290 TraceCheckUtils]: 58: Hoare triple {15975#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {15975#(< ~counter~0 100)} is VALID [2022-04-08 12:36:40,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {16000#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15975#(< ~counter~0 100)} is VALID [2022-04-08 12:36:40,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {16000#(< ~counter~0 99)} assume !!(0 != ~r~0); {16000#(< ~counter~0 99)} is VALID [2022-04-08 12:36:40,634 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15712#true} {16000#(< ~counter~0 99)} #94#return; {16000#(< ~counter~0 99)} is VALID [2022-04-08 12:36:40,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:36:40,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:36:40,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:36:40,634 INFO L272 TraceCheckUtils]: 51: Hoare triple {16000#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 12:36:40,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {16000#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {16000#(< ~counter~0 99)} is VALID [2022-04-08 12:36:40,635 INFO L290 TraceCheckUtils]: 49: Hoare triple {16025#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16000#(< ~counter~0 99)} is VALID [2022-04-08 12:36:40,635 INFO L290 TraceCheckUtils]: 48: Hoare triple {16025#(< ~counter~0 98)} assume !(~r~0 < 0); {16025#(< ~counter~0 98)} is VALID [2022-04-08 12:36:40,636 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15712#true} {16025#(< ~counter~0 98)} #98#return; {16025#(< ~counter~0 98)} is VALID [2022-04-08 12:36:40,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:36:40,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:36:40,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:36:40,636 INFO L272 TraceCheckUtils]: 43: Hoare triple {16025#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 12:36:40,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {16025#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {16025#(< ~counter~0 98)} is VALID [2022-04-08 12:36:40,637 INFO L290 TraceCheckUtils]: 41: Hoare triple {16050#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16025#(< ~counter~0 98)} is VALID [2022-04-08 12:36:40,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {16050#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16050#(< ~counter~0 97)} is VALID [2022-04-08 12:36:40,637 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15712#true} {16050#(< ~counter~0 97)} #98#return; {16050#(< ~counter~0 97)} is VALID [2022-04-08 12:36:40,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:36:40,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:36:40,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:36:40,638 INFO L272 TraceCheckUtils]: 35: Hoare triple {16050#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 12:36:40,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {16050#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {16050#(< ~counter~0 97)} is VALID [2022-04-08 12:36:40,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {16075#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16050#(< ~counter~0 97)} is VALID [2022-04-08 12:36:40,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {16075#(< ~counter~0 96)} assume !(~r~0 > 0); {16075#(< ~counter~0 96)} is VALID [2022-04-08 12:36:40,639 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15712#true} {16075#(< ~counter~0 96)} #96#return; {16075#(< ~counter~0 96)} is VALID [2022-04-08 12:36:40,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:36:40,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:36:40,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:36:40,640 INFO L272 TraceCheckUtils]: 27: Hoare triple {16075#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 12:36:40,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {16075#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {16075#(< ~counter~0 96)} is VALID [2022-04-08 12:36:40,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {16100#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16075#(< ~counter~0 96)} is VALID [2022-04-08 12:36:40,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {16100#(< ~counter~0 95)} assume !!(0 != ~r~0); {16100#(< ~counter~0 95)} is VALID [2022-04-08 12:36:40,642 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15712#true} {16100#(< ~counter~0 95)} #94#return; {16100#(< ~counter~0 95)} is VALID [2022-04-08 12:36:40,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:36:40,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:36:40,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:36:40,642 INFO L272 TraceCheckUtils]: 19: Hoare triple {16100#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 12:36:40,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {16100#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {16100#(< ~counter~0 95)} is VALID [2022-04-08 12:36:40,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {16125#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16100#(< ~counter~0 95)} is VALID [2022-04-08 12:36:40,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {16125#(< ~counter~0 94)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16125#(< ~counter~0 94)} is VALID [2022-04-08 12:36:40,644 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15712#true} {16125#(< ~counter~0 94)} #92#return; {16125#(< ~counter~0 94)} is VALID [2022-04-08 12:36:40,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:36:40,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:36:40,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:36:40,644 INFO L272 TraceCheckUtils]: 11: Hoare triple {16125#(< ~counter~0 94)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {15712#true} is VALID [2022-04-08 12:36:40,645 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15712#true} {16125#(< ~counter~0 94)} #90#return; {16125#(< ~counter~0 94)} is VALID [2022-04-08 12:36:40,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:36:40,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:36:40,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:36:40,645 INFO L272 TraceCheckUtils]: 6: Hoare triple {16125#(< ~counter~0 94)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 12:36:40,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {16125#(< ~counter~0 94)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {16125#(< ~counter~0 94)} is VALID [2022-04-08 12:36:40,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {16125#(< ~counter~0 94)} call #t~ret9 := main(); {16125#(< ~counter~0 94)} is VALID [2022-04-08 12:36:40,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16125#(< ~counter~0 94)} {15712#true} #102#return; {16125#(< ~counter~0 94)} is VALID [2022-04-08 12:36:40,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {16125#(< ~counter~0 94)} assume true; {16125#(< ~counter~0 94)} is VALID [2022-04-08 12:36:40,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {15712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16125#(< ~counter~0 94)} is VALID [2022-04-08 12:36:40,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {15712#true} call ULTIMATE.init(); {15712#true} is VALID [2022-04-08 12:36:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 12:36:40,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:40,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81994878] [2022-04-08 12:36:40,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:40,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925254235] [2022-04-08 12:36:40,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925254235] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:40,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:40,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 12:36:40,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:40,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [569430768] [2022-04-08 12:36:40,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [569430768] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:40,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:40,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 12:36:40,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690045071] [2022-04-08 12:36:40,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:40,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-08 12:36:40,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:40,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:40,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:40,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 12:36:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:40,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 12:36:40,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 12:36:40,711 INFO L87 Difference]: Start difference. First operand 140 states and 177 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:41,255 INFO L93 Difference]: Finished difference Result 195 states and 255 transitions. [2022-04-08 12:36:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 12:36:41,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-08 12:36:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-08 12:36:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-08 12:36:41,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-08 12:36:41,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:41,402 INFO L225 Difference]: With dead ends: 195 [2022-04-08 12:36:41,403 INFO L226 Difference]: Without dead ends: 146 [2022-04-08 12:36:41,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=301, Unknown=0, NotChecked=0, Total=506 [2022-04-08 12:36:41,403 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 69 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:41,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 179 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:36:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-08 12:36:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-08 12:36:41,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:41,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:36:41,568 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:36:41,568 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:36:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:41,571 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-08 12:36:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 12:36:41,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:41,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:41,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-08 12:36:41,572 INFO L87 Difference]: Start difference. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-08 12:36:41,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:41,575 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-08 12:36:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 12:36:41,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:41,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:41,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:41,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 12:36:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 183 transitions. [2022-04-08 12:36:41,579 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 183 transitions. Word has length 75 [2022-04-08 12:36:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:41,579 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 183 transitions. [2022-04-08 12:36:41,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 12:36:41,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 183 transitions. [2022-04-08 12:36:43,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 12:36:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 12:36:43,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:43,478 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:43,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:43,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:43,679 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:43,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:43,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-08 12:36:43,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:43,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1195634284] [2022-04-08 12:36:43,680 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:43,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-08 12:36:43,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:43,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327714684] [2022-04-08 12:36:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:43,692 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:43,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [284657260] [2022-04-08 12:36:43,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:43,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:43,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:43,693 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:43,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 12:36:43,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:43,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:43,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 12:36:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:43,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:44,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {17163#true} call ULTIMATE.init(); {17163#true} is VALID [2022-04-08 12:36:44,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {17163#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17171#(<= ~counter~0 0)} {17163#true} #102#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {17171#(<= ~counter~0 0)} call #t~ret9 := main(); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {17171#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,109 INFO L272 TraceCheckUtils]: 6: Hoare triple {17171#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {17171#(<= ~counter~0 0)} ~cond := #in~cond; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {17171#(<= ~counter~0 0)} assume !(0 == ~cond); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,110 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17171#(<= ~counter~0 0)} {17171#(<= ~counter~0 0)} #90#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,110 INFO L272 TraceCheckUtils]: 11: Hoare triple {17171#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {17171#(<= ~counter~0 0)} ~cond := #in~cond; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {17171#(<= ~counter~0 0)} assume !(0 == ~cond); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,111 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17171#(<= ~counter~0 0)} {17171#(<= ~counter~0 0)} #92#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {17171#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {17171#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {17220#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,113 INFO L272 TraceCheckUtils]: 19: Hoare triple {17220#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {17220#(<= ~counter~0 1)} ~cond := #in~cond; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {17220#(<= ~counter~0 1)} assume !(0 == ~cond); {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {17220#(<= ~counter~0 1)} assume true; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,114 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17220#(<= ~counter~0 1)} {17220#(<= ~counter~0 1)} #94#return; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {17220#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {17220#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {17245#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,116 INFO L272 TraceCheckUtils]: 27: Hoare triple {17245#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {17245#(<= ~counter~0 2)} ~cond := #in~cond; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {17245#(<= ~counter~0 2)} assume !(0 == ~cond); {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {17245#(<= ~counter~0 2)} assume true; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,117 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17245#(<= ~counter~0 2)} {17245#(<= ~counter~0 2)} #96#return; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {17245#(<= ~counter~0 2)} assume !(~r~0 > 0); {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {17245#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:44,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {17270#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:44,123 INFO L272 TraceCheckUtils]: 35: Hoare triple {17270#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17270#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:44,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {17270#(<= ~counter~0 3)} ~cond := #in~cond; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:44,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {17270#(<= ~counter~0 3)} assume !(0 == ~cond); {17270#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:44,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {17270#(<= ~counter~0 3)} assume true; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:44,124 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17270#(<= ~counter~0 3)} {17270#(<= ~counter~0 3)} #98#return; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:44,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {17270#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:44,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {17270#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {17295#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,126 INFO L272 TraceCheckUtils]: 43: Hoare triple {17295#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17295#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,126 INFO L290 TraceCheckUtils]: 44: Hoare triple {17295#(<= ~counter~0 4)} ~cond := #in~cond; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {17295#(<= ~counter~0 4)} assume !(0 == ~cond); {17295#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {17295#(<= ~counter~0 4)} assume true; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,127 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17295#(<= ~counter~0 4)} {17295#(<= ~counter~0 4)} #98#return; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {17295#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {17295#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:44,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {17320#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:44,129 INFO L272 TraceCheckUtils]: 51: Hoare triple {17320#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17320#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:44,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {17320#(<= ~counter~0 5)} ~cond := #in~cond; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:44,129 INFO L290 TraceCheckUtils]: 53: Hoare triple {17320#(<= ~counter~0 5)} assume !(0 == ~cond); {17320#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:44,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {17320#(<= ~counter~0 5)} assume true; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:44,130 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17320#(<= ~counter~0 5)} {17320#(<= ~counter~0 5)} #98#return; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:44,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {17320#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:44,131 INFO L290 TraceCheckUtils]: 57: Hoare triple {17320#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:44,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {17345#(<= ~counter~0 6)} assume !!(#t~post8 < 100);havoc #t~post8; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:44,131 INFO L272 TraceCheckUtils]: 59: Hoare triple {17345#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17345#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:44,132 INFO L290 TraceCheckUtils]: 60: Hoare triple {17345#(<= ~counter~0 6)} ~cond := #in~cond; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:44,132 INFO L290 TraceCheckUtils]: 61: Hoare triple {17345#(<= ~counter~0 6)} assume !(0 == ~cond); {17345#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:44,132 INFO L290 TraceCheckUtils]: 62: Hoare triple {17345#(<= ~counter~0 6)} assume true; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:44,133 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17345#(<= ~counter~0 6)} {17345#(<= ~counter~0 6)} #98#return; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:44,133 INFO L290 TraceCheckUtils]: 64: Hoare triple {17345#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:44,133 INFO L290 TraceCheckUtils]: 65: Hoare triple {17345#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:44,133 INFO L290 TraceCheckUtils]: 66: Hoare triple {17370#(<= ~counter~0 7)} assume !!(#t~post8 < 100);havoc #t~post8; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:44,134 INFO L272 TraceCheckUtils]: 67: Hoare triple {17370#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:44,134 INFO L290 TraceCheckUtils]: 68: Hoare triple {17370#(<= ~counter~0 7)} ~cond := #in~cond; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:44,134 INFO L290 TraceCheckUtils]: 69: Hoare triple {17370#(<= ~counter~0 7)} assume !(0 == ~cond); {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:44,135 INFO L290 TraceCheckUtils]: 70: Hoare triple {17370#(<= ~counter~0 7)} assume true; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:44,135 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17370#(<= ~counter~0 7)} {17370#(<= ~counter~0 7)} #98#return; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:44,135 INFO L290 TraceCheckUtils]: 72: Hoare triple {17370#(<= ~counter~0 7)} assume !(~r~0 < 0); {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:44,136 INFO L290 TraceCheckUtils]: 73: Hoare triple {17370#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17395#(<= |main_#t~post6| 7)} is VALID [2022-04-08 12:36:44,136 INFO L290 TraceCheckUtils]: 74: Hoare triple {17395#(<= |main_#t~post6| 7)} assume !(#t~post6 < 100);havoc #t~post6; {17164#false} is VALID [2022-04-08 12:36:44,136 INFO L272 TraceCheckUtils]: 75: Hoare triple {17164#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17164#false} is VALID [2022-04-08 12:36:44,136 INFO L290 TraceCheckUtils]: 76: Hoare triple {17164#false} ~cond := #in~cond; {17164#false} is VALID [2022-04-08 12:36:44,136 INFO L290 TraceCheckUtils]: 77: Hoare triple {17164#false} assume 0 == ~cond; {17164#false} is VALID [2022-04-08 12:36:44,136 INFO L290 TraceCheckUtils]: 78: Hoare triple {17164#false} assume !false; {17164#false} is VALID [2022-04-08 12:36:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 126 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:44,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:44,557 INFO L290 TraceCheckUtils]: 78: Hoare triple {17164#false} assume !false; {17164#false} is VALID [2022-04-08 12:36:44,557 INFO L290 TraceCheckUtils]: 77: Hoare triple {17164#false} assume 0 == ~cond; {17164#false} is VALID [2022-04-08 12:36:44,557 INFO L290 TraceCheckUtils]: 76: Hoare triple {17164#false} ~cond := #in~cond; {17164#false} is VALID [2022-04-08 12:36:44,557 INFO L272 TraceCheckUtils]: 75: Hoare triple {17164#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17164#false} is VALID [2022-04-08 12:36:44,557 INFO L290 TraceCheckUtils]: 74: Hoare triple {17423#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {17164#false} is VALID [2022-04-08 12:36:44,558 INFO L290 TraceCheckUtils]: 73: Hoare triple {17427#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17423#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:36:44,558 INFO L290 TraceCheckUtils]: 72: Hoare triple {17427#(< ~counter~0 100)} assume !(~r~0 < 0); {17427#(< ~counter~0 100)} is VALID [2022-04-08 12:36:44,559 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17163#true} {17427#(< ~counter~0 100)} #98#return; {17427#(< ~counter~0 100)} is VALID [2022-04-08 12:36:44,559 INFO L290 TraceCheckUtils]: 70: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:36:44,559 INFO L290 TraceCheckUtils]: 69: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:36:44,559 INFO L290 TraceCheckUtils]: 68: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:36:44,559 INFO L272 TraceCheckUtils]: 67: Hoare triple {17427#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 12:36:44,559 INFO L290 TraceCheckUtils]: 66: Hoare triple {17427#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {17427#(< ~counter~0 100)} is VALID [2022-04-08 12:36:44,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {17452#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17427#(< ~counter~0 100)} is VALID [2022-04-08 12:36:44,560 INFO L290 TraceCheckUtils]: 64: Hoare triple {17452#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17452#(< ~counter~0 99)} is VALID [2022-04-08 12:36:44,560 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17163#true} {17452#(< ~counter~0 99)} #98#return; {17452#(< ~counter~0 99)} is VALID [2022-04-08 12:36:44,561 INFO L290 TraceCheckUtils]: 62: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:36:44,561 INFO L290 TraceCheckUtils]: 61: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:36:44,561 INFO L290 TraceCheckUtils]: 60: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:36:44,561 INFO L272 TraceCheckUtils]: 59: Hoare triple {17452#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 12:36:44,561 INFO L290 TraceCheckUtils]: 58: Hoare triple {17452#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {17452#(< ~counter~0 99)} is VALID [2022-04-08 12:36:44,561 INFO L290 TraceCheckUtils]: 57: Hoare triple {17477#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17452#(< ~counter~0 99)} is VALID [2022-04-08 12:36:44,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {17477#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17477#(< ~counter~0 98)} is VALID [2022-04-08 12:36:44,562 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17163#true} {17477#(< ~counter~0 98)} #98#return; {17477#(< ~counter~0 98)} is VALID [2022-04-08 12:36:44,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:36:44,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:36:44,562 INFO L290 TraceCheckUtils]: 52: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:36:44,562 INFO L272 TraceCheckUtils]: 51: Hoare triple {17477#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 12:36:44,563 INFO L290 TraceCheckUtils]: 50: Hoare triple {17477#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {17477#(< ~counter~0 98)} is VALID [2022-04-08 12:36:44,563 INFO L290 TraceCheckUtils]: 49: Hoare triple {17502#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17477#(< ~counter~0 98)} is VALID [2022-04-08 12:36:44,563 INFO L290 TraceCheckUtils]: 48: Hoare triple {17502#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17502#(< ~counter~0 97)} is VALID [2022-04-08 12:36:44,564 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17163#true} {17502#(< ~counter~0 97)} #98#return; {17502#(< ~counter~0 97)} is VALID [2022-04-08 12:36:44,564 INFO L290 TraceCheckUtils]: 46: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:36:44,564 INFO L290 TraceCheckUtils]: 45: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:36:44,564 INFO L290 TraceCheckUtils]: 44: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:36:44,564 INFO L272 TraceCheckUtils]: 43: Hoare triple {17502#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 12:36:44,564 INFO L290 TraceCheckUtils]: 42: Hoare triple {17502#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {17502#(< ~counter~0 97)} is VALID [2022-04-08 12:36:44,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {17527#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17502#(< ~counter~0 97)} is VALID [2022-04-08 12:36:44,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {17527#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17527#(< ~counter~0 96)} is VALID [2022-04-08 12:36:44,566 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17163#true} {17527#(< ~counter~0 96)} #98#return; {17527#(< ~counter~0 96)} is VALID [2022-04-08 12:36:44,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:36:44,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:36:44,566 INFO L290 TraceCheckUtils]: 36: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:36:44,566 INFO L272 TraceCheckUtils]: 35: Hoare triple {17527#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 12:36:44,566 INFO L290 TraceCheckUtils]: 34: Hoare triple {17527#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {17527#(< ~counter~0 96)} is VALID [2022-04-08 12:36:44,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {17552#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17527#(< ~counter~0 96)} is VALID [2022-04-08 12:36:44,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {17552#(< ~counter~0 95)} assume !(~r~0 > 0); {17552#(< ~counter~0 95)} is VALID [2022-04-08 12:36:44,567 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17163#true} {17552#(< ~counter~0 95)} #96#return; {17552#(< ~counter~0 95)} is VALID [2022-04-08 12:36:44,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:36:44,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:36:44,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:36:44,568 INFO L272 TraceCheckUtils]: 27: Hoare triple {17552#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 12:36:44,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {17552#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {17552#(< ~counter~0 95)} is VALID [2022-04-08 12:36:44,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {17577#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17552#(< ~counter~0 95)} is VALID [2022-04-08 12:36:44,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {17577#(< ~counter~0 94)} assume !!(0 != ~r~0); {17577#(< ~counter~0 94)} is VALID [2022-04-08 12:36:44,569 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17163#true} {17577#(< ~counter~0 94)} #94#return; {17577#(< ~counter~0 94)} is VALID [2022-04-08 12:36:44,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:36:44,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:36:44,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:36:44,569 INFO L272 TraceCheckUtils]: 19: Hoare triple {17577#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 12:36:44,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {17577#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {17577#(< ~counter~0 94)} is VALID [2022-04-08 12:36:44,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {17602#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17577#(< ~counter~0 94)} is VALID [2022-04-08 12:36:44,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {17602#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17602#(< ~counter~0 93)} is VALID [2022-04-08 12:36:44,571 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17163#true} {17602#(< ~counter~0 93)} #92#return; {17602#(< ~counter~0 93)} is VALID [2022-04-08 12:36:44,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:36:44,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:36:44,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:36:44,572 INFO L272 TraceCheckUtils]: 11: Hoare triple {17602#(< ~counter~0 93)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {17163#true} is VALID [2022-04-08 12:36:44,572 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17163#true} {17602#(< ~counter~0 93)} #90#return; {17602#(< ~counter~0 93)} is VALID [2022-04-08 12:36:44,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:36:44,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:36:44,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:36:44,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {17602#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 12:36:44,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {17602#(< ~counter~0 93)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {17602#(< ~counter~0 93)} is VALID [2022-04-08 12:36:44,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {17602#(< ~counter~0 93)} call #t~ret9 := main(); {17602#(< ~counter~0 93)} is VALID [2022-04-08 12:36:44,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17602#(< ~counter~0 93)} {17163#true} #102#return; {17602#(< ~counter~0 93)} is VALID [2022-04-08 12:36:44,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {17602#(< ~counter~0 93)} assume true; {17602#(< ~counter~0 93)} is VALID [2022-04-08 12:36:44,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {17163#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17602#(< ~counter~0 93)} is VALID [2022-04-08 12:36:44,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {17163#true} call ULTIMATE.init(); {17163#true} is VALID [2022-04-08 12:36:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 12:36:44,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:44,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327714684] [2022-04-08 12:36:44,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:44,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284657260] [2022-04-08 12:36:44,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284657260] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:44,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:44,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 12:36:44,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:44,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1195634284] [2022-04-08 12:36:44,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1195634284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:44,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:44,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 12:36:44,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916086856] [2022-04-08 12:36:44,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:44,576 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-08 12:36:44,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:44,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:44,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:44,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 12:36:44,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:44,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 12:36:44,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 12:36:44,636 INFO L87 Difference]: Start difference. First operand 146 states and 183 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:45,324 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2022-04-08 12:36:45,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 12:36:45,325 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-08 12:36:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:45,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-08 12:36:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-08 12:36:45,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-08 12:36:45,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:45,476 INFO L225 Difference]: With dead ends: 168 [2022-04-08 12:36:45,476 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 12:36:45,476 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=327, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:36:45,477 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 82 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:45,477 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 221 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:36:45,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 12:36:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-08 12:36:45,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:45,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 12:36:45,664 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 12:36:45,664 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 12:36:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:45,667 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-08 12:36:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-08 12:36:45,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:45,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:45,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-08 12:36:45,668 INFO L87 Difference]: Start difference. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-08 12:36:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:45,671 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-08 12:36:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-08 12:36:45,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:45,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:45,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:45,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 12:36:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2022-04-08 12:36:45,675 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 79 [2022-04-08 12:36:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:45,676 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2022-04-08 12:36:45,676 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:45,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 198 transitions. [2022-04-08 12:36:46,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:46,534 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2022-04-08 12:36:46,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 12:36:46,535 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:46,535 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:46,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:46,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:46,736 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:46,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-08 12:36:46,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:46,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [583478747] [2022-04-08 12:36:46,737 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:46,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-08 12:36:46,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:46,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769721452] [2022-04-08 12:36:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:46,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:46,748 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:46,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066277505] [2022-04-08 12:36:46,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:46,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:46,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:46,749 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:46,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 12:36:46,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:46,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:46,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 12:36:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:46,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:47,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {18640#true} call ULTIMATE.init(); {18640#true} is VALID [2022-04-08 12:36:47,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {18640#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18648#(<= ~counter~0 0)} {18640#true} #102#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {18648#(<= ~counter~0 0)} call #t~ret9 := main(); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {18648#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {18648#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {18648#(<= ~counter~0 0)} ~cond := #in~cond; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {18648#(<= ~counter~0 0)} assume !(0 == ~cond); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,210 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18648#(<= ~counter~0 0)} {18648#(<= ~counter~0 0)} #90#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,210 INFO L272 TraceCheckUtils]: 11: Hoare triple {18648#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {18648#(<= ~counter~0 0)} ~cond := #in~cond; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {18648#(<= ~counter~0 0)} assume !(0 == ~cond); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,211 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18648#(<= ~counter~0 0)} {18648#(<= ~counter~0 0)} #92#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {18648#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {18648#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {18697#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,213 INFO L272 TraceCheckUtils]: 19: Hoare triple {18697#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {18697#(<= ~counter~0 1)} ~cond := #in~cond; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {18697#(<= ~counter~0 1)} assume !(0 == ~cond); {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {18697#(<= ~counter~0 1)} assume true; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,214 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18697#(<= ~counter~0 1)} {18697#(<= ~counter~0 1)} #94#return; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {18697#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {18697#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {18722#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,216 INFO L272 TraceCheckUtils]: 27: Hoare triple {18722#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {18722#(<= ~counter~0 2)} ~cond := #in~cond; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {18722#(<= ~counter~0 2)} assume !(0 == ~cond); {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {18722#(<= ~counter~0 2)} assume true; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,217 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18722#(<= ~counter~0 2)} {18722#(<= ~counter~0 2)} #96#return; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {18722#(<= ~counter~0 2)} assume !(~r~0 > 0); {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {18722#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:47,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {18747#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:47,218 INFO L272 TraceCheckUtils]: 35: Hoare triple {18747#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18747#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:47,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {18747#(<= ~counter~0 3)} ~cond := #in~cond; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:47,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {18747#(<= ~counter~0 3)} assume !(0 == ~cond); {18747#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:47,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {18747#(<= ~counter~0 3)} assume true; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:47,220 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18747#(<= ~counter~0 3)} {18747#(<= ~counter~0 3)} #98#return; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:47,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {18747#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:47,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {18747#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:47,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {18772#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:47,221 INFO L272 TraceCheckUtils]: 43: Hoare triple {18772#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:47,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {18772#(<= ~counter~0 4)} ~cond := #in~cond; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:47,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {18772#(<= ~counter~0 4)} assume !(0 == ~cond); {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:47,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {18772#(<= ~counter~0 4)} assume true; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:47,227 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18772#(<= ~counter~0 4)} {18772#(<= ~counter~0 4)} #98#return; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:47,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {18772#(<= ~counter~0 4)} assume !(~r~0 < 0); {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:47,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {18772#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:47,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {18797#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:47,229 INFO L272 TraceCheckUtils]: 51: Hoare triple {18797#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:47,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {18797#(<= ~counter~0 5)} ~cond := #in~cond; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:47,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {18797#(<= ~counter~0 5)} assume !(0 == ~cond); {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:47,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {18797#(<= ~counter~0 5)} assume true; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:47,230 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18797#(<= ~counter~0 5)} {18797#(<= ~counter~0 5)} #94#return; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:47,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {18797#(<= ~counter~0 5)} assume !!(0 != ~r~0); {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:47,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {18797#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:47,231 INFO L290 TraceCheckUtils]: 58: Hoare triple {18822#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:47,231 INFO L272 TraceCheckUtils]: 59: Hoare triple {18822#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18822#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:47,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {18822#(<= ~counter~0 6)} ~cond := #in~cond; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:47,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {18822#(<= ~counter~0 6)} assume !(0 == ~cond); {18822#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:47,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {18822#(<= ~counter~0 6)} assume true; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:47,233 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18822#(<= ~counter~0 6)} {18822#(<= ~counter~0 6)} #96#return; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:47,233 INFO L290 TraceCheckUtils]: 64: Hoare triple {18822#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:47,233 INFO L290 TraceCheckUtils]: 65: Hoare triple {18822#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:47,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {18847#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:47,234 INFO L272 TraceCheckUtils]: 67: Hoare triple {18847#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:47,234 INFO L290 TraceCheckUtils]: 68: Hoare triple {18847#(<= ~counter~0 7)} ~cond := #in~cond; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:47,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {18847#(<= ~counter~0 7)} assume !(0 == ~cond); {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:47,235 INFO L290 TraceCheckUtils]: 70: Hoare triple {18847#(<= ~counter~0 7)} assume true; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:47,235 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18847#(<= ~counter~0 7)} {18847#(<= ~counter~0 7)} #96#return; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:47,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {18847#(<= ~counter~0 7)} assume !(~r~0 > 0); {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:47,236 INFO L290 TraceCheckUtils]: 73: Hoare triple {18847#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18872#(<= |main_#t~post8| 7)} is VALID [2022-04-08 12:36:47,236 INFO L290 TraceCheckUtils]: 74: Hoare triple {18872#(<= |main_#t~post8| 7)} assume !(#t~post8 < 100);havoc #t~post8; {18641#false} is VALID [2022-04-08 12:36:47,236 INFO L290 TraceCheckUtils]: 75: Hoare triple {18641#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18641#false} is VALID [2022-04-08 12:36:47,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {18641#false} assume !(#t~post6 < 100);havoc #t~post6; {18641#false} is VALID [2022-04-08 12:36:47,237 INFO L272 TraceCheckUtils]: 77: Hoare triple {18641#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18641#false} is VALID [2022-04-08 12:36:47,237 INFO L290 TraceCheckUtils]: 78: Hoare triple {18641#false} ~cond := #in~cond; {18641#false} is VALID [2022-04-08 12:36:47,237 INFO L290 TraceCheckUtils]: 79: Hoare triple {18641#false} assume 0 == ~cond; {18641#false} is VALID [2022-04-08 12:36:47,237 INFO L290 TraceCheckUtils]: 80: Hoare triple {18641#false} assume !false; {18641#false} is VALID [2022-04-08 12:36:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:47,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:47,660 INFO L290 TraceCheckUtils]: 80: Hoare triple {18641#false} assume !false; {18641#false} is VALID [2022-04-08 12:36:47,660 INFO L290 TraceCheckUtils]: 79: Hoare triple {18641#false} assume 0 == ~cond; {18641#false} is VALID [2022-04-08 12:36:47,660 INFO L290 TraceCheckUtils]: 78: Hoare triple {18641#false} ~cond := #in~cond; {18641#false} is VALID [2022-04-08 12:36:47,660 INFO L272 TraceCheckUtils]: 77: Hoare triple {18641#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18641#false} is VALID [2022-04-08 12:36:47,660 INFO L290 TraceCheckUtils]: 76: Hoare triple {18641#false} assume !(#t~post6 < 100);havoc #t~post6; {18641#false} is VALID [2022-04-08 12:36:47,660 INFO L290 TraceCheckUtils]: 75: Hoare triple {18641#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18641#false} is VALID [2022-04-08 12:36:47,661 INFO L290 TraceCheckUtils]: 74: Hoare triple {18912#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {18641#false} is VALID [2022-04-08 12:36:47,661 INFO L290 TraceCheckUtils]: 73: Hoare triple {18916#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18912#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:36:47,661 INFO L290 TraceCheckUtils]: 72: Hoare triple {18916#(< ~counter~0 100)} assume !(~r~0 > 0); {18916#(< ~counter~0 100)} is VALID [2022-04-08 12:36:47,662 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18640#true} {18916#(< ~counter~0 100)} #96#return; {18916#(< ~counter~0 100)} is VALID [2022-04-08 12:36:47,662 INFO L290 TraceCheckUtils]: 70: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:36:47,662 INFO L290 TraceCheckUtils]: 69: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:36:47,662 INFO L290 TraceCheckUtils]: 68: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:36:47,662 INFO L272 TraceCheckUtils]: 67: Hoare triple {18916#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 12:36:47,662 INFO L290 TraceCheckUtils]: 66: Hoare triple {18916#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {18916#(< ~counter~0 100)} is VALID [2022-04-08 12:36:47,663 INFO L290 TraceCheckUtils]: 65: Hoare triple {18941#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18916#(< ~counter~0 100)} is VALID [2022-04-08 12:36:47,663 INFO L290 TraceCheckUtils]: 64: Hoare triple {18941#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18941#(< ~counter~0 99)} is VALID [2022-04-08 12:36:47,664 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18640#true} {18941#(< ~counter~0 99)} #96#return; {18941#(< ~counter~0 99)} is VALID [2022-04-08 12:36:47,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:36:47,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:36:47,664 INFO L290 TraceCheckUtils]: 60: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:36:47,664 INFO L272 TraceCheckUtils]: 59: Hoare triple {18941#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 12:36:47,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {18941#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {18941#(< ~counter~0 99)} is VALID [2022-04-08 12:36:47,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {18966#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18941#(< ~counter~0 99)} is VALID [2022-04-08 12:36:47,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {18966#(< ~counter~0 98)} assume !!(0 != ~r~0); {18966#(< ~counter~0 98)} is VALID [2022-04-08 12:36:47,666 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18640#true} {18966#(< ~counter~0 98)} #94#return; {18966#(< ~counter~0 98)} is VALID [2022-04-08 12:36:47,666 INFO L290 TraceCheckUtils]: 54: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:36:47,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:36:47,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:36:47,666 INFO L272 TraceCheckUtils]: 51: Hoare triple {18966#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 12:36:47,666 INFO L290 TraceCheckUtils]: 50: Hoare triple {18966#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {18966#(< ~counter~0 98)} is VALID [2022-04-08 12:36:47,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {18991#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18966#(< ~counter~0 98)} is VALID [2022-04-08 12:36:47,667 INFO L290 TraceCheckUtils]: 48: Hoare triple {18991#(< ~counter~0 97)} assume !(~r~0 < 0); {18991#(< ~counter~0 97)} is VALID [2022-04-08 12:36:47,668 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18640#true} {18991#(< ~counter~0 97)} #98#return; {18991#(< ~counter~0 97)} is VALID [2022-04-08 12:36:47,668 INFO L290 TraceCheckUtils]: 46: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:36:47,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:36:47,668 INFO L290 TraceCheckUtils]: 44: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:36:47,668 INFO L272 TraceCheckUtils]: 43: Hoare triple {18991#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 12:36:47,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {18991#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {18991#(< ~counter~0 97)} is VALID [2022-04-08 12:36:47,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {19016#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18991#(< ~counter~0 97)} is VALID [2022-04-08 12:36:47,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {19016#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19016#(< ~counter~0 96)} is VALID [2022-04-08 12:36:47,669 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18640#true} {19016#(< ~counter~0 96)} #98#return; {19016#(< ~counter~0 96)} is VALID [2022-04-08 12:36:47,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:36:47,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:36:47,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:36:47,670 INFO L272 TraceCheckUtils]: 35: Hoare triple {19016#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 12:36:47,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {19016#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {19016#(< ~counter~0 96)} is VALID [2022-04-08 12:36:47,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {19041#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19016#(< ~counter~0 96)} is VALID [2022-04-08 12:36:47,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {19041#(< ~counter~0 95)} assume !(~r~0 > 0); {19041#(< ~counter~0 95)} is VALID [2022-04-08 12:36:47,671 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18640#true} {19041#(< ~counter~0 95)} #96#return; {19041#(< ~counter~0 95)} is VALID [2022-04-08 12:36:47,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:36:47,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:36:47,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:36:47,671 INFO L272 TraceCheckUtils]: 27: Hoare triple {19041#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 12:36:47,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {19041#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {19041#(< ~counter~0 95)} is VALID [2022-04-08 12:36:47,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {19066#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19041#(< ~counter~0 95)} is VALID [2022-04-08 12:36:47,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {19066#(< ~counter~0 94)} assume !!(0 != ~r~0); {19066#(< ~counter~0 94)} is VALID [2022-04-08 12:36:47,673 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18640#true} {19066#(< ~counter~0 94)} #94#return; {19066#(< ~counter~0 94)} is VALID [2022-04-08 12:36:47,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:36:47,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:36:47,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:36:47,673 INFO L272 TraceCheckUtils]: 19: Hoare triple {19066#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 12:36:47,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {19066#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {19066#(< ~counter~0 94)} is VALID [2022-04-08 12:36:47,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {19091#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19066#(< ~counter~0 94)} is VALID [2022-04-08 12:36:47,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {19091#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19091#(< ~counter~0 93)} is VALID [2022-04-08 12:36:47,674 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18640#true} {19091#(< ~counter~0 93)} #92#return; {19091#(< ~counter~0 93)} is VALID [2022-04-08 12:36:47,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:36:47,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:36:47,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:36:47,675 INFO L272 TraceCheckUtils]: 11: Hoare triple {19091#(< ~counter~0 93)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {18640#true} is VALID [2022-04-08 12:36:47,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18640#true} {19091#(< ~counter~0 93)} #90#return; {19091#(< ~counter~0 93)} is VALID [2022-04-08 12:36:47,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:36:47,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:36:47,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:36:47,675 INFO L272 TraceCheckUtils]: 6: Hoare triple {19091#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 12:36:47,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {19091#(< ~counter~0 93)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {19091#(< ~counter~0 93)} is VALID [2022-04-08 12:36:47,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {19091#(< ~counter~0 93)} call #t~ret9 := main(); {19091#(< ~counter~0 93)} is VALID [2022-04-08 12:36:47,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19091#(< ~counter~0 93)} {18640#true} #102#return; {19091#(< ~counter~0 93)} is VALID [2022-04-08 12:36:47,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {19091#(< ~counter~0 93)} assume true; {19091#(< ~counter~0 93)} is VALID [2022-04-08 12:36:47,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {18640#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19091#(< ~counter~0 93)} is VALID [2022-04-08 12:36:47,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {18640#true} call ULTIMATE.init(); {18640#true} is VALID [2022-04-08 12:36:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 12:36:47,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:47,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769721452] [2022-04-08 12:36:47,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:47,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066277505] [2022-04-08 12:36:47,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066277505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:47,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:47,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 12:36:47,678 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:47,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [583478747] [2022-04-08 12:36:47,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [583478747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:47,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:47,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 12:36:47,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357077381] [2022-04-08 12:36:47,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:47,678 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-08 12:36:47,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:47,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:47,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:47,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 12:36:47,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:47,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 12:36:47,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 12:36:47,734 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:48,294 INFO L93 Difference]: Finished difference Result 213 states and 277 transitions. [2022-04-08 12:36:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 12:36:48,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-08 12:36:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-08 12:36:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-08 12:36:48,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-08 12:36:48,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:48,455 INFO L225 Difference]: With dead ends: 213 [2022-04-08 12:36:48,455 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 12:36:48,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=357, Unknown=0, NotChecked=0, Total=600 [2022-04-08 12:36:48,456 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 82 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:48,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 193 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:36:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 12:36:48,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2022-04-08 12:36:48,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:48,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 12:36:48,636 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 12:36:48,636 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 12:36:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:48,638 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-08 12:36:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-08 12:36:48,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:48,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:48,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-08 12:36:48,639 INFO L87 Difference]: Start difference. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-08 12:36:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:48,642 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-08 12:36:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-08 12:36:48,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:48,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:48,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:48,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 12:36:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2022-04-08 12:36:48,647 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 81 [2022-04-08 12:36:48,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:48,647 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2022-04-08 12:36:48,647 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:48,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 202 transitions. [2022-04-08 12:36:50,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-08 12:36:50,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 12:36:50,190 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:50,190 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:50,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:50,390 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:50,390 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:50,391 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-08 12:36:50,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:50,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [388138613] [2022-04-08 12:36:50,391 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:50,391 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-08 12:36:50,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:50,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73477283] [2022-04-08 12:36:50,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:50,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:50,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:50,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1341266132] [2022-04-08 12:36:50,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:36:50,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:50,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:50,403 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:50,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 12:36:50,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:36:50,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:50,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 12:36:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:50,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:50,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {20229#true} call ULTIMATE.init(); {20229#true} is VALID [2022-04-08 12:36:50,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {20229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20237#(<= ~counter~0 0)} {20229#true} #102#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {20237#(<= ~counter~0 0)} call #t~ret9 := main(); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {20237#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,888 INFO L272 TraceCheckUtils]: 6: Hoare triple {20237#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {20237#(<= ~counter~0 0)} ~cond := #in~cond; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {20237#(<= ~counter~0 0)} assume !(0 == ~cond); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,889 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20237#(<= ~counter~0 0)} {20237#(<= ~counter~0 0)} #90#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,889 INFO L272 TraceCheckUtils]: 11: Hoare triple {20237#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {20237#(<= ~counter~0 0)} ~cond := #in~cond; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {20237#(<= ~counter~0 0)} assume !(0 == ~cond); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,890 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20237#(<= ~counter~0 0)} {20237#(<= ~counter~0 0)} #92#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {20237#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {20237#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {20286#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,892 INFO L272 TraceCheckUtils]: 19: Hoare triple {20286#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {20286#(<= ~counter~0 1)} ~cond := #in~cond; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {20286#(<= ~counter~0 1)} assume !(0 == ~cond); {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {20286#(<= ~counter~0 1)} assume true; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,894 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20286#(<= ~counter~0 1)} {20286#(<= ~counter~0 1)} #94#return; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {20286#(<= ~counter~0 1)} assume !!(0 != ~r~0); {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {20286#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:50,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {20311#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:50,895 INFO L272 TraceCheckUtils]: 27: Hoare triple {20311#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:50,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {20311#(<= ~counter~0 2)} ~cond := #in~cond; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:50,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {20311#(<= ~counter~0 2)} assume !(0 == ~cond); {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:50,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {20311#(<= ~counter~0 2)} assume true; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:50,896 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20311#(<= ~counter~0 2)} {20311#(<= ~counter~0 2)} #96#return; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:50,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {20311#(<= ~counter~0 2)} assume !(~r~0 > 0); {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:50,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {20311#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:50,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {20336#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:50,898 INFO L272 TraceCheckUtils]: 35: Hoare triple {20336#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20336#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:50,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {20336#(<= ~counter~0 3)} ~cond := #in~cond; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:50,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {20336#(<= ~counter~0 3)} assume !(0 == ~cond); {20336#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:50,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {20336#(<= ~counter~0 3)} assume true; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:50,899 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20336#(<= ~counter~0 3)} {20336#(<= ~counter~0 3)} #98#return; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:50,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {20336#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:50,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {20336#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:50,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {20361#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:50,900 INFO L272 TraceCheckUtils]: 43: Hoare triple {20361#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:50,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {20361#(<= ~counter~0 4)} ~cond := #in~cond; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:50,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {20361#(<= ~counter~0 4)} assume !(0 == ~cond); {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:50,901 INFO L290 TraceCheckUtils]: 46: Hoare triple {20361#(<= ~counter~0 4)} assume true; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:50,902 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20361#(<= ~counter~0 4)} {20361#(<= ~counter~0 4)} #98#return; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:50,902 INFO L290 TraceCheckUtils]: 48: Hoare triple {20361#(<= ~counter~0 4)} assume !(~r~0 < 0); {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:50,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {20361#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:50,903 INFO L290 TraceCheckUtils]: 50: Hoare triple {20386#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:50,903 INFO L272 TraceCheckUtils]: 51: Hoare triple {20386#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:50,903 INFO L290 TraceCheckUtils]: 52: Hoare triple {20386#(<= ~counter~0 5)} ~cond := #in~cond; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:50,904 INFO L290 TraceCheckUtils]: 53: Hoare triple {20386#(<= ~counter~0 5)} assume !(0 == ~cond); {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:50,904 INFO L290 TraceCheckUtils]: 54: Hoare triple {20386#(<= ~counter~0 5)} assume true; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:50,905 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20386#(<= ~counter~0 5)} {20386#(<= ~counter~0 5)} #94#return; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:50,905 INFO L290 TraceCheckUtils]: 56: Hoare triple {20386#(<= ~counter~0 5)} assume !!(0 != ~r~0); {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:50,905 INFO L290 TraceCheckUtils]: 57: Hoare triple {20386#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:50,906 INFO L290 TraceCheckUtils]: 58: Hoare triple {20411#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:50,906 INFO L272 TraceCheckUtils]: 59: Hoare triple {20411#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20411#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:50,906 INFO L290 TraceCheckUtils]: 60: Hoare triple {20411#(<= ~counter~0 6)} ~cond := #in~cond; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:50,906 INFO L290 TraceCheckUtils]: 61: Hoare triple {20411#(<= ~counter~0 6)} assume !(0 == ~cond); {20411#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:50,907 INFO L290 TraceCheckUtils]: 62: Hoare triple {20411#(<= ~counter~0 6)} assume true; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:50,907 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20411#(<= ~counter~0 6)} {20411#(<= ~counter~0 6)} #96#return; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:50,908 INFO L290 TraceCheckUtils]: 64: Hoare triple {20411#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:50,908 INFO L290 TraceCheckUtils]: 65: Hoare triple {20411#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:50,908 INFO L290 TraceCheckUtils]: 66: Hoare triple {20436#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:50,909 INFO L272 TraceCheckUtils]: 67: Hoare triple {20436#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20436#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:50,909 INFO L290 TraceCheckUtils]: 68: Hoare triple {20436#(<= ~counter~0 7)} ~cond := #in~cond; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:50,909 INFO L290 TraceCheckUtils]: 69: Hoare triple {20436#(<= ~counter~0 7)} assume !(0 == ~cond); {20436#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:50,909 INFO L290 TraceCheckUtils]: 70: Hoare triple {20436#(<= ~counter~0 7)} assume true; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:50,910 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20436#(<= ~counter~0 7)} {20436#(<= ~counter~0 7)} #96#return; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:50,910 INFO L290 TraceCheckUtils]: 72: Hoare triple {20436#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:50,911 INFO L290 TraceCheckUtils]: 73: Hoare triple {20436#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20461#(<= |main_#t~post7| 7)} is VALID [2022-04-08 12:36:50,911 INFO L290 TraceCheckUtils]: 74: Hoare triple {20461#(<= |main_#t~post7| 7)} assume !(#t~post7 < 100);havoc #t~post7; {20230#false} is VALID [2022-04-08 12:36:50,911 INFO L290 TraceCheckUtils]: 75: Hoare triple {20230#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20230#false} is VALID [2022-04-08 12:36:50,911 INFO L290 TraceCheckUtils]: 76: Hoare triple {20230#false} assume !(#t~post8 < 100);havoc #t~post8; {20230#false} is VALID [2022-04-08 12:36:50,911 INFO L290 TraceCheckUtils]: 77: Hoare triple {20230#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20230#false} is VALID [2022-04-08 12:36:50,911 INFO L290 TraceCheckUtils]: 78: Hoare triple {20230#false} assume !(#t~post6 < 100);havoc #t~post6; {20230#false} is VALID [2022-04-08 12:36:50,911 INFO L272 TraceCheckUtils]: 79: Hoare triple {20230#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20230#false} is VALID [2022-04-08 12:36:50,911 INFO L290 TraceCheckUtils]: 80: Hoare triple {20230#false} ~cond := #in~cond; {20230#false} is VALID [2022-04-08 12:36:50,911 INFO L290 TraceCheckUtils]: 81: Hoare triple {20230#false} assume 0 == ~cond; {20230#false} is VALID [2022-04-08 12:36:50,911 INFO L290 TraceCheckUtils]: 82: Hoare triple {20230#false} assume !false; {20230#false} is VALID [2022-04-08 12:36:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:50,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:51,342 INFO L290 TraceCheckUtils]: 82: Hoare triple {20230#false} assume !false; {20230#false} is VALID [2022-04-08 12:36:51,343 INFO L290 TraceCheckUtils]: 81: Hoare triple {20230#false} assume 0 == ~cond; {20230#false} is VALID [2022-04-08 12:36:51,343 INFO L290 TraceCheckUtils]: 80: Hoare triple {20230#false} ~cond := #in~cond; {20230#false} is VALID [2022-04-08 12:36:51,343 INFO L272 TraceCheckUtils]: 79: Hoare triple {20230#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20230#false} is VALID [2022-04-08 12:36:51,343 INFO L290 TraceCheckUtils]: 78: Hoare triple {20230#false} assume !(#t~post6 < 100);havoc #t~post6; {20230#false} is VALID [2022-04-08 12:36:51,343 INFO L290 TraceCheckUtils]: 77: Hoare triple {20230#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20230#false} is VALID [2022-04-08 12:36:51,343 INFO L290 TraceCheckUtils]: 76: Hoare triple {20230#false} assume !(#t~post8 < 100);havoc #t~post8; {20230#false} is VALID [2022-04-08 12:36:51,343 INFO L290 TraceCheckUtils]: 75: Hoare triple {20230#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20230#false} is VALID [2022-04-08 12:36:51,343 INFO L290 TraceCheckUtils]: 74: Hoare triple {20513#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {20230#false} is VALID [2022-04-08 12:36:51,344 INFO L290 TraceCheckUtils]: 73: Hoare triple {20517#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20513#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:36:51,344 INFO L290 TraceCheckUtils]: 72: Hoare triple {20517#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20517#(< ~counter~0 100)} is VALID [2022-04-08 12:36:51,344 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20229#true} {20517#(< ~counter~0 100)} #96#return; {20517#(< ~counter~0 100)} is VALID [2022-04-08 12:36:51,344 INFO L290 TraceCheckUtils]: 70: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:36:51,344 INFO L290 TraceCheckUtils]: 69: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:36:51,345 INFO L290 TraceCheckUtils]: 68: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:36:51,345 INFO L272 TraceCheckUtils]: 67: Hoare triple {20517#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 12:36:51,345 INFO L290 TraceCheckUtils]: 66: Hoare triple {20517#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {20517#(< ~counter~0 100)} is VALID [2022-04-08 12:36:51,346 INFO L290 TraceCheckUtils]: 65: Hoare triple {20542#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20517#(< ~counter~0 100)} is VALID [2022-04-08 12:36:51,346 INFO L290 TraceCheckUtils]: 64: Hoare triple {20542#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20542#(< ~counter~0 99)} is VALID [2022-04-08 12:36:51,346 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20229#true} {20542#(< ~counter~0 99)} #96#return; {20542#(< ~counter~0 99)} is VALID [2022-04-08 12:36:51,346 INFO L290 TraceCheckUtils]: 62: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:36:51,346 INFO L290 TraceCheckUtils]: 61: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:36:51,346 INFO L290 TraceCheckUtils]: 60: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:36:51,346 INFO L272 TraceCheckUtils]: 59: Hoare triple {20542#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 12:36:51,347 INFO L290 TraceCheckUtils]: 58: Hoare triple {20542#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {20542#(< ~counter~0 99)} is VALID [2022-04-08 12:36:51,347 INFO L290 TraceCheckUtils]: 57: Hoare triple {20567#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20542#(< ~counter~0 99)} is VALID [2022-04-08 12:36:51,347 INFO L290 TraceCheckUtils]: 56: Hoare triple {20567#(< ~counter~0 98)} assume !!(0 != ~r~0); {20567#(< ~counter~0 98)} is VALID [2022-04-08 12:36:51,348 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20229#true} {20567#(< ~counter~0 98)} #94#return; {20567#(< ~counter~0 98)} is VALID [2022-04-08 12:36:51,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:36:51,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:36:51,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:36:51,348 INFO L272 TraceCheckUtils]: 51: Hoare triple {20567#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 12:36:51,348 INFO L290 TraceCheckUtils]: 50: Hoare triple {20567#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {20567#(< ~counter~0 98)} is VALID [2022-04-08 12:36:51,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {20592#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20567#(< ~counter~0 98)} is VALID [2022-04-08 12:36:51,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {20592#(< ~counter~0 97)} assume !(~r~0 < 0); {20592#(< ~counter~0 97)} is VALID [2022-04-08 12:36:51,350 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20229#true} {20592#(< ~counter~0 97)} #98#return; {20592#(< ~counter~0 97)} is VALID [2022-04-08 12:36:51,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:36:51,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:36:51,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:36:51,350 INFO L272 TraceCheckUtils]: 43: Hoare triple {20592#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 12:36:51,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {20592#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {20592#(< ~counter~0 97)} is VALID [2022-04-08 12:36:51,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {20617#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20592#(< ~counter~0 97)} is VALID [2022-04-08 12:36:51,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {20617#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20617#(< ~counter~0 96)} is VALID [2022-04-08 12:36:51,351 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20229#true} {20617#(< ~counter~0 96)} #98#return; {20617#(< ~counter~0 96)} is VALID [2022-04-08 12:36:51,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:36:51,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:36:51,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:36:51,352 INFO L272 TraceCheckUtils]: 35: Hoare triple {20617#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 12:36:51,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {20617#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {20617#(< ~counter~0 96)} is VALID [2022-04-08 12:36:51,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {20642#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20617#(< ~counter~0 96)} is VALID [2022-04-08 12:36:51,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {20642#(< ~counter~0 95)} assume !(~r~0 > 0); {20642#(< ~counter~0 95)} is VALID [2022-04-08 12:36:51,353 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20229#true} {20642#(< ~counter~0 95)} #96#return; {20642#(< ~counter~0 95)} is VALID [2022-04-08 12:36:51,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:36:51,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:36:51,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:36:51,353 INFO L272 TraceCheckUtils]: 27: Hoare triple {20642#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 12:36:51,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {20642#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {20642#(< ~counter~0 95)} is VALID [2022-04-08 12:36:51,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {20667#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20642#(< ~counter~0 95)} is VALID [2022-04-08 12:36:51,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {20667#(< ~counter~0 94)} assume !!(0 != ~r~0); {20667#(< ~counter~0 94)} is VALID [2022-04-08 12:36:51,355 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20229#true} {20667#(< ~counter~0 94)} #94#return; {20667#(< ~counter~0 94)} is VALID [2022-04-08 12:36:51,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:36:51,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:36:51,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:36:51,355 INFO L272 TraceCheckUtils]: 19: Hoare triple {20667#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 12:36:51,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {20667#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {20667#(< ~counter~0 94)} is VALID [2022-04-08 12:36:51,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {20692#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20667#(< ~counter~0 94)} is VALID [2022-04-08 12:36:51,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {20692#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20692#(< ~counter~0 93)} is VALID [2022-04-08 12:36:51,356 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20229#true} {20692#(< ~counter~0 93)} #92#return; {20692#(< ~counter~0 93)} is VALID [2022-04-08 12:36:51,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:36:51,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:36:51,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:36:51,356 INFO L272 TraceCheckUtils]: 11: Hoare triple {20692#(< ~counter~0 93)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {20229#true} is VALID [2022-04-08 12:36:51,357 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20229#true} {20692#(< ~counter~0 93)} #90#return; {20692#(< ~counter~0 93)} is VALID [2022-04-08 12:36:51,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:36:51,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:36:51,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:36:51,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {20692#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 12:36:51,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {20692#(< ~counter~0 93)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {20692#(< ~counter~0 93)} is VALID [2022-04-08 12:36:51,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {20692#(< ~counter~0 93)} call #t~ret9 := main(); {20692#(< ~counter~0 93)} is VALID [2022-04-08 12:36:51,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20692#(< ~counter~0 93)} {20229#true} #102#return; {20692#(< ~counter~0 93)} is VALID [2022-04-08 12:36:51,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {20692#(< ~counter~0 93)} assume true; {20692#(< ~counter~0 93)} is VALID [2022-04-08 12:36:51,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {20229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20692#(< ~counter~0 93)} is VALID [2022-04-08 12:36:51,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {20229#true} call ULTIMATE.init(); {20229#true} is VALID [2022-04-08 12:36:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 12:36:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:51,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73477283] [2022-04-08 12:36:51,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:51,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341266132] [2022-04-08 12:36:51,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341266132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:51,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:51,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 12:36:51,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:51,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [388138613] [2022-04-08 12:36:51,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [388138613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:51,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:51,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 12:36:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658151179] [2022-04-08 12:36:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:51,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-08 12:36:51,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:51,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:51,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:51,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 12:36:51,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:51,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 12:36:51,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 12:36:51,413 INFO L87 Difference]: Start difference. First operand 160 states and 202 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:52,006 INFO L93 Difference]: Finished difference Result 215 states and 280 transitions. [2022-04-08 12:36:52,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 12:36:52,006 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-08 12:36:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-08 12:36:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-08 12:36:52,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-08 12:36:52,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:52,173 INFO L225 Difference]: With dead ends: 215 [2022-04-08 12:36:52,173 INFO L226 Difference]: Without dead ends: 166 [2022-04-08 12:36:52,174 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=266, Invalid=384, Unknown=0, NotChecked=0, Total=650 [2022-04-08 12:36:52,174 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 67 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:52,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 215 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:36:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-08 12:36:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-04-08 12:36:52,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:52,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 12:36:52,398 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 12:36:52,399 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 12:36:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:52,402 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-08 12:36:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 12:36:52,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:52,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:52,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-08 12:36:52,404 INFO L87 Difference]: Start difference. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-08 12:36:52,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:52,407 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-08 12:36:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 12:36:52,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:52,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:52,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:52,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 12:36:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2022-04-08 12:36:52,412 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 83 [2022-04-08 12:36:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:52,412 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2022-04-08 12:36:52,412 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 12:36:52,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 208 transitions. [2022-04-08 12:36:54,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 207 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 12:36:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 12:36:54,834 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:54,834 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:54,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-08 12:36:55,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:55,035 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-08 12:36:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:55,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [419230650] [2022-04-08 12:36:55,035 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-08 12:36:55,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:55,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833662315] [2022-04-08 12:36:55,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:55,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:55,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:55,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147255553] [2022-04-08 12:36:55,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:55,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:55,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:55,047 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:55,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 12:36:55,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:55,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:55,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 12:36:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:55,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:55,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {21852#true} call ULTIMATE.init(); {21852#true} is VALID [2022-04-08 12:36:55,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {21852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21860#(<= ~counter~0 0)} {21852#true} #102#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {21860#(<= ~counter~0 0)} call #t~ret9 := main(); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {21860#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {21860#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {21860#(<= ~counter~0 0)} ~cond := #in~cond; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {21860#(<= ~counter~0 0)} assume !(0 == ~cond); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21860#(<= ~counter~0 0)} {21860#(<= ~counter~0 0)} #90#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,539 INFO L272 TraceCheckUtils]: 11: Hoare triple {21860#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {21860#(<= ~counter~0 0)} ~cond := #in~cond; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {21860#(<= ~counter~0 0)} assume !(0 == ~cond); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,540 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21860#(<= ~counter~0 0)} {21860#(<= ~counter~0 0)} #92#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {21860#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {21860#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {21909#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,542 INFO L272 TraceCheckUtils]: 19: Hoare triple {21909#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {21909#(<= ~counter~0 1)} ~cond := #in~cond; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {21909#(<= ~counter~0 1)} assume !(0 == ~cond); {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {21909#(<= ~counter~0 1)} assume true; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,543 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21909#(<= ~counter~0 1)} {21909#(<= ~counter~0 1)} #94#return; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {21909#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {21909#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {21934#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,545 INFO L272 TraceCheckUtils]: 27: Hoare triple {21934#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {21934#(<= ~counter~0 2)} ~cond := #in~cond; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {21934#(<= ~counter~0 2)} assume !(0 == ~cond); {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {21934#(<= ~counter~0 2)} assume true; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,546 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21934#(<= ~counter~0 2)} {21934#(<= ~counter~0 2)} #96#return; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {21934#(<= ~counter~0 2)} assume !(~r~0 > 0); {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {21934#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:55,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {21959#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:55,548 INFO L272 TraceCheckUtils]: 35: Hoare triple {21959#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21959#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:55,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {21959#(<= ~counter~0 3)} ~cond := #in~cond; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:55,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {21959#(<= ~counter~0 3)} assume !(0 == ~cond); {21959#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:55,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {21959#(<= ~counter~0 3)} assume true; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:55,549 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21959#(<= ~counter~0 3)} {21959#(<= ~counter~0 3)} #98#return; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:55,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {21959#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:55,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {21959#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:55,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {21984#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:55,550 INFO L272 TraceCheckUtils]: 43: Hoare triple {21984#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:55,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {21984#(<= ~counter~0 4)} ~cond := #in~cond; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:55,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {21984#(<= ~counter~0 4)} assume !(0 == ~cond); {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:55,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {21984#(<= ~counter~0 4)} assume true; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:55,552 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21984#(<= ~counter~0 4)} {21984#(<= ~counter~0 4)} #98#return; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:55,552 INFO L290 TraceCheckUtils]: 48: Hoare triple {21984#(<= ~counter~0 4)} assume !(~r~0 < 0); {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:55,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {21984#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:55,553 INFO L290 TraceCheckUtils]: 50: Hoare triple {22009#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:55,553 INFO L272 TraceCheckUtils]: 51: Hoare triple {22009#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:55,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {22009#(<= ~counter~0 5)} ~cond := #in~cond; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:55,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {22009#(<= ~counter~0 5)} assume !(0 == ~cond); {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:55,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {22009#(<= ~counter~0 5)} assume true; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:55,554 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22009#(<= ~counter~0 5)} {22009#(<= ~counter~0 5)} #94#return; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:55,555 INFO L290 TraceCheckUtils]: 56: Hoare triple {22009#(<= ~counter~0 5)} assume !!(0 != ~r~0); {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:55,555 INFO L290 TraceCheckUtils]: 57: Hoare triple {22009#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:55,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {22034#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:55,556 INFO L272 TraceCheckUtils]: 59: Hoare triple {22034#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22034#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:55,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {22034#(<= ~counter~0 6)} ~cond := #in~cond; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:55,557 INFO L290 TraceCheckUtils]: 61: Hoare triple {22034#(<= ~counter~0 6)} assume !(0 == ~cond); {22034#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:55,557 INFO L290 TraceCheckUtils]: 62: Hoare triple {22034#(<= ~counter~0 6)} assume true; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:55,557 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22034#(<= ~counter~0 6)} {22034#(<= ~counter~0 6)} #96#return; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:55,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {22034#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:55,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {22034#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:55,558 INFO L290 TraceCheckUtils]: 66: Hoare triple {22059#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:55,559 INFO L272 TraceCheckUtils]: 67: Hoare triple {22059#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:55,559 INFO L290 TraceCheckUtils]: 68: Hoare triple {22059#(<= ~counter~0 7)} ~cond := #in~cond; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:55,559 INFO L290 TraceCheckUtils]: 69: Hoare triple {22059#(<= ~counter~0 7)} assume !(0 == ~cond); {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:55,560 INFO L290 TraceCheckUtils]: 70: Hoare triple {22059#(<= ~counter~0 7)} assume true; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:55,560 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22059#(<= ~counter~0 7)} {22059#(<= ~counter~0 7)} #96#return; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:55,560 INFO L290 TraceCheckUtils]: 72: Hoare triple {22059#(<= ~counter~0 7)} assume !(~r~0 > 0); {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:36:55,561 INFO L290 TraceCheckUtils]: 73: Hoare triple {22059#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:36:55,561 INFO L290 TraceCheckUtils]: 74: Hoare triple {22084#(<= ~counter~0 8)} assume !!(#t~post8 < 100);havoc #t~post8; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:36:55,562 INFO L272 TraceCheckUtils]: 75: Hoare triple {22084#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:36:55,562 INFO L290 TraceCheckUtils]: 76: Hoare triple {22084#(<= ~counter~0 8)} ~cond := #in~cond; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:36:55,562 INFO L290 TraceCheckUtils]: 77: Hoare triple {22084#(<= ~counter~0 8)} assume !(0 == ~cond); {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:36:55,562 INFO L290 TraceCheckUtils]: 78: Hoare triple {22084#(<= ~counter~0 8)} assume true; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:36:55,563 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22084#(<= ~counter~0 8)} {22084#(<= ~counter~0 8)} #98#return; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:36:55,563 INFO L290 TraceCheckUtils]: 80: Hoare triple {22084#(<= ~counter~0 8)} assume !(~r~0 < 0); {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:36:55,564 INFO L290 TraceCheckUtils]: 81: Hoare triple {22084#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22109#(<= |main_#t~post6| 8)} is VALID [2022-04-08 12:36:55,564 INFO L290 TraceCheckUtils]: 82: Hoare triple {22109#(<= |main_#t~post6| 8)} assume !(#t~post6 < 100);havoc #t~post6; {21853#false} is VALID [2022-04-08 12:36:55,564 INFO L272 TraceCheckUtils]: 83: Hoare triple {21853#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21853#false} is VALID [2022-04-08 12:36:55,564 INFO L290 TraceCheckUtils]: 84: Hoare triple {21853#false} ~cond := #in~cond; {21853#false} is VALID [2022-04-08 12:36:55,564 INFO L290 TraceCheckUtils]: 85: Hoare triple {21853#false} assume 0 == ~cond; {21853#false} is VALID [2022-04-08 12:36:55,564 INFO L290 TraceCheckUtils]: 86: Hoare triple {21853#false} assume !false; {21853#false} is VALID [2022-04-08 12:36:55,564 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:36:55,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:56,020 INFO L290 TraceCheckUtils]: 86: Hoare triple {21853#false} assume !false; {21853#false} is VALID [2022-04-08 12:36:56,020 INFO L290 TraceCheckUtils]: 85: Hoare triple {21853#false} assume 0 == ~cond; {21853#false} is VALID [2022-04-08 12:36:56,020 INFO L290 TraceCheckUtils]: 84: Hoare triple {21853#false} ~cond := #in~cond; {21853#false} is VALID [2022-04-08 12:36:56,020 INFO L272 TraceCheckUtils]: 83: Hoare triple {21853#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21853#false} is VALID [2022-04-08 12:36:56,021 INFO L290 TraceCheckUtils]: 82: Hoare triple {22137#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {21853#false} is VALID [2022-04-08 12:36:56,021 INFO L290 TraceCheckUtils]: 81: Hoare triple {22141#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22137#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:36:56,021 INFO L290 TraceCheckUtils]: 80: Hoare triple {22141#(< ~counter~0 100)} assume !(~r~0 < 0); {22141#(< ~counter~0 100)} is VALID [2022-04-08 12:36:56,022 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {21852#true} {22141#(< ~counter~0 100)} #98#return; {22141#(< ~counter~0 100)} is VALID [2022-04-08 12:36:56,022 INFO L290 TraceCheckUtils]: 78: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:36:56,022 INFO L290 TraceCheckUtils]: 77: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:36:56,022 INFO L290 TraceCheckUtils]: 76: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:36:56,022 INFO L272 TraceCheckUtils]: 75: Hoare triple {22141#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 12:36:56,022 INFO L290 TraceCheckUtils]: 74: Hoare triple {22141#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {22141#(< ~counter~0 100)} is VALID [2022-04-08 12:36:56,023 INFO L290 TraceCheckUtils]: 73: Hoare triple {22166#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22141#(< ~counter~0 100)} is VALID [2022-04-08 12:36:56,023 INFO L290 TraceCheckUtils]: 72: Hoare triple {22166#(< ~counter~0 99)} assume !(~r~0 > 0); {22166#(< ~counter~0 99)} is VALID [2022-04-08 12:36:56,024 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21852#true} {22166#(< ~counter~0 99)} #96#return; {22166#(< ~counter~0 99)} is VALID [2022-04-08 12:36:56,024 INFO L290 TraceCheckUtils]: 70: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:36:56,024 INFO L290 TraceCheckUtils]: 69: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:36:56,024 INFO L290 TraceCheckUtils]: 68: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:36:56,024 INFO L272 TraceCheckUtils]: 67: Hoare triple {22166#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 12:36:56,024 INFO L290 TraceCheckUtils]: 66: Hoare triple {22166#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {22166#(< ~counter~0 99)} is VALID [2022-04-08 12:36:56,025 INFO L290 TraceCheckUtils]: 65: Hoare triple {22191#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22166#(< ~counter~0 99)} is VALID [2022-04-08 12:36:56,025 INFO L290 TraceCheckUtils]: 64: Hoare triple {22191#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22191#(< ~counter~0 98)} is VALID [2022-04-08 12:36:56,025 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21852#true} {22191#(< ~counter~0 98)} #96#return; {22191#(< ~counter~0 98)} is VALID [2022-04-08 12:36:56,026 INFO L290 TraceCheckUtils]: 62: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:36:56,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:36:56,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:36:56,026 INFO L272 TraceCheckUtils]: 59: Hoare triple {22191#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 12:36:56,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {22191#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {22191#(< ~counter~0 98)} is VALID [2022-04-08 12:36:56,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {22216#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22191#(< ~counter~0 98)} is VALID [2022-04-08 12:36:56,027 INFO L290 TraceCheckUtils]: 56: Hoare triple {22216#(< ~counter~0 97)} assume !!(0 != ~r~0); {22216#(< ~counter~0 97)} is VALID [2022-04-08 12:36:56,027 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21852#true} {22216#(< ~counter~0 97)} #94#return; {22216#(< ~counter~0 97)} is VALID [2022-04-08 12:36:56,027 INFO L290 TraceCheckUtils]: 54: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:36:56,027 INFO L290 TraceCheckUtils]: 53: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:36:56,027 INFO L290 TraceCheckUtils]: 52: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:36:56,027 INFO L272 TraceCheckUtils]: 51: Hoare triple {22216#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 12:36:56,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {22216#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {22216#(< ~counter~0 97)} is VALID [2022-04-08 12:36:56,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {22241#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22216#(< ~counter~0 97)} is VALID [2022-04-08 12:36:56,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {22241#(< ~counter~0 96)} assume !(~r~0 < 0); {22241#(< ~counter~0 96)} is VALID [2022-04-08 12:36:56,029 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21852#true} {22241#(< ~counter~0 96)} #98#return; {22241#(< ~counter~0 96)} is VALID [2022-04-08 12:36:56,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:36:56,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:36:56,029 INFO L290 TraceCheckUtils]: 44: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:36:56,029 INFO L272 TraceCheckUtils]: 43: Hoare triple {22241#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 12:36:56,029 INFO L290 TraceCheckUtils]: 42: Hoare triple {22241#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {22241#(< ~counter~0 96)} is VALID [2022-04-08 12:36:56,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {22266#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22241#(< ~counter~0 96)} is VALID [2022-04-08 12:36:56,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {22266#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22266#(< ~counter~0 95)} is VALID [2022-04-08 12:36:56,031 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21852#true} {22266#(< ~counter~0 95)} #98#return; {22266#(< ~counter~0 95)} is VALID [2022-04-08 12:36:56,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:36:56,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:36:56,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:36:56,031 INFO L272 TraceCheckUtils]: 35: Hoare triple {22266#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 12:36:56,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {22266#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {22266#(< ~counter~0 95)} is VALID [2022-04-08 12:36:56,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {22291#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22266#(< ~counter~0 95)} is VALID [2022-04-08 12:36:56,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {22291#(< ~counter~0 94)} assume !(~r~0 > 0); {22291#(< ~counter~0 94)} is VALID [2022-04-08 12:36:56,032 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21852#true} {22291#(< ~counter~0 94)} #96#return; {22291#(< ~counter~0 94)} is VALID [2022-04-08 12:36:56,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:36:56,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:36:56,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:36:56,033 INFO L272 TraceCheckUtils]: 27: Hoare triple {22291#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 12:36:56,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {22291#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {22291#(< ~counter~0 94)} is VALID [2022-04-08 12:36:56,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {22316#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22291#(< ~counter~0 94)} is VALID [2022-04-08 12:36:56,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {22316#(< ~counter~0 93)} assume !!(0 != ~r~0); {22316#(< ~counter~0 93)} is VALID [2022-04-08 12:36:56,034 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21852#true} {22316#(< ~counter~0 93)} #94#return; {22316#(< ~counter~0 93)} is VALID [2022-04-08 12:36:56,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:36:56,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:36:56,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:36:56,034 INFO L272 TraceCheckUtils]: 19: Hoare triple {22316#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 12:36:56,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {22316#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {22316#(< ~counter~0 93)} is VALID [2022-04-08 12:36:56,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {22341#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22316#(< ~counter~0 93)} is VALID [2022-04-08 12:36:56,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {22341#(< ~counter~0 92)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22341#(< ~counter~0 92)} is VALID [2022-04-08 12:36:56,036 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21852#true} {22341#(< ~counter~0 92)} #92#return; {22341#(< ~counter~0 92)} is VALID [2022-04-08 12:36:56,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:36:56,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:36:56,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:36:56,036 INFO L272 TraceCheckUtils]: 11: Hoare triple {22341#(< ~counter~0 92)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {21852#true} is VALID [2022-04-08 12:36:56,039 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21852#true} {22341#(< ~counter~0 92)} #90#return; {22341#(< ~counter~0 92)} is VALID [2022-04-08 12:36:56,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:36:56,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:36:56,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:36:56,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {22341#(< ~counter~0 92)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 12:36:56,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {22341#(< ~counter~0 92)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {22341#(< ~counter~0 92)} is VALID [2022-04-08 12:36:56,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {22341#(< ~counter~0 92)} call #t~ret9 := main(); {22341#(< ~counter~0 92)} is VALID [2022-04-08 12:36:56,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22341#(< ~counter~0 92)} {21852#true} #102#return; {22341#(< ~counter~0 92)} is VALID [2022-04-08 12:36:56,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {22341#(< ~counter~0 92)} assume true; {22341#(< ~counter~0 92)} is VALID [2022-04-08 12:36:56,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {21852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22341#(< ~counter~0 92)} is VALID [2022-04-08 12:36:56,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {21852#true} call ULTIMATE.init(); {21852#true} is VALID [2022-04-08 12:36:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 12:36:56,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:56,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833662315] [2022-04-08 12:36:56,042 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:56,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147255553] [2022-04-08 12:36:56,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147255553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:56,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:56,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 12:36:56,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:56,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [419230650] [2022-04-08 12:36:56,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [419230650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:56,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:56,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 12:36:56,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242772790] [2022-04-08 12:36:56,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-08 12:36:56,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:56,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:36:56,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:56,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 12:36:56,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:56,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 12:36:56,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 12:36:56,122 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:36:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:56,890 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2022-04-08 12:36:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 12:36:56,890 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-08 12:36:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:36:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-08 12:36:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:36:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-08 12:36:56,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-08 12:36:57,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:57,052 INFO L225 Difference]: With dead ends: 188 [2022-04-08 12:36:57,052 INFO L226 Difference]: Without dead ends: 183 [2022-04-08 12:36:57,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=414, Unknown=0, NotChecked=0, Total=702 [2022-04-08 12:36:57,053 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:57,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 256 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:36:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-08 12:36:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2022-04-08 12:36:57,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:57,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 12:36:57,273 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 12:36:57,273 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 12:36:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:57,276 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-08 12:36:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-08 12:36:57,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:57,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:57,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-08 12:36:57,278 INFO L87 Difference]: Start difference. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-08 12:36:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:57,281 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-08 12:36:57,281 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-08 12:36:57,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:57,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:57,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:57,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 12:36:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-04-08 12:36:57,285 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 87 [2022-04-08 12:36:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:57,286 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-04-08 12:36:57,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:36:57,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 223 transitions. [2022-04-08 12:36:59,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 222 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-08 12:36:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 12:36:59,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:59,724 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:36:59,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-08 12:36:59,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:59,924 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-08 12:36:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:59,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2112979114] [2022-04-08 12:36:59,925 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-08 12:36:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:59,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835326633] [2022-04-08 12:36:59,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:59,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:59,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79803738] [2022-04-08 12:36:59,942 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:36:59,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:59,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:59,943 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:36:59,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 12:36:59,995 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:36:59,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:59,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 12:37:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:00,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:00,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {23501#true} call ULTIMATE.init(); {23501#true} is VALID [2022-04-08 12:37:00,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {23501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23501#true} is VALID [2022-04-08 12:37:00,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23501#true} {23501#true} #102#return; {23501#true} is VALID [2022-04-08 12:37:00,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {23501#true} call #t~ret9 := main(); {23501#true} is VALID [2022-04-08 12:37:00,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {23501#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {23501#true} is VALID [2022-04-08 12:37:00,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {23501#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,226 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23501#true} {23501#true} #90#return; {23501#true} is VALID [2022-04-08 12:37:00,227 INFO L272 TraceCheckUtils]: 11: Hoare triple {23501#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,227 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23501#true} {23501#true} #92#return; {23501#true} is VALID [2022-04-08 12:37:00,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {23501#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,228 INFO L272 TraceCheckUtils]: 19: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,228 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,229 INFO L272 TraceCheckUtils]: 27: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,230 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 > 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,231 INFO L272 TraceCheckUtils]: 35: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,231 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,232 INFO L272 TraceCheckUtils]: 43: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,232 INFO L290 TraceCheckUtils]: 44: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,233 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 < 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,233 INFO L290 TraceCheckUtils]: 50: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,233 INFO L272 TraceCheckUtils]: 51: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,235 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,236 INFO L272 TraceCheckUtils]: 59: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,237 INFO L290 TraceCheckUtils]: 60: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,237 INFO L290 TraceCheckUtils]: 62: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,237 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,238 INFO L290 TraceCheckUtils]: 64: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,238 INFO L290 TraceCheckUtils]: 65: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,239 INFO L290 TraceCheckUtils]: 66: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,239 INFO L272 TraceCheckUtils]: 67: Hoare triple {23699#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,239 INFO L290 TraceCheckUtils]: 68: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,240 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #96#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,241 INFO L290 TraceCheckUtils]: 74: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,241 INFO L272 TraceCheckUtils]: 75: Hoare triple {23699#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,241 INFO L290 TraceCheckUtils]: 76: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,241 INFO L290 TraceCheckUtils]: 77: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,241 INFO L290 TraceCheckUtils]: 78: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,242 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #98#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,243 INFO L290 TraceCheckUtils]: 80: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23502#false} is VALID [2022-04-08 12:37:00,243 INFO L290 TraceCheckUtils]: 81: Hoare triple {23502#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23502#false} is VALID [2022-04-08 12:37:00,243 INFO L290 TraceCheckUtils]: 82: Hoare triple {23502#false} assume !(#t~post8 < 100);havoc #t~post8; {23502#false} is VALID [2022-04-08 12:37:00,243 INFO L290 TraceCheckUtils]: 83: Hoare triple {23502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23502#false} is VALID [2022-04-08 12:37:00,243 INFO L290 TraceCheckUtils]: 84: Hoare triple {23502#false} assume !(#t~post6 < 100);havoc #t~post6; {23502#false} is VALID [2022-04-08 12:37:00,243 INFO L272 TraceCheckUtils]: 85: Hoare triple {23502#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23502#false} is VALID [2022-04-08 12:37:00,243 INFO L290 TraceCheckUtils]: 86: Hoare triple {23502#false} ~cond := #in~cond; {23502#false} is VALID [2022-04-08 12:37:00,243 INFO L290 TraceCheckUtils]: 87: Hoare triple {23502#false} assume 0 == ~cond; {23502#false} is VALID [2022-04-08 12:37:00,243 INFO L290 TraceCheckUtils]: 88: Hoare triple {23502#false} assume !false; {23502#false} is VALID [2022-04-08 12:37:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-08 12:37:00,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:00,487 INFO L290 TraceCheckUtils]: 88: Hoare triple {23502#false} assume !false; {23502#false} is VALID [2022-04-08 12:37:00,487 INFO L290 TraceCheckUtils]: 87: Hoare triple {23502#false} assume 0 == ~cond; {23502#false} is VALID [2022-04-08 12:37:00,487 INFO L290 TraceCheckUtils]: 86: Hoare triple {23502#false} ~cond := #in~cond; {23502#false} is VALID [2022-04-08 12:37:00,487 INFO L272 TraceCheckUtils]: 85: Hoare triple {23502#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23502#false} is VALID [2022-04-08 12:37:00,487 INFO L290 TraceCheckUtils]: 84: Hoare triple {23502#false} assume !(#t~post6 < 100);havoc #t~post6; {23502#false} is VALID [2022-04-08 12:37:00,487 INFO L290 TraceCheckUtils]: 83: Hoare triple {23502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23502#false} is VALID [2022-04-08 12:37:00,487 INFO L290 TraceCheckUtils]: 82: Hoare triple {23502#false} assume !(#t~post8 < 100);havoc #t~post8; {23502#false} is VALID [2022-04-08 12:37:00,487 INFO L290 TraceCheckUtils]: 81: Hoare triple {23502#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23502#false} is VALID [2022-04-08 12:37:00,488 INFO L290 TraceCheckUtils]: 80: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23502#false} is VALID [2022-04-08 12:37:00,489 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #98#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,489 INFO L290 TraceCheckUtils]: 78: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,489 INFO L290 TraceCheckUtils]: 77: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,489 INFO L290 TraceCheckUtils]: 76: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,489 INFO L272 TraceCheckUtils]: 75: Hoare triple {23699#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,489 INFO L290 TraceCheckUtils]: 74: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,490 INFO L290 TraceCheckUtils]: 73: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,490 INFO L290 TraceCheckUtils]: 72: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,490 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #96#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,490 INFO L290 TraceCheckUtils]: 70: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,490 INFO L290 TraceCheckUtils]: 69: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,490 INFO L290 TraceCheckUtils]: 68: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,490 INFO L272 TraceCheckUtils]: 67: Hoare triple {23699#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,491 INFO L290 TraceCheckUtils]: 66: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,491 INFO L290 TraceCheckUtils]: 65: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,492 INFO L290 TraceCheckUtils]: 64: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 12:37:00,493 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,493 INFO L272 TraceCheckUtils]: 59: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,493 INFO L290 TraceCheckUtils]: 58: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,494 INFO L290 TraceCheckUtils]: 57: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,494 INFO L290 TraceCheckUtils]: 56: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,494 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,494 INFO L290 TraceCheckUtils]: 53: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,495 INFO L272 TraceCheckUtils]: 51: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,495 INFO L290 TraceCheckUtils]: 50: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,495 INFO L290 TraceCheckUtils]: 49: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 < 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,496 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,496 INFO L272 TraceCheckUtils]: 43: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,496 INFO L290 TraceCheckUtils]: 42: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,497 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,497 INFO L272 TraceCheckUtils]: 35: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 > 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,499 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,499 INFO L272 TraceCheckUtils]: 27: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,500 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,500 INFO L272 TraceCheckUtils]: 19: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {23501#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:00,501 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23501#true} {23501#true} #92#return; {23501#true} is VALID [2022-04-08 12:37:00,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L272 TraceCheckUtils]: 11: Hoare triple {23501#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23501#true} {23501#true} #90#return; {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {23501#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {23501#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {23501#true} call #t~ret9 := main(); {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23501#true} {23501#true} #102#return; {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {23501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {23501#true} call ULTIMATE.init(); {23501#true} is VALID [2022-04-08 12:37:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-08 12:37:00,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:00,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835326633] [2022-04-08 12:37:00,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:00,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79803738] [2022-04-08 12:37:00,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79803738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:00,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:00,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-08 12:37:00,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:00,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2112979114] [2022-04-08 12:37:00,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2112979114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:00,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:00,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:37:00,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885388517] [2022-04-08 12:37:00,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:00,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-08 12:37:00,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:00,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:37:00,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:00,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:37:00,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:00,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:37:00,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:37:00,540 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:37:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:01,140 INFO L93 Difference]: Finished difference Result 407 states and 543 transitions. [2022-04-08 12:37:01,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:37:01,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-08 12:37:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:37:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-08 12:37:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:37:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-08 12:37:01,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-08 12:37:01,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:01,255 INFO L225 Difference]: With dead ends: 407 [2022-04-08 12:37:01,255 INFO L226 Difference]: Without dead ends: 301 [2022-04-08 12:37:01,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:37:01,256 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 15 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:37:01,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 138 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:37:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-08 12:37:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2022-04-08 12:37:01,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:01,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 12:37:01,753 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 12:37:01,754 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 12:37:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:01,762 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-08 12:37:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-08 12:37:01,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:01,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:01,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-08 12:37:01,763 INFO L87 Difference]: Start difference. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-08 12:37:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:01,770 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-08 12:37:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-08 12:37:01,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:01,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:01,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:01,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 12:37:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 395 transitions. [2022-04-08 12:37:01,780 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 395 transitions. Word has length 89 [2022-04-08 12:37:01,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:01,780 INFO L478 AbstractCegarLoop]: Abstraction has 296 states and 395 transitions. [2022-04-08 12:37:01,780 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:37:01,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 395 transitions. [2022-04-08 12:37:02,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2022-04-08 12:37:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 12:37:02,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:02,797 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:37:02,822 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-08 12:37:03,020 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 12:37:03,020 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-08 12:37:03,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:03,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [66599536] [2022-04-08 12:37:03,021 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-08 12:37:03,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:03,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320525860] [2022-04-08 12:37:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:03,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:03,031 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:03,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568820534] [2022-04-08 12:37:03,031 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:37:03,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:03,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:03,032 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:37:03,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 12:37:03,165 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 12:37:03,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:03,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 12:37:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:03,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:03,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {26048#true} call ULTIMATE.init(); {26048#true} is VALID [2022-04-08 12:37:03,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {26048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26056#(<= ~counter~0 0)} {26048#true} #102#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {26056#(<= ~counter~0 0)} call #t~ret9 := main(); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {26056#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,617 INFO L272 TraceCheckUtils]: 6: Hoare triple {26056#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {26056#(<= ~counter~0 0)} ~cond := #in~cond; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {26056#(<= ~counter~0 0)} assume !(0 == ~cond); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,618 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26056#(<= ~counter~0 0)} {26056#(<= ~counter~0 0)} #90#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,619 INFO L272 TraceCheckUtils]: 11: Hoare triple {26056#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {26056#(<= ~counter~0 0)} ~cond := #in~cond; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {26056#(<= ~counter~0 0)} assume !(0 == ~cond); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,620 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26056#(<= ~counter~0 0)} {26056#(<= ~counter~0 0)} #92#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {26056#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:03,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {26056#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:03,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {26105#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:03,622 INFO L272 TraceCheckUtils]: 19: Hoare triple {26105#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:03,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {26105#(<= ~counter~0 1)} ~cond := #in~cond; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:03,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {26105#(<= ~counter~0 1)} assume !(0 == ~cond); {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:03,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {26105#(<= ~counter~0 1)} assume true; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:03,628 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26105#(<= ~counter~0 1)} {26105#(<= ~counter~0 1)} #94#return; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:03,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {26105#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:03,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {26105#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:03,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {26130#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:03,630 INFO L272 TraceCheckUtils]: 27: Hoare triple {26130#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:03,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {26130#(<= ~counter~0 2)} ~cond := #in~cond; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:03,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {26130#(<= ~counter~0 2)} assume !(0 == ~cond); {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:03,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {26130#(<= ~counter~0 2)} assume true; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:03,632 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26130#(<= ~counter~0 2)} {26130#(<= ~counter~0 2)} #96#return; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:03,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {26130#(<= ~counter~0 2)} assume !(~r~0 > 0); {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:03,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {26130#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:03,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {26155#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:03,633 INFO L272 TraceCheckUtils]: 35: Hoare triple {26155#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26155#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:03,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {26155#(<= ~counter~0 3)} ~cond := #in~cond; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:03,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {26155#(<= ~counter~0 3)} assume !(0 == ~cond); {26155#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:03,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {26155#(<= ~counter~0 3)} assume true; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:03,635 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26155#(<= ~counter~0 3)} {26155#(<= ~counter~0 3)} #98#return; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:03,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {26155#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:03,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {26155#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:03,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {26180#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:03,636 INFO L272 TraceCheckUtils]: 43: Hoare triple {26180#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:03,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {26180#(<= ~counter~0 4)} ~cond := #in~cond; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:03,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {26180#(<= ~counter~0 4)} assume !(0 == ~cond); {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:03,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {26180#(<= ~counter~0 4)} assume true; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:03,637 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26180#(<= ~counter~0 4)} {26180#(<= ~counter~0 4)} #98#return; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:03,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {26180#(<= ~counter~0 4)} assume !(~r~0 < 0); {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:03,638 INFO L290 TraceCheckUtils]: 49: Hoare triple {26180#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:03,638 INFO L290 TraceCheckUtils]: 50: Hoare triple {26205#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:03,639 INFO L272 TraceCheckUtils]: 51: Hoare triple {26205#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:03,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {26205#(<= ~counter~0 5)} ~cond := #in~cond; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:03,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {26205#(<= ~counter~0 5)} assume !(0 == ~cond); {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:03,640 INFO L290 TraceCheckUtils]: 54: Hoare triple {26205#(<= ~counter~0 5)} assume true; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:03,640 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26205#(<= ~counter~0 5)} {26205#(<= ~counter~0 5)} #94#return; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:03,640 INFO L290 TraceCheckUtils]: 56: Hoare triple {26205#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:03,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {26205#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:03,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {26230#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:03,642 INFO L272 TraceCheckUtils]: 59: Hoare triple {26230#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26230#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:03,642 INFO L290 TraceCheckUtils]: 60: Hoare triple {26230#(<= ~counter~0 6)} ~cond := #in~cond; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:03,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {26230#(<= ~counter~0 6)} assume !(0 == ~cond); {26230#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:03,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {26230#(<= ~counter~0 6)} assume true; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:03,650 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26230#(<= ~counter~0 6)} {26230#(<= ~counter~0 6)} #96#return; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:03,651 INFO L290 TraceCheckUtils]: 64: Hoare triple {26230#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:03,654 INFO L290 TraceCheckUtils]: 65: Hoare triple {26230#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:03,655 INFO L290 TraceCheckUtils]: 66: Hoare triple {26255#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:03,655 INFO L272 TraceCheckUtils]: 67: Hoare triple {26255#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26255#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:03,655 INFO L290 TraceCheckUtils]: 68: Hoare triple {26255#(<= ~counter~0 7)} ~cond := #in~cond; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:03,656 INFO L290 TraceCheckUtils]: 69: Hoare triple {26255#(<= ~counter~0 7)} assume !(0 == ~cond); {26255#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:03,656 INFO L290 TraceCheckUtils]: 70: Hoare triple {26255#(<= ~counter~0 7)} assume true; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:03,656 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26255#(<= ~counter~0 7)} {26255#(<= ~counter~0 7)} #96#return; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:03,657 INFO L290 TraceCheckUtils]: 72: Hoare triple {26255#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:03,657 INFO L290 TraceCheckUtils]: 73: Hoare triple {26255#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:03,657 INFO L290 TraceCheckUtils]: 74: Hoare triple {26280#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:03,658 INFO L272 TraceCheckUtils]: 75: Hoare triple {26280#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:03,658 INFO L290 TraceCheckUtils]: 76: Hoare triple {26280#(<= ~counter~0 8)} ~cond := #in~cond; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:03,658 INFO L290 TraceCheckUtils]: 77: Hoare triple {26280#(<= ~counter~0 8)} assume !(0 == ~cond); {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:03,659 INFO L290 TraceCheckUtils]: 78: Hoare triple {26280#(<= ~counter~0 8)} assume true; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:03,659 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26280#(<= ~counter~0 8)} {26280#(<= ~counter~0 8)} #96#return; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:03,660 INFO L290 TraceCheckUtils]: 80: Hoare triple {26280#(<= ~counter~0 8)} assume !(~r~0 > 0); {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:03,661 INFO L290 TraceCheckUtils]: 81: Hoare triple {26280#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26305#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:03,661 INFO L290 TraceCheckUtils]: 82: Hoare triple {26305#(<= ~counter~0 9)} assume !(#t~post8 < 100);havoc #t~post8; {26305#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:03,661 INFO L290 TraceCheckUtils]: 83: Hoare triple {26305#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26312#(<= |main_#t~post6| 9)} is VALID [2022-04-08 12:37:03,662 INFO L290 TraceCheckUtils]: 84: Hoare triple {26312#(<= |main_#t~post6| 9)} assume !(#t~post6 < 100);havoc #t~post6; {26049#false} is VALID [2022-04-08 12:37:03,662 INFO L272 TraceCheckUtils]: 85: Hoare triple {26049#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26049#false} is VALID [2022-04-08 12:37:03,662 INFO L290 TraceCheckUtils]: 86: Hoare triple {26049#false} ~cond := #in~cond; {26049#false} is VALID [2022-04-08 12:37:03,662 INFO L290 TraceCheckUtils]: 87: Hoare triple {26049#false} assume 0 == ~cond; {26049#false} is VALID [2022-04-08 12:37:03,662 INFO L290 TraceCheckUtils]: 88: Hoare triple {26049#false} assume !false; {26049#false} is VALID [2022-04-08 12:37:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:37:03,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:04,159 INFO L290 TraceCheckUtils]: 88: Hoare triple {26049#false} assume !false; {26049#false} is VALID [2022-04-08 12:37:04,159 INFO L290 TraceCheckUtils]: 87: Hoare triple {26049#false} assume 0 == ~cond; {26049#false} is VALID [2022-04-08 12:37:04,160 INFO L290 TraceCheckUtils]: 86: Hoare triple {26049#false} ~cond := #in~cond; {26049#false} is VALID [2022-04-08 12:37:04,160 INFO L272 TraceCheckUtils]: 85: Hoare triple {26049#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26049#false} is VALID [2022-04-08 12:37:04,161 INFO L290 TraceCheckUtils]: 84: Hoare triple {26340#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {26049#false} is VALID [2022-04-08 12:37:04,161 INFO L290 TraceCheckUtils]: 83: Hoare triple {26344#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26340#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:37:04,161 INFO L290 TraceCheckUtils]: 82: Hoare triple {26344#(< ~counter~0 100)} assume !(#t~post8 < 100);havoc #t~post8; {26344#(< ~counter~0 100)} is VALID [2022-04-08 12:37:04,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {26351#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26344#(< ~counter~0 100)} is VALID [2022-04-08 12:37:04,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {26351#(< ~counter~0 99)} assume !(~r~0 > 0); {26351#(< ~counter~0 99)} is VALID [2022-04-08 12:37:04,163 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26048#true} {26351#(< ~counter~0 99)} #96#return; {26351#(< ~counter~0 99)} is VALID [2022-04-08 12:37:04,163 INFO L290 TraceCheckUtils]: 78: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:04,163 INFO L290 TraceCheckUtils]: 77: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:04,163 INFO L290 TraceCheckUtils]: 76: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:04,163 INFO L272 TraceCheckUtils]: 75: Hoare triple {26351#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 12:37:04,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {26351#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {26351#(< ~counter~0 99)} is VALID [2022-04-08 12:37:04,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {26376#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26351#(< ~counter~0 99)} is VALID [2022-04-08 12:37:04,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {26376#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26376#(< ~counter~0 98)} is VALID [2022-04-08 12:37:04,165 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26048#true} {26376#(< ~counter~0 98)} #96#return; {26376#(< ~counter~0 98)} is VALID [2022-04-08 12:37:04,165 INFO L290 TraceCheckUtils]: 70: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:04,165 INFO L290 TraceCheckUtils]: 69: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:04,165 INFO L290 TraceCheckUtils]: 68: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:04,165 INFO L272 TraceCheckUtils]: 67: Hoare triple {26376#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 12:37:04,165 INFO L290 TraceCheckUtils]: 66: Hoare triple {26376#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {26376#(< ~counter~0 98)} is VALID [2022-04-08 12:37:04,166 INFO L290 TraceCheckUtils]: 65: Hoare triple {26401#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26376#(< ~counter~0 98)} is VALID [2022-04-08 12:37:04,166 INFO L290 TraceCheckUtils]: 64: Hoare triple {26401#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26401#(< ~counter~0 97)} is VALID [2022-04-08 12:37:04,166 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26048#true} {26401#(< ~counter~0 97)} #96#return; {26401#(< ~counter~0 97)} is VALID [2022-04-08 12:37:04,166 INFO L290 TraceCheckUtils]: 62: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:04,166 INFO L290 TraceCheckUtils]: 61: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:04,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:04,167 INFO L272 TraceCheckUtils]: 59: Hoare triple {26401#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 12:37:04,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {26401#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {26401#(< ~counter~0 97)} is VALID [2022-04-08 12:37:04,167 INFO L290 TraceCheckUtils]: 57: Hoare triple {26426#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26401#(< ~counter~0 97)} is VALID [2022-04-08 12:37:04,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {26426#(< ~counter~0 96)} assume !!(0 != ~r~0); {26426#(< ~counter~0 96)} is VALID [2022-04-08 12:37:04,168 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26048#true} {26426#(< ~counter~0 96)} #94#return; {26426#(< ~counter~0 96)} is VALID [2022-04-08 12:37:04,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:04,168 INFO L290 TraceCheckUtils]: 53: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:04,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:04,168 INFO L272 TraceCheckUtils]: 51: Hoare triple {26426#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 12:37:04,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {26426#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {26426#(< ~counter~0 96)} is VALID [2022-04-08 12:37:04,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {26451#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26426#(< ~counter~0 96)} is VALID [2022-04-08 12:37:04,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {26451#(< ~counter~0 95)} assume !(~r~0 < 0); {26451#(< ~counter~0 95)} is VALID [2022-04-08 12:37:04,170 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26048#true} {26451#(< ~counter~0 95)} #98#return; {26451#(< ~counter~0 95)} is VALID [2022-04-08 12:37:04,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:04,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:04,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:04,170 INFO L272 TraceCheckUtils]: 43: Hoare triple {26451#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 12:37:04,170 INFO L290 TraceCheckUtils]: 42: Hoare triple {26451#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {26451#(< ~counter~0 95)} is VALID [2022-04-08 12:37:04,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {26476#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26451#(< ~counter~0 95)} is VALID [2022-04-08 12:37:04,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {26476#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26476#(< ~counter~0 94)} is VALID [2022-04-08 12:37:04,171 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26048#true} {26476#(< ~counter~0 94)} #98#return; {26476#(< ~counter~0 94)} is VALID [2022-04-08 12:37:04,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:04,172 INFO L290 TraceCheckUtils]: 37: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:04,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:04,172 INFO L272 TraceCheckUtils]: 35: Hoare triple {26476#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 12:37:04,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {26476#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {26476#(< ~counter~0 94)} is VALID [2022-04-08 12:37:04,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {26501#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26476#(< ~counter~0 94)} is VALID [2022-04-08 12:37:04,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {26501#(< ~counter~0 93)} assume !(~r~0 > 0); {26501#(< ~counter~0 93)} is VALID [2022-04-08 12:37:04,173 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26048#true} {26501#(< ~counter~0 93)} #96#return; {26501#(< ~counter~0 93)} is VALID [2022-04-08 12:37:04,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:04,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:04,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:04,173 INFO L272 TraceCheckUtils]: 27: Hoare triple {26501#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 12:37:04,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {26501#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {26501#(< ~counter~0 93)} is VALID [2022-04-08 12:37:04,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {26526#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26501#(< ~counter~0 93)} is VALID [2022-04-08 12:37:04,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {26526#(< ~counter~0 92)} assume !!(0 != ~r~0); {26526#(< ~counter~0 92)} is VALID [2022-04-08 12:37:04,175 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26048#true} {26526#(< ~counter~0 92)} #94#return; {26526#(< ~counter~0 92)} is VALID [2022-04-08 12:37:04,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:04,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:04,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:04,175 INFO L272 TraceCheckUtils]: 19: Hoare triple {26526#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 12:37:04,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {26526#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {26526#(< ~counter~0 92)} is VALID [2022-04-08 12:37:04,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {26551#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26526#(< ~counter~0 92)} is VALID [2022-04-08 12:37:04,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {26551#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26551#(< ~counter~0 91)} is VALID [2022-04-08 12:37:04,177 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26048#true} {26551#(< ~counter~0 91)} #92#return; {26551#(< ~counter~0 91)} is VALID [2022-04-08 12:37:04,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:04,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:04,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:04,177 INFO L272 TraceCheckUtils]: 11: Hoare triple {26551#(< ~counter~0 91)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {26048#true} is VALID [2022-04-08 12:37:04,177 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26048#true} {26551#(< ~counter~0 91)} #90#return; {26551#(< ~counter~0 91)} is VALID [2022-04-08 12:37:04,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:04,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:04,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:04,177 INFO L272 TraceCheckUtils]: 6: Hoare triple {26551#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 12:37:04,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {26551#(< ~counter~0 91)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {26551#(< ~counter~0 91)} is VALID [2022-04-08 12:37:04,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {26551#(< ~counter~0 91)} call #t~ret9 := main(); {26551#(< ~counter~0 91)} is VALID [2022-04-08 12:37:04,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26551#(< ~counter~0 91)} {26048#true} #102#return; {26551#(< ~counter~0 91)} is VALID [2022-04-08 12:37:04,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {26551#(< ~counter~0 91)} assume true; {26551#(< ~counter~0 91)} is VALID [2022-04-08 12:37:04,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {26048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26551#(< ~counter~0 91)} is VALID [2022-04-08 12:37:04,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {26048#true} call ULTIMATE.init(); {26048#true} is VALID [2022-04-08 12:37:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 12:37:04,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:04,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320525860] [2022-04-08 12:37:04,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:04,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568820534] [2022-04-08 12:37:04,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568820534] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:04,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:04,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 12:37:04,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:04,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [66599536] [2022-04-08 12:37:04,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [66599536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:04,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:04,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 12:37:04,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88494275] [2022-04-08 12:37:04,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:04,181 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-08 12:37:04,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:04,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:37:04,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:04,240 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 12:37:04,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:04,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 12:37:04,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:37:04,241 INFO L87 Difference]: Start difference. First operand 296 states and 395 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:37:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:05,430 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-04-08 12:37:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 12:37:05,430 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-08 12:37:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:37:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 12:37:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:37:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 12:37:05,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-08 12:37:05,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:05,584 INFO L225 Difference]: With dead ends: 362 [2022-04-08 12:37:05,584 INFO L226 Difference]: Without dead ends: 357 [2022-04-08 12:37:05,584 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=359, Invalid=511, Unknown=0, NotChecked=0, Total=870 [2022-04-08 12:37:05,585 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 148 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:37:05,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 236 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:37:05,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-08 12:37:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2022-04-08 12:37:06,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:06,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:06,065 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:06,066 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:06,073 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-08 12:37:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-08 12:37:06,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:06,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:06,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-08 12:37:06,075 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-08 12:37:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:06,084 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-08 12:37:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-08 12:37:06,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:06,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:06,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:06,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 460 transitions. [2022-04-08 12:37:06,095 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 460 transitions. Word has length 89 [2022-04-08 12:37:06,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:06,095 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 460 transitions. [2022-04-08 12:37:06,095 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:37:06,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 460 transitions. [2022-04-08 12:37:08,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 459 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 460 transitions. [2022-04-08 12:37:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 12:37:08,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:08,897 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:37:08,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 12:37:09,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 12:37:09,097 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-08 12:37:09,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:09,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2046661590] [2022-04-08 12:37:09,098 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-08 12:37:09,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:09,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396102356] [2022-04-08 12:37:09,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:09,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:09,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070983841] [2022-04-08 12:37:09,110 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:37:09,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:09,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:09,111 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:37:09,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 12:37:09,255 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 12:37:09,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:09,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 12:37:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:09,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:09,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {28739#true} call ULTIMATE.init(); {28739#true} is VALID [2022-04-08 12:37:09,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {28739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28747#(<= ~counter~0 0)} {28739#true} #102#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {28747#(<= ~counter~0 0)} call #t~ret9 := main(); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {28747#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,687 INFO L272 TraceCheckUtils]: 6: Hoare triple {28747#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {28747#(<= ~counter~0 0)} ~cond := #in~cond; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {28747#(<= ~counter~0 0)} assume !(0 == ~cond); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,688 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28747#(<= ~counter~0 0)} {28747#(<= ~counter~0 0)} #90#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,689 INFO L272 TraceCheckUtils]: 11: Hoare triple {28747#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {28747#(<= ~counter~0 0)} ~cond := #in~cond; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {28747#(<= ~counter~0 0)} assume !(0 == ~cond); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,690 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28747#(<= ~counter~0 0)} {28747#(<= ~counter~0 0)} #92#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {28747#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:09,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {28747#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:09,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {28796#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:09,692 INFO L272 TraceCheckUtils]: 19: Hoare triple {28796#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:09,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {28796#(<= ~counter~0 1)} ~cond := #in~cond; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:09,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {28796#(<= ~counter~0 1)} assume !(0 == ~cond); {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:09,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {28796#(<= ~counter~0 1)} assume true; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:09,693 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28796#(<= ~counter~0 1)} {28796#(<= ~counter~0 1)} #94#return; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:09,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {28796#(<= ~counter~0 1)} assume !!(0 != ~r~0); {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:09,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {28796#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:09,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {28821#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:09,695 INFO L272 TraceCheckUtils]: 27: Hoare triple {28821#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:09,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {28821#(<= ~counter~0 2)} ~cond := #in~cond; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:09,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {28821#(<= ~counter~0 2)} assume !(0 == ~cond); {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:09,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {28821#(<= ~counter~0 2)} assume true; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:09,696 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28821#(<= ~counter~0 2)} {28821#(<= ~counter~0 2)} #96#return; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:09,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {28821#(<= ~counter~0 2)} assume !(~r~0 > 0); {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:09,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {28821#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:09,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {28846#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:09,698 INFO L272 TraceCheckUtils]: 35: Hoare triple {28846#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28846#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:09,698 INFO L290 TraceCheckUtils]: 36: Hoare triple {28846#(<= ~counter~0 3)} ~cond := #in~cond; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:09,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {28846#(<= ~counter~0 3)} assume !(0 == ~cond); {28846#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:09,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {28846#(<= ~counter~0 3)} assume true; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:09,699 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28846#(<= ~counter~0 3)} {28846#(<= ~counter~0 3)} #98#return; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:09,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {28846#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:09,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {28846#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:09,701 INFO L290 TraceCheckUtils]: 42: Hoare triple {28871#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:09,701 INFO L272 TraceCheckUtils]: 43: Hoare triple {28871#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:09,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {28871#(<= ~counter~0 4)} ~cond := #in~cond; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:09,702 INFO L290 TraceCheckUtils]: 45: Hoare triple {28871#(<= ~counter~0 4)} assume !(0 == ~cond); {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:09,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {28871#(<= ~counter~0 4)} assume true; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:09,703 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28871#(<= ~counter~0 4)} {28871#(<= ~counter~0 4)} #98#return; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:09,703 INFO L290 TraceCheckUtils]: 48: Hoare triple {28871#(<= ~counter~0 4)} assume !(~r~0 < 0); {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:09,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {28871#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:09,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {28896#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:09,704 INFO L272 TraceCheckUtils]: 51: Hoare triple {28896#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:09,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {28896#(<= ~counter~0 5)} ~cond := #in~cond; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:09,705 INFO L290 TraceCheckUtils]: 53: Hoare triple {28896#(<= ~counter~0 5)} assume !(0 == ~cond); {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:09,705 INFO L290 TraceCheckUtils]: 54: Hoare triple {28896#(<= ~counter~0 5)} assume true; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:09,706 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28896#(<= ~counter~0 5)} {28896#(<= ~counter~0 5)} #94#return; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:09,706 INFO L290 TraceCheckUtils]: 56: Hoare triple {28896#(<= ~counter~0 5)} assume !!(0 != ~r~0); {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:09,706 INFO L290 TraceCheckUtils]: 57: Hoare triple {28896#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:09,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {28921#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:09,707 INFO L272 TraceCheckUtils]: 59: Hoare triple {28921#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28921#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:09,707 INFO L290 TraceCheckUtils]: 60: Hoare triple {28921#(<= ~counter~0 6)} ~cond := #in~cond; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:09,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {28921#(<= ~counter~0 6)} assume !(0 == ~cond); {28921#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:09,708 INFO L290 TraceCheckUtils]: 62: Hoare triple {28921#(<= ~counter~0 6)} assume true; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:09,708 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28921#(<= ~counter~0 6)} {28921#(<= ~counter~0 6)} #96#return; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:09,709 INFO L290 TraceCheckUtils]: 64: Hoare triple {28921#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:09,709 INFO L290 TraceCheckUtils]: 65: Hoare triple {28921#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:09,709 INFO L290 TraceCheckUtils]: 66: Hoare triple {28946#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:09,710 INFO L272 TraceCheckUtils]: 67: Hoare triple {28946#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28946#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:09,710 INFO L290 TraceCheckUtils]: 68: Hoare triple {28946#(<= ~counter~0 7)} ~cond := #in~cond; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:09,710 INFO L290 TraceCheckUtils]: 69: Hoare triple {28946#(<= ~counter~0 7)} assume !(0 == ~cond); {28946#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:09,711 INFO L290 TraceCheckUtils]: 70: Hoare triple {28946#(<= ~counter~0 7)} assume true; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:09,711 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28946#(<= ~counter~0 7)} {28946#(<= ~counter~0 7)} #96#return; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:09,711 INFO L290 TraceCheckUtils]: 72: Hoare triple {28946#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:09,712 INFO L290 TraceCheckUtils]: 73: Hoare triple {28946#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:09,712 INFO L290 TraceCheckUtils]: 74: Hoare triple {28971#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:09,713 INFO L272 TraceCheckUtils]: 75: Hoare triple {28971#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28971#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:09,713 INFO L290 TraceCheckUtils]: 76: Hoare triple {28971#(<= ~counter~0 8)} ~cond := #in~cond; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:09,713 INFO L290 TraceCheckUtils]: 77: Hoare triple {28971#(<= ~counter~0 8)} assume !(0 == ~cond); {28971#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:09,714 INFO L290 TraceCheckUtils]: 78: Hoare triple {28971#(<= ~counter~0 8)} assume true; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:09,714 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28971#(<= ~counter~0 8)} {28971#(<= ~counter~0 8)} #96#return; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:09,714 INFO L290 TraceCheckUtils]: 80: Hoare triple {28971#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:09,715 INFO L290 TraceCheckUtils]: 81: Hoare triple {28971#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28996#(<= |main_#t~post7| 8)} is VALID [2022-04-08 12:37:09,715 INFO L290 TraceCheckUtils]: 82: Hoare triple {28996#(<= |main_#t~post7| 8)} assume !(#t~post7 < 100);havoc #t~post7; {28740#false} is VALID [2022-04-08 12:37:09,715 INFO L290 TraceCheckUtils]: 83: Hoare triple {28740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28740#false} is VALID [2022-04-08 12:37:09,715 INFO L290 TraceCheckUtils]: 84: Hoare triple {28740#false} assume !(#t~post8 < 100);havoc #t~post8; {28740#false} is VALID [2022-04-08 12:37:09,715 INFO L290 TraceCheckUtils]: 85: Hoare triple {28740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28740#false} is VALID [2022-04-08 12:37:09,715 INFO L290 TraceCheckUtils]: 86: Hoare triple {28740#false} assume !(#t~post6 < 100);havoc #t~post6; {28740#false} is VALID [2022-04-08 12:37:09,715 INFO L272 TraceCheckUtils]: 87: Hoare triple {28740#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28740#false} is VALID [2022-04-08 12:37:09,715 INFO L290 TraceCheckUtils]: 88: Hoare triple {28740#false} ~cond := #in~cond; {28740#false} is VALID [2022-04-08 12:37:09,715 INFO L290 TraceCheckUtils]: 89: Hoare triple {28740#false} assume 0 == ~cond; {28740#false} is VALID [2022-04-08 12:37:09,715 INFO L290 TraceCheckUtils]: 90: Hoare triple {28740#false} assume !false; {28740#false} is VALID [2022-04-08 12:37:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:37:09,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:10,186 INFO L290 TraceCheckUtils]: 90: Hoare triple {28740#false} assume !false; {28740#false} is VALID [2022-04-08 12:37:10,186 INFO L290 TraceCheckUtils]: 89: Hoare triple {28740#false} assume 0 == ~cond; {28740#false} is VALID [2022-04-08 12:37:10,186 INFO L290 TraceCheckUtils]: 88: Hoare triple {28740#false} ~cond := #in~cond; {28740#false} is VALID [2022-04-08 12:37:10,186 INFO L272 TraceCheckUtils]: 87: Hoare triple {28740#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28740#false} is VALID [2022-04-08 12:37:10,186 INFO L290 TraceCheckUtils]: 86: Hoare triple {28740#false} assume !(#t~post6 < 100);havoc #t~post6; {28740#false} is VALID [2022-04-08 12:37:10,186 INFO L290 TraceCheckUtils]: 85: Hoare triple {28740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28740#false} is VALID [2022-04-08 12:37:10,187 INFO L290 TraceCheckUtils]: 84: Hoare triple {28740#false} assume !(#t~post8 < 100);havoc #t~post8; {28740#false} is VALID [2022-04-08 12:37:10,187 INFO L290 TraceCheckUtils]: 83: Hoare triple {28740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28740#false} is VALID [2022-04-08 12:37:10,187 INFO L290 TraceCheckUtils]: 82: Hoare triple {29048#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {28740#false} is VALID [2022-04-08 12:37:10,187 INFO L290 TraceCheckUtils]: 81: Hoare triple {29052#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29048#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:37:10,188 INFO L290 TraceCheckUtils]: 80: Hoare triple {29052#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29052#(< ~counter~0 100)} is VALID [2022-04-08 12:37:10,188 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28739#true} {29052#(< ~counter~0 100)} #96#return; {29052#(< ~counter~0 100)} is VALID [2022-04-08 12:37:10,189 INFO L290 TraceCheckUtils]: 78: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:10,189 INFO L290 TraceCheckUtils]: 77: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:10,189 INFO L290 TraceCheckUtils]: 76: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:10,189 INFO L272 TraceCheckUtils]: 75: Hoare triple {29052#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 12:37:10,189 INFO L290 TraceCheckUtils]: 74: Hoare triple {29052#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {29052#(< ~counter~0 100)} is VALID [2022-04-08 12:37:10,190 INFO L290 TraceCheckUtils]: 73: Hoare triple {29077#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29052#(< ~counter~0 100)} is VALID [2022-04-08 12:37:10,191 INFO L290 TraceCheckUtils]: 72: Hoare triple {29077#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29077#(< ~counter~0 99)} is VALID [2022-04-08 12:37:10,191 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28739#true} {29077#(< ~counter~0 99)} #96#return; {29077#(< ~counter~0 99)} is VALID [2022-04-08 12:37:10,191 INFO L290 TraceCheckUtils]: 70: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:10,192 INFO L290 TraceCheckUtils]: 69: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:10,192 INFO L290 TraceCheckUtils]: 68: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:10,192 INFO L272 TraceCheckUtils]: 67: Hoare triple {29077#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 12:37:10,192 INFO L290 TraceCheckUtils]: 66: Hoare triple {29077#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {29077#(< ~counter~0 99)} is VALID [2022-04-08 12:37:10,193 INFO L290 TraceCheckUtils]: 65: Hoare triple {29102#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29077#(< ~counter~0 99)} is VALID [2022-04-08 12:37:10,193 INFO L290 TraceCheckUtils]: 64: Hoare triple {29102#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29102#(< ~counter~0 98)} is VALID [2022-04-08 12:37:10,194 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28739#true} {29102#(< ~counter~0 98)} #96#return; {29102#(< ~counter~0 98)} is VALID [2022-04-08 12:37:10,194 INFO L290 TraceCheckUtils]: 62: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:10,194 INFO L290 TraceCheckUtils]: 61: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:10,194 INFO L290 TraceCheckUtils]: 60: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:10,194 INFO L272 TraceCheckUtils]: 59: Hoare triple {29102#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 12:37:10,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {29102#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {29102#(< ~counter~0 98)} is VALID [2022-04-08 12:37:10,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {29127#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29102#(< ~counter~0 98)} is VALID [2022-04-08 12:37:10,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {29127#(< ~counter~0 97)} assume !!(0 != ~r~0); {29127#(< ~counter~0 97)} is VALID [2022-04-08 12:37:10,196 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28739#true} {29127#(< ~counter~0 97)} #94#return; {29127#(< ~counter~0 97)} is VALID [2022-04-08 12:37:10,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:10,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:10,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:10,197 INFO L272 TraceCheckUtils]: 51: Hoare triple {29127#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 12:37:10,197 INFO L290 TraceCheckUtils]: 50: Hoare triple {29127#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {29127#(< ~counter~0 97)} is VALID [2022-04-08 12:37:10,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {29152#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29127#(< ~counter~0 97)} is VALID [2022-04-08 12:37:10,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {29152#(< ~counter~0 96)} assume !(~r~0 < 0); {29152#(< ~counter~0 96)} is VALID [2022-04-08 12:37:10,199 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28739#true} {29152#(< ~counter~0 96)} #98#return; {29152#(< ~counter~0 96)} is VALID [2022-04-08 12:37:10,199 INFO L290 TraceCheckUtils]: 46: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:10,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:10,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:10,199 INFO L272 TraceCheckUtils]: 43: Hoare triple {29152#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 12:37:10,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {29152#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {29152#(< ~counter~0 96)} is VALID [2022-04-08 12:37:10,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {29177#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29152#(< ~counter~0 96)} is VALID [2022-04-08 12:37:10,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {29177#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {29177#(< ~counter~0 95)} is VALID [2022-04-08 12:37:10,201 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28739#true} {29177#(< ~counter~0 95)} #98#return; {29177#(< ~counter~0 95)} is VALID [2022-04-08 12:37:10,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:10,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:10,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:10,202 INFO L272 TraceCheckUtils]: 35: Hoare triple {29177#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 12:37:10,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {29177#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {29177#(< ~counter~0 95)} is VALID [2022-04-08 12:37:10,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {29202#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29177#(< ~counter~0 95)} is VALID [2022-04-08 12:37:10,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {29202#(< ~counter~0 94)} assume !(~r~0 > 0); {29202#(< ~counter~0 94)} is VALID [2022-04-08 12:37:10,204 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28739#true} {29202#(< ~counter~0 94)} #96#return; {29202#(< ~counter~0 94)} is VALID [2022-04-08 12:37:10,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:10,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:10,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:10,204 INFO L272 TraceCheckUtils]: 27: Hoare triple {29202#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 12:37:10,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {29202#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {29202#(< ~counter~0 94)} is VALID [2022-04-08 12:37:10,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {29227#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29202#(< ~counter~0 94)} is VALID [2022-04-08 12:37:10,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {29227#(< ~counter~0 93)} assume !!(0 != ~r~0); {29227#(< ~counter~0 93)} is VALID [2022-04-08 12:37:10,207 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28739#true} {29227#(< ~counter~0 93)} #94#return; {29227#(< ~counter~0 93)} is VALID [2022-04-08 12:37:10,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:10,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:10,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:10,207 INFO L272 TraceCheckUtils]: 19: Hoare triple {29227#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 12:37:10,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {29227#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {29227#(< ~counter~0 93)} is VALID [2022-04-08 12:37:10,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {29252#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29227#(< ~counter~0 93)} is VALID [2022-04-08 12:37:10,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {29252#(< ~counter~0 92)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {29252#(< ~counter~0 92)} is VALID [2022-04-08 12:37:10,209 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28739#true} {29252#(< ~counter~0 92)} #92#return; {29252#(< ~counter~0 92)} is VALID [2022-04-08 12:37:10,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:10,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:10,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:10,209 INFO L272 TraceCheckUtils]: 11: Hoare triple {29252#(< ~counter~0 92)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {28739#true} is VALID [2022-04-08 12:37:10,210 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28739#true} {29252#(< ~counter~0 92)} #90#return; {29252#(< ~counter~0 92)} is VALID [2022-04-08 12:37:10,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:10,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:10,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:10,210 INFO L272 TraceCheckUtils]: 6: Hoare triple {29252#(< ~counter~0 92)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 12:37:10,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {29252#(< ~counter~0 92)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {29252#(< ~counter~0 92)} is VALID [2022-04-08 12:37:10,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {29252#(< ~counter~0 92)} call #t~ret9 := main(); {29252#(< ~counter~0 92)} is VALID [2022-04-08 12:37:10,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29252#(< ~counter~0 92)} {28739#true} #102#return; {29252#(< ~counter~0 92)} is VALID [2022-04-08 12:37:10,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {29252#(< ~counter~0 92)} assume true; {29252#(< ~counter~0 92)} is VALID [2022-04-08 12:37:10,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {28739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29252#(< ~counter~0 92)} is VALID [2022-04-08 12:37:10,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {28739#true} call ULTIMATE.init(); {28739#true} is VALID [2022-04-08 12:37:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 12:37:10,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:10,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396102356] [2022-04-08 12:37:10,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:10,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070983841] [2022-04-08 12:37:10,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070983841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:10,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:10,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 12:37:10,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:10,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2046661590] [2022-04-08 12:37:10,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2046661590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:10,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:10,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 12:37:10,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850250518] [2022-04-08 12:37:10,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:10,214 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-08 12:37:10,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:10,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:37:10,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:10,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 12:37:10,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:10,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 12:37:10,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 12:37:10,297 INFO L87 Difference]: Start difference. First operand 342 states and 460 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:37:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:11,316 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2022-04-08 12:37:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 12:37:11,316 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-08 12:37:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:37:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 12:37:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:37:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 12:37:11,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-08 12:37:11,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:11,493 INFO L225 Difference]: With dead ends: 427 [2022-04-08 12:37:11,493 INFO L226 Difference]: Without dead ends: 342 [2022-04-08 12:37:11,494 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=477, Unknown=0, NotChecked=0, Total=812 [2022-04-08 12:37:11,494 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 95 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:37:11,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 217 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:37:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-08 12:37:12,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-08 12:37:12,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:12,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:12,031 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:12,032 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:12,039 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-08 12:37:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 12:37:12,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:12,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:12,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-08 12:37:12,041 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-08 12:37:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:12,049 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-08 12:37:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 12:37:12,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:12,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:12,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:12,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 456 transitions. [2022-04-08 12:37:12,061 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 456 transitions. Word has length 91 [2022-04-08 12:37:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:12,061 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 456 transitions. [2022-04-08 12:37:12,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 12:37:12,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 456 transitions. [2022-04-08 12:37:13,124 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-08 12:37:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 12:37:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-08 12:37:13,126 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:13,126 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:37:13,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 12:37:13,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 12:37:13,335 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:13,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-08 12:37:13,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:13,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1434474638] [2022-04-08 12:37:13,336 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-08 12:37:13,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:13,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425817417] [2022-04-08 12:37:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:13,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:13,353 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:13,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709893771] [2022-04-08 12:37:13,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:37:13,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:13,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:13,355 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:37:13,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 12:37:13,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:37:13,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:13,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 12:37:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:13,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:13,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {31542#true} call ULTIMATE.init(); {31542#true} is VALID [2022-04-08 12:37:13,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {31542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31550#(<= ~counter~0 0)} {31542#true} #102#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {31550#(<= ~counter~0 0)} call #t~ret9 := main(); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {31550#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {31550#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {31550#(<= ~counter~0 0)} ~cond := #in~cond; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {31550#(<= ~counter~0 0)} assume !(0 == ~cond); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31550#(<= ~counter~0 0)} {31550#(<= ~counter~0 0)} #90#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,914 INFO L272 TraceCheckUtils]: 11: Hoare triple {31550#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {31550#(<= ~counter~0 0)} ~cond := #in~cond; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {31550#(<= ~counter~0 0)} assume !(0 == ~cond); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,915 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31550#(<= ~counter~0 0)} {31550#(<= ~counter~0 0)} #92#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {31550#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:13,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {31550#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:13,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {31599#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:13,917 INFO L272 TraceCheckUtils]: 19: Hoare triple {31599#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:13,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {31599#(<= ~counter~0 1)} ~cond := #in~cond; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:13,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {31599#(<= ~counter~0 1)} assume !(0 == ~cond); {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:13,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {31599#(<= ~counter~0 1)} assume true; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:13,918 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31599#(<= ~counter~0 1)} {31599#(<= ~counter~0 1)} #94#return; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:13,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {31599#(<= ~counter~0 1)} assume !!(0 != ~r~0); {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:13,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {31599#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:13,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {31624#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:13,920 INFO L272 TraceCheckUtils]: 27: Hoare triple {31624#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:13,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {31624#(<= ~counter~0 2)} ~cond := #in~cond; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:13,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {31624#(<= ~counter~0 2)} assume !(0 == ~cond); {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:13,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {31624#(<= ~counter~0 2)} assume true; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:13,921 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31624#(<= ~counter~0 2)} {31624#(<= ~counter~0 2)} #96#return; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:13,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {31624#(<= ~counter~0 2)} assume !(~r~0 > 0); {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:13,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {31624#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:13,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {31649#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:13,923 INFO L272 TraceCheckUtils]: 35: Hoare triple {31649#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31649#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:13,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {31649#(<= ~counter~0 3)} ~cond := #in~cond; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:13,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {31649#(<= ~counter~0 3)} assume !(0 == ~cond); {31649#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:13,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {31649#(<= ~counter~0 3)} assume true; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:13,924 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31649#(<= ~counter~0 3)} {31649#(<= ~counter~0 3)} #98#return; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:13,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {31649#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:13,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {31649#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:13,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {31674#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:13,925 INFO L272 TraceCheckUtils]: 43: Hoare triple {31674#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:13,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {31674#(<= ~counter~0 4)} ~cond := #in~cond; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:13,926 INFO L290 TraceCheckUtils]: 45: Hoare triple {31674#(<= ~counter~0 4)} assume !(0 == ~cond); {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:13,926 INFO L290 TraceCheckUtils]: 46: Hoare triple {31674#(<= ~counter~0 4)} assume true; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:13,927 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31674#(<= ~counter~0 4)} {31674#(<= ~counter~0 4)} #98#return; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:13,927 INFO L290 TraceCheckUtils]: 48: Hoare triple {31674#(<= ~counter~0 4)} assume !(~r~0 < 0); {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:13,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {31674#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:13,928 INFO L290 TraceCheckUtils]: 50: Hoare triple {31699#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:13,928 INFO L272 TraceCheckUtils]: 51: Hoare triple {31699#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:13,929 INFO L290 TraceCheckUtils]: 52: Hoare triple {31699#(<= ~counter~0 5)} ~cond := #in~cond; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:13,929 INFO L290 TraceCheckUtils]: 53: Hoare triple {31699#(<= ~counter~0 5)} assume !(0 == ~cond); {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:13,929 INFO L290 TraceCheckUtils]: 54: Hoare triple {31699#(<= ~counter~0 5)} assume true; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:13,930 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31699#(<= ~counter~0 5)} {31699#(<= ~counter~0 5)} #94#return; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:13,930 INFO L290 TraceCheckUtils]: 56: Hoare triple {31699#(<= ~counter~0 5)} assume !!(0 != ~r~0); {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:13,931 INFO L290 TraceCheckUtils]: 57: Hoare triple {31699#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:13,931 INFO L290 TraceCheckUtils]: 58: Hoare triple {31724#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:13,931 INFO L272 TraceCheckUtils]: 59: Hoare triple {31724#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31724#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:13,932 INFO L290 TraceCheckUtils]: 60: Hoare triple {31724#(<= ~counter~0 6)} ~cond := #in~cond; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:13,932 INFO L290 TraceCheckUtils]: 61: Hoare triple {31724#(<= ~counter~0 6)} assume !(0 == ~cond); {31724#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:13,932 INFO L290 TraceCheckUtils]: 62: Hoare triple {31724#(<= ~counter~0 6)} assume true; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:13,933 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31724#(<= ~counter~0 6)} {31724#(<= ~counter~0 6)} #96#return; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:13,933 INFO L290 TraceCheckUtils]: 64: Hoare triple {31724#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:13,933 INFO L290 TraceCheckUtils]: 65: Hoare triple {31724#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:13,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {31749#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:13,934 INFO L272 TraceCheckUtils]: 67: Hoare triple {31749#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31749#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:13,934 INFO L290 TraceCheckUtils]: 68: Hoare triple {31749#(<= ~counter~0 7)} ~cond := #in~cond; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:13,935 INFO L290 TraceCheckUtils]: 69: Hoare triple {31749#(<= ~counter~0 7)} assume !(0 == ~cond); {31749#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:13,935 INFO L290 TraceCheckUtils]: 70: Hoare triple {31749#(<= ~counter~0 7)} assume true; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:13,935 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31749#(<= ~counter~0 7)} {31749#(<= ~counter~0 7)} #96#return; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:13,936 INFO L290 TraceCheckUtils]: 72: Hoare triple {31749#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:13,936 INFO L290 TraceCheckUtils]: 73: Hoare triple {31749#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:13,937 INFO L290 TraceCheckUtils]: 74: Hoare triple {31774#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:13,937 INFO L272 TraceCheckUtils]: 75: Hoare triple {31774#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:13,937 INFO L290 TraceCheckUtils]: 76: Hoare triple {31774#(<= ~counter~0 8)} ~cond := #in~cond; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:13,938 INFO L290 TraceCheckUtils]: 77: Hoare triple {31774#(<= ~counter~0 8)} assume !(0 == ~cond); {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:13,938 INFO L290 TraceCheckUtils]: 78: Hoare triple {31774#(<= ~counter~0 8)} assume true; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:13,938 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31774#(<= ~counter~0 8)} {31774#(<= ~counter~0 8)} #96#return; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:13,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {31774#(<= ~counter~0 8)} assume !(~r~0 > 0); {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:13,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {31774#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:13,939 INFO L290 TraceCheckUtils]: 82: Hoare triple {31799#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:13,940 INFO L272 TraceCheckUtils]: 83: Hoare triple {31799#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31799#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:13,940 INFO L290 TraceCheckUtils]: 84: Hoare triple {31799#(<= ~counter~0 9)} ~cond := #in~cond; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:13,940 INFO L290 TraceCheckUtils]: 85: Hoare triple {31799#(<= ~counter~0 9)} assume !(0 == ~cond); {31799#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:13,941 INFO L290 TraceCheckUtils]: 86: Hoare triple {31799#(<= ~counter~0 9)} assume true; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:13,941 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31799#(<= ~counter~0 9)} {31799#(<= ~counter~0 9)} #98#return; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:13,941 INFO L290 TraceCheckUtils]: 88: Hoare triple {31799#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:13,942 INFO L290 TraceCheckUtils]: 89: Hoare triple {31799#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31824#(<= |main_#t~post8| 9)} is VALID [2022-04-08 12:37:13,942 INFO L290 TraceCheckUtils]: 90: Hoare triple {31824#(<= |main_#t~post8| 9)} assume !(#t~post8 < 100);havoc #t~post8; {31543#false} is VALID [2022-04-08 12:37:13,942 INFO L290 TraceCheckUtils]: 91: Hoare triple {31543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31543#false} is VALID [2022-04-08 12:37:13,942 INFO L290 TraceCheckUtils]: 92: Hoare triple {31543#false} assume !(#t~post6 < 100);havoc #t~post6; {31543#false} is VALID [2022-04-08 12:37:13,942 INFO L272 TraceCheckUtils]: 93: Hoare triple {31543#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31543#false} is VALID [2022-04-08 12:37:13,942 INFO L290 TraceCheckUtils]: 94: Hoare triple {31543#false} ~cond := #in~cond; {31543#false} is VALID [2022-04-08 12:37:13,942 INFO L290 TraceCheckUtils]: 95: Hoare triple {31543#false} assume 0 == ~cond; {31543#false} is VALID [2022-04-08 12:37:13,942 INFO L290 TraceCheckUtils]: 96: Hoare triple {31543#false} assume !false; {31543#false} is VALID [2022-04-08 12:37:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:37:13,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:14,476 INFO L290 TraceCheckUtils]: 96: Hoare triple {31543#false} assume !false; {31543#false} is VALID [2022-04-08 12:37:14,477 INFO L290 TraceCheckUtils]: 95: Hoare triple {31543#false} assume 0 == ~cond; {31543#false} is VALID [2022-04-08 12:37:14,477 INFO L290 TraceCheckUtils]: 94: Hoare triple {31543#false} ~cond := #in~cond; {31543#false} is VALID [2022-04-08 12:37:14,477 INFO L272 TraceCheckUtils]: 93: Hoare triple {31543#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31543#false} is VALID [2022-04-08 12:37:14,477 INFO L290 TraceCheckUtils]: 92: Hoare triple {31543#false} assume !(#t~post6 < 100);havoc #t~post6; {31543#false} is VALID [2022-04-08 12:37:14,477 INFO L290 TraceCheckUtils]: 91: Hoare triple {31543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31543#false} is VALID [2022-04-08 12:37:14,477 INFO L290 TraceCheckUtils]: 90: Hoare triple {31864#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {31543#false} is VALID [2022-04-08 12:37:14,477 INFO L290 TraceCheckUtils]: 89: Hoare triple {31868#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31864#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:37:14,478 INFO L290 TraceCheckUtils]: 88: Hoare triple {31868#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31868#(< ~counter~0 100)} is VALID [2022-04-08 12:37:14,478 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31542#true} {31868#(< ~counter~0 100)} #98#return; {31868#(< ~counter~0 100)} is VALID [2022-04-08 12:37:14,478 INFO L290 TraceCheckUtils]: 86: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:14,478 INFO L290 TraceCheckUtils]: 85: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:14,478 INFO L290 TraceCheckUtils]: 84: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:14,478 INFO L272 TraceCheckUtils]: 83: Hoare triple {31868#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 12:37:14,479 INFO L290 TraceCheckUtils]: 82: Hoare triple {31868#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {31868#(< ~counter~0 100)} is VALID [2022-04-08 12:37:14,480 INFO L290 TraceCheckUtils]: 81: Hoare triple {31893#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31868#(< ~counter~0 100)} is VALID [2022-04-08 12:37:14,480 INFO L290 TraceCheckUtils]: 80: Hoare triple {31893#(< ~counter~0 99)} assume !(~r~0 > 0); {31893#(< ~counter~0 99)} is VALID [2022-04-08 12:37:14,480 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31542#true} {31893#(< ~counter~0 99)} #96#return; {31893#(< ~counter~0 99)} is VALID [2022-04-08 12:37:14,480 INFO L290 TraceCheckUtils]: 78: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:14,481 INFO L290 TraceCheckUtils]: 77: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:14,481 INFO L290 TraceCheckUtils]: 76: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:14,481 INFO L272 TraceCheckUtils]: 75: Hoare triple {31893#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 12:37:14,481 INFO L290 TraceCheckUtils]: 74: Hoare triple {31893#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {31893#(< ~counter~0 99)} is VALID [2022-04-08 12:37:14,481 INFO L290 TraceCheckUtils]: 73: Hoare triple {31918#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31893#(< ~counter~0 99)} is VALID [2022-04-08 12:37:14,482 INFO L290 TraceCheckUtils]: 72: Hoare triple {31918#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31918#(< ~counter~0 98)} is VALID [2022-04-08 12:37:14,482 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31542#true} {31918#(< ~counter~0 98)} #96#return; {31918#(< ~counter~0 98)} is VALID [2022-04-08 12:37:14,482 INFO L290 TraceCheckUtils]: 70: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:14,482 INFO L290 TraceCheckUtils]: 69: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:14,482 INFO L290 TraceCheckUtils]: 68: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:14,482 INFO L272 TraceCheckUtils]: 67: Hoare triple {31918#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 12:37:14,483 INFO L290 TraceCheckUtils]: 66: Hoare triple {31918#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {31918#(< ~counter~0 98)} is VALID [2022-04-08 12:37:14,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {31943#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31918#(< ~counter~0 98)} is VALID [2022-04-08 12:37:14,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {31943#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31943#(< ~counter~0 97)} is VALID [2022-04-08 12:37:14,484 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31542#true} {31943#(< ~counter~0 97)} #96#return; {31943#(< ~counter~0 97)} is VALID [2022-04-08 12:37:14,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:14,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:14,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:14,484 INFO L272 TraceCheckUtils]: 59: Hoare triple {31943#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 12:37:14,485 INFO L290 TraceCheckUtils]: 58: Hoare triple {31943#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {31943#(< ~counter~0 97)} is VALID [2022-04-08 12:37:14,485 INFO L290 TraceCheckUtils]: 57: Hoare triple {31968#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31943#(< ~counter~0 97)} is VALID [2022-04-08 12:37:14,485 INFO L290 TraceCheckUtils]: 56: Hoare triple {31968#(< ~counter~0 96)} assume !!(0 != ~r~0); {31968#(< ~counter~0 96)} is VALID [2022-04-08 12:37:14,486 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31542#true} {31968#(< ~counter~0 96)} #94#return; {31968#(< ~counter~0 96)} is VALID [2022-04-08 12:37:14,486 INFO L290 TraceCheckUtils]: 54: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:14,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:14,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:14,486 INFO L272 TraceCheckUtils]: 51: Hoare triple {31968#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 12:37:14,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {31968#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {31968#(< ~counter~0 96)} is VALID [2022-04-08 12:37:14,487 INFO L290 TraceCheckUtils]: 49: Hoare triple {31993#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31968#(< ~counter~0 96)} is VALID [2022-04-08 12:37:14,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {31993#(< ~counter~0 95)} assume !(~r~0 < 0); {31993#(< ~counter~0 95)} is VALID [2022-04-08 12:37:14,488 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31542#true} {31993#(< ~counter~0 95)} #98#return; {31993#(< ~counter~0 95)} is VALID [2022-04-08 12:37:14,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:14,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:14,488 INFO L290 TraceCheckUtils]: 44: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:14,488 INFO L272 TraceCheckUtils]: 43: Hoare triple {31993#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 12:37:14,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {31993#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {31993#(< ~counter~0 95)} is VALID [2022-04-08 12:37:14,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {32018#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31993#(< ~counter~0 95)} is VALID [2022-04-08 12:37:14,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {32018#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32018#(< ~counter~0 94)} is VALID [2022-04-08 12:37:14,489 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31542#true} {32018#(< ~counter~0 94)} #98#return; {32018#(< ~counter~0 94)} is VALID [2022-04-08 12:37:14,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:14,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:14,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:14,490 INFO L272 TraceCheckUtils]: 35: Hoare triple {32018#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 12:37:14,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {32018#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {32018#(< ~counter~0 94)} is VALID [2022-04-08 12:37:14,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {32043#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32018#(< ~counter~0 94)} is VALID [2022-04-08 12:37:14,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {32043#(< ~counter~0 93)} assume !(~r~0 > 0); {32043#(< ~counter~0 93)} is VALID [2022-04-08 12:37:14,491 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31542#true} {32043#(< ~counter~0 93)} #96#return; {32043#(< ~counter~0 93)} is VALID [2022-04-08 12:37:14,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:14,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:14,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:14,491 INFO L272 TraceCheckUtils]: 27: Hoare triple {32043#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 12:37:14,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {32043#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {32043#(< ~counter~0 93)} is VALID [2022-04-08 12:37:14,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {32068#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32043#(< ~counter~0 93)} is VALID [2022-04-08 12:37:14,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {32068#(< ~counter~0 92)} assume !!(0 != ~r~0); {32068#(< ~counter~0 92)} is VALID [2022-04-08 12:37:14,493 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31542#true} {32068#(< ~counter~0 92)} #94#return; {32068#(< ~counter~0 92)} is VALID [2022-04-08 12:37:14,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:14,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:14,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:14,493 INFO L272 TraceCheckUtils]: 19: Hoare triple {32068#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 12:37:14,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {32068#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {32068#(< ~counter~0 92)} is VALID [2022-04-08 12:37:14,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {32093#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32068#(< ~counter~0 92)} is VALID [2022-04-08 12:37:14,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {32093#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32093#(< ~counter~0 91)} is VALID [2022-04-08 12:37:14,495 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31542#true} {32093#(< ~counter~0 91)} #92#return; {32093#(< ~counter~0 91)} is VALID [2022-04-08 12:37:14,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:14,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:14,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:14,495 INFO L272 TraceCheckUtils]: 11: Hoare triple {32093#(< ~counter~0 91)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {31542#true} is VALID [2022-04-08 12:37:14,495 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31542#true} {32093#(< ~counter~0 91)} #90#return; {32093#(< ~counter~0 91)} is VALID [2022-04-08 12:37:14,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:14,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:14,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:14,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {32093#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 12:37:14,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {32093#(< ~counter~0 91)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {32093#(< ~counter~0 91)} is VALID [2022-04-08 12:37:14,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {32093#(< ~counter~0 91)} call #t~ret9 := main(); {32093#(< ~counter~0 91)} is VALID [2022-04-08 12:37:14,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32093#(< ~counter~0 91)} {31542#true} #102#return; {32093#(< ~counter~0 91)} is VALID [2022-04-08 12:37:14,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {32093#(< ~counter~0 91)} assume true; {32093#(< ~counter~0 91)} is VALID [2022-04-08 12:37:14,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {31542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32093#(< ~counter~0 91)} is VALID [2022-04-08 12:37:14,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {31542#true} call ULTIMATE.init(); {31542#true} is VALID [2022-04-08 12:37:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-08 12:37:14,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:14,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425817417] [2022-04-08 12:37:14,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:14,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709893771] [2022-04-08 12:37:14,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709893771] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:14,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:14,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 12:37:14,498 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:14,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1434474638] [2022-04-08 12:37:14,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1434474638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:14,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:14,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 12:37:14,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953226453] [2022-04-08 12:37:14,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:14,499 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-08 12:37:14,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:14,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 12:37:14,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:14,588 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 12:37:14,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:14,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 12:37:14,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:37:14,588 INFO L87 Difference]: Start difference. First operand 342 states and 456 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 12:37:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:15,811 INFO L93 Difference]: Finished difference Result 467 states and 640 transitions. [2022-04-08 12:37:15,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 12:37:15,812 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-08 12:37:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 12:37:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-08 12:37:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 12:37:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-08 12:37:15,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-08 12:37:16,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:16,028 INFO L225 Difference]: With dead ends: 467 [2022-04-08 12:37:16,029 INFO L226 Difference]: Without dead ends: 352 [2022-04-08 12:37:16,029 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=383, Invalid=547, Unknown=0, NotChecked=0, Total=930 [2022-04-08 12:37:16,030 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:37:16,030 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 249 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:37:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-08 12:37:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2022-04-08 12:37:16,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:16,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:16,596 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:16,597 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:16,605 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-08 12:37:16,605 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-08 12:37:16,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:16,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:16,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-08 12:37:16,607 INFO L87 Difference]: Start difference. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-08 12:37:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:16,615 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-08 12:37:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-08 12:37:16,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:16,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:16,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:16,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 457 transitions. [2022-04-08 12:37:16,627 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 457 transitions. Word has length 97 [2022-04-08 12:37:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:16,627 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 457 transitions. [2022-04-08 12:37:16,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 12:37:16,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 457 transitions. [2022-04-08 12:37:19,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 456 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 457 transitions. [2022-04-08 12:37:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 12:37:19,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:19,519 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:37:19,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 12:37:19,723 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-08 12:37:19,723 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:19,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-08 12:37:19,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:19,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [729091941] [2022-04-08 12:37:19,724 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:19,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-08 12:37:19,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:19,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5296960] [2022-04-08 12:37:19,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:19,735 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:19,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305802122] [2022-04-08 12:37:19,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:37:19,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:19,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:19,736 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:37:19,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 12:37:19,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:37:19,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:19,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 12:37:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:19,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:20,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {34487#true} call ULTIMATE.init(); {34487#true} is VALID [2022-04-08 12:37:20,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {34487#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34487#true} {34487#true} #102#return; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {34487#true} call #t~ret9 := main(); {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {34487#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {34487#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34487#true} {34487#true} #90#return; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L272 TraceCheckUtils]: 11: Hoare triple {34487#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34487#true} {34487#true} #92#return; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {34487#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {34487#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {34487#true} assume !!(#t~post6 < 100);havoc #t~post6; {34487#true} is VALID [2022-04-08 12:37:20,042 INFO L272 TraceCheckUtils]: 19: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34487#true} {34487#true} #94#return; {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {34487#true} assume !!(0 != ~r~0); {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {34487#true} assume !!(#t~post7 < 100);havoc #t~post7; {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L272 TraceCheckUtils]: 27: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {34487#true} assume !(~r~0 > 0); {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {34487#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {34487#true} assume !!(#t~post8 < 100);havoc #t~post8; {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L272 TraceCheckUtils]: 35: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 36: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:20,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34487#true} {34487#true} #98#return; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {34487#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {34487#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 42: Hoare triple {34487#true} assume !!(#t~post8 < 100);havoc #t~post8; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L272 TraceCheckUtils]: 43: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 44: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 45: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34487#true} {34487#true} #98#return; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 48: Hoare triple {34487#true} assume !(~r~0 < 0); {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 49: Hoare triple {34487#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {34487#true} assume !!(#t~post6 < 100);havoc #t~post6; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L272 TraceCheckUtils]: 51: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34487#true} {34487#true} #94#return; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {34487#true} assume !!(0 != ~r~0); {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-08 12:37:20,044 INFO L290 TraceCheckUtils]: 58: Hoare triple {34487#true} assume !!(#t~post7 < 100);havoc #t~post7; {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L272 TraceCheckUtils]: 59: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L290 TraceCheckUtils]: 60: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L290 TraceCheckUtils]: 61: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L290 TraceCheckUtils]: 62: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L290 TraceCheckUtils]: 64: Hoare triple {34487#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L290 TraceCheckUtils]: 65: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L290 TraceCheckUtils]: 66: Hoare triple {34487#true} assume !!(#t~post7 < 100);havoc #t~post7; {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L272 TraceCheckUtils]: 67: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L290 TraceCheckUtils]: 68: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L290 TraceCheckUtils]: 69: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L290 TraceCheckUtils]: 70: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:20,045 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-08 12:37:20,063 INFO L290 TraceCheckUtils]: 72: Hoare triple {34487#true} assume !(~r~0 > 0); {34708#(not (< 0 main_~r~0))} is VALID [2022-04-08 12:37:20,064 INFO L290 TraceCheckUtils]: 73: Hoare triple {34708#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34708#(not (< 0 main_~r~0))} is VALID [2022-04-08 12:37:20,064 INFO L290 TraceCheckUtils]: 74: Hoare triple {34708#(not (< 0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {34708#(not (< 0 main_~r~0))} is VALID [2022-04-08 12:37:20,065 INFO L272 TraceCheckUtils]: 75: Hoare triple {34708#(not (< 0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-08 12:37:20,065 INFO L290 TraceCheckUtils]: 76: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:20,065 INFO L290 TraceCheckUtils]: 77: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:20,065 INFO L290 TraceCheckUtils]: 78: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:20,066 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {34487#true} {34708#(not (< 0 main_~r~0))} #98#return; {34708#(not (< 0 main_~r~0))} is VALID [2022-04-08 12:37:20,066 INFO L290 TraceCheckUtils]: 80: Hoare triple {34708#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 12:37:20,067 INFO L290 TraceCheckUtils]: 81: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 12:37:20,067 INFO L290 TraceCheckUtils]: 82: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 100);havoc #t~post6; {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 12:37:20,068 INFO L272 TraceCheckUtils]: 83: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-08 12:37:20,068 INFO L290 TraceCheckUtils]: 84: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:20,068 INFO L290 TraceCheckUtils]: 85: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:20,068 INFO L290 TraceCheckUtils]: 86: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:20,069 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34487#true} {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 12:37:20,069 INFO L290 TraceCheckUtils]: 88: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {34488#false} is VALID [2022-04-08 12:37:20,069 INFO L290 TraceCheckUtils]: 89: Hoare triple {34488#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34488#false} is VALID [2022-04-08 12:37:20,069 INFO L290 TraceCheckUtils]: 90: Hoare triple {34488#false} assume !(#t~post7 < 100);havoc #t~post7; {34488#false} is VALID [2022-04-08 12:37:20,070 INFO L290 TraceCheckUtils]: 91: Hoare triple {34488#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34488#false} is VALID [2022-04-08 12:37:20,070 INFO L290 TraceCheckUtils]: 92: Hoare triple {34488#false} assume !(#t~post8 < 100);havoc #t~post8; {34488#false} is VALID [2022-04-08 12:37:20,070 INFO L290 TraceCheckUtils]: 93: Hoare triple {34488#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34488#false} is VALID [2022-04-08 12:37:20,070 INFO L290 TraceCheckUtils]: 94: Hoare triple {34488#false} assume !(#t~post6 < 100);havoc #t~post6; {34488#false} is VALID [2022-04-08 12:37:20,070 INFO L272 TraceCheckUtils]: 95: Hoare triple {34488#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34488#false} is VALID [2022-04-08 12:37:20,070 INFO L290 TraceCheckUtils]: 96: Hoare triple {34488#false} ~cond := #in~cond; {34488#false} is VALID [2022-04-08 12:37:20,070 INFO L290 TraceCheckUtils]: 97: Hoare triple {34488#false} assume 0 == ~cond; {34488#false} is VALID [2022-04-08 12:37:20,070 INFO L290 TraceCheckUtils]: 98: Hoare triple {34488#false} assume !false; {34488#false} is VALID [2022-04-08 12:37:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-04-08 12:37:20,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:37:20,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:20,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5296960] [2022-04-08 12:37:20,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:20,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305802122] [2022-04-08 12:37:20,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305802122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:20,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:20,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:37:20,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:20,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [729091941] [2022-04-08 12:37:20,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [729091941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:20,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:20,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:37:20,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009208083] [2022-04-08 12:37:20,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:20,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-08 12:37:20,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:20,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:37:20,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:20,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:37:20,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:20,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:37:20,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:37:20,119 INFO L87 Difference]: Start difference. First operand 344 states and 457 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:37:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:20,865 INFO L93 Difference]: Finished difference Result 504 states and 675 transitions. [2022-04-08 12:37:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 12:37:20,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-08 12:37:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:37:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 12:37:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:37:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 12:37:20,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-08 12:37:20,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:20,942 INFO L225 Difference]: With dead ends: 504 [2022-04-08 12:37:20,942 INFO L226 Difference]: Without dead ends: 362 [2022-04-08 12:37:20,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:37:20,943 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:37:20,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 122 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:37:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-08 12:37:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2022-04-08 12:37:21,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:21,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:21,463 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:21,464 INFO L87 Difference]: Start difference. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:21,472 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-08 12:37:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-08 12:37:21,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:21,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:21,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-08 12:37:21,473 INFO L87 Difference]: Start difference. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-08 12:37:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:21,482 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-08 12:37:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-08 12:37:21,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:21,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:21,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:21,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 468 transitions. [2022-04-08 12:37:21,493 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 468 transitions. Word has length 99 [2022-04-08 12:37:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:21,494 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 468 transitions. [2022-04-08 12:37:21,494 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 12:37:21,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 352 states and 468 transitions. [2022-04-08 12:37:24,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 467 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 468 transitions. [2022-04-08 12:37:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 12:37:24,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:24,396 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:37:24,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 12:37:24,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 12:37:24,596 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-08 12:37:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:24,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [767548747] [2022-04-08 12:37:24,597 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-08 12:37:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:24,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242914835] [2022-04-08 12:37:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:24,610 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:24,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614261148] [2022-04-08 12:37:24,611 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:37:24,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:24,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:24,612 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:37:24,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 12:37:24,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:37:24,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:24,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 12:37:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:24,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:25,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {37223#true} call ULTIMATE.init(); {37223#true} is VALID [2022-04-08 12:37:25,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {37223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37231#(<= ~counter~0 0)} {37223#true} #102#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {37231#(<= ~counter~0 0)} call #t~ret9 := main(); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {37231#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,258 INFO L272 TraceCheckUtils]: 6: Hoare triple {37231#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {37231#(<= ~counter~0 0)} ~cond := #in~cond; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {37231#(<= ~counter~0 0)} assume !(0 == ~cond); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37231#(<= ~counter~0 0)} {37231#(<= ~counter~0 0)} #90#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,260 INFO L272 TraceCheckUtils]: 11: Hoare triple {37231#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {37231#(<= ~counter~0 0)} ~cond := #in~cond; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {37231#(<= ~counter~0 0)} assume !(0 == ~cond); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,261 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37231#(<= ~counter~0 0)} {37231#(<= ~counter~0 0)} #92#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {37231#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:25,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {37231#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:25,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {37280#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:25,263 INFO L272 TraceCheckUtils]: 19: Hoare triple {37280#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:25,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {37280#(<= ~counter~0 1)} ~cond := #in~cond; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:25,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {37280#(<= ~counter~0 1)} assume !(0 == ~cond); {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:25,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {37280#(<= ~counter~0 1)} assume true; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:25,264 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37280#(<= ~counter~0 1)} {37280#(<= ~counter~0 1)} #94#return; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:25,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {37280#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:25,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {37280#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:25,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {37305#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:25,266 INFO L272 TraceCheckUtils]: 27: Hoare triple {37305#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:25,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {37305#(<= ~counter~0 2)} ~cond := #in~cond; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:25,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {37305#(<= ~counter~0 2)} assume !(0 == ~cond); {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:25,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {37305#(<= ~counter~0 2)} assume true; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:25,267 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37305#(<= ~counter~0 2)} {37305#(<= ~counter~0 2)} #96#return; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:25,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {37305#(<= ~counter~0 2)} assume !(~r~0 > 0); {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:25,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {37305#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:25,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {37330#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:25,268 INFO L272 TraceCheckUtils]: 35: Hoare triple {37330#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37330#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:25,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {37330#(<= ~counter~0 3)} ~cond := #in~cond; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:25,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {37330#(<= ~counter~0 3)} assume !(0 == ~cond); {37330#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:25,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {37330#(<= ~counter~0 3)} assume true; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:25,270 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37330#(<= ~counter~0 3)} {37330#(<= ~counter~0 3)} #98#return; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:25,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {37330#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:25,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {37330#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:25,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {37355#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:25,280 INFO L272 TraceCheckUtils]: 43: Hoare triple {37355#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:25,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {37355#(<= ~counter~0 4)} ~cond := #in~cond; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:25,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {37355#(<= ~counter~0 4)} assume !(0 == ~cond); {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:25,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {37355#(<= ~counter~0 4)} assume true; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:25,282 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37355#(<= ~counter~0 4)} {37355#(<= ~counter~0 4)} #98#return; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:25,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {37355#(<= ~counter~0 4)} assume !(~r~0 < 0); {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:25,283 INFO L290 TraceCheckUtils]: 49: Hoare triple {37355#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:25,283 INFO L290 TraceCheckUtils]: 50: Hoare triple {37380#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:25,284 INFO L272 TraceCheckUtils]: 51: Hoare triple {37380#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:25,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {37380#(<= ~counter~0 5)} ~cond := #in~cond; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:25,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {37380#(<= ~counter~0 5)} assume !(0 == ~cond); {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:25,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {37380#(<= ~counter~0 5)} assume true; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:25,285 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37380#(<= ~counter~0 5)} {37380#(<= ~counter~0 5)} #94#return; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:25,286 INFO L290 TraceCheckUtils]: 56: Hoare triple {37380#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:25,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {37380#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:25,287 INFO L290 TraceCheckUtils]: 58: Hoare triple {37405#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:25,287 INFO L272 TraceCheckUtils]: 59: Hoare triple {37405#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37405#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:25,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {37405#(<= ~counter~0 6)} ~cond := #in~cond; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:25,288 INFO L290 TraceCheckUtils]: 61: Hoare triple {37405#(<= ~counter~0 6)} assume !(0 == ~cond); {37405#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:25,288 INFO L290 TraceCheckUtils]: 62: Hoare triple {37405#(<= ~counter~0 6)} assume true; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:25,289 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37405#(<= ~counter~0 6)} {37405#(<= ~counter~0 6)} #96#return; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:25,289 INFO L290 TraceCheckUtils]: 64: Hoare triple {37405#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:25,290 INFO L290 TraceCheckUtils]: 65: Hoare triple {37405#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:25,290 INFO L290 TraceCheckUtils]: 66: Hoare triple {37430#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:25,291 INFO L272 TraceCheckUtils]: 67: Hoare triple {37430#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37430#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:25,291 INFO L290 TraceCheckUtils]: 68: Hoare triple {37430#(<= ~counter~0 7)} ~cond := #in~cond; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:25,292 INFO L290 TraceCheckUtils]: 69: Hoare triple {37430#(<= ~counter~0 7)} assume !(0 == ~cond); {37430#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:25,292 INFO L290 TraceCheckUtils]: 70: Hoare triple {37430#(<= ~counter~0 7)} assume true; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:25,292 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37430#(<= ~counter~0 7)} {37430#(<= ~counter~0 7)} #96#return; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:25,293 INFO L290 TraceCheckUtils]: 72: Hoare triple {37430#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:25,293 INFO L290 TraceCheckUtils]: 73: Hoare triple {37430#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:25,294 INFO L290 TraceCheckUtils]: 74: Hoare triple {37455#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:25,294 INFO L272 TraceCheckUtils]: 75: Hoare triple {37455#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37455#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:25,295 INFO L290 TraceCheckUtils]: 76: Hoare triple {37455#(<= ~counter~0 8)} ~cond := #in~cond; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:25,295 INFO L290 TraceCheckUtils]: 77: Hoare triple {37455#(<= ~counter~0 8)} assume !(0 == ~cond); {37455#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:25,295 INFO L290 TraceCheckUtils]: 78: Hoare triple {37455#(<= ~counter~0 8)} assume true; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:25,296 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37455#(<= ~counter~0 8)} {37455#(<= ~counter~0 8)} #96#return; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:25,296 INFO L290 TraceCheckUtils]: 80: Hoare triple {37455#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:25,297 INFO L290 TraceCheckUtils]: 81: Hoare triple {37455#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:25,297 INFO L290 TraceCheckUtils]: 82: Hoare triple {37480#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:25,298 INFO L272 TraceCheckUtils]: 83: Hoare triple {37480#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37480#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:25,298 INFO L290 TraceCheckUtils]: 84: Hoare triple {37480#(<= ~counter~0 9)} ~cond := #in~cond; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:25,298 INFO L290 TraceCheckUtils]: 85: Hoare triple {37480#(<= ~counter~0 9)} assume !(0 == ~cond); {37480#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:25,299 INFO L290 TraceCheckUtils]: 86: Hoare triple {37480#(<= ~counter~0 9)} assume true; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:25,299 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37480#(<= ~counter~0 9)} {37480#(<= ~counter~0 9)} #96#return; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:25,300 INFO L290 TraceCheckUtils]: 88: Hoare triple {37480#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:25,300 INFO L290 TraceCheckUtils]: 89: Hoare triple {37480#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37505#(<= |main_#t~post7| 9)} is VALID [2022-04-08 12:37:25,301 INFO L290 TraceCheckUtils]: 90: Hoare triple {37505#(<= |main_#t~post7| 9)} assume !(#t~post7 < 100);havoc #t~post7; {37224#false} is VALID [2022-04-08 12:37:25,301 INFO L290 TraceCheckUtils]: 91: Hoare triple {37224#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37224#false} is VALID [2022-04-08 12:37:25,301 INFO L290 TraceCheckUtils]: 92: Hoare triple {37224#false} assume !(#t~post8 < 100);havoc #t~post8; {37224#false} is VALID [2022-04-08 12:37:25,301 INFO L290 TraceCheckUtils]: 93: Hoare triple {37224#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37224#false} is VALID [2022-04-08 12:37:25,301 INFO L290 TraceCheckUtils]: 94: Hoare triple {37224#false} assume !(#t~post6 < 100);havoc #t~post6; {37224#false} is VALID [2022-04-08 12:37:25,301 INFO L272 TraceCheckUtils]: 95: Hoare triple {37224#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37224#false} is VALID [2022-04-08 12:37:25,301 INFO L290 TraceCheckUtils]: 96: Hoare triple {37224#false} ~cond := #in~cond; {37224#false} is VALID [2022-04-08 12:37:25,301 INFO L290 TraceCheckUtils]: 97: Hoare triple {37224#false} assume 0 == ~cond; {37224#false} is VALID [2022-04-08 12:37:25,302 INFO L290 TraceCheckUtils]: 98: Hoare triple {37224#false} assume !false; {37224#false} is VALID [2022-04-08 12:37:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 202 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:37:25,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:25,833 INFO L290 TraceCheckUtils]: 98: Hoare triple {37224#false} assume !false; {37224#false} is VALID [2022-04-08 12:37:25,833 INFO L290 TraceCheckUtils]: 97: Hoare triple {37224#false} assume 0 == ~cond; {37224#false} is VALID [2022-04-08 12:37:25,834 INFO L290 TraceCheckUtils]: 96: Hoare triple {37224#false} ~cond := #in~cond; {37224#false} is VALID [2022-04-08 12:37:25,834 INFO L272 TraceCheckUtils]: 95: Hoare triple {37224#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37224#false} is VALID [2022-04-08 12:37:25,834 INFO L290 TraceCheckUtils]: 94: Hoare triple {37224#false} assume !(#t~post6 < 100);havoc #t~post6; {37224#false} is VALID [2022-04-08 12:37:25,834 INFO L290 TraceCheckUtils]: 93: Hoare triple {37224#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37224#false} is VALID [2022-04-08 12:37:25,834 INFO L290 TraceCheckUtils]: 92: Hoare triple {37224#false} assume !(#t~post8 < 100);havoc #t~post8; {37224#false} is VALID [2022-04-08 12:37:25,834 INFO L290 TraceCheckUtils]: 91: Hoare triple {37224#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37224#false} is VALID [2022-04-08 12:37:25,836 INFO L290 TraceCheckUtils]: 90: Hoare triple {37557#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {37224#false} is VALID [2022-04-08 12:37:25,836 INFO L290 TraceCheckUtils]: 89: Hoare triple {37561#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37557#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:37:25,837 INFO L290 TraceCheckUtils]: 88: Hoare triple {37561#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37561#(< ~counter~0 100)} is VALID [2022-04-08 12:37:25,837 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37223#true} {37561#(< ~counter~0 100)} #96#return; {37561#(< ~counter~0 100)} is VALID [2022-04-08 12:37:25,837 INFO L290 TraceCheckUtils]: 86: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:25,837 INFO L290 TraceCheckUtils]: 85: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:25,837 INFO L290 TraceCheckUtils]: 84: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:25,838 INFO L272 TraceCheckUtils]: 83: Hoare triple {37561#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 12:37:25,838 INFO L290 TraceCheckUtils]: 82: Hoare triple {37561#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {37561#(< ~counter~0 100)} is VALID [2022-04-08 12:37:25,839 INFO L290 TraceCheckUtils]: 81: Hoare triple {37586#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37561#(< ~counter~0 100)} is VALID [2022-04-08 12:37:25,839 INFO L290 TraceCheckUtils]: 80: Hoare triple {37586#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37586#(< ~counter~0 99)} is VALID [2022-04-08 12:37:25,839 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37223#true} {37586#(< ~counter~0 99)} #96#return; {37586#(< ~counter~0 99)} is VALID [2022-04-08 12:37:25,840 INFO L290 TraceCheckUtils]: 78: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:25,840 INFO L290 TraceCheckUtils]: 77: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:25,840 INFO L290 TraceCheckUtils]: 76: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:25,840 INFO L272 TraceCheckUtils]: 75: Hoare triple {37586#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 12:37:25,840 INFO L290 TraceCheckUtils]: 74: Hoare triple {37586#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {37586#(< ~counter~0 99)} is VALID [2022-04-08 12:37:25,840 INFO L290 TraceCheckUtils]: 73: Hoare triple {37611#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37586#(< ~counter~0 99)} is VALID [2022-04-08 12:37:25,841 INFO L290 TraceCheckUtils]: 72: Hoare triple {37611#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37611#(< ~counter~0 98)} is VALID [2022-04-08 12:37:25,841 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37223#true} {37611#(< ~counter~0 98)} #96#return; {37611#(< ~counter~0 98)} is VALID [2022-04-08 12:37:25,841 INFO L290 TraceCheckUtils]: 70: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:25,841 INFO L290 TraceCheckUtils]: 69: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:25,841 INFO L290 TraceCheckUtils]: 68: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:25,841 INFO L272 TraceCheckUtils]: 67: Hoare triple {37611#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 12:37:25,842 INFO L290 TraceCheckUtils]: 66: Hoare triple {37611#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {37611#(< ~counter~0 98)} is VALID [2022-04-08 12:37:25,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {37636#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37611#(< ~counter~0 98)} is VALID [2022-04-08 12:37:25,843 INFO L290 TraceCheckUtils]: 64: Hoare triple {37636#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37636#(< ~counter~0 97)} is VALID [2022-04-08 12:37:25,843 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37223#true} {37636#(< ~counter~0 97)} #96#return; {37636#(< ~counter~0 97)} is VALID [2022-04-08 12:37:25,843 INFO L290 TraceCheckUtils]: 62: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:25,843 INFO L290 TraceCheckUtils]: 61: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:25,843 INFO L290 TraceCheckUtils]: 60: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:25,843 INFO L272 TraceCheckUtils]: 59: Hoare triple {37636#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 12:37:25,843 INFO L290 TraceCheckUtils]: 58: Hoare triple {37636#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {37636#(< ~counter~0 97)} is VALID [2022-04-08 12:37:25,844 INFO L290 TraceCheckUtils]: 57: Hoare triple {37661#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37636#(< ~counter~0 97)} is VALID [2022-04-08 12:37:25,844 INFO L290 TraceCheckUtils]: 56: Hoare triple {37661#(< ~counter~0 96)} assume !!(0 != ~r~0); {37661#(< ~counter~0 96)} is VALID [2022-04-08 12:37:25,846 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37223#true} {37661#(< ~counter~0 96)} #94#return; {37661#(< ~counter~0 96)} is VALID [2022-04-08 12:37:25,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:25,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:25,846 INFO L290 TraceCheckUtils]: 52: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:25,846 INFO L272 TraceCheckUtils]: 51: Hoare triple {37661#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 12:37:25,847 INFO L290 TraceCheckUtils]: 50: Hoare triple {37661#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {37661#(< ~counter~0 96)} is VALID [2022-04-08 12:37:25,847 INFO L290 TraceCheckUtils]: 49: Hoare triple {37686#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37661#(< ~counter~0 96)} is VALID [2022-04-08 12:37:25,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {37686#(< ~counter~0 95)} assume !(~r~0 < 0); {37686#(< ~counter~0 95)} is VALID [2022-04-08 12:37:25,848 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37223#true} {37686#(< ~counter~0 95)} #98#return; {37686#(< ~counter~0 95)} is VALID [2022-04-08 12:37:25,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:25,848 INFO L290 TraceCheckUtils]: 45: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:25,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:25,848 INFO L272 TraceCheckUtils]: 43: Hoare triple {37686#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 12:37:25,849 INFO L290 TraceCheckUtils]: 42: Hoare triple {37686#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {37686#(< ~counter~0 95)} is VALID [2022-04-08 12:37:25,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {37711#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37686#(< ~counter~0 95)} is VALID [2022-04-08 12:37:25,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {37711#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37711#(< ~counter~0 94)} is VALID [2022-04-08 12:37:25,850 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37223#true} {37711#(< ~counter~0 94)} #98#return; {37711#(< ~counter~0 94)} is VALID [2022-04-08 12:37:25,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:25,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:25,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:25,850 INFO L272 TraceCheckUtils]: 35: Hoare triple {37711#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 12:37:25,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {37711#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {37711#(< ~counter~0 94)} is VALID [2022-04-08 12:37:25,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {37736#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37711#(< ~counter~0 94)} is VALID [2022-04-08 12:37:25,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {37736#(< ~counter~0 93)} assume !(~r~0 > 0); {37736#(< ~counter~0 93)} is VALID [2022-04-08 12:37:25,852 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37223#true} {37736#(< ~counter~0 93)} #96#return; {37736#(< ~counter~0 93)} is VALID [2022-04-08 12:37:25,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:25,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:25,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:25,852 INFO L272 TraceCheckUtils]: 27: Hoare triple {37736#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 12:37:25,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {37736#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {37736#(< ~counter~0 93)} is VALID [2022-04-08 12:37:25,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {37761#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37736#(< ~counter~0 93)} is VALID [2022-04-08 12:37:25,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {37761#(< ~counter~0 92)} assume !!(0 != ~r~0); {37761#(< ~counter~0 92)} is VALID [2022-04-08 12:37:25,853 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37223#true} {37761#(< ~counter~0 92)} #94#return; {37761#(< ~counter~0 92)} is VALID [2022-04-08 12:37:25,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:25,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:25,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:25,855 INFO L272 TraceCheckUtils]: 19: Hoare triple {37761#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 12:37:25,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {37761#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {37761#(< ~counter~0 92)} is VALID [2022-04-08 12:37:25,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {37786#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37761#(< ~counter~0 92)} is VALID [2022-04-08 12:37:25,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {37786#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37786#(< ~counter~0 91)} is VALID [2022-04-08 12:37:25,861 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37223#true} {37786#(< ~counter~0 91)} #92#return; {37786#(< ~counter~0 91)} is VALID [2022-04-08 12:37:25,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:25,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:25,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:25,861 INFO L272 TraceCheckUtils]: 11: Hoare triple {37786#(< ~counter~0 91)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {37223#true} is VALID [2022-04-08 12:37:25,861 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37223#true} {37786#(< ~counter~0 91)} #90#return; {37786#(< ~counter~0 91)} is VALID [2022-04-08 12:37:25,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:25,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:25,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:25,861 INFO L272 TraceCheckUtils]: 6: Hoare triple {37786#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 12:37:25,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {37786#(< ~counter~0 91)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {37786#(< ~counter~0 91)} is VALID [2022-04-08 12:37:25,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {37786#(< ~counter~0 91)} call #t~ret9 := main(); {37786#(< ~counter~0 91)} is VALID [2022-04-08 12:37:25,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37786#(< ~counter~0 91)} {37223#true} #102#return; {37786#(< ~counter~0 91)} is VALID [2022-04-08 12:37:25,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {37786#(< ~counter~0 91)} assume true; {37786#(< ~counter~0 91)} is VALID [2022-04-08 12:37:25,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {37223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37786#(< ~counter~0 91)} is VALID [2022-04-08 12:37:25,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {37223#true} call ULTIMATE.init(); {37223#true} is VALID [2022-04-08 12:37:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-08 12:37:25,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:25,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242914835] [2022-04-08 12:37:25,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:25,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614261148] [2022-04-08 12:37:25,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614261148] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:25,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:25,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 12:37:25,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:25,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [767548747] [2022-04-08 12:37:25,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [767548747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:25,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:25,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 12:37:25,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151350543] [2022-04-08 12:37:25,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:25,865 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-08 12:37:25,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:25,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 12:37:25,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:25,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 12:37:25,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:25,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 12:37:25,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:37:25,935 INFO L87 Difference]: Start difference. First operand 352 states and 468 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 12:37:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:27,057 INFO L93 Difference]: Finished difference Result 471 states and 642 transitions. [2022-04-08 12:37:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 12:37:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-08 12:37:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 12:37:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-08 12:37:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 12:37:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-08 12:37:27,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-08 12:37:27,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:27,270 INFO L225 Difference]: With dead ends: 471 [2022-04-08 12:37:27,270 INFO L226 Difference]: Without dead ends: 364 [2022-04-08 12:37:27,271 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=412, Invalid=580, Unknown=0, NotChecked=0, Total=992 [2022-04-08 12:37:27,272 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 110 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:37:27,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 238 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:37:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-08 12:37:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-04-08 12:37:27,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:27,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:27,949 INFO L74 IsIncluded]: Start isIncluded. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:27,950 INFO L87 Difference]: Start difference. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:27,958 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-08 12:37:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 12:37:27,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:27,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:27,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-08 12:37:27,960 INFO L87 Difference]: Start difference. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-08 12:37:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:27,968 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-08 12:37:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 12:37:27,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:27,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:27,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:27,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 12:37:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2022-04-08 12:37:27,980 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 99 [2022-04-08 12:37:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:27,980 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2022-04-08 12:37:27,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 12:37:27,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 480 transitions. [2022-04-08 12:37:30,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 12:37:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-08 12:37:30,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:30,799 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:37:30,815 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-08 12:37:30,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:31,000 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:31,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:31,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-08 12:37:31,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:31,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [270426078] [2022-04-08 12:37:31,000 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:31,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-08 12:37:31,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:31,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208244817] [2022-04-08 12:37:31,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:31,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:31,016 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:31,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [729992613] [2022-04-08 12:37:31,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:37:31,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:31,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:31,018 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:37:31,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 12:37:31,122 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:37:31,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:31,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 12:37:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:31,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:31,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {40254#true} call ULTIMATE.init(); {40254#true} is VALID [2022-04-08 12:37:31,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {40254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40262#(<= ~counter~0 0)} {40254#true} #102#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {40262#(<= ~counter~0 0)} call #t~ret9 := main(); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {40262#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {40262#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {40262#(<= ~counter~0 0)} ~cond := #in~cond; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {40262#(<= ~counter~0 0)} assume !(0 == ~cond); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40262#(<= ~counter~0 0)} {40262#(<= ~counter~0 0)} #90#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,672 INFO L272 TraceCheckUtils]: 11: Hoare triple {40262#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {40262#(<= ~counter~0 0)} ~cond := #in~cond; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {40262#(<= ~counter~0 0)} assume !(0 == ~cond); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,673 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40262#(<= ~counter~0 0)} {40262#(<= ~counter~0 0)} #92#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {40262#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:31,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {40262#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:31,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {40311#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:31,675 INFO L272 TraceCheckUtils]: 19: Hoare triple {40311#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:31,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {40311#(<= ~counter~0 1)} ~cond := #in~cond; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:31,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {40311#(<= ~counter~0 1)} assume !(0 == ~cond); {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:31,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {40311#(<= ~counter~0 1)} assume true; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:31,676 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40311#(<= ~counter~0 1)} {40311#(<= ~counter~0 1)} #94#return; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:31,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {40311#(<= ~counter~0 1)} assume !!(0 != ~r~0); {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:31,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {40311#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:31,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {40336#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:31,678 INFO L272 TraceCheckUtils]: 27: Hoare triple {40336#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:31,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {40336#(<= ~counter~0 2)} ~cond := #in~cond; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:31,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {40336#(<= ~counter~0 2)} assume !(0 == ~cond); {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:31,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {40336#(<= ~counter~0 2)} assume true; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:31,679 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40336#(<= ~counter~0 2)} {40336#(<= ~counter~0 2)} #96#return; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:31,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {40336#(<= ~counter~0 2)} assume !(~r~0 > 0); {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:31,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {40336#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:31,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {40361#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:31,680 INFO L272 TraceCheckUtils]: 35: Hoare triple {40361#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40361#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:31,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {40361#(<= ~counter~0 3)} ~cond := #in~cond; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:31,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {40361#(<= ~counter~0 3)} assume !(0 == ~cond); {40361#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:31,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {40361#(<= ~counter~0 3)} assume true; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:31,682 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40361#(<= ~counter~0 3)} {40361#(<= ~counter~0 3)} #98#return; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:31,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {40361#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:31,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {40361#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:31,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {40386#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:31,683 INFO L272 TraceCheckUtils]: 43: Hoare triple {40386#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:31,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {40386#(<= ~counter~0 4)} ~cond := #in~cond; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:31,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {40386#(<= ~counter~0 4)} assume !(0 == ~cond); {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:31,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {40386#(<= ~counter~0 4)} assume true; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:31,685 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40386#(<= ~counter~0 4)} {40386#(<= ~counter~0 4)} #98#return; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:31,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {40386#(<= ~counter~0 4)} assume !(~r~0 < 0); {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:31,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {40386#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:31,686 INFO L290 TraceCheckUtils]: 50: Hoare triple {40411#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:31,686 INFO L272 TraceCheckUtils]: 51: Hoare triple {40411#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:31,686 INFO L290 TraceCheckUtils]: 52: Hoare triple {40411#(<= ~counter~0 5)} ~cond := #in~cond; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:31,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {40411#(<= ~counter~0 5)} assume !(0 == ~cond); {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:31,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {40411#(<= ~counter~0 5)} assume true; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:31,687 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40411#(<= ~counter~0 5)} {40411#(<= ~counter~0 5)} #94#return; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:31,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {40411#(<= ~counter~0 5)} assume !!(0 != ~r~0); {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:31,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {40411#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:31,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {40436#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:31,689 INFO L272 TraceCheckUtils]: 59: Hoare triple {40436#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40436#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:31,689 INFO L290 TraceCheckUtils]: 60: Hoare triple {40436#(<= ~counter~0 6)} ~cond := #in~cond; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:31,689 INFO L290 TraceCheckUtils]: 61: Hoare triple {40436#(<= ~counter~0 6)} assume !(0 == ~cond); {40436#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:31,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {40436#(<= ~counter~0 6)} assume true; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:31,690 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40436#(<= ~counter~0 6)} {40436#(<= ~counter~0 6)} #96#return; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:31,690 INFO L290 TraceCheckUtils]: 64: Hoare triple {40436#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:31,691 INFO L290 TraceCheckUtils]: 65: Hoare triple {40436#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:31,691 INFO L290 TraceCheckUtils]: 66: Hoare triple {40461#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:31,692 INFO L272 TraceCheckUtils]: 67: Hoare triple {40461#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40461#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:31,692 INFO L290 TraceCheckUtils]: 68: Hoare triple {40461#(<= ~counter~0 7)} ~cond := #in~cond; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:31,692 INFO L290 TraceCheckUtils]: 69: Hoare triple {40461#(<= ~counter~0 7)} assume !(0 == ~cond); {40461#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:31,693 INFO L290 TraceCheckUtils]: 70: Hoare triple {40461#(<= ~counter~0 7)} assume true; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:31,693 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40461#(<= ~counter~0 7)} {40461#(<= ~counter~0 7)} #96#return; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:31,693 INFO L290 TraceCheckUtils]: 72: Hoare triple {40461#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:31,694 INFO L290 TraceCheckUtils]: 73: Hoare triple {40461#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:31,694 INFO L290 TraceCheckUtils]: 74: Hoare triple {40486#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:31,695 INFO L272 TraceCheckUtils]: 75: Hoare triple {40486#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:31,695 INFO L290 TraceCheckUtils]: 76: Hoare triple {40486#(<= ~counter~0 8)} ~cond := #in~cond; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:31,695 INFO L290 TraceCheckUtils]: 77: Hoare triple {40486#(<= ~counter~0 8)} assume !(0 == ~cond); {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:31,695 INFO L290 TraceCheckUtils]: 78: Hoare triple {40486#(<= ~counter~0 8)} assume true; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:31,696 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40486#(<= ~counter~0 8)} {40486#(<= ~counter~0 8)} #96#return; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:31,696 INFO L290 TraceCheckUtils]: 80: Hoare triple {40486#(<= ~counter~0 8)} assume !(~r~0 > 0); {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:31,697 INFO L290 TraceCheckUtils]: 81: Hoare triple {40486#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:31,697 INFO L290 TraceCheckUtils]: 82: Hoare triple {40511#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:31,697 INFO L272 TraceCheckUtils]: 83: Hoare triple {40511#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:31,698 INFO L290 TraceCheckUtils]: 84: Hoare triple {40511#(<= ~counter~0 9)} ~cond := #in~cond; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:31,698 INFO L290 TraceCheckUtils]: 85: Hoare triple {40511#(<= ~counter~0 9)} assume !(0 == ~cond); {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:31,698 INFO L290 TraceCheckUtils]: 86: Hoare triple {40511#(<= ~counter~0 9)} assume true; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:31,699 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40511#(<= ~counter~0 9)} {40511#(<= ~counter~0 9)} #98#return; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:31,699 INFO L290 TraceCheckUtils]: 88: Hoare triple {40511#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:31,699 INFO L290 TraceCheckUtils]: 89: Hoare triple {40511#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:31,700 INFO L290 TraceCheckUtils]: 90: Hoare triple {40536#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:31,700 INFO L272 TraceCheckUtils]: 91: Hoare triple {40536#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:31,700 INFO L290 TraceCheckUtils]: 92: Hoare triple {40536#(<= ~counter~0 10)} ~cond := #in~cond; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:31,701 INFO L290 TraceCheckUtils]: 93: Hoare triple {40536#(<= ~counter~0 10)} assume !(0 == ~cond); {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:31,701 INFO L290 TraceCheckUtils]: 94: Hoare triple {40536#(<= ~counter~0 10)} assume true; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:31,701 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40536#(<= ~counter~0 10)} {40536#(<= ~counter~0 10)} #98#return; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:31,702 INFO L290 TraceCheckUtils]: 96: Hoare triple {40536#(<= ~counter~0 10)} assume !(~r~0 < 0); {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:31,702 INFO L290 TraceCheckUtils]: 97: Hoare triple {40536#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40561#(<= |main_#t~post6| 10)} is VALID [2022-04-08 12:37:31,702 INFO L290 TraceCheckUtils]: 98: Hoare triple {40561#(<= |main_#t~post6| 10)} assume !(#t~post6 < 100);havoc #t~post6; {40255#false} is VALID [2022-04-08 12:37:31,702 INFO L272 TraceCheckUtils]: 99: Hoare triple {40255#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40255#false} is VALID [2022-04-08 12:37:31,702 INFO L290 TraceCheckUtils]: 100: Hoare triple {40255#false} ~cond := #in~cond; {40255#false} is VALID [2022-04-08 12:37:31,702 INFO L290 TraceCheckUtils]: 101: Hoare triple {40255#false} assume 0 == ~cond; {40255#false} is VALID [2022-04-08 12:37:31,703 INFO L290 TraceCheckUtils]: 102: Hoare triple {40255#false} assume !false; {40255#false} is VALID [2022-04-08 12:37:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 236 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:37:31,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:32,263 INFO L290 TraceCheckUtils]: 102: Hoare triple {40255#false} assume !false; {40255#false} is VALID [2022-04-08 12:37:32,263 INFO L290 TraceCheckUtils]: 101: Hoare triple {40255#false} assume 0 == ~cond; {40255#false} is VALID [2022-04-08 12:37:32,263 INFO L290 TraceCheckUtils]: 100: Hoare triple {40255#false} ~cond := #in~cond; {40255#false} is VALID [2022-04-08 12:37:32,263 INFO L272 TraceCheckUtils]: 99: Hoare triple {40255#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40255#false} is VALID [2022-04-08 12:37:32,264 INFO L290 TraceCheckUtils]: 98: Hoare triple {40589#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {40255#false} is VALID [2022-04-08 12:37:32,264 INFO L290 TraceCheckUtils]: 97: Hoare triple {40593#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40589#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:37:32,264 INFO L290 TraceCheckUtils]: 96: Hoare triple {40593#(< ~counter~0 100)} assume !(~r~0 < 0); {40593#(< ~counter~0 100)} is VALID [2022-04-08 12:37:32,265 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40254#true} {40593#(< ~counter~0 100)} #98#return; {40593#(< ~counter~0 100)} is VALID [2022-04-08 12:37:32,265 INFO L290 TraceCheckUtils]: 94: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:32,265 INFO L290 TraceCheckUtils]: 93: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:32,265 INFO L290 TraceCheckUtils]: 92: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:32,265 INFO L272 TraceCheckUtils]: 91: Hoare triple {40593#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 12:37:32,265 INFO L290 TraceCheckUtils]: 90: Hoare triple {40593#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {40593#(< ~counter~0 100)} is VALID [2022-04-08 12:37:32,266 INFO L290 TraceCheckUtils]: 89: Hoare triple {40618#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40593#(< ~counter~0 100)} is VALID [2022-04-08 12:37:32,267 INFO L290 TraceCheckUtils]: 88: Hoare triple {40618#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40618#(< ~counter~0 99)} is VALID [2022-04-08 12:37:32,267 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40254#true} {40618#(< ~counter~0 99)} #98#return; {40618#(< ~counter~0 99)} is VALID [2022-04-08 12:37:32,267 INFO L290 TraceCheckUtils]: 86: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:32,267 INFO L290 TraceCheckUtils]: 85: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:32,267 INFO L290 TraceCheckUtils]: 84: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:32,267 INFO L272 TraceCheckUtils]: 83: Hoare triple {40618#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 12:37:32,268 INFO L290 TraceCheckUtils]: 82: Hoare triple {40618#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {40618#(< ~counter~0 99)} is VALID [2022-04-08 12:37:32,268 INFO L290 TraceCheckUtils]: 81: Hoare triple {40643#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40618#(< ~counter~0 99)} is VALID [2022-04-08 12:37:32,268 INFO L290 TraceCheckUtils]: 80: Hoare triple {40643#(< ~counter~0 98)} assume !(~r~0 > 0); {40643#(< ~counter~0 98)} is VALID [2022-04-08 12:37:32,269 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40254#true} {40643#(< ~counter~0 98)} #96#return; {40643#(< ~counter~0 98)} is VALID [2022-04-08 12:37:32,269 INFO L290 TraceCheckUtils]: 78: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:32,269 INFO L290 TraceCheckUtils]: 77: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:32,269 INFO L290 TraceCheckUtils]: 76: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:32,269 INFO L272 TraceCheckUtils]: 75: Hoare triple {40643#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 12:37:32,269 INFO L290 TraceCheckUtils]: 74: Hoare triple {40643#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {40643#(< ~counter~0 98)} is VALID [2022-04-08 12:37:32,270 INFO L290 TraceCheckUtils]: 73: Hoare triple {40668#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40643#(< ~counter~0 98)} is VALID [2022-04-08 12:37:32,270 INFO L290 TraceCheckUtils]: 72: Hoare triple {40668#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40668#(< ~counter~0 97)} is VALID [2022-04-08 12:37:32,271 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40254#true} {40668#(< ~counter~0 97)} #96#return; {40668#(< ~counter~0 97)} is VALID [2022-04-08 12:37:32,271 INFO L290 TraceCheckUtils]: 70: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:32,271 INFO L290 TraceCheckUtils]: 69: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:32,271 INFO L290 TraceCheckUtils]: 68: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:32,271 INFO L272 TraceCheckUtils]: 67: Hoare triple {40668#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 12:37:32,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {40668#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {40668#(< ~counter~0 97)} is VALID [2022-04-08 12:37:32,272 INFO L290 TraceCheckUtils]: 65: Hoare triple {40693#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40668#(< ~counter~0 97)} is VALID [2022-04-08 12:37:32,272 INFO L290 TraceCheckUtils]: 64: Hoare triple {40693#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40693#(< ~counter~0 96)} is VALID [2022-04-08 12:37:32,272 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40254#true} {40693#(< ~counter~0 96)} #96#return; {40693#(< ~counter~0 96)} is VALID [2022-04-08 12:37:32,272 INFO L290 TraceCheckUtils]: 62: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:32,272 INFO L290 TraceCheckUtils]: 61: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:32,273 INFO L290 TraceCheckUtils]: 60: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:32,273 INFO L272 TraceCheckUtils]: 59: Hoare triple {40693#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 12:37:32,273 INFO L290 TraceCheckUtils]: 58: Hoare triple {40693#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {40693#(< ~counter~0 96)} is VALID [2022-04-08 12:37:32,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {40718#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40693#(< ~counter~0 96)} is VALID [2022-04-08 12:37:32,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {40718#(< ~counter~0 95)} assume !!(0 != ~r~0); {40718#(< ~counter~0 95)} is VALID [2022-04-08 12:37:32,274 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40254#true} {40718#(< ~counter~0 95)} #94#return; {40718#(< ~counter~0 95)} is VALID [2022-04-08 12:37:32,274 INFO L290 TraceCheckUtils]: 54: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:32,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:32,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:32,274 INFO L272 TraceCheckUtils]: 51: Hoare triple {40718#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 12:37:32,275 INFO L290 TraceCheckUtils]: 50: Hoare triple {40718#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {40718#(< ~counter~0 95)} is VALID [2022-04-08 12:37:32,275 INFO L290 TraceCheckUtils]: 49: Hoare triple {40743#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40718#(< ~counter~0 95)} is VALID [2022-04-08 12:37:32,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {40743#(< ~counter~0 94)} assume !(~r~0 < 0); {40743#(< ~counter~0 94)} is VALID [2022-04-08 12:37:32,276 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40254#true} {40743#(< ~counter~0 94)} #98#return; {40743#(< ~counter~0 94)} is VALID [2022-04-08 12:37:32,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:32,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:32,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:32,276 INFO L272 TraceCheckUtils]: 43: Hoare triple {40743#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 12:37:32,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {40743#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {40743#(< ~counter~0 94)} is VALID [2022-04-08 12:37:32,277 INFO L290 TraceCheckUtils]: 41: Hoare triple {40768#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40743#(< ~counter~0 94)} is VALID [2022-04-08 12:37:32,277 INFO L290 TraceCheckUtils]: 40: Hoare triple {40768#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40768#(< ~counter~0 93)} is VALID [2022-04-08 12:37:32,278 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40254#true} {40768#(< ~counter~0 93)} #98#return; {40768#(< ~counter~0 93)} is VALID [2022-04-08 12:37:32,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:32,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:32,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:32,278 INFO L272 TraceCheckUtils]: 35: Hoare triple {40768#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 12:37:32,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {40768#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {40768#(< ~counter~0 93)} is VALID [2022-04-08 12:37:32,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {40793#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40768#(< ~counter~0 93)} is VALID [2022-04-08 12:37:32,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {40793#(< ~counter~0 92)} assume !(~r~0 > 0); {40793#(< ~counter~0 92)} is VALID [2022-04-08 12:37:32,279 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40254#true} {40793#(< ~counter~0 92)} #96#return; {40793#(< ~counter~0 92)} is VALID [2022-04-08 12:37:32,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:32,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:32,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:32,280 INFO L272 TraceCheckUtils]: 27: Hoare triple {40793#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 12:37:32,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {40793#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {40793#(< ~counter~0 92)} is VALID [2022-04-08 12:37:32,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {40818#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40793#(< ~counter~0 92)} is VALID [2022-04-08 12:37:32,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {40818#(< ~counter~0 91)} assume !!(0 != ~r~0); {40818#(< ~counter~0 91)} is VALID [2022-04-08 12:37:32,281 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40254#true} {40818#(< ~counter~0 91)} #94#return; {40818#(< ~counter~0 91)} is VALID [2022-04-08 12:37:32,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:32,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:32,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:32,281 INFO L272 TraceCheckUtils]: 19: Hoare triple {40818#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 12:37:32,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {40818#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {40818#(< ~counter~0 91)} is VALID [2022-04-08 12:37:32,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {40843#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40818#(< ~counter~0 91)} is VALID [2022-04-08 12:37:32,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {40843#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {40843#(< ~counter~0 90)} is VALID [2022-04-08 12:37:32,283 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40254#true} {40843#(< ~counter~0 90)} #92#return; {40843#(< ~counter~0 90)} is VALID [2022-04-08 12:37:32,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:32,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:32,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:32,283 INFO L272 TraceCheckUtils]: 11: Hoare triple {40843#(< ~counter~0 90)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40254#true} is VALID [2022-04-08 12:37:32,283 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40254#true} {40843#(< ~counter~0 90)} #90#return; {40843#(< ~counter~0 90)} is VALID [2022-04-08 12:37:32,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:32,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:32,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:32,284 INFO L272 TraceCheckUtils]: 6: Hoare triple {40843#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 12:37:32,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {40843#(< ~counter~0 90)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40843#(< ~counter~0 90)} is VALID [2022-04-08 12:37:32,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {40843#(< ~counter~0 90)} call #t~ret9 := main(); {40843#(< ~counter~0 90)} is VALID [2022-04-08 12:37:32,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40843#(< ~counter~0 90)} {40254#true} #102#return; {40843#(< ~counter~0 90)} is VALID [2022-04-08 12:37:32,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {40843#(< ~counter~0 90)} assume true; {40843#(< ~counter~0 90)} is VALID [2022-04-08 12:37:32,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {40254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40843#(< ~counter~0 90)} is VALID [2022-04-08 12:37:32,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {40254#true} call ULTIMATE.init(); {40254#true} is VALID [2022-04-08 12:37:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 12:37:32,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:32,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208244817] [2022-04-08 12:37:32,286 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:32,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729992613] [2022-04-08 12:37:32,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729992613] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:32,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:32,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-08 12:37:32,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:32,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [270426078] [2022-04-08 12:37:32,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [270426078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:32,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:32,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 12:37:32,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496428825] [2022-04-08 12:37:32,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:32,287 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 103 [2022-04-08 12:37:32,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:32,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:32,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:32,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 12:37:32,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:32,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 12:37:32,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-08 12:37:32,370 INFO L87 Difference]: Start difference. First operand 364 states and 480 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:33,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:33,705 INFO L93 Difference]: Finished difference Result 407 states and 538 transitions. [2022-04-08 12:37:33,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 12:37:33,706 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 103 [2022-04-08 12:37:33,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-08 12:37:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-08 12:37:33,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 214 transitions. [2022-04-08 12:37:33,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:33,879 INFO L225 Difference]: With dead ends: 407 [2022-04-08 12:37:33,879 INFO L226 Difference]: Without dead ends: 396 [2022-04-08 12:37:33,880 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-08 12:37:33,880 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 146 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:37:33,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 250 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:37:33,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-08 12:37:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 377. [2022-04-08 12:37:34,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:34,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-08 12:37:34,515 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-08 12:37:34,516 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-08 12:37:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:34,526 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-08 12:37:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-08 12:37:34,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:34,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:34,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 396 states. [2022-04-08 12:37:34,527 INFO L87 Difference]: Start difference. First operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 396 states. [2022-04-08 12:37:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:34,537 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-08 12:37:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-08 12:37:34,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:34,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:34,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:34,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-08 12:37:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 501 transitions. [2022-04-08 12:37:34,550 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 501 transitions. Word has length 103 [2022-04-08 12:37:34,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:34,550 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 501 transitions. [2022-04-08 12:37:34,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:34,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 501 transitions. [2022-04-08 12:37:37,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 500 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 501 transitions. [2022-04-08 12:37:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 12:37:37,547 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:37,547 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:37:37,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-08 12:37:37,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:37,751 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:37,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 9 times [2022-04-08 12:37:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:37,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1610983986] [2022-04-08 12:37:37,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 10 times [2022-04-08 12:37:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:37,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957098638] [2022-04-08 12:37:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:37,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:37,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [193560582] [2022-04-08 12:37:37,765 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:37:37,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:37,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:37,766 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:37:37,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-08 12:37:37,833 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:37:37,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:37,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:37:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:37,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:38,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {43271#true} call ULTIMATE.init(); {43271#true} is VALID [2022-04-08 12:37:38,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {43271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43271#true} {43271#true} #102#return; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {43271#true} call #t~ret9 := main(); {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {43271#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L272 TraceCheckUtils]: 6: Hoare triple {43271#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43271#true} {43271#true} #90#return; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L272 TraceCheckUtils]: 11: Hoare triple {43271#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43271#true} {43271#true} #92#return; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {43271#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {43271#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {43271#true} assume !!(#t~post6 < 100);havoc #t~post6; {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L272 TraceCheckUtils]: 19: Hoare triple {43271#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:38,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43271#true} {43271#true} #94#return; {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {43271#true} assume !!(0 != ~r~0); {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {43271#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {43271#true} assume !!(#t~post7 < 100);havoc #t~post7; {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L272 TraceCheckUtils]: 27: Hoare triple {43271#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43271#true} {43271#true} #96#return; {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {43271#true} assume !(~r~0 > 0); {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {43271#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {43271#true} assume !!(#t~post8 < 100);havoc #t~post8; {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L272 TraceCheckUtils]: 35: Hoare triple {43271#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,729 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43271#true} {43271#true} #98#return; {43271#true} is VALID [2022-04-08 12:37:38,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {43271#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 12:37:38,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 12:37:38,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 100);havoc #t~post8; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 12:37:38,731 INFO L272 TraceCheckUtils]: 43: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:38,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:38,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:38,731 INFO L290 TraceCheckUtils]: 46: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,732 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {43271#true} {43396#(< (+ main_~r~0 2) main_~u~0)} #98#return; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 12:37:38,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 12:37:38,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 12:37:38,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 100);havoc #t~post6; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 12:37:38,733 INFO L272 TraceCheckUtils]: 51: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:38,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:38,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:38,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,733 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43271#true} {43396#(< (+ main_~r~0 2) main_~u~0)} #94#return; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 12:37:38,734 INFO L290 TraceCheckUtils]: 56: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 12:37:38,734 INFO L290 TraceCheckUtils]: 57: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 12:37:38,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 12:37:38,734 INFO L272 TraceCheckUtils]: 59: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:38,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:38,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:38,735 INFO L290 TraceCheckUtils]: 62: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,735 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {43271#true} {43396#(< (+ main_~r~0 2) main_~u~0)} #96#return; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 12:37:38,736 INFO L290 TraceCheckUtils]: 64: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-08 12:37:38,736 INFO L290 TraceCheckUtils]: 65: Hoare triple {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-08 12:37:38,736 INFO L290 TraceCheckUtils]: 66: Hoare triple {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-08 12:37:38,736 INFO L272 TraceCheckUtils]: 67: Hoare triple {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:38,736 INFO L290 TraceCheckUtils]: 68: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:38,736 INFO L290 TraceCheckUtils]: 69: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:38,736 INFO L290 TraceCheckUtils]: 70: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,737 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {43271#true} {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-08 12:37:38,737 INFO L290 TraceCheckUtils]: 72: Hoare triple {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:37:38,738 INFO L290 TraceCheckUtils]: 73: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:37:38,738 INFO L290 TraceCheckUtils]: 74: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 100);havoc #t~post7; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:37:38,738 INFO L272 TraceCheckUtils]: 75: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:38,738 INFO L290 TraceCheckUtils]: 76: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:38,738 INFO L290 TraceCheckUtils]: 77: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:38,738 INFO L290 TraceCheckUtils]: 78: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,739 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43271#true} {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #96#return; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:37:38,739 INFO L290 TraceCheckUtils]: 80: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:37:38,739 INFO L290 TraceCheckUtils]: 81: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:37:38,739 INFO L290 TraceCheckUtils]: 82: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:37:38,739 INFO L272 TraceCheckUtils]: 83: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:38,740 INFO L290 TraceCheckUtils]: 84: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:38,740 INFO L290 TraceCheckUtils]: 85: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:38,740 INFO L290 TraceCheckUtils]: 86: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,740 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {43271#true} {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #98#return; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:37:38,741 INFO L290 TraceCheckUtils]: 88: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-08 12:37:38,741 INFO L290 TraceCheckUtils]: 89: Hoare triple {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-08 12:37:38,741 INFO L290 TraceCheckUtils]: 90: Hoare triple {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-08 12:37:38,741 INFO L272 TraceCheckUtils]: 91: Hoare triple {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:38,742 INFO L290 TraceCheckUtils]: 92: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:38,742 INFO L290 TraceCheckUtils]: 93: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:38,742 INFO L290 TraceCheckUtils]: 94: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:38,742 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {43271#true} {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} #98#return; {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-08 12:37:38,743 INFO L290 TraceCheckUtils]: 96: Hoare triple {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43272#false} is VALID [2022-04-08 12:37:38,743 INFO L290 TraceCheckUtils]: 97: Hoare triple {43272#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43272#false} is VALID [2022-04-08 12:37:38,743 INFO L290 TraceCheckUtils]: 98: Hoare triple {43272#false} assume !(#t~post8 < 100);havoc #t~post8; {43272#false} is VALID [2022-04-08 12:37:38,743 INFO L290 TraceCheckUtils]: 99: Hoare triple {43272#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43272#false} is VALID [2022-04-08 12:37:38,743 INFO L290 TraceCheckUtils]: 100: Hoare triple {43272#false} assume !(#t~post6 < 100);havoc #t~post6; {43272#false} is VALID [2022-04-08 12:37:38,743 INFO L272 TraceCheckUtils]: 101: Hoare triple {43272#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43272#false} is VALID [2022-04-08 12:37:38,743 INFO L290 TraceCheckUtils]: 102: Hoare triple {43272#false} ~cond := #in~cond; {43272#false} is VALID [2022-04-08 12:37:38,743 INFO L290 TraceCheckUtils]: 103: Hoare triple {43272#false} assume 0 == ~cond; {43272#false} is VALID [2022-04-08 12:37:38,743 INFO L290 TraceCheckUtils]: 104: Hoare triple {43272#false} assume !false; {43272#false} is VALID [2022-04-08 12:37:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 12:37:38,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:39,191 INFO L290 TraceCheckUtils]: 104: Hoare triple {43272#false} assume !false; {43272#false} is VALID [2022-04-08 12:37:39,191 INFO L290 TraceCheckUtils]: 103: Hoare triple {43272#false} assume 0 == ~cond; {43272#false} is VALID [2022-04-08 12:37:39,191 INFO L290 TraceCheckUtils]: 102: Hoare triple {43272#false} ~cond := #in~cond; {43272#false} is VALID [2022-04-08 12:37:39,191 INFO L272 TraceCheckUtils]: 101: Hoare triple {43272#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43272#false} is VALID [2022-04-08 12:37:39,192 INFO L290 TraceCheckUtils]: 100: Hoare triple {43272#false} assume !(#t~post6 < 100);havoc #t~post6; {43272#false} is VALID [2022-04-08 12:37:39,192 INFO L290 TraceCheckUtils]: 99: Hoare triple {43272#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43272#false} is VALID [2022-04-08 12:37:39,192 INFO L290 TraceCheckUtils]: 98: Hoare triple {43272#false} assume !(#t~post8 < 100);havoc #t~post8; {43272#false} is VALID [2022-04-08 12:37:39,192 INFO L290 TraceCheckUtils]: 97: Hoare triple {43272#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43272#false} is VALID [2022-04-08 12:37:39,192 INFO L290 TraceCheckUtils]: 96: Hoare triple {43616#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43272#false} is VALID [2022-04-08 12:37:39,193 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {43271#true} {43616#(not (< main_~r~0 0))} #98#return; {43616#(not (< main_~r~0 0))} is VALID [2022-04-08 12:37:39,193 INFO L290 TraceCheckUtils]: 94: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,193 INFO L290 TraceCheckUtils]: 93: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:39,193 INFO L290 TraceCheckUtils]: 92: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:39,193 INFO L272 TraceCheckUtils]: 91: Hoare triple {43616#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:39,194 INFO L290 TraceCheckUtils]: 90: Hoare triple {43616#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {43616#(not (< main_~r~0 0))} is VALID [2022-04-08 12:37:39,194 INFO L290 TraceCheckUtils]: 89: Hoare triple {43616#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43616#(not (< main_~r~0 0))} is VALID [2022-04-08 12:37:39,195 INFO L290 TraceCheckUtils]: 88: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43616#(not (< main_~r~0 0))} is VALID [2022-04-08 12:37:39,195 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {43271#true} {43641#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:37:39,195 INFO L290 TraceCheckUtils]: 86: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,196 INFO L290 TraceCheckUtils]: 85: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:39,196 INFO L290 TraceCheckUtils]: 84: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:39,196 INFO L272 TraceCheckUtils]: 83: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:39,196 INFO L290 TraceCheckUtils]: 82: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:37:39,196 INFO L290 TraceCheckUtils]: 81: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:37:39,197 INFO L290 TraceCheckUtils]: 80: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:37:39,197 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43271#true} {43641#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:37:39,197 INFO L290 TraceCheckUtils]: 78: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,197 INFO L290 TraceCheckUtils]: 77: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:39,197 INFO L290 TraceCheckUtils]: 76: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:39,198 INFO L272 TraceCheckUtils]: 75: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:39,198 INFO L290 TraceCheckUtils]: 74: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:37:39,198 INFO L290 TraceCheckUtils]: 73: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:37:39,199 INFO L290 TraceCheckUtils]: 72: Hoare triple {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:37:39,200 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {43271#true} {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:37:39,200 INFO L290 TraceCheckUtils]: 70: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:39,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:39,200 INFO L272 TraceCheckUtils]: 67: Hoare triple {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:39,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:37:39,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:37:39,202 INFO L290 TraceCheckUtils]: 64: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:37:39,202 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {43271#true} {43715#(<= main_~r~0 main_~u~0)} #96#return; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:37:39,202 INFO L290 TraceCheckUtils]: 62: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,202 INFO L290 TraceCheckUtils]: 61: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:39,203 INFO L290 TraceCheckUtils]: 60: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:39,203 INFO L272 TraceCheckUtils]: 59: Hoare triple {43715#(<= main_~r~0 main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:39,203 INFO L290 TraceCheckUtils]: 58: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:37:39,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {43715#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:37:39,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(0 != ~r~0); {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:37:39,204 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43271#true} {43715#(<= main_~r~0 main_~u~0)} #94#return; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:37:39,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:39,205 INFO L290 TraceCheckUtils]: 52: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:39,205 INFO L272 TraceCheckUtils]: 51: Hoare triple {43715#(<= main_~r~0 main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:39,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(#t~post6 < 100);havoc #t~post6; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:37:39,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {43715#(<= main_~r~0 main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:37:39,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !(~r~0 < 0); {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:37:39,206 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {43271#true} {43715#(<= main_~r~0 main_~u~0)} #98#return; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:37:39,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:39,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:39,207 INFO L272 TraceCheckUtils]: 43: Hoare triple {43715#(<= main_~r~0 main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:39,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(#t~post8 < 100);havoc #t~post8; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:37:39,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {43715#(<= main_~r~0 main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:37:39,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {43271#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:37:39,208 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43271#true} {43271#true} #98#return; {43271#true} is VALID [2022-04-08 12:37:39,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L272 TraceCheckUtils]: 35: Hoare triple {43271#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {43271#true} assume !!(#t~post8 < 100);havoc #t~post8; {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {43271#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {43271#true} assume !(~r~0 > 0); {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43271#true} {43271#true} #96#return; {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L272 TraceCheckUtils]: 27: Hoare triple {43271#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {43271#true} assume !!(#t~post7 < 100);havoc #t~post7; {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {43271#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {43271#true} assume !!(0 != ~r~0); {43271#true} is VALID [2022-04-08 12:37:39,209 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43271#true} {43271#true} #94#return; {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L272 TraceCheckUtils]: 19: Hoare triple {43271#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {43271#true} assume !!(#t~post6 < 100);havoc #t~post6; {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {43271#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {43271#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43271#true} {43271#true} #92#return; {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L272 TraceCheckUtils]: 11: Hoare triple {43271#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43271#true} {43271#true} #90#return; {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 12:37:39,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 12:37:39,211 INFO L272 TraceCheckUtils]: 6: Hoare triple {43271#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 12:37:39,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {43271#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {43271#true} is VALID [2022-04-08 12:37:39,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {43271#true} call #t~ret9 := main(); {43271#true} is VALID [2022-04-08 12:37:39,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43271#true} {43271#true} #102#return; {43271#true} is VALID [2022-04-08 12:37:39,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 12:37:39,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {43271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43271#true} is VALID [2022-04-08 12:37:39,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {43271#true} call ULTIMATE.init(); {43271#true} is VALID [2022-04-08 12:37:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 12:37:39,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:39,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957098638] [2022-04-08 12:37:39,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:39,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193560582] [2022-04-08 12:37:39,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193560582] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:39,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:39,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 12:37:39,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:39,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1610983986] [2022-04-08 12:37:39,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1610983986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:39,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:39,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:37:39,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372011878] [2022-04-08 12:37:39,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:39,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-08 12:37:39,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:39,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 12:37:39,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:39,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:37:39,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:39,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:37:39,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:37:39,276 INFO L87 Difference]: Start difference. First operand 377 states and 501 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 12:37:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:41,085 INFO L93 Difference]: Finished difference Result 649 states and 907 transitions. [2022-04-08 12:37:41,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 12:37:41,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-08 12:37:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 12:37:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-08 12:37:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 12:37:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-08 12:37:41,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 171 transitions. [2022-04-08 12:37:41,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:41,279 INFO L225 Difference]: With dead ends: 649 [2022-04-08 12:37:41,279 INFO L226 Difference]: Without dead ends: 588 [2022-04-08 12:37:41,280 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 12:37:41,280 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 38 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:37:41,280 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 280 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:37:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-08 12:37:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 504. [2022-04-08 12:37:42,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:42,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 12:37:42,327 INFO L74 IsIncluded]: Start isIncluded. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 12:37:42,328 INFO L87 Difference]: Start difference. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 12:37:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:42,349 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-08 12:37:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-08 12:37:42,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:42,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:42,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 588 states. [2022-04-08 12:37:42,352 INFO L87 Difference]: Start difference. First operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 588 states. [2022-04-08 12:37:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:42,373 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-08 12:37:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-08 12:37:42,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:42,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:42,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:42,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 12:37:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 695 transitions. [2022-04-08 12:37:42,396 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 695 transitions. Word has length 105 [2022-04-08 12:37:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:42,396 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 695 transitions. [2022-04-08 12:37:42,397 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 12:37:42,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 695 transitions. [2022-04-08 12:37:45,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 695 edges. 695 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 695 transitions. [2022-04-08 12:37:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 12:37:45,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:45,228 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:37:45,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-08 12:37:45,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:45,428 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:45,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:45,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 11 times [2022-04-08 12:37:45,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:45,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1350465866] [2022-04-08 12:37:45,429 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 12 times [2022-04-08 12:37:45,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:45,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251824693] [2022-04-08 12:37:45,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:45,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:45,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:45,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023702180] [2022-04-08 12:37:45,442 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:37:45,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:45,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:45,443 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:37:45,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-08 12:37:45,563 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 12:37:45,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:45,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 12:37:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:45,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:46,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {47398#true} call ULTIMATE.init(); {47398#true} is VALID [2022-04-08 12:37:46,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {47398#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {47406#(<= ~counter~0 0)} assume true; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47406#(<= ~counter~0 0)} {47398#true} #102#return; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {47406#(<= ~counter~0 0)} call #t~ret9 := main(); {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {47406#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,083 INFO L272 TraceCheckUtils]: 6: Hoare triple {47406#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {47406#(<= ~counter~0 0)} ~cond := #in~cond; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {47406#(<= ~counter~0 0)} assume !(0 == ~cond); {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {47406#(<= ~counter~0 0)} assume true; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,084 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47406#(<= ~counter~0 0)} {47406#(<= ~counter~0 0)} #90#return; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,084 INFO L272 TraceCheckUtils]: 11: Hoare triple {47406#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {47406#(<= ~counter~0 0)} ~cond := #in~cond; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {47406#(<= ~counter~0 0)} assume !(0 == ~cond); {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {47406#(<= ~counter~0 0)} assume true; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,086 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47406#(<= ~counter~0 0)} {47406#(<= ~counter~0 0)} #92#return; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {47406#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:46,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {47406#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47455#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:46,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {47455#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {47455#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:46,088 INFO L272 TraceCheckUtils]: 19: Hoare triple {47455#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47455#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:46,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {47455#(<= ~counter~0 1)} ~cond := #in~cond; {47455#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:46,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {47455#(<= ~counter~0 1)} assume !(0 == ~cond); {47455#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:46,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {47455#(<= ~counter~0 1)} assume true; {47455#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:46,089 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47455#(<= ~counter~0 1)} {47455#(<= ~counter~0 1)} #94#return; {47455#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:46,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {47455#(<= ~counter~0 1)} assume !!(0 != ~r~0); {47455#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:46,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {47455#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47480#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:46,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {47480#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {47480#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:46,092 INFO L272 TraceCheckUtils]: 27: Hoare triple {47480#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47480#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:46,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {47480#(<= ~counter~0 2)} ~cond := #in~cond; {47480#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:46,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {47480#(<= ~counter~0 2)} assume !(0 == ~cond); {47480#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:46,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {47480#(<= ~counter~0 2)} assume true; {47480#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:46,093 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47480#(<= ~counter~0 2)} {47480#(<= ~counter~0 2)} #96#return; {47480#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:46,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {47480#(<= ~counter~0 2)} assume !(~r~0 > 0); {47480#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:46,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {47480#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47505#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:46,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {47505#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {47505#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:46,095 INFO L272 TraceCheckUtils]: 35: Hoare triple {47505#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47505#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:46,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {47505#(<= ~counter~0 3)} ~cond := #in~cond; {47505#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:46,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {47505#(<= ~counter~0 3)} assume !(0 == ~cond); {47505#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:46,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {47505#(<= ~counter~0 3)} assume true; {47505#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:46,097 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47505#(<= ~counter~0 3)} {47505#(<= ~counter~0 3)} #98#return; {47505#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:46,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {47505#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47505#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:46,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {47505#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47530#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:46,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {47530#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {47530#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:46,099 INFO L272 TraceCheckUtils]: 43: Hoare triple {47530#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47530#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:46,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {47530#(<= ~counter~0 4)} ~cond := #in~cond; {47530#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:46,100 INFO L290 TraceCheckUtils]: 45: Hoare triple {47530#(<= ~counter~0 4)} assume !(0 == ~cond); {47530#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:46,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {47530#(<= ~counter~0 4)} assume true; {47530#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:46,101 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47530#(<= ~counter~0 4)} {47530#(<= ~counter~0 4)} #98#return; {47530#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:46,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {47530#(<= ~counter~0 4)} assume !(~r~0 < 0); {47530#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:46,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {47530#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47555#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:46,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {47555#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {47555#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:46,103 INFO L272 TraceCheckUtils]: 51: Hoare triple {47555#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47555#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:46,103 INFO L290 TraceCheckUtils]: 52: Hoare triple {47555#(<= ~counter~0 5)} ~cond := #in~cond; {47555#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:46,103 INFO L290 TraceCheckUtils]: 53: Hoare triple {47555#(<= ~counter~0 5)} assume !(0 == ~cond); {47555#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:46,104 INFO L290 TraceCheckUtils]: 54: Hoare triple {47555#(<= ~counter~0 5)} assume true; {47555#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:46,104 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47555#(<= ~counter~0 5)} {47555#(<= ~counter~0 5)} #94#return; {47555#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:46,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {47555#(<= ~counter~0 5)} assume !!(0 != ~r~0); {47555#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:46,106 INFO L290 TraceCheckUtils]: 57: Hoare triple {47555#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47580#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:46,106 INFO L290 TraceCheckUtils]: 58: Hoare triple {47580#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {47580#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:46,106 INFO L272 TraceCheckUtils]: 59: Hoare triple {47580#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47580#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:46,107 INFO L290 TraceCheckUtils]: 60: Hoare triple {47580#(<= ~counter~0 6)} ~cond := #in~cond; {47580#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:46,107 INFO L290 TraceCheckUtils]: 61: Hoare triple {47580#(<= ~counter~0 6)} assume !(0 == ~cond); {47580#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:46,108 INFO L290 TraceCheckUtils]: 62: Hoare triple {47580#(<= ~counter~0 6)} assume true; {47580#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:46,108 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47580#(<= ~counter~0 6)} {47580#(<= ~counter~0 6)} #96#return; {47580#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:46,108 INFO L290 TraceCheckUtils]: 64: Hoare triple {47580#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47580#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:46,109 INFO L290 TraceCheckUtils]: 65: Hoare triple {47580#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47605#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:46,110 INFO L290 TraceCheckUtils]: 66: Hoare triple {47605#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {47605#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:46,110 INFO L272 TraceCheckUtils]: 67: Hoare triple {47605#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47605#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:46,111 INFO L290 TraceCheckUtils]: 68: Hoare triple {47605#(<= ~counter~0 7)} ~cond := #in~cond; {47605#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:46,111 INFO L290 TraceCheckUtils]: 69: Hoare triple {47605#(<= ~counter~0 7)} assume !(0 == ~cond); {47605#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:46,111 INFO L290 TraceCheckUtils]: 70: Hoare triple {47605#(<= ~counter~0 7)} assume true; {47605#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:46,112 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47605#(<= ~counter~0 7)} {47605#(<= ~counter~0 7)} #96#return; {47605#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:46,112 INFO L290 TraceCheckUtils]: 72: Hoare triple {47605#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47605#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:46,113 INFO L290 TraceCheckUtils]: 73: Hoare triple {47605#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47630#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:46,113 INFO L290 TraceCheckUtils]: 74: Hoare triple {47630#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {47630#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:46,114 INFO L272 TraceCheckUtils]: 75: Hoare triple {47630#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47630#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:46,114 INFO L290 TraceCheckUtils]: 76: Hoare triple {47630#(<= ~counter~0 8)} ~cond := #in~cond; {47630#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:46,115 INFO L290 TraceCheckUtils]: 77: Hoare triple {47630#(<= ~counter~0 8)} assume !(0 == ~cond); {47630#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:46,115 INFO L290 TraceCheckUtils]: 78: Hoare triple {47630#(<= ~counter~0 8)} assume true; {47630#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:46,116 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47630#(<= ~counter~0 8)} {47630#(<= ~counter~0 8)} #96#return; {47630#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:46,116 INFO L290 TraceCheckUtils]: 80: Hoare triple {47630#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47630#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:46,117 INFO L290 TraceCheckUtils]: 81: Hoare triple {47630#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47655#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:46,117 INFO L290 TraceCheckUtils]: 82: Hoare triple {47655#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {47655#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:46,118 INFO L272 TraceCheckUtils]: 83: Hoare triple {47655#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47655#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:46,118 INFO L290 TraceCheckUtils]: 84: Hoare triple {47655#(<= ~counter~0 9)} ~cond := #in~cond; {47655#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:46,119 INFO L290 TraceCheckUtils]: 85: Hoare triple {47655#(<= ~counter~0 9)} assume !(0 == ~cond); {47655#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:46,119 INFO L290 TraceCheckUtils]: 86: Hoare triple {47655#(<= ~counter~0 9)} assume true; {47655#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:46,120 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47655#(<= ~counter~0 9)} {47655#(<= ~counter~0 9)} #96#return; {47655#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:46,120 INFO L290 TraceCheckUtils]: 88: Hoare triple {47655#(<= ~counter~0 9)} assume !(~r~0 > 0); {47655#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:46,121 INFO L290 TraceCheckUtils]: 89: Hoare triple {47655#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47680#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:46,121 INFO L290 TraceCheckUtils]: 90: Hoare triple {47680#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {47680#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:46,122 INFO L272 TraceCheckUtils]: 91: Hoare triple {47680#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47680#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:46,122 INFO L290 TraceCheckUtils]: 92: Hoare triple {47680#(<= ~counter~0 10)} ~cond := #in~cond; {47680#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:46,123 INFO L290 TraceCheckUtils]: 93: Hoare triple {47680#(<= ~counter~0 10)} assume !(0 == ~cond); {47680#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:46,123 INFO L290 TraceCheckUtils]: 94: Hoare triple {47680#(<= ~counter~0 10)} assume true; {47680#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:46,124 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47680#(<= ~counter~0 10)} {47680#(<= ~counter~0 10)} #98#return; {47680#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:46,124 INFO L290 TraceCheckUtils]: 96: Hoare triple {47680#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47680#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:46,125 INFO L290 TraceCheckUtils]: 97: Hoare triple {47680#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47705#(<= |main_#t~post8| 10)} is VALID [2022-04-08 12:37:46,125 INFO L290 TraceCheckUtils]: 98: Hoare triple {47705#(<= |main_#t~post8| 10)} assume !(#t~post8 < 100);havoc #t~post8; {47399#false} is VALID [2022-04-08 12:37:46,125 INFO L290 TraceCheckUtils]: 99: Hoare triple {47399#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47399#false} is VALID [2022-04-08 12:37:46,125 INFO L290 TraceCheckUtils]: 100: Hoare triple {47399#false} assume !(#t~post6 < 100);havoc #t~post6; {47399#false} is VALID [2022-04-08 12:37:46,125 INFO L272 TraceCheckUtils]: 101: Hoare triple {47399#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47399#false} is VALID [2022-04-08 12:37:46,125 INFO L290 TraceCheckUtils]: 102: Hoare triple {47399#false} ~cond := #in~cond; {47399#false} is VALID [2022-04-08 12:37:46,125 INFO L290 TraceCheckUtils]: 103: Hoare triple {47399#false} assume 0 == ~cond; {47399#false} is VALID [2022-04-08 12:37:46,125 INFO L290 TraceCheckUtils]: 104: Hoare triple {47399#false} assume !false; {47399#false} is VALID [2022-04-08 12:37:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 242 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:37:46,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:46,680 INFO L290 TraceCheckUtils]: 104: Hoare triple {47399#false} assume !false; {47399#false} is VALID [2022-04-08 12:37:46,680 INFO L290 TraceCheckUtils]: 103: Hoare triple {47399#false} assume 0 == ~cond; {47399#false} is VALID [2022-04-08 12:37:46,680 INFO L290 TraceCheckUtils]: 102: Hoare triple {47399#false} ~cond := #in~cond; {47399#false} is VALID [2022-04-08 12:37:46,680 INFO L272 TraceCheckUtils]: 101: Hoare triple {47399#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47399#false} is VALID [2022-04-08 12:37:46,680 INFO L290 TraceCheckUtils]: 100: Hoare triple {47399#false} assume !(#t~post6 < 100);havoc #t~post6; {47399#false} is VALID [2022-04-08 12:37:46,680 INFO L290 TraceCheckUtils]: 99: Hoare triple {47399#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47399#false} is VALID [2022-04-08 12:37:46,680 INFO L290 TraceCheckUtils]: 98: Hoare triple {47745#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {47399#false} is VALID [2022-04-08 12:37:46,681 INFO L290 TraceCheckUtils]: 97: Hoare triple {47749#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47745#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:37:46,681 INFO L290 TraceCheckUtils]: 96: Hoare triple {47749#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47749#(< ~counter~0 100)} is VALID [2022-04-08 12:37:46,681 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47398#true} {47749#(< ~counter~0 100)} #98#return; {47749#(< ~counter~0 100)} is VALID [2022-04-08 12:37:46,681 INFO L290 TraceCheckUtils]: 94: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 12:37:46,681 INFO L290 TraceCheckUtils]: 93: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 12:37:46,681 INFO L290 TraceCheckUtils]: 92: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 12:37:46,682 INFO L272 TraceCheckUtils]: 91: Hoare triple {47749#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 12:37:46,682 INFO L290 TraceCheckUtils]: 90: Hoare triple {47749#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {47749#(< ~counter~0 100)} is VALID [2022-04-08 12:37:46,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {47774#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47749#(< ~counter~0 100)} is VALID [2022-04-08 12:37:46,683 INFO L290 TraceCheckUtils]: 88: Hoare triple {47774#(< ~counter~0 99)} assume !(~r~0 > 0); {47774#(< ~counter~0 99)} is VALID [2022-04-08 12:37:46,684 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47398#true} {47774#(< ~counter~0 99)} #96#return; {47774#(< ~counter~0 99)} is VALID [2022-04-08 12:37:46,684 INFO L290 TraceCheckUtils]: 86: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 12:37:46,684 INFO L290 TraceCheckUtils]: 85: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 12:37:46,684 INFO L290 TraceCheckUtils]: 84: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 12:37:46,684 INFO L272 TraceCheckUtils]: 83: Hoare triple {47774#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 12:37:46,684 INFO L290 TraceCheckUtils]: 82: Hoare triple {47774#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {47774#(< ~counter~0 99)} is VALID [2022-04-08 12:37:46,685 INFO L290 TraceCheckUtils]: 81: Hoare triple {47799#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47774#(< ~counter~0 99)} is VALID [2022-04-08 12:37:46,685 INFO L290 TraceCheckUtils]: 80: Hoare triple {47799#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47799#(< ~counter~0 98)} is VALID [2022-04-08 12:37:46,685 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47398#true} {47799#(< ~counter~0 98)} #96#return; {47799#(< ~counter~0 98)} is VALID [2022-04-08 12:37:46,686 INFO L290 TraceCheckUtils]: 78: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 12:37:46,686 INFO L290 TraceCheckUtils]: 77: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 12:37:46,686 INFO L290 TraceCheckUtils]: 76: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 12:37:46,686 INFO L272 TraceCheckUtils]: 75: Hoare triple {47799#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 12:37:46,686 INFO L290 TraceCheckUtils]: 74: Hoare triple {47799#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {47799#(< ~counter~0 98)} is VALID [2022-04-08 12:37:46,687 INFO L290 TraceCheckUtils]: 73: Hoare triple {47824#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47799#(< ~counter~0 98)} is VALID [2022-04-08 12:37:46,687 INFO L290 TraceCheckUtils]: 72: Hoare triple {47824#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47824#(< ~counter~0 97)} is VALID [2022-04-08 12:37:46,687 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47398#true} {47824#(< ~counter~0 97)} #96#return; {47824#(< ~counter~0 97)} is VALID [2022-04-08 12:37:46,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 12:37:46,687 INFO L290 TraceCheckUtils]: 69: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 12:37:46,687 INFO L290 TraceCheckUtils]: 68: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 12:37:46,687 INFO L272 TraceCheckUtils]: 67: Hoare triple {47824#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 12:37:46,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {47824#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {47824#(< ~counter~0 97)} is VALID [2022-04-08 12:37:46,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {47849#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47824#(< ~counter~0 97)} is VALID [2022-04-08 12:37:46,689 INFO L290 TraceCheckUtils]: 64: Hoare triple {47849#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47849#(< ~counter~0 96)} is VALID [2022-04-08 12:37:46,689 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47398#true} {47849#(< ~counter~0 96)} #96#return; {47849#(< ~counter~0 96)} is VALID [2022-04-08 12:37:46,689 INFO L290 TraceCheckUtils]: 62: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 12:37:46,689 INFO L290 TraceCheckUtils]: 61: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 12:37:46,689 INFO L290 TraceCheckUtils]: 60: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 12:37:46,689 INFO L272 TraceCheckUtils]: 59: Hoare triple {47849#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 12:37:46,690 INFO L290 TraceCheckUtils]: 58: Hoare triple {47849#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {47849#(< ~counter~0 96)} is VALID [2022-04-08 12:37:46,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {47874#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47849#(< ~counter~0 96)} is VALID [2022-04-08 12:37:46,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {47874#(< ~counter~0 95)} assume !!(0 != ~r~0); {47874#(< ~counter~0 95)} is VALID [2022-04-08 12:37:46,693 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47398#true} {47874#(< ~counter~0 95)} #94#return; {47874#(< ~counter~0 95)} is VALID [2022-04-08 12:37:46,693 INFO L290 TraceCheckUtils]: 54: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 12:37:46,693 INFO L290 TraceCheckUtils]: 53: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 12:37:46,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 12:37:46,693 INFO L272 TraceCheckUtils]: 51: Hoare triple {47874#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 12:37:46,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {47874#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {47874#(< ~counter~0 95)} is VALID [2022-04-08 12:37:46,694 INFO L290 TraceCheckUtils]: 49: Hoare triple {47899#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47874#(< ~counter~0 95)} is VALID [2022-04-08 12:37:46,694 INFO L290 TraceCheckUtils]: 48: Hoare triple {47899#(< ~counter~0 94)} assume !(~r~0 < 0); {47899#(< ~counter~0 94)} is VALID [2022-04-08 12:37:46,695 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47398#true} {47899#(< ~counter~0 94)} #98#return; {47899#(< ~counter~0 94)} is VALID [2022-04-08 12:37:46,695 INFO L290 TraceCheckUtils]: 46: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 12:37:46,695 INFO L290 TraceCheckUtils]: 45: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 12:37:46,695 INFO L290 TraceCheckUtils]: 44: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 12:37:46,695 INFO L272 TraceCheckUtils]: 43: Hoare triple {47899#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 12:37:46,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {47899#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {47899#(< ~counter~0 94)} is VALID [2022-04-08 12:37:46,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {47924#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47899#(< ~counter~0 94)} is VALID [2022-04-08 12:37:46,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {47924#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47924#(< ~counter~0 93)} is VALID [2022-04-08 12:37:46,698 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47398#true} {47924#(< ~counter~0 93)} #98#return; {47924#(< ~counter~0 93)} is VALID [2022-04-08 12:37:46,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 12:37:46,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 12:37:46,698 INFO L290 TraceCheckUtils]: 36: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 12:37:46,698 INFO L272 TraceCheckUtils]: 35: Hoare triple {47924#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 12:37:46,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {47924#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {47924#(< ~counter~0 93)} is VALID [2022-04-08 12:37:46,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {47949#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47924#(< ~counter~0 93)} is VALID [2022-04-08 12:37:46,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {47949#(< ~counter~0 92)} assume !(~r~0 > 0); {47949#(< ~counter~0 92)} is VALID [2022-04-08 12:37:46,700 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47398#true} {47949#(< ~counter~0 92)} #96#return; {47949#(< ~counter~0 92)} is VALID [2022-04-08 12:37:46,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 12:37:46,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 12:37:46,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 12:37:46,700 INFO L272 TraceCheckUtils]: 27: Hoare triple {47949#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 12:37:46,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {47949#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {47949#(< ~counter~0 92)} is VALID [2022-04-08 12:37:46,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {47974#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47949#(< ~counter~0 92)} is VALID [2022-04-08 12:37:46,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {47974#(< ~counter~0 91)} assume !!(0 != ~r~0); {47974#(< ~counter~0 91)} is VALID [2022-04-08 12:37:46,702 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47398#true} {47974#(< ~counter~0 91)} #94#return; {47974#(< ~counter~0 91)} is VALID [2022-04-08 12:37:46,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 12:37:46,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 12:37:46,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 12:37:46,703 INFO L272 TraceCheckUtils]: 19: Hoare triple {47974#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 12:37:46,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {47974#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {47974#(< ~counter~0 91)} is VALID [2022-04-08 12:37:46,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {47999#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47974#(< ~counter~0 91)} is VALID [2022-04-08 12:37:46,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {47999#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {47999#(< ~counter~0 90)} is VALID [2022-04-08 12:37:46,705 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47398#true} {47999#(< ~counter~0 90)} #92#return; {47999#(< ~counter~0 90)} is VALID [2022-04-08 12:37:46,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 12:37:46,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 12:37:46,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 12:37:46,705 INFO L272 TraceCheckUtils]: 11: Hoare triple {47999#(< ~counter~0 90)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {47398#true} is VALID [2022-04-08 12:37:46,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47398#true} {47999#(< ~counter~0 90)} #90#return; {47999#(< ~counter~0 90)} is VALID [2022-04-08 12:37:46,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 12:37:46,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 12:37:46,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 12:37:46,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {47999#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 12:37:46,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {47999#(< ~counter~0 90)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {47999#(< ~counter~0 90)} is VALID [2022-04-08 12:37:46,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {47999#(< ~counter~0 90)} call #t~ret9 := main(); {47999#(< ~counter~0 90)} is VALID [2022-04-08 12:37:46,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47999#(< ~counter~0 90)} {47398#true} #102#return; {47999#(< ~counter~0 90)} is VALID [2022-04-08 12:37:46,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {47999#(< ~counter~0 90)} assume true; {47999#(< ~counter~0 90)} is VALID [2022-04-08 12:37:46,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {47398#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47999#(< ~counter~0 90)} is VALID [2022-04-08 12:37:46,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {47398#true} call ULTIMATE.init(); {47398#true} is VALID [2022-04-08 12:37:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 12:37:46,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:46,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251824693] [2022-04-08 12:37:46,709 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:46,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023702180] [2022-04-08 12:37:46,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023702180] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:46,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:46,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-08 12:37:46,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:46,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1350465866] [2022-04-08 12:37:46,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1350465866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:46,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:46,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 12:37:46,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889746553] [2022-04-08 12:37:46,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:46,710 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 105 [2022-04-08 12:37:46,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:46,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:46,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:46,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 12:37:46,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:46,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 12:37:46,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-08 12:37:46,787 INFO L87 Difference]: Start difference. First operand 504 states and 695 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:48,591 INFO L93 Difference]: Finished difference Result 753 states and 1073 transitions. [2022-04-08 12:37:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 12:37:48,592 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 105 [2022-04-08 12:37:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-08 12:37:48,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-08 12:37:48,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 236 transitions. [2022-04-08 12:37:48,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:48,791 INFO L225 Difference]: With dead ends: 753 [2022-04-08 12:37:48,791 INFO L226 Difference]: Without dead ends: 532 [2022-04-08 12:37:48,792 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-08 12:37:48,793 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 143 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:37:48,793 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 249 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:37:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-08 12:37:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 522. [2022-04-08 12:37:49,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:49,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 12:37:49,904 INFO L74 IsIncluded]: Start isIncluded. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 12:37:49,904 INFO L87 Difference]: Start difference. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 12:37:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:49,921 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-08 12:37:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-08 12:37:49,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:49,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:49,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 532 states. [2022-04-08 12:37:49,923 INFO L87 Difference]: Start difference. First operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 532 states. [2022-04-08 12:37:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:49,941 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-08 12:37:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-08 12:37:49,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:49,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:49,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:49,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 12:37:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 717 transitions. [2022-04-08 12:37:49,962 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 717 transitions. Word has length 105 [2022-04-08 12:37:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:49,962 INFO L478 AbstractCegarLoop]: Abstraction has 522 states and 717 transitions. [2022-04-08 12:37:49,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:49,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 522 states and 717 transitions. [2022-04-08 12:37:53,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 717 transitions. [2022-04-08 12:37:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-08 12:37:53,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:53,061 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 7, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:37:53,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-08 12:37:53,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-08 12:37:53,275 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:53,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 11 times [2022-04-08 12:37:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:53,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1131686323] [2022-04-08 12:37:53,276 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 12 times [2022-04-08 12:37:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:53,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508865409] [2022-04-08 12:37:53,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:53,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:53,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:53,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452722504] [2022-04-08 12:37:53,304 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:37:53,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:53,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:53,305 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:37:53,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-08 12:37:53,420 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 12:37:53,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:53,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 12:37:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:53,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:53,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {51683#true} call ULTIMATE.init(); {51683#true} is VALID [2022-04-08 12:37:53,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {51683#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {51691#(<= ~counter~0 0)} assume true; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51691#(<= ~counter~0 0)} {51683#true} #102#return; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {51691#(<= ~counter~0 0)} call #t~ret9 := main(); {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {51691#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,947 INFO L272 TraceCheckUtils]: 6: Hoare triple {51691#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {51691#(<= ~counter~0 0)} ~cond := #in~cond; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {51691#(<= ~counter~0 0)} assume !(0 == ~cond); {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {51691#(<= ~counter~0 0)} assume true; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,948 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51691#(<= ~counter~0 0)} {51691#(<= ~counter~0 0)} #90#return; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,949 INFO L272 TraceCheckUtils]: 11: Hoare triple {51691#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {51691#(<= ~counter~0 0)} ~cond := #in~cond; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {51691#(<= ~counter~0 0)} assume !(0 == ~cond); {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {51691#(<= ~counter~0 0)} assume true; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,950 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51691#(<= ~counter~0 0)} {51691#(<= ~counter~0 0)} #92#return; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {51691#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:53,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {51691#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51740#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:53,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {51740#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {51740#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:53,952 INFO L272 TraceCheckUtils]: 19: Hoare triple {51740#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51740#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:53,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {51740#(<= ~counter~0 1)} ~cond := #in~cond; {51740#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:53,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {51740#(<= ~counter~0 1)} assume !(0 == ~cond); {51740#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:53,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {51740#(<= ~counter~0 1)} assume true; {51740#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:53,953 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51740#(<= ~counter~0 1)} {51740#(<= ~counter~0 1)} #94#return; {51740#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:53,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {51740#(<= ~counter~0 1)} assume !!(0 != ~r~0); {51740#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:53,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {51740#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51765#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:53,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {51765#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {51765#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:53,955 INFO L272 TraceCheckUtils]: 27: Hoare triple {51765#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51765#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:53,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {51765#(<= ~counter~0 2)} ~cond := #in~cond; {51765#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:53,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {51765#(<= ~counter~0 2)} assume !(0 == ~cond); {51765#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:53,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {51765#(<= ~counter~0 2)} assume true; {51765#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:53,956 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51765#(<= ~counter~0 2)} {51765#(<= ~counter~0 2)} #96#return; {51765#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:53,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {51765#(<= ~counter~0 2)} assume !(~r~0 > 0); {51765#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:53,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {51765#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51790#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:53,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {51790#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {51790#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:53,958 INFO L272 TraceCheckUtils]: 35: Hoare triple {51790#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51790#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:53,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {51790#(<= ~counter~0 3)} ~cond := #in~cond; {51790#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:53,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {51790#(<= ~counter~0 3)} assume !(0 == ~cond); {51790#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:53,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {51790#(<= ~counter~0 3)} assume true; {51790#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:53,959 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51790#(<= ~counter~0 3)} {51790#(<= ~counter~0 3)} #98#return; {51790#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:53,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {51790#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51790#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:53,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {51790#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51815#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:53,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {51815#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {51815#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:53,961 INFO L272 TraceCheckUtils]: 43: Hoare triple {51815#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51815#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:53,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {51815#(<= ~counter~0 4)} ~cond := #in~cond; {51815#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:53,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {51815#(<= ~counter~0 4)} assume !(0 == ~cond); {51815#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:53,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {51815#(<= ~counter~0 4)} assume true; {51815#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:53,962 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51815#(<= ~counter~0 4)} {51815#(<= ~counter~0 4)} #98#return; {51815#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:53,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {51815#(<= ~counter~0 4)} assume !(~r~0 < 0); {51815#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:53,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {51815#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51840#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:53,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {51840#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {51840#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:53,964 INFO L272 TraceCheckUtils]: 51: Hoare triple {51840#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51840#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:53,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {51840#(<= ~counter~0 5)} ~cond := #in~cond; {51840#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:53,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {51840#(<= ~counter~0 5)} assume !(0 == ~cond); {51840#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:53,965 INFO L290 TraceCheckUtils]: 54: Hoare triple {51840#(<= ~counter~0 5)} assume true; {51840#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:53,965 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51840#(<= ~counter~0 5)} {51840#(<= ~counter~0 5)} #94#return; {51840#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:53,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {51840#(<= ~counter~0 5)} assume !!(0 != ~r~0); {51840#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:53,966 INFO L290 TraceCheckUtils]: 57: Hoare triple {51840#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51865#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:53,966 INFO L290 TraceCheckUtils]: 58: Hoare triple {51865#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {51865#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:53,967 INFO L272 TraceCheckUtils]: 59: Hoare triple {51865#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51865#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:53,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {51865#(<= ~counter~0 6)} ~cond := #in~cond; {51865#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:53,967 INFO L290 TraceCheckUtils]: 61: Hoare triple {51865#(<= ~counter~0 6)} assume !(0 == ~cond); {51865#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:53,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {51865#(<= ~counter~0 6)} assume true; {51865#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:53,968 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51865#(<= ~counter~0 6)} {51865#(<= ~counter~0 6)} #96#return; {51865#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:53,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {51865#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51865#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:53,969 INFO L290 TraceCheckUtils]: 65: Hoare triple {51865#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51890#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:53,969 INFO L290 TraceCheckUtils]: 66: Hoare triple {51890#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {51890#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:53,970 INFO L272 TraceCheckUtils]: 67: Hoare triple {51890#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51890#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:53,970 INFO L290 TraceCheckUtils]: 68: Hoare triple {51890#(<= ~counter~0 7)} ~cond := #in~cond; {51890#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:53,970 INFO L290 TraceCheckUtils]: 69: Hoare triple {51890#(<= ~counter~0 7)} assume !(0 == ~cond); {51890#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:53,970 INFO L290 TraceCheckUtils]: 70: Hoare triple {51890#(<= ~counter~0 7)} assume true; {51890#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:53,971 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51890#(<= ~counter~0 7)} {51890#(<= ~counter~0 7)} #96#return; {51890#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:53,971 INFO L290 TraceCheckUtils]: 72: Hoare triple {51890#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51890#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:53,972 INFO L290 TraceCheckUtils]: 73: Hoare triple {51890#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51915#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:53,972 INFO L290 TraceCheckUtils]: 74: Hoare triple {51915#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {51915#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:53,972 INFO L272 TraceCheckUtils]: 75: Hoare triple {51915#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51915#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:53,973 INFO L290 TraceCheckUtils]: 76: Hoare triple {51915#(<= ~counter~0 8)} ~cond := #in~cond; {51915#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:53,973 INFO L290 TraceCheckUtils]: 77: Hoare triple {51915#(<= ~counter~0 8)} assume !(0 == ~cond); {51915#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:53,973 INFO L290 TraceCheckUtils]: 78: Hoare triple {51915#(<= ~counter~0 8)} assume true; {51915#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:53,974 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51915#(<= ~counter~0 8)} {51915#(<= ~counter~0 8)} #96#return; {51915#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:53,974 INFO L290 TraceCheckUtils]: 80: Hoare triple {51915#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51915#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:53,975 INFO L290 TraceCheckUtils]: 81: Hoare triple {51915#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51940#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:53,975 INFO L290 TraceCheckUtils]: 82: Hoare triple {51940#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {51940#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:53,975 INFO L272 TraceCheckUtils]: 83: Hoare triple {51940#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51940#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:53,976 INFO L290 TraceCheckUtils]: 84: Hoare triple {51940#(<= ~counter~0 9)} ~cond := #in~cond; {51940#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:53,976 INFO L290 TraceCheckUtils]: 85: Hoare triple {51940#(<= ~counter~0 9)} assume !(0 == ~cond); {51940#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:53,976 INFO L290 TraceCheckUtils]: 86: Hoare triple {51940#(<= ~counter~0 9)} assume true; {51940#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:53,977 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51940#(<= ~counter~0 9)} {51940#(<= ~counter~0 9)} #96#return; {51940#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:53,977 INFO L290 TraceCheckUtils]: 88: Hoare triple {51940#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51940#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:53,978 INFO L290 TraceCheckUtils]: 89: Hoare triple {51940#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51965#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:53,978 INFO L290 TraceCheckUtils]: 90: Hoare triple {51965#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {51965#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:53,978 INFO L272 TraceCheckUtils]: 91: Hoare triple {51965#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51965#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:53,979 INFO L290 TraceCheckUtils]: 92: Hoare triple {51965#(<= ~counter~0 10)} ~cond := #in~cond; {51965#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:53,979 INFO L290 TraceCheckUtils]: 93: Hoare triple {51965#(<= ~counter~0 10)} assume !(0 == ~cond); {51965#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:53,979 INFO L290 TraceCheckUtils]: 94: Hoare triple {51965#(<= ~counter~0 10)} assume true; {51965#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:53,980 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51965#(<= ~counter~0 10)} {51965#(<= ~counter~0 10)} #96#return; {51965#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:53,980 INFO L290 TraceCheckUtils]: 96: Hoare triple {51965#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51965#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:53,980 INFO L290 TraceCheckUtils]: 97: Hoare triple {51965#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51990#(<= |main_#t~post7| 10)} is VALID [2022-04-08 12:37:53,980 INFO L290 TraceCheckUtils]: 98: Hoare triple {51990#(<= |main_#t~post7| 10)} assume !(#t~post7 < 100);havoc #t~post7; {51684#false} is VALID [2022-04-08 12:37:53,981 INFO L290 TraceCheckUtils]: 99: Hoare triple {51684#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51684#false} is VALID [2022-04-08 12:37:53,981 INFO L290 TraceCheckUtils]: 100: Hoare triple {51684#false} assume !(#t~post8 < 100);havoc #t~post8; {51684#false} is VALID [2022-04-08 12:37:53,981 INFO L290 TraceCheckUtils]: 101: Hoare triple {51684#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51684#false} is VALID [2022-04-08 12:37:53,981 INFO L290 TraceCheckUtils]: 102: Hoare triple {51684#false} assume !(#t~post6 < 100);havoc #t~post6; {51684#false} is VALID [2022-04-08 12:37:53,981 INFO L272 TraceCheckUtils]: 103: Hoare triple {51684#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51684#false} is VALID [2022-04-08 12:37:53,981 INFO L290 TraceCheckUtils]: 104: Hoare triple {51684#false} ~cond := #in~cond; {51684#false} is VALID [2022-04-08 12:37:53,981 INFO L290 TraceCheckUtils]: 105: Hoare triple {51684#false} assume 0 == ~cond; {51684#false} is VALID [2022-04-08 12:37:53,981 INFO L290 TraceCheckUtils]: 106: Hoare triple {51684#false} assume !false; {51684#false} is VALID [2022-04-08 12:37:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 260 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:37:53,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:54,660 INFO L290 TraceCheckUtils]: 106: Hoare triple {51684#false} assume !false; {51684#false} is VALID [2022-04-08 12:37:54,661 INFO L290 TraceCheckUtils]: 105: Hoare triple {51684#false} assume 0 == ~cond; {51684#false} is VALID [2022-04-08 12:37:54,661 INFO L290 TraceCheckUtils]: 104: Hoare triple {51684#false} ~cond := #in~cond; {51684#false} is VALID [2022-04-08 12:37:54,661 INFO L272 TraceCheckUtils]: 103: Hoare triple {51684#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51684#false} is VALID [2022-04-08 12:37:54,661 INFO L290 TraceCheckUtils]: 102: Hoare triple {51684#false} assume !(#t~post6 < 100);havoc #t~post6; {51684#false} is VALID [2022-04-08 12:37:54,661 INFO L290 TraceCheckUtils]: 101: Hoare triple {51684#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51684#false} is VALID [2022-04-08 12:37:54,661 INFO L290 TraceCheckUtils]: 100: Hoare triple {51684#false} assume !(#t~post8 < 100);havoc #t~post8; {51684#false} is VALID [2022-04-08 12:37:54,661 INFO L290 TraceCheckUtils]: 99: Hoare triple {51684#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51684#false} is VALID [2022-04-08 12:37:54,661 INFO L290 TraceCheckUtils]: 98: Hoare triple {52042#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {51684#false} is VALID [2022-04-08 12:37:54,662 INFO L290 TraceCheckUtils]: 97: Hoare triple {52046#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52042#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:37:54,662 INFO L290 TraceCheckUtils]: 96: Hoare triple {52046#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52046#(< ~counter~0 100)} is VALID [2022-04-08 12:37:54,663 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51683#true} {52046#(< ~counter~0 100)} #96#return; {52046#(< ~counter~0 100)} is VALID [2022-04-08 12:37:54,663 INFO L290 TraceCheckUtils]: 94: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 12:37:54,663 INFO L290 TraceCheckUtils]: 93: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 12:37:54,663 INFO L290 TraceCheckUtils]: 92: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 12:37:54,663 INFO L272 TraceCheckUtils]: 91: Hoare triple {52046#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 12:37:54,663 INFO L290 TraceCheckUtils]: 90: Hoare triple {52046#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {52046#(< ~counter~0 100)} is VALID [2022-04-08 12:37:54,665 INFO L290 TraceCheckUtils]: 89: Hoare triple {52071#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52046#(< ~counter~0 100)} is VALID [2022-04-08 12:37:54,665 INFO L290 TraceCheckUtils]: 88: Hoare triple {52071#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52071#(< ~counter~0 99)} is VALID [2022-04-08 12:37:54,666 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51683#true} {52071#(< ~counter~0 99)} #96#return; {52071#(< ~counter~0 99)} is VALID [2022-04-08 12:37:54,666 INFO L290 TraceCheckUtils]: 86: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 12:37:54,666 INFO L290 TraceCheckUtils]: 85: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 12:37:54,666 INFO L290 TraceCheckUtils]: 84: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 12:37:54,666 INFO L272 TraceCheckUtils]: 83: Hoare triple {52071#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 12:37:54,666 INFO L290 TraceCheckUtils]: 82: Hoare triple {52071#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {52071#(< ~counter~0 99)} is VALID [2022-04-08 12:37:54,667 INFO L290 TraceCheckUtils]: 81: Hoare triple {52096#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52071#(< ~counter~0 99)} is VALID [2022-04-08 12:37:54,667 INFO L290 TraceCheckUtils]: 80: Hoare triple {52096#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52096#(< ~counter~0 98)} is VALID [2022-04-08 12:37:54,668 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51683#true} {52096#(< ~counter~0 98)} #96#return; {52096#(< ~counter~0 98)} is VALID [2022-04-08 12:37:54,668 INFO L290 TraceCheckUtils]: 78: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 12:37:54,668 INFO L290 TraceCheckUtils]: 77: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 12:37:54,668 INFO L290 TraceCheckUtils]: 76: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 12:37:54,668 INFO L272 TraceCheckUtils]: 75: Hoare triple {52096#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 12:37:54,669 INFO L290 TraceCheckUtils]: 74: Hoare triple {52096#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {52096#(< ~counter~0 98)} is VALID [2022-04-08 12:37:54,669 INFO L290 TraceCheckUtils]: 73: Hoare triple {52121#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52096#(< ~counter~0 98)} is VALID [2022-04-08 12:37:54,670 INFO L290 TraceCheckUtils]: 72: Hoare triple {52121#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52121#(< ~counter~0 97)} is VALID [2022-04-08 12:37:54,670 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51683#true} {52121#(< ~counter~0 97)} #96#return; {52121#(< ~counter~0 97)} is VALID [2022-04-08 12:37:54,670 INFO L290 TraceCheckUtils]: 70: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 12:37:54,671 INFO L290 TraceCheckUtils]: 69: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 12:37:54,671 INFO L290 TraceCheckUtils]: 68: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 12:37:54,671 INFO L272 TraceCheckUtils]: 67: Hoare triple {52121#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 12:37:54,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {52121#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {52121#(< ~counter~0 97)} is VALID [2022-04-08 12:37:54,672 INFO L290 TraceCheckUtils]: 65: Hoare triple {52146#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52121#(< ~counter~0 97)} is VALID [2022-04-08 12:37:54,672 INFO L290 TraceCheckUtils]: 64: Hoare triple {52146#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52146#(< ~counter~0 96)} is VALID [2022-04-08 12:37:54,673 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51683#true} {52146#(< ~counter~0 96)} #96#return; {52146#(< ~counter~0 96)} is VALID [2022-04-08 12:37:54,673 INFO L290 TraceCheckUtils]: 62: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 12:37:54,673 INFO L290 TraceCheckUtils]: 61: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 12:37:54,673 INFO L290 TraceCheckUtils]: 60: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 12:37:54,673 INFO L272 TraceCheckUtils]: 59: Hoare triple {52146#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 12:37:54,673 INFO L290 TraceCheckUtils]: 58: Hoare triple {52146#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {52146#(< ~counter~0 96)} is VALID [2022-04-08 12:37:54,674 INFO L290 TraceCheckUtils]: 57: Hoare triple {52171#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52146#(< ~counter~0 96)} is VALID [2022-04-08 12:37:54,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {52171#(< ~counter~0 95)} assume !!(0 != ~r~0); {52171#(< ~counter~0 95)} is VALID [2022-04-08 12:37:54,675 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51683#true} {52171#(< ~counter~0 95)} #94#return; {52171#(< ~counter~0 95)} is VALID [2022-04-08 12:37:54,675 INFO L290 TraceCheckUtils]: 54: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 12:37:54,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 12:37:54,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 12:37:54,675 INFO L272 TraceCheckUtils]: 51: Hoare triple {52171#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 12:37:54,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {52171#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {52171#(< ~counter~0 95)} is VALID [2022-04-08 12:37:54,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {52196#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52171#(< ~counter~0 95)} is VALID [2022-04-08 12:37:54,677 INFO L290 TraceCheckUtils]: 48: Hoare triple {52196#(< ~counter~0 94)} assume !(~r~0 < 0); {52196#(< ~counter~0 94)} is VALID [2022-04-08 12:37:54,677 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51683#true} {52196#(< ~counter~0 94)} #98#return; {52196#(< ~counter~0 94)} is VALID [2022-04-08 12:37:54,677 INFO L290 TraceCheckUtils]: 46: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 12:37:54,678 INFO L290 TraceCheckUtils]: 45: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 12:37:54,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 12:37:54,678 INFO L272 TraceCheckUtils]: 43: Hoare triple {52196#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 12:37:54,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {52196#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {52196#(< ~counter~0 94)} is VALID [2022-04-08 12:37:54,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {52221#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52196#(< ~counter~0 94)} is VALID [2022-04-08 12:37:54,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {52221#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52221#(< ~counter~0 93)} is VALID [2022-04-08 12:37:54,680 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51683#true} {52221#(< ~counter~0 93)} #98#return; {52221#(< ~counter~0 93)} is VALID [2022-04-08 12:37:54,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 12:37:54,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 12:37:54,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 12:37:54,680 INFO L272 TraceCheckUtils]: 35: Hoare triple {52221#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 12:37:54,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {52221#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {52221#(< ~counter~0 93)} is VALID [2022-04-08 12:37:54,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {52246#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52221#(< ~counter~0 93)} is VALID [2022-04-08 12:37:54,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {52246#(< ~counter~0 92)} assume !(~r~0 > 0); {52246#(< ~counter~0 92)} is VALID [2022-04-08 12:37:54,682 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51683#true} {52246#(< ~counter~0 92)} #96#return; {52246#(< ~counter~0 92)} is VALID [2022-04-08 12:37:54,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 12:37:54,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 12:37:54,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 12:37:54,682 INFO L272 TraceCheckUtils]: 27: Hoare triple {52246#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 12:37:54,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {52246#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {52246#(< ~counter~0 92)} is VALID [2022-04-08 12:37:54,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {52271#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52246#(< ~counter~0 92)} is VALID [2022-04-08 12:37:54,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {52271#(< ~counter~0 91)} assume !!(0 != ~r~0); {52271#(< ~counter~0 91)} is VALID [2022-04-08 12:37:54,685 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51683#true} {52271#(< ~counter~0 91)} #94#return; {52271#(< ~counter~0 91)} is VALID [2022-04-08 12:37:54,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 12:37:54,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 12:37:54,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 12:37:54,685 INFO L272 TraceCheckUtils]: 19: Hoare triple {52271#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 12:37:54,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {52271#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {52271#(< ~counter~0 91)} is VALID [2022-04-08 12:37:54,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {52296#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52271#(< ~counter~0 91)} is VALID [2022-04-08 12:37:54,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {52296#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {52296#(< ~counter~0 90)} is VALID [2022-04-08 12:37:54,686 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51683#true} {52296#(< ~counter~0 90)} #92#return; {52296#(< ~counter~0 90)} is VALID [2022-04-08 12:37:54,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 12:37:54,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 12:37:54,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 12:37:54,687 INFO L272 TraceCheckUtils]: 11: Hoare triple {52296#(< ~counter~0 90)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {51683#true} is VALID [2022-04-08 12:37:54,687 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51683#true} {52296#(< ~counter~0 90)} #90#return; {52296#(< ~counter~0 90)} is VALID [2022-04-08 12:37:54,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 12:37:54,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 12:37:54,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 12:37:54,687 INFO L272 TraceCheckUtils]: 6: Hoare triple {52296#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 12:37:54,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {52296#(< ~counter~0 90)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {52296#(< ~counter~0 90)} is VALID [2022-04-08 12:37:54,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {52296#(< ~counter~0 90)} call #t~ret9 := main(); {52296#(< ~counter~0 90)} is VALID [2022-04-08 12:37:54,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52296#(< ~counter~0 90)} {51683#true} #102#return; {52296#(< ~counter~0 90)} is VALID [2022-04-08 12:37:54,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {52296#(< ~counter~0 90)} assume true; {52296#(< ~counter~0 90)} is VALID [2022-04-08 12:37:54,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {51683#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {52296#(< ~counter~0 90)} is VALID [2022-04-08 12:37:54,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {51683#true} call ULTIMATE.init(); {51683#true} is VALID [2022-04-08 12:37:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 12:37:54,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:54,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508865409] [2022-04-08 12:37:54,689 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:54,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452722504] [2022-04-08 12:37:54,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452722504] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:54,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:54,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-08 12:37:54,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:54,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1131686323] [2022-04-08 12:37:54,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1131686323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:54,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:54,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 12:37:54,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965029088] [2022-04-08 12:37:54,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:54,690 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 107 [2022-04-08 12:37:54,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:54,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:54,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:54,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 12:37:54,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:54,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 12:37:54,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-08 12:37:54,773 INFO L87 Difference]: Start difference. First operand 522 states and 717 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:56,638 INFO L93 Difference]: Finished difference Result 735 states and 1041 transitions. [2022-04-08 12:37:56,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 12:37:56,638 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 107 [2022-04-08 12:37:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-08 12:37:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-08 12:37:56,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 236 transitions. [2022-04-08 12:37:56,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:56,863 INFO L225 Difference]: With dead ends: 735 [2022-04-08 12:37:56,863 INFO L226 Difference]: Without dead ends: 538 [2022-04-08 12:37:56,864 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=497, Invalid=693, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 12:37:56,864 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:37:56,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 255 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:37:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-04-08 12:37:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-04-08 12:37:57,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:57,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 12:37:57,990 INFO L74 IsIncluded]: Start isIncluded. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 12:37:57,991 INFO L87 Difference]: Start difference. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 12:37:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:58,002 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-08 12:37:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-08 12:37:58,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:58,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:58,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 538 states. [2022-04-08 12:37:58,003 INFO L87 Difference]: Start difference. First operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 538 states. [2022-04-08 12:37:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:58,015 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-08 12:37:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-08 12:37:58,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:58,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:58,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:58,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 12:37:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 733 transitions. [2022-04-08 12:37:58,030 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 733 transitions. Word has length 107 [2022-04-08 12:37:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:58,031 INFO L478 AbstractCegarLoop]: Abstraction has 538 states and 733 transitions. [2022-04-08 12:37:58,031 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 12:37:58,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 538 states and 733 transitions. [2022-04-08 12:38:00,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 733 edges. 733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-08 12:38:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 12:38:00,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:00,914 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:38:00,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-08 12:38:01,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:01,115 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:01,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 5 times [2022-04-08 12:38:01,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:01,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [65834858] [2022-04-08 12:38:01,116 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:01,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 6 times [2022-04-08 12:38:01,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:01,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3866644] [2022-04-08 12:38:01,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:01,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:01,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:01,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457265375] [2022-04-08 12:38:01,135 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:38:01,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:01,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:01,136 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:38:01,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-08 12:38:01,286 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 12:38:01,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:01,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 12:38:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:01,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:01,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {55990#true} call ULTIMATE.init(); {55990#true} is VALID [2022-04-08 12:38:01,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {55990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {55998#(<= ~counter~0 0)} assume true; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55998#(<= ~counter~0 0)} {55990#true} #102#return; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {55998#(<= ~counter~0 0)} call #t~ret9 := main(); {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {55998#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {55998#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {55998#(<= ~counter~0 0)} ~cond := #in~cond; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {55998#(<= ~counter~0 0)} assume !(0 == ~cond); {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {55998#(<= ~counter~0 0)} assume true; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,916 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55998#(<= ~counter~0 0)} {55998#(<= ~counter~0 0)} #90#return; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,916 INFO L272 TraceCheckUtils]: 11: Hoare triple {55998#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {55998#(<= ~counter~0 0)} ~cond := #in~cond; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {55998#(<= ~counter~0 0)} assume !(0 == ~cond); {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {55998#(<= ~counter~0 0)} assume true; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,917 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55998#(<= ~counter~0 0)} {55998#(<= ~counter~0 0)} #92#return; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {55998#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:01,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {55998#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56047#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:01,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {56047#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {56047#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:01,919 INFO L272 TraceCheckUtils]: 19: Hoare triple {56047#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56047#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:01,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {56047#(<= ~counter~0 1)} ~cond := #in~cond; {56047#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:01,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {56047#(<= ~counter~0 1)} assume !(0 == ~cond); {56047#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:01,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {56047#(<= ~counter~0 1)} assume true; {56047#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:01,921 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56047#(<= ~counter~0 1)} {56047#(<= ~counter~0 1)} #94#return; {56047#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:01,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {56047#(<= ~counter~0 1)} assume !!(0 != ~r~0); {56047#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:01,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {56047#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56072#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:01,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {56072#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {56072#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:01,922 INFO L272 TraceCheckUtils]: 27: Hoare triple {56072#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56072#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:01,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {56072#(<= ~counter~0 2)} ~cond := #in~cond; {56072#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:01,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {56072#(<= ~counter~0 2)} assume !(0 == ~cond); {56072#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:01,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {56072#(<= ~counter~0 2)} assume true; {56072#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:01,924 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56072#(<= ~counter~0 2)} {56072#(<= ~counter~0 2)} #96#return; {56072#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:01,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {56072#(<= ~counter~0 2)} assume !(~r~0 > 0); {56072#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:01,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {56072#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56097#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:01,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {56097#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {56097#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:01,925 INFO L272 TraceCheckUtils]: 35: Hoare triple {56097#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56097#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:01,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {56097#(<= ~counter~0 3)} ~cond := #in~cond; {56097#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:01,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {56097#(<= ~counter~0 3)} assume !(0 == ~cond); {56097#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:01,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {56097#(<= ~counter~0 3)} assume true; {56097#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:01,926 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56097#(<= ~counter~0 3)} {56097#(<= ~counter~0 3)} #98#return; {56097#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:01,927 INFO L290 TraceCheckUtils]: 40: Hoare triple {56097#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56097#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:01,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {56097#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56122#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:01,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {56122#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {56122#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:01,928 INFO L272 TraceCheckUtils]: 43: Hoare triple {56122#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56122#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:01,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {56122#(<= ~counter~0 4)} ~cond := #in~cond; {56122#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:01,929 INFO L290 TraceCheckUtils]: 45: Hoare triple {56122#(<= ~counter~0 4)} assume !(0 == ~cond); {56122#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:01,929 INFO L290 TraceCheckUtils]: 46: Hoare triple {56122#(<= ~counter~0 4)} assume true; {56122#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:01,929 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56122#(<= ~counter~0 4)} {56122#(<= ~counter~0 4)} #98#return; {56122#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:01,930 INFO L290 TraceCheckUtils]: 48: Hoare triple {56122#(<= ~counter~0 4)} assume !(~r~0 < 0); {56122#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:01,930 INFO L290 TraceCheckUtils]: 49: Hoare triple {56122#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56147#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:01,930 INFO L290 TraceCheckUtils]: 50: Hoare triple {56147#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {56147#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:01,931 INFO L272 TraceCheckUtils]: 51: Hoare triple {56147#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56147#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:01,931 INFO L290 TraceCheckUtils]: 52: Hoare triple {56147#(<= ~counter~0 5)} ~cond := #in~cond; {56147#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:01,931 INFO L290 TraceCheckUtils]: 53: Hoare triple {56147#(<= ~counter~0 5)} assume !(0 == ~cond); {56147#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:01,932 INFO L290 TraceCheckUtils]: 54: Hoare triple {56147#(<= ~counter~0 5)} assume true; {56147#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:01,932 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56147#(<= ~counter~0 5)} {56147#(<= ~counter~0 5)} #94#return; {56147#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:01,932 INFO L290 TraceCheckUtils]: 56: Hoare triple {56147#(<= ~counter~0 5)} assume !!(0 != ~r~0); {56147#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:01,933 INFO L290 TraceCheckUtils]: 57: Hoare triple {56147#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56172#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:01,933 INFO L290 TraceCheckUtils]: 58: Hoare triple {56172#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {56172#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:01,934 INFO L272 TraceCheckUtils]: 59: Hoare triple {56172#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56172#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:01,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {56172#(<= ~counter~0 6)} ~cond := #in~cond; {56172#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:01,934 INFO L290 TraceCheckUtils]: 61: Hoare triple {56172#(<= ~counter~0 6)} assume !(0 == ~cond); {56172#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:01,935 INFO L290 TraceCheckUtils]: 62: Hoare triple {56172#(<= ~counter~0 6)} assume true; {56172#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:01,935 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56172#(<= ~counter~0 6)} {56172#(<= ~counter~0 6)} #96#return; {56172#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:01,935 INFO L290 TraceCheckUtils]: 64: Hoare triple {56172#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56172#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:01,936 INFO L290 TraceCheckUtils]: 65: Hoare triple {56172#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56197#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:01,936 INFO L290 TraceCheckUtils]: 66: Hoare triple {56197#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {56197#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:01,937 INFO L272 TraceCheckUtils]: 67: Hoare triple {56197#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56197#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:01,937 INFO L290 TraceCheckUtils]: 68: Hoare triple {56197#(<= ~counter~0 7)} ~cond := #in~cond; {56197#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:01,937 INFO L290 TraceCheckUtils]: 69: Hoare triple {56197#(<= ~counter~0 7)} assume !(0 == ~cond); {56197#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:01,937 INFO L290 TraceCheckUtils]: 70: Hoare triple {56197#(<= ~counter~0 7)} assume true; {56197#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:01,938 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56197#(<= ~counter~0 7)} {56197#(<= ~counter~0 7)} #96#return; {56197#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:01,938 INFO L290 TraceCheckUtils]: 72: Hoare triple {56197#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56197#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:01,939 INFO L290 TraceCheckUtils]: 73: Hoare triple {56197#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56222#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:01,939 INFO L290 TraceCheckUtils]: 74: Hoare triple {56222#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {56222#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:01,940 INFO L272 TraceCheckUtils]: 75: Hoare triple {56222#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56222#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:01,940 INFO L290 TraceCheckUtils]: 76: Hoare triple {56222#(<= ~counter~0 8)} ~cond := #in~cond; {56222#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:01,940 INFO L290 TraceCheckUtils]: 77: Hoare triple {56222#(<= ~counter~0 8)} assume !(0 == ~cond); {56222#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:01,940 INFO L290 TraceCheckUtils]: 78: Hoare triple {56222#(<= ~counter~0 8)} assume true; {56222#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:01,941 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56222#(<= ~counter~0 8)} {56222#(<= ~counter~0 8)} #96#return; {56222#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:01,941 INFO L290 TraceCheckUtils]: 80: Hoare triple {56222#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56222#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:01,942 INFO L290 TraceCheckUtils]: 81: Hoare triple {56222#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56247#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:01,942 INFO L290 TraceCheckUtils]: 82: Hoare triple {56247#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {56247#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:01,942 INFO L272 TraceCheckUtils]: 83: Hoare triple {56247#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56247#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:01,943 INFO L290 TraceCheckUtils]: 84: Hoare triple {56247#(<= ~counter~0 9)} ~cond := #in~cond; {56247#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:01,943 INFO L290 TraceCheckUtils]: 85: Hoare triple {56247#(<= ~counter~0 9)} assume !(0 == ~cond); {56247#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:01,943 INFO L290 TraceCheckUtils]: 86: Hoare triple {56247#(<= ~counter~0 9)} assume true; {56247#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:01,944 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56247#(<= ~counter~0 9)} {56247#(<= ~counter~0 9)} #96#return; {56247#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:01,944 INFO L290 TraceCheckUtils]: 88: Hoare triple {56247#(<= ~counter~0 9)} assume !(~r~0 > 0); {56247#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:01,945 INFO L290 TraceCheckUtils]: 89: Hoare triple {56247#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56272#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:01,945 INFO L290 TraceCheckUtils]: 90: Hoare triple {56272#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {56272#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:01,945 INFO L272 TraceCheckUtils]: 91: Hoare triple {56272#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56272#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:01,946 INFO L290 TraceCheckUtils]: 92: Hoare triple {56272#(<= ~counter~0 10)} ~cond := #in~cond; {56272#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:01,946 INFO L290 TraceCheckUtils]: 93: Hoare triple {56272#(<= ~counter~0 10)} assume !(0 == ~cond); {56272#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:01,946 INFO L290 TraceCheckUtils]: 94: Hoare triple {56272#(<= ~counter~0 10)} assume true; {56272#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:01,947 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56272#(<= ~counter~0 10)} {56272#(<= ~counter~0 10)} #98#return; {56272#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:01,947 INFO L290 TraceCheckUtils]: 96: Hoare triple {56272#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56272#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:01,947 INFO L290 TraceCheckUtils]: 97: Hoare triple {56272#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56297#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:01,948 INFO L290 TraceCheckUtils]: 98: Hoare triple {56297#(<= ~counter~0 11)} assume !!(#t~post8 < 100);havoc #t~post8; {56297#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:01,948 INFO L272 TraceCheckUtils]: 99: Hoare triple {56297#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56297#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:01,948 INFO L290 TraceCheckUtils]: 100: Hoare triple {56297#(<= ~counter~0 11)} ~cond := #in~cond; {56297#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:01,949 INFO L290 TraceCheckUtils]: 101: Hoare triple {56297#(<= ~counter~0 11)} assume !(0 == ~cond); {56297#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:01,949 INFO L290 TraceCheckUtils]: 102: Hoare triple {56297#(<= ~counter~0 11)} assume true; {56297#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:01,949 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56297#(<= ~counter~0 11)} {56297#(<= ~counter~0 11)} #98#return; {56297#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:01,950 INFO L290 TraceCheckUtils]: 104: Hoare triple {56297#(<= ~counter~0 11)} assume !(~r~0 < 0); {56297#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:01,950 INFO L290 TraceCheckUtils]: 105: Hoare triple {56297#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56322#(<= |main_#t~post6| 11)} is VALID [2022-04-08 12:38:01,950 INFO L290 TraceCheckUtils]: 106: Hoare triple {56322#(<= |main_#t~post6| 11)} assume !(#t~post6 < 100);havoc #t~post6; {55991#false} is VALID [2022-04-08 12:38:01,950 INFO L272 TraceCheckUtils]: 107: Hoare triple {55991#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55991#false} is VALID [2022-04-08 12:38:01,950 INFO L290 TraceCheckUtils]: 108: Hoare triple {55991#false} ~cond := #in~cond; {55991#false} is VALID [2022-04-08 12:38:01,950 INFO L290 TraceCheckUtils]: 109: Hoare triple {55991#false} assume 0 == ~cond; {55991#false} is VALID [2022-04-08 12:38:01,951 INFO L290 TraceCheckUtils]: 110: Hoare triple {55991#false} assume !false; {55991#false} is VALID [2022-04-08 12:38:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 292 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:38:01,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:02,658 INFO L290 TraceCheckUtils]: 110: Hoare triple {55991#false} assume !false; {55991#false} is VALID [2022-04-08 12:38:02,659 INFO L290 TraceCheckUtils]: 109: Hoare triple {55991#false} assume 0 == ~cond; {55991#false} is VALID [2022-04-08 12:38:02,659 INFO L290 TraceCheckUtils]: 108: Hoare triple {55991#false} ~cond := #in~cond; {55991#false} is VALID [2022-04-08 12:38:02,659 INFO L272 TraceCheckUtils]: 107: Hoare triple {55991#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55991#false} is VALID [2022-04-08 12:38:02,659 INFO L290 TraceCheckUtils]: 106: Hoare triple {56350#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {55991#false} is VALID [2022-04-08 12:38:02,659 INFO L290 TraceCheckUtils]: 105: Hoare triple {56354#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56350#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:38:02,659 INFO L290 TraceCheckUtils]: 104: Hoare triple {56354#(< ~counter~0 100)} assume !(~r~0 < 0); {56354#(< ~counter~0 100)} is VALID [2022-04-08 12:38:02,660 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {55990#true} {56354#(< ~counter~0 100)} #98#return; {56354#(< ~counter~0 100)} is VALID [2022-04-08 12:38:02,660 INFO L290 TraceCheckUtils]: 102: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,660 INFO L290 TraceCheckUtils]: 101: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,660 INFO L290 TraceCheckUtils]: 100: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,660 INFO L272 TraceCheckUtils]: 99: Hoare triple {56354#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,660 INFO L290 TraceCheckUtils]: 98: Hoare triple {56354#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {56354#(< ~counter~0 100)} is VALID [2022-04-08 12:38:02,662 INFO L290 TraceCheckUtils]: 97: Hoare triple {56379#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56354#(< ~counter~0 100)} is VALID [2022-04-08 12:38:02,662 INFO L290 TraceCheckUtils]: 96: Hoare triple {56379#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56379#(< ~counter~0 99)} is VALID [2022-04-08 12:38:02,662 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {55990#true} {56379#(< ~counter~0 99)} #98#return; {56379#(< ~counter~0 99)} is VALID [2022-04-08 12:38:02,663 INFO L290 TraceCheckUtils]: 94: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,663 INFO L290 TraceCheckUtils]: 93: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,663 INFO L290 TraceCheckUtils]: 92: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,663 INFO L272 TraceCheckUtils]: 91: Hoare triple {56379#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,663 INFO L290 TraceCheckUtils]: 90: Hoare triple {56379#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {56379#(< ~counter~0 99)} is VALID [2022-04-08 12:38:02,664 INFO L290 TraceCheckUtils]: 89: Hoare triple {56404#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56379#(< ~counter~0 99)} is VALID [2022-04-08 12:38:02,664 INFO L290 TraceCheckUtils]: 88: Hoare triple {56404#(< ~counter~0 98)} assume !(~r~0 > 0); {56404#(< ~counter~0 98)} is VALID [2022-04-08 12:38:02,664 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {55990#true} {56404#(< ~counter~0 98)} #96#return; {56404#(< ~counter~0 98)} is VALID [2022-04-08 12:38:02,664 INFO L290 TraceCheckUtils]: 86: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,664 INFO L290 TraceCheckUtils]: 85: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,665 INFO L290 TraceCheckUtils]: 84: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,665 INFO L272 TraceCheckUtils]: 83: Hoare triple {56404#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,665 INFO L290 TraceCheckUtils]: 82: Hoare triple {56404#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {56404#(< ~counter~0 98)} is VALID [2022-04-08 12:38:02,665 INFO L290 TraceCheckUtils]: 81: Hoare triple {56429#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56404#(< ~counter~0 98)} is VALID [2022-04-08 12:38:02,666 INFO L290 TraceCheckUtils]: 80: Hoare triple {56429#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56429#(< ~counter~0 97)} is VALID [2022-04-08 12:38:02,666 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {55990#true} {56429#(< ~counter~0 97)} #96#return; {56429#(< ~counter~0 97)} is VALID [2022-04-08 12:38:02,666 INFO L290 TraceCheckUtils]: 78: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,666 INFO L290 TraceCheckUtils]: 77: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,666 INFO L290 TraceCheckUtils]: 76: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,666 INFO L272 TraceCheckUtils]: 75: Hoare triple {56429#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,667 INFO L290 TraceCheckUtils]: 74: Hoare triple {56429#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {56429#(< ~counter~0 97)} is VALID [2022-04-08 12:38:02,667 INFO L290 TraceCheckUtils]: 73: Hoare triple {56454#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56429#(< ~counter~0 97)} is VALID [2022-04-08 12:38:02,668 INFO L290 TraceCheckUtils]: 72: Hoare triple {56454#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56454#(< ~counter~0 96)} is VALID [2022-04-08 12:38:02,668 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {55990#true} {56454#(< ~counter~0 96)} #96#return; {56454#(< ~counter~0 96)} is VALID [2022-04-08 12:38:02,668 INFO L290 TraceCheckUtils]: 70: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,668 INFO L290 TraceCheckUtils]: 69: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,668 INFO L290 TraceCheckUtils]: 68: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,668 INFO L272 TraceCheckUtils]: 67: Hoare triple {56454#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,669 INFO L290 TraceCheckUtils]: 66: Hoare triple {56454#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {56454#(< ~counter~0 96)} is VALID [2022-04-08 12:38:02,669 INFO L290 TraceCheckUtils]: 65: Hoare triple {56479#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56454#(< ~counter~0 96)} is VALID [2022-04-08 12:38:02,669 INFO L290 TraceCheckUtils]: 64: Hoare triple {56479#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56479#(< ~counter~0 95)} is VALID [2022-04-08 12:38:02,670 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {55990#true} {56479#(< ~counter~0 95)} #96#return; {56479#(< ~counter~0 95)} is VALID [2022-04-08 12:38:02,670 INFO L290 TraceCheckUtils]: 62: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,670 INFO L290 TraceCheckUtils]: 61: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,670 INFO L290 TraceCheckUtils]: 60: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,670 INFO L272 TraceCheckUtils]: 59: Hoare triple {56479#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,670 INFO L290 TraceCheckUtils]: 58: Hoare triple {56479#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {56479#(< ~counter~0 95)} is VALID [2022-04-08 12:38:02,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {56504#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56479#(< ~counter~0 95)} is VALID [2022-04-08 12:38:02,671 INFO L290 TraceCheckUtils]: 56: Hoare triple {56504#(< ~counter~0 94)} assume !!(0 != ~r~0); {56504#(< ~counter~0 94)} is VALID [2022-04-08 12:38:02,672 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {55990#true} {56504#(< ~counter~0 94)} #94#return; {56504#(< ~counter~0 94)} is VALID [2022-04-08 12:38:02,672 INFO L290 TraceCheckUtils]: 54: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,672 INFO L290 TraceCheckUtils]: 53: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,672 INFO L290 TraceCheckUtils]: 52: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,672 INFO L272 TraceCheckUtils]: 51: Hoare triple {56504#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {56504#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {56504#(< ~counter~0 94)} is VALID [2022-04-08 12:38:02,673 INFO L290 TraceCheckUtils]: 49: Hoare triple {56529#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56504#(< ~counter~0 94)} is VALID [2022-04-08 12:38:02,673 INFO L290 TraceCheckUtils]: 48: Hoare triple {56529#(< ~counter~0 93)} assume !(~r~0 < 0); {56529#(< ~counter~0 93)} is VALID [2022-04-08 12:38:02,674 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55990#true} {56529#(< ~counter~0 93)} #98#return; {56529#(< ~counter~0 93)} is VALID [2022-04-08 12:38:02,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,674 INFO L272 TraceCheckUtils]: 43: Hoare triple {56529#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {56529#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {56529#(< ~counter~0 93)} is VALID [2022-04-08 12:38:02,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {56554#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56529#(< ~counter~0 93)} is VALID [2022-04-08 12:38:02,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {56554#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56554#(< ~counter~0 92)} is VALID [2022-04-08 12:38:02,676 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {55990#true} {56554#(< ~counter~0 92)} #98#return; {56554#(< ~counter~0 92)} is VALID [2022-04-08 12:38:02,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,676 INFO L272 TraceCheckUtils]: 35: Hoare triple {56554#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {56554#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {56554#(< ~counter~0 92)} is VALID [2022-04-08 12:38:02,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {56579#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56554#(< ~counter~0 92)} is VALID [2022-04-08 12:38:02,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {56579#(< ~counter~0 91)} assume !(~r~0 > 0); {56579#(< ~counter~0 91)} is VALID [2022-04-08 12:38:02,677 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {55990#true} {56579#(< ~counter~0 91)} #96#return; {56579#(< ~counter~0 91)} is VALID [2022-04-08 12:38:02,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,678 INFO L272 TraceCheckUtils]: 27: Hoare triple {56579#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {56579#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {56579#(< ~counter~0 91)} is VALID [2022-04-08 12:38:02,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {56604#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56579#(< ~counter~0 91)} is VALID [2022-04-08 12:38:02,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {56604#(< ~counter~0 90)} assume !!(0 != ~r~0); {56604#(< ~counter~0 90)} is VALID [2022-04-08 12:38:02,679 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {55990#true} {56604#(< ~counter~0 90)} #94#return; {56604#(< ~counter~0 90)} is VALID [2022-04-08 12:38:02,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,679 INFO L272 TraceCheckUtils]: 19: Hoare triple {56604#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {56604#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {56604#(< ~counter~0 90)} is VALID [2022-04-08 12:38:02,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {56629#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56604#(< ~counter~0 90)} is VALID [2022-04-08 12:38:02,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {56629#(< ~counter~0 89)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56629#(< ~counter~0 89)} is VALID [2022-04-08 12:38:02,681 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55990#true} {56629#(< ~counter~0 89)} #92#return; {56629#(< ~counter~0 89)} is VALID [2022-04-08 12:38:02,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,681 INFO L272 TraceCheckUtils]: 11: Hoare triple {56629#(< ~counter~0 89)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,682 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55990#true} {56629#(< ~counter~0 89)} #90#return; {56629#(< ~counter~0 89)} is VALID [2022-04-08 12:38:02,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 12:38:02,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 12:38:02,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 12:38:02,682 INFO L272 TraceCheckUtils]: 6: Hoare triple {56629#(< ~counter~0 89)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 12:38:02,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {56629#(< ~counter~0 89)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {56629#(< ~counter~0 89)} is VALID [2022-04-08 12:38:02,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {56629#(< ~counter~0 89)} call #t~ret9 := main(); {56629#(< ~counter~0 89)} is VALID [2022-04-08 12:38:02,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56629#(< ~counter~0 89)} {55990#true} #102#return; {56629#(< ~counter~0 89)} is VALID [2022-04-08 12:38:02,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {56629#(< ~counter~0 89)} assume true; {56629#(< ~counter~0 89)} is VALID [2022-04-08 12:38:02,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {55990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {56629#(< ~counter~0 89)} is VALID [2022-04-08 12:38:02,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {55990#true} call ULTIMATE.init(); {55990#true} is VALID [2022-04-08 12:38:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 12:38:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:02,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3866644] [2022-04-08 12:38:02,684 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:02,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457265375] [2022-04-08 12:38:02,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457265375] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:02,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:02,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-08 12:38:02,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:02,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [65834858] [2022-04-08 12:38:02,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [65834858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:02,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:02,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 12:38:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228920748] [2022-04-08 12:38:02,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:02,685 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 111 [2022-04-08 12:38:02,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:02,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:02,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:02,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 12:38:02,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:02,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 12:38:02,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-08 12:38:02,767 INFO L87 Difference]: Start difference. First operand 538 states and 733 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:04,894 INFO L93 Difference]: Finished difference Result 593 states and 810 transitions. [2022-04-08 12:38:04,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 12:38:04,894 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 111 [2022-04-08 12:38:04,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:04,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-08 12:38:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-08 12:38:04,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 234 transitions. [2022-04-08 12:38:05,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:05,116 INFO L225 Difference]: With dead ends: 593 [2022-04-08 12:38:05,116 INFO L226 Difference]: Without dead ends: 582 [2022-04-08 12:38:05,117 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-08 12:38:05,117 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 173 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 12:38:05,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 262 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 12:38:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-04-08 12:38:06,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 560. [2022-04-08 12:38:06,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:06,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:06,339 INFO L74 IsIncluded]: Start isIncluded. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:06,340 INFO L87 Difference]: Start difference. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:06,363 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-08 12:38:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-08 12:38:06,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:06,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:06,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 582 states. [2022-04-08 12:38:06,366 INFO L87 Difference]: Start difference. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 582 states. [2022-04-08 12:38:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:06,385 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-08 12:38:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-08 12:38:06,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:06,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:06,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:06,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-08 12:38:06,410 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 111 [2022-04-08 12:38:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:06,410 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-08 12:38:06,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:06,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-08 12:38:10,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 768 edges. 767 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-08 12:38:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-08 12:38:10,180 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:10,180 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:38:10,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-08 12:38:10,380 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-08 12:38:10,380 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:10,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:10,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 13 times [2022-04-08 12:38:10,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:10,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1634536462] [2022-04-08 12:38:10,381 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:10,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 14 times [2022-04-08 12:38:10,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:10,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747684953] [2022-04-08 12:38:10,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:10,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:10,392 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:10,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819812985] [2022-04-08 12:38:10,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:38:10,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:10,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:10,393 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:38:10,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-08 12:38:10,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:38:10,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:10,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:38:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:10,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:11,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {60169#true} call ULTIMATE.init(); {60169#true} is VALID [2022-04-08 12:38:11,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {60169#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {60169#true} is VALID [2022-04-08 12:38:11,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60169#true} {60169#true} #102#return; {60169#true} is VALID [2022-04-08 12:38:11,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {60169#true} call #t~ret9 := main(); {60169#true} is VALID [2022-04-08 12:38:11,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {60169#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {60169#true} is VALID [2022-04-08 12:38:11,392 INFO L272 TraceCheckUtils]: 6: Hoare triple {60169#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60169#true} {60169#true} #90#return; {60169#true} is VALID [2022-04-08 12:38:11,393 INFO L272 TraceCheckUtils]: 11: Hoare triple {60169#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,393 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60169#true} {60169#true} #92#return; {60169#true} is VALID [2022-04-08 12:38:11,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {60169#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:11,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {60222#(<= 1 main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:11,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(#t~post6 < 100);havoc #t~post6; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:11,394 INFO L272 TraceCheckUtils]: 19: Hoare triple {60222#(<= 1 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,394 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60169#true} {60222#(<= 1 main_~v~0)} #94#return; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:11,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(0 != ~r~0); {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:11,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {60222#(<= 1 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:11,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:11,395 INFO L272 TraceCheckUtils]: 27: Hoare triple {60222#(<= 1 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,396 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60169#true} {60222#(<= 1 main_~v~0)} #96#return; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:11,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {60222#(<= 1 main_~v~0)} assume !(~r~0 > 0); {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:11,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {60222#(<= 1 main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:11,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:11,397 INFO L272 TraceCheckUtils]: 35: Hoare triple {60222#(<= 1 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,397 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60169#true} {60222#(<= 1 main_~v~0)} #98#return; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:11,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 12:38:11,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 12:38:11,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post8 < 100);havoc #t~post8; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 12:38:11,400 INFO L272 TraceCheckUtils]: 43: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,400 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60169#true} {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #98#return; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 12:38:11,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !(~r~0 < 0); {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 12:38:11,401 INFO L290 TraceCheckUtils]: 49: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 12:38:11,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post6 < 100);havoc #t~post6; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 12:38:11,401 INFO L272 TraceCheckUtils]: 51: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,401 INFO L290 TraceCheckUtils]: 52: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,401 INFO L290 TraceCheckUtils]: 53: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,401 INFO L290 TraceCheckUtils]: 54: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,402 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60169#true} {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #94#return; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 12:38:11,402 INFO L290 TraceCheckUtils]: 56: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(0 != ~r~0); {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 12:38:11,402 INFO L290 TraceCheckUtils]: 57: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 12:38:11,403 INFO L290 TraceCheckUtils]: 58: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post7 < 100);havoc #t~post7; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 12:38:11,403 INFO L272 TraceCheckUtils]: 59: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,403 INFO L290 TraceCheckUtils]: 60: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,403 INFO L290 TraceCheckUtils]: 61: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,403 INFO L290 TraceCheckUtils]: 62: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,403 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60169#true} {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #96#return; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 12:38:11,404 INFO L290 TraceCheckUtils]: 64: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60368#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-08 12:38:11,405 INFO L290 TraceCheckUtils]: 65: Hoare triple {60368#(< (+ main_~r~0 3) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60368#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-08 12:38:11,405 INFO L290 TraceCheckUtils]: 66: Hoare triple {60368#(< (+ main_~r~0 3) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {60368#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-08 12:38:11,405 INFO L272 TraceCheckUtils]: 67: Hoare triple {60368#(< (+ main_~r~0 3) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,405 INFO L290 TraceCheckUtils]: 68: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,405 INFO L290 TraceCheckUtils]: 69: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,405 INFO L290 TraceCheckUtils]: 70: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,406 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60169#true} {60368#(< (+ main_~r~0 3) main_~u~0)} #96#return; {60368#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-08 12:38:11,406 INFO L290 TraceCheckUtils]: 72: Hoare triple {60368#(< (+ main_~r~0 3) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-08 12:38:11,406 INFO L290 TraceCheckUtils]: 73: Hoare triple {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-08 12:38:11,407 INFO L290 TraceCheckUtils]: 74: Hoare triple {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-08 12:38:11,407 INFO L272 TraceCheckUtils]: 75: Hoare triple {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,407 INFO L290 TraceCheckUtils]: 76: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,407 INFO L290 TraceCheckUtils]: 77: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,407 INFO L290 TraceCheckUtils]: 78: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,407 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60169#true} {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #96#return; {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-08 12:38:11,408 INFO L290 TraceCheckUtils]: 80: Hoare triple {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:38:11,408 INFO L290 TraceCheckUtils]: 81: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:38:11,408 INFO L290 TraceCheckUtils]: 82: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 100);havoc #t~post7; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:38:11,408 INFO L272 TraceCheckUtils]: 83: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,408 INFO L290 TraceCheckUtils]: 84: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,408 INFO L290 TraceCheckUtils]: 85: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,408 INFO L290 TraceCheckUtils]: 86: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,409 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60169#true} {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #96#return; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:38:11,409 INFO L290 TraceCheckUtils]: 88: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:38:11,409 INFO L290 TraceCheckUtils]: 89: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:38:11,410 INFO L290 TraceCheckUtils]: 90: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:38:11,410 INFO L272 TraceCheckUtils]: 91: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,410 INFO L290 TraceCheckUtils]: 92: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,410 INFO L290 TraceCheckUtils]: 93: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,410 INFO L290 TraceCheckUtils]: 94: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,410 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60169#true} {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #98#return; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 12:38:11,411 INFO L290 TraceCheckUtils]: 96: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-08 12:38:11,411 INFO L290 TraceCheckUtils]: 97: Hoare triple {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-08 12:38:11,412 INFO L290 TraceCheckUtils]: 98: Hoare triple {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-08 12:38:11,412 INFO L272 TraceCheckUtils]: 99: Hoare triple {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,412 INFO L290 TraceCheckUtils]: 100: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,412 INFO L290 TraceCheckUtils]: 101: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,412 INFO L290 TraceCheckUtils]: 102: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,412 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60169#true} {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} #98#return; {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-08 12:38:11,413 INFO L290 TraceCheckUtils]: 104: Hoare triple {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60170#false} is VALID [2022-04-08 12:38:11,413 INFO L290 TraceCheckUtils]: 105: Hoare triple {60170#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60170#false} is VALID [2022-04-08 12:38:11,413 INFO L290 TraceCheckUtils]: 106: Hoare triple {60170#false} assume !(#t~post8 < 100);havoc #t~post8; {60170#false} is VALID [2022-04-08 12:38:11,413 INFO L290 TraceCheckUtils]: 107: Hoare triple {60170#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60170#false} is VALID [2022-04-08 12:38:11,413 INFO L290 TraceCheckUtils]: 108: Hoare triple {60170#false} assume !(#t~post6 < 100);havoc #t~post6; {60170#false} is VALID [2022-04-08 12:38:11,413 INFO L272 TraceCheckUtils]: 109: Hoare triple {60170#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60170#false} is VALID [2022-04-08 12:38:11,413 INFO L290 TraceCheckUtils]: 110: Hoare triple {60170#false} ~cond := #in~cond; {60170#false} is VALID [2022-04-08 12:38:11,413 INFO L290 TraceCheckUtils]: 111: Hoare triple {60170#false} assume 0 == ~cond; {60170#false} is VALID [2022-04-08 12:38:11,413 INFO L290 TraceCheckUtils]: 112: Hoare triple {60170#false} assume !false; {60170#false} is VALID [2022-04-08 12:38:11,414 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 46 proven. 56 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 12:38:11,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:11,933 INFO L290 TraceCheckUtils]: 112: Hoare triple {60170#false} assume !false; {60170#false} is VALID [2022-04-08 12:38:11,934 INFO L290 TraceCheckUtils]: 111: Hoare triple {60170#false} assume 0 == ~cond; {60170#false} is VALID [2022-04-08 12:38:11,934 INFO L290 TraceCheckUtils]: 110: Hoare triple {60170#false} ~cond := #in~cond; {60170#false} is VALID [2022-04-08 12:38:11,934 INFO L272 TraceCheckUtils]: 109: Hoare triple {60170#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60170#false} is VALID [2022-04-08 12:38:11,934 INFO L290 TraceCheckUtils]: 108: Hoare triple {60170#false} assume !(#t~post6 < 100);havoc #t~post6; {60170#false} is VALID [2022-04-08 12:38:11,934 INFO L290 TraceCheckUtils]: 107: Hoare triple {60170#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60170#false} is VALID [2022-04-08 12:38:11,934 INFO L290 TraceCheckUtils]: 106: Hoare triple {60170#false} assume !(#t~post8 < 100);havoc #t~post8; {60170#false} is VALID [2022-04-08 12:38:11,934 INFO L290 TraceCheckUtils]: 105: Hoare triple {60170#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60170#false} is VALID [2022-04-08 12:38:11,934 INFO L290 TraceCheckUtils]: 104: Hoare triple {60540#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60170#false} is VALID [2022-04-08 12:38:11,935 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60169#true} {60540#(not (< main_~r~0 0))} #98#return; {60540#(not (< main_~r~0 0))} is VALID [2022-04-08 12:38:11,935 INFO L290 TraceCheckUtils]: 102: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,935 INFO L290 TraceCheckUtils]: 101: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,935 INFO L290 TraceCheckUtils]: 100: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,935 INFO L272 TraceCheckUtils]: 99: Hoare triple {60540#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,935 INFO L290 TraceCheckUtils]: 98: Hoare triple {60540#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {60540#(not (< main_~r~0 0))} is VALID [2022-04-08 12:38:11,935 INFO L290 TraceCheckUtils]: 97: Hoare triple {60540#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60540#(not (< main_~r~0 0))} is VALID [2022-04-08 12:38:11,936 INFO L290 TraceCheckUtils]: 96: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60540#(not (< main_~r~0 0))} is VALID [2022-04-08 12:38:11,936 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60169#true} {60565#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:38:11,937 INFO L290 TraceCheckUtils]: 94: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,937 INFO L290 TraceCheckUtils]: 93: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,937 INFO L290 TraceCheckUtils]: 92: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,937 INFO L272 TraceCheckUtils]: 91: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,937 INFO L290 TraceCheckUtils]: 90: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:38:11,937 INFO L290 TraceCheckUtils]: 89: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:38:11,937 INFO L290 TraceCheckUtils]: 88: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:38:11,938 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60169#true} {60565#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:38:11,938 INFO L290 TraceCheckUtils]: 86: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,938 INFO L290 TraceCheckUtils]: 85: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,938 INFO L290 TraceCheckUtils]: 84: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,938 INFO L272 TraceCheckUtils]: 83: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,938 INFO L290 TraceCheckUtils]: 82: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:38:11,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:38:11,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:38:11,940 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60169#true} {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:38:11,940 INFO L290 TraceCheckUtils]: 78: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,940 INFO L290 TraceCheckUtils]: 77: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,940 INFO L290 TraceCheckUtils]: 76: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,940 INFO L272 TraceCheckUtils]: 75: Hoare triple {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,940 INFO L290 TraceCheckUtils]: 74: Hoare triple {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:38:11,940 INFO L290 TraceCheckUtils]: 73: Hoare triple {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:38:11,942 INFO L290 TraceCheckUtils]: 72: Hoare triple {60639#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:38:11,942 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60169#true} {60639#(<= main_~r~0 main_~u~0)} #96#return; {60639#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:38:11,942 INFO L290 TraceCheckUtils]: 70: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,942 INFO L290 TraceCheckUtils]: 69: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,942 INFO L290 TraceCheckUtils]: 68: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,942 INFO L272 TraceCheckUtils]: 67: Hoare triple {60639#(<= main_~r~0 main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {60639#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {60639#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:38:11,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {60639#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60639#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:38:11,943 INFO L290 TraceCheckUtils]: 64: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60639#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 12:38:11,944 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60169#true} {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #96#return; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 12:38:11,944 INFO L290 TraceCheckUtils]: 62: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,944 INFO L272 TraceCheckUtils]: 59: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post7 < 100);havoc #t~post7; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 12:38:11,945 INFO L290 TraceCheckUtils]: 57: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 12:38:11,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(0 != ~r~0); {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 12:38:11,945 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60169#true} {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #94#return; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 12:38:11,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,946 INFO L290 TraceCheckUtils]: 53: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,946 INFO L290 TraceCheckUtils]: 52: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,946 INFO L272 TraceCheckUtils]: 51: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post6 < 100);havoc #t~post6; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 12:38:11,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 12:38:11,947 INFO L290 TraceCheckUtils]: 48: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !(~r~0 < 0); {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 12:38:11,947 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60169#true} {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #98#return; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 12:38:11,947 INFO L290 TraceCheckUtils]: 46: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,947 INFO L290 TraceCheckUtils]: 45: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,947 INFO L290 TraceCheckUtils]: 44: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,947 INFO L272 TraceCheckUtils]: 43: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post8 < 100);havoc #t~post8; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 12:38:11,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 12:38:11,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 12:38:11,949 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60169#true} {60737#(<= 0 (+ main_~v~0 3))} #98#return; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 12:38:11,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,949 INFO L272 TraceCheckUtils]: 35: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(#t~post8 < 100);havoc #t~post8; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 12:38:11,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 12:38:11,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !(~r~0 > 0); {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 12:38:11,950 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60169#true} {60737#(<= 0 (+ main_~v~0 3))} #96#return; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 12:38:11,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,951 INFO L272 TraceCheckUtils]: 27: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 12:38:11,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 12:38:11,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(0 != ~r~0); {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 12:38:11,952 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60169#true} {60737#(<= 0 (+ main_~v~0 3))} #94#return; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 12:38:11,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,952 INFO L272 TraceCheckUtils]: 19: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(#t~post6 < 100);havoc #t~post6; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 12:38:11,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 12:38:11,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {60169#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 12:38:11,953 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60169#true} {60169#true} #92#return; {60169#true} is VALID [2022-04-08 12:38:11,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,953 INFO L272 TraceCheckUtils]: 11: Hoare triple {60169#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60169#true} {60169#true} #90#return; {60169#true} is VALID [2022-04-08 12:38:11,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 12:38:11,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 12:38:11,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {60169#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 12:38:11,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {60169#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {60169#true} is VALID [2022-04-08 12:38:11,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {60169#true} call #t~ret9 := main(); {60169#true} is VALID [2022-04-08 12:38:11,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60169#true} {60169#true} #102#return; {60169#true} is VALID [2022-04-08 12:38:11,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 12:38:11,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {60169#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {60169#true} is VALID [2022-04-08 12:38:11,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {60169#true} call ULTIMATE.init(); {60169#true} is VALID [2022-04-08 12:38:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 34 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 12:38:11,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:11,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747684953] [2022-04-08 12:38:11,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:11,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819812985] [2022-04-08 12:38:11,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819812985] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:11,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:11,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 12:38:11,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:11,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1634536462] [2022-04-08 12:38:11,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1634536462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:11,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:11,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:38:11,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462894984] [2022-04-08 12:38:11,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:11,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-08 12:38:11,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:11,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 12:38:12,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:12,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:38:12,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:12,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:38:12,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-08 12:38:12,025 INFO L87 Difference]: Start difference. First operand 560 states and 768 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 12:38:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:15,172 INFO L93 Difference]: Finished difference Result 862 states and 1224 transitions. [2022-04-08 12:38:15,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 12:38:15,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-08 12:38:15,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 12:38:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-08 12:38:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 12:38:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-08 12:38:15,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2022-04-08 12:38:15,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:15,376 INFO L225 Difference]: With dead ends: 862 [2022-04-08 12:38:15,376 INFO L226 Difference]: Without dead ends: 711 [2022-04-08 12:38:15,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-04-08 12:38:15,377 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 83 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 12:38:15,377 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 328 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 12:38:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-04-08 12:38:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 560. [2022-04-08 12:38:16,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:16,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:16,997 INFO L74 IsIncluded]: Start isIncluded. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:16,998 INFO L87 Difference]: Start difference. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:17,017 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-08 12:38:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-08 12:38:17,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:17,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:17,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 711 states. [2022-04-08 12:38:17,018 INFO L87 Difference]: Start difference. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 711 states. [2022-04-08 12:38:17,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:17,037 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-08 12:38:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-08 12:38:17,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:17,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:17,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:17,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-08 12:38:17,054 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 113 [2022-04-08 12:38:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:17,054 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-08 12:38:17,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 12:38:17,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-08 12:38:19,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 768 edges. 768 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-08 12:38:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-08 12:38:19,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:19,803 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:38:19,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-08 12:38:20,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:20,004 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:20,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:20,004 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 15 times [2022-04-08 12:38:20,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:20,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1574170676] [2022-04-08 12:38:20,004 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:20,004 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 16 times [2022-04-08 12:38:20,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:20,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126070153] [2022-04-08 12:38:20,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:20,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:20,017 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:20,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [18100991] [2022-04-08 12:38:20,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:38:20,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:20,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:20,018 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:38:20,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-08 12:38:20,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:38:20,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:20,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 12:38:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:20,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:20,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {65136#true} call ULTIMATE.init(); {65136#true} is VALID [2022-04-08 12:38:20,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {65136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {65144#(<= ~counter~0 0)} assume true; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65144#(<= ~counter~0 0)} {65136#true} #102#return; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {65144#(<= ~counter~0 0)} call #t~ret9 := main(); {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {65144#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,972 INFO L272 TraceCheckUtils]: 6: Hoare triple {65144#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {65144#(<= ~counter~0 0)} ~cond := #in~cond; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {65144#(<= ~counter~0 0)} assume !(0 == ~cond); {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {65144#(<= ~counter~0 0)} assume true; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65144#(<= ~counter~0 0)} {65144#(<= ~counter~0 0)} #90#return; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,973 INFO L272 TraceCheckUtils]: 11: Hoare triple {65144#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {65144#(<= ~counter~0 0)} ~cond := #in~cond; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {65144#(<= ~counter~0 0)} assume !(0 == ~cond); {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {65144#(<= ~counter~0 0)} assume true; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,975 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65144#(<= ~counter~0 0)} {65144#(<= ~counter~0 0)} #92#return; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {65144#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:20,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {65144#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65193#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:20,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {65193#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {65193#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:20,977 INFO L272 TraceCheckUtils]: 19: Hoare triple {65193#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65193#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:20,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {65193#(<= ~counter~0 1)} ~cond := #in~cond; {65193#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:20,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {65193#(<= ~counter~0 1)} assume !(0 == ~cond); {65193#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:20,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {65193#(<= ~counter~0 1)} assume true; {65193#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:20,978 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65193#(<= ~counter~0 1)} {65193#(<= ~counter~0 1)} #94#return; {65193#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:20,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {65193#(<= ~counter~0 1)} assume !!(0 != ~r~0); {65193#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:20,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {65193#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65218#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:20,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {65218#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {65218#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:20,980 INFO L272 TraceCheckUtils]: 27: Hoare triple {65218#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65218#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:20,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {65218#(<= ~counter~0 2)} ~cond := #in~cond; {65218#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:20,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {65218#(<= ~counter~0 2)} assume !(0 == ~cond); {65218#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:20,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {65218#(<= ~counter~0 2)} assume true; {65218#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:20,981 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65218#(<= ~counter~0 2)} {65218#(<= ~counter~0 2)} #96#return; {65218#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:20,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {65218#(<= ~counter~0 2)} assume !(~r~0 > 0); {65218#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:20,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {65218#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65243#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:20,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {65243#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {65243#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:20,983 INFO L272 TraceCheckUtils]: 35: Hoare triple {65243#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65243#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:20,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {65243#(<= ~counter~0 3)} ~cond := #in~cond; {65243#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:20,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {65243#(<= ~counter~0 3)} assume !(0 == ~cond); {65243#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:20,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {65243#(<= ~counter~0 3)} assume true; {65243#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:20,984 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65243#(<= ~counter~0 3)} {65243#(<= ~counter~0 3)} #98#return; {65243#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:20,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {65243#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65243#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:20,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {65243#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65268#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:20,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {65268#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {65268#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:20,986 INFO L272 TraceCheckUtils]: 43: Hoare triple {65268#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65268#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:20,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {65268#(<= ~counter~0 4)} ~cond := #in~cond; {65268#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:20,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {65268#(<= ~counter~0 4)} assume !(0 == ~cond); {65268#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:20,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {65268#(<= ~counter~0 4)} assume true; {65268#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:20,987 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65268#(<= ~counter~0 4)} {65268#(<= ~counter~0 4)} #98#return; {65268#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:20,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {65268#(<= ~counter~0 4)} assume !(~r~0 < 0); {65268#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:20,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {65268#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65293#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:20,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {65293#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {65293#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:20,989 INFO L272 TraceCheckUtils]: 51: Hoare triple {65293#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65293#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:20,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {65293#(<= ~counter~0 5)} ~cond := #in~cond; {65293#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:20,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {65293#(<= ~counter~0 5)} assume !(0 == ~cond); {65293#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:20,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {65293#(<= ~counter~0 5)} assume true; {65293#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:20,990 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65293#(<= ~counter~0 5)} {65293#(<= ~counter~0 5)} #94#return; {65293#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:20,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {65293#(<= ~counter~0 5)} assume !!(0 != ~r~0); {65293#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:20,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {65293#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65318#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:20,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {65318#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {65318#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:20,992 INFO L272 TraceCheckUtils]: 59: Hoare triple {65318#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65318#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:20,992 INFO L290 TraceCheckUtils]: 60: Hoare triple {65318#(<= ~counter~0 6)} ~cond := #in~cond; {65318#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:20,992 INFO L290 TraceCheckUtils]: 61: Hoare triple {65318#(<= ~counter~0 6)} assume !(0 == ~cond); {65318#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:20,993 INFO L290 TraceCheckUtils]: 62: Hoare triple {65318#(<= ~counter~0 6)} assume true; {65318#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:20,993 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65318#(<= ~counter~0 6)} {65318#(<= ~counter~0 6)} #96#return; {65318#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:20,993 INFO L290 TraceCheckUtils]: 64: Hoare triple {65318#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65318#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:20,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {65318#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65343#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:20,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {65343#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {65343#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:20,995 INFO L272 TraceCheckUtils]: 67: Hoare triple {65343#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65343#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:20,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {65343#(<= ~counter~0 7)} ~cond := #in~cond; {65343#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:20,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {65343#(<= ~counter~0 7)} assume !(0 == ~cond); {65343#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:20,996 INFO L290 TraceCheckUtils]: 70: Hoare triple {65343#(<= ~counter~0 7)} assume true; {65343#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:20,996 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65343#(<= ~counter~0 7)} {65343#(<= ~counter~0 7)} #96#return; {65343#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:20,996 INFO L290 TraceCheckUtils]: 72: Hoare triple {65343#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65343#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:20,997 INFO L290 TraceCheckUtils]: 73: Hoare triple {65343#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65368#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:20,997 INFO L290 TraceCheckUtils]: 74: Hoare triple {65368#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {65368#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:20,998 INFO L272 TraceCheckUtils]: 75: Hoare triple {65368#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65368#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:20,998 INFO L290 TraceCheckUtils]: 76: Hoare triple {65368#(<= ~counter~0 8)} ~cond := #in~cond; {65368#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:20,998 INFO L290 TraceCheckUtils]: 77: Hoare triple {65368#(<= ~counter~0 8)} assume !(0 == ~cond); {65368#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:20,999 INFO L290 TraceCheckUtils]: 78: Hoare triple {65368#(<= ~counter~0 8)} assume true; {65368#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:20,999 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65368#(<= ~counter~0 8)} {65368#(<= ~counter~0 8)} #96#return; {65368#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:20,999 INFO L290 TraceCheckUtils]: 80: Hoare triple {65368#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65368#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:21,000 INFO L290 TraceCheckUtils]: 81: Hoare triple {65368#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65393#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,000 INFO L290 TraceCheckUtils]: 82: Hoare triple {65393#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {65393#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,001 INFO L272 TraceCheckUtils]: 83: Hoare triple {65393#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65393#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,001 INFO L290 TraceCheckUtils]: 84: Hoare triple {65393#(<= ~counter~0 9)} ~cond := #in~cond; {65393#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,001 INFO L290 TraceCheckUtils]: 85: Hoare triple {65393#(<= ~counter~0 9)} assume !(0 == ~cond); {65393#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,002 INFO L290 TraceCheckUtils]: 86: Hoare triple {65393#(<= ~counter~0 9)} assume true; {65393#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,002 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65393#(<= ~counter~0 9)} {65393#(<= ~counter~0 9)} #96#return; {65393#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,002 INFO L290 TraceCheckUtils]: 88: Hoare triple {65393#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65393#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,003 INFO L290 TraceCheckUtils]: 89: Hoare triple {65393#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65418#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,003 INFO L290 TraceCheckUtils]: 90: Hoare triple {65418#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {65418#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,004 INFO L272 TraceCheckUtils]: 91: Hoare triple {65418#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65418#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,004 INFO L290 TraceCheckUtils]: 92: Hoare triple {65418#(<= ~counter~0 10)} ~cond := #in~cond; {65418#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,004 INFO L290 TraceCheckUtils]: 93: Hoare triple {65418#(<= ~counter~0 10)} assume !(0 == ~cond); {65418#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,004 INFO L290 TraceCheckUtils]: 94: Hoare triple {65418#(<= ~counter~0 10)} assume true; {65418#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,005 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65418#(<= ~counter~0 10)} {65418#(<= ~counter~0 10)} #96#return; {65418#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,005 INFO L290 TraceCheckUtils]: 96: Hoare triple {65418#(<= ~counter~0 10)} assume !(~r~0 > 0); {65418#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,006 INFO L290 TraceCheckUtils]: 97: Hoare triple {65418#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65443#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,006 INFO L290 TraceCheckUtils]: 98: Hoare triple {65443#(<= ~counter~0 11)} assume !!(#t~post8 < 100);havoc #t~post8; {65443#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,007 INFO L272 TraceCheckUtils]: 99: Hoare triple {65443#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65443#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,007 INFO L290 TraceCheckUtils]: 100: Hoare triple {65443#(<= ~counter~0 11)} ~cond := #in~cond; {65443#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,007 INFO L290 TraceCheckUtils]: 101: Hoare triple {65443#(<= ~counter~0 11)} assume !(0 == ~cond); {65443#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,007 INFO L290 TraceCheckUtils]: 102: Hoare triple {65443#(<= ~counter~0 11)} assume true; {65443#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,008 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65443#(<= ~counter~0 11)} {65443#(<= ~counter~0 11)} #98#return; {65443#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,008 INFO L290 TraceCheckUtils]: 104: Hoare triple {65443#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65443#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,008 INFO L290 TraceCheckUtils]: 105: Hoare triple {65443#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65468#(<= |main_#t~post8| 11)} is VALID [2022-04-08 12:38:21,009 INFO L290 TraceCheckUtils]: 106: Hoare triple {65468#(<= |main_#t~post8| 11)} assume !(#t~post8 < 100);havoc #t~post8; {65137#false} is VALID [2022-04-08 12:38:21,009 INFO L290 TraceCheckUtils]: 107: Hoare triple {65137#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65137#false} is VALID [2022-04-08 12:38:21,009 INFO L290 TraceCheckUtils]: 108: Hoare triple {65137#false} assume !(#t~post6 < 100);havoc #t~post6; {65137#false} is VALID [2022-04-08 12:38:21,009 INFO L272 TraceCheckUtils]: 109: Hoare triple {65137#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65137#false} is VALID [2022-04-08 12:38:21,009 INFO L290 TraceCheckUtils]: 110: Hoare triple {65137#false} ~cond := #in~cond; {65137#false} is VALID [2022-04-08 12:38:21,009 INFO L290 TraceCheckUtils]: 111: Hoare triple {65137#false} assume 0 == ~cond; {65137#false} is VALID [2022-04-08 12:38:21,009 INFO L290 TraceCheckUtils]: 112: Hoare triple {65137#false} assume !false; {65137#false} is VALID [2022-04-08 12:38:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 302 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:38:21,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:21,625 INFO L290 TraceCheckUtils]: 112: Hoare triple {65137#false} assume !false; {65137#false} is VALID [2022-04-08 12:38:21,625 INFO L290 TraceCheckUtils]: 111: Hoare triple {65137#false} assume 0 == ~cond; {65137#false} is VALID [2022-04-08 12:38:21,625 INFO L290 TraceCheckUtils]: 110: Hoare triple {65137#false} ~cond := #in~cond; {65137#false} is VALID [2022-04-08 12:38:21,625 INFO L272 TraceCheckUtils]: 109: Hoare triple {65137#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65137#false} is VALID [2022-04-08 12:38:21,625 INFO L290 TraceCheckUtils]: 108: Hoare triple {65137#false} assume !(#t~post6 < 100);havoc #t~post6; {65137#false} is VALID [2022-04-08 12:38:21,625 INFO L290 TraceCheckUtils]: 107: Hoare triple {65137#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65137#false} is VALID [2022-04-08 12:38:21,625 INFO L290 TraceCheckUtils]: 106: Hoare triple {65508#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {65137#false} is VALID [2022-04-08 12:38:21,626 INFO L290 TraceCheckUtils]: 105: Hoare triple {65512#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65508#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:38:21,626 INFO L290 TraceCheckUtils]: 104: Hoare triple {65512#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65512#(< ~counter~0 100)} is VALID [2022-04-08 12:38:21,627 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65136#true} {65512#(< ~counter~0 100)} #98#return; {65512#(< ~counter~0 100)} is VALID [2022-04-08 12:38:21,627 INFO L290 TraceCheckUtils]: 102: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,627 INFO L290 TraceCheckUtils]: 101: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,627 INFO L290 TraceCheckUtils]: 100: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,627 INFO L272 TraceCheckUtils]: 99: Hoare triple {65512#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,627 INFO L290 TraceCheckUtils]: 98: Hoare triple {65512#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {65512#(< ~counter~0 100)} is VALID [2022-04-08 12:38:21,628 INFO L290 TraceCheckUtils]: 97: Hoare triple {65537#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65512#(< ~counter~0 100)} is VALID [2022-04-08 12:38:21,629 INFO L290 TraceCheckUtils]: 96: Hoare triple {65537#(< ~counter~0 99)} assume !(~r~0 > 0); {65537#(< ~counter~0 99)} is VALID [2022-04-08 12:38:21,629 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65136#true} {65537#(< ~counter~0 99)} #96#return; {65537#(< ~counter~0 99)} is VALID [2022-04-08 12:38:21,629 INFO L290 TraceCheckUtils]: 94: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,629 INFO L290 TraceCheckUtils]: 93: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,629 INFO L290 TraceCheckUtils]: 92: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,629 INFO L272 TraceCheckUtils]: 91: Hoare triple {65537#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,630 INFO L290 TraceCheckUtils]: 90: Hoare triple {65537#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {65537#(< ~counter~0 99)} is VALID [2022-04-08 12:38:21,630 INFO L290 TraceCheckUtils]: 89: Hoare triple {65562#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65537#(< ~counter~0 99)} is VALID [2022-04-08 12:38:21,631 INFO L290 TraceCheckUtils]: 88: Hoare triple {65562#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65562#(< ~counter~0 98)} is VALID [2022-04-08 12:38:21,631 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65136#true} {65562#(< ~counter~0 98)} #96#return; {65562#(< ~counter~0 98)} is VALID [2022-04-08 12:38:21,631 INFO L290 TraceCheckUtils]: 86: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,631 INFO L290 TraceCheckUtils]: 85: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,631 INFO L290 TraceCheckUtils]: 84: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,631 INFO L272 TraceCheckUtils]: 83: Hoare triple {65562#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,632 INFO L290 TraceCheckUtils]: 82: Hoare triple {65562#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {65562#(< ~counter~0 98)} is VALID [2022-04-08 12:38:21,632 INFO L290 TraceCheckUtils]: 81: Hoare triple {65587#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65562#(< ~counter~0 98)} is VALID [2022-04-08 12:38:21,633 INFO L290 TraceCheckUtils]: 80: Hoare triple {65587#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65587#(< ~counter~0 97)} is VALID [2022-04-08 12:38:21,633 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65136#true} {65587#(< ~counter~0 97)} #96#return; {65587#(< ~counter~0 97)} is VALID [2022-04-08 12:38:21,633 INFO L290 TraceCheckUtils]: 78: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,633 INFO L290 TraceCheckUtils]: 77: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,633 INFO L290 TraceCheckUtils]: 76: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,633 INFO L272 TraceCheckUtils]: 75: Hoare triple {65587#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,634 INFO L290 TraceCheckUtils]: 74: Hoare triple {65587#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {65587#(< ~counter~0 97)} is VALID [2022-04-08 12:38:21,634 INFO L290 TraceCheckUtils]: 73: Hoare triple {65612#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65587#(< ~counter~0 97)} is VALID [2022-04-08 12:38:21,635 INFO L290 TraceCheckUtils]: 72: Hoare triple {65612#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65612#(< ~counter~0 96)} is VALID [2022-04-08 12:38:21,635 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65136#true} {65612#(< ~counter~0 96)} #96#return; {65612#(< ~counter~0 96)} is VALID [2022-04-08 12:38:21,635 INFO L290 TraceCheckUtils]: 70: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,635 INFO L290 TraceCheckUtils]: 69: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,635 INFO L290 TraceCheckUtils]: 68: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,635 INFO L272 TraceCheckUtils]: 67: Hoare triple {65612#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {65612#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {65612#(< ~counter~0 96)} is VALID [2022-04-08 12:38:21,636 INFO L290 TraceCheckUtils]: 65: Hoare triple {65637#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65612#(< ~counter~0 96)} is VALID [2022-04-08 12:38:21,637 INFO L290 TraceCheckUtils]: 64: Hoare triple {65637#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65637#(< ~counter~0 95)} is VALID [2022-04-08 12:38:21,637 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65136#true} {65637#(< ~counter~0 95)} #96#return; {65637#(< ~counter~0 95)} is VALID [2022-04-08 12:38:21,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,637 INFO L290 TraceCheckUtils]: 60: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,637 INFO L272 TraceCheckUtils]: 59: Hoare triple {65637#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {65637#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {65637#(< ~counter~0 95)} is VALID [2022-04-08 12:38:21,638 INFO L290 TraceCheckUtils]: 57: Hoare triple {65662#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65637#(< ~counter~0 95)} is VALID [2022-04-08 12:38:21,638 INFO L290 TraceCheckUtils]: 56: Hoare triple {65662#(< ~counter~0 94)} assume !!(0 != ~r~0); {65662#(< ~counter~0 94)} is VALID [2022-04-08 12:38:21,639 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65136#true} {65662#(< ~counter~0 94)} #94#return; {65662#(< ~counter~0 94)} is VALID [2022-04-08 12:38:21,639 INFO L290 TraceCheckUtils]: 54: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,639 INFO L272 TraceCheckUtils]: 51: Hoare triple {65662#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {65662#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {65662#(< ~counter~0 94)} is VALID [2022-04-08 12:38:21,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {65687#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65662#(< ~counter~0 94)} is VALID [2022-04-08 12:38:21,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {65687#(< ~counter~0 93)} assume !(~r~0 < 0); {65687#(< ~counter~0 93)} is VALID [2022-04-08 12:38:21,641 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65136#true} {65687#(< ~counter~0 93)} #98#return; {65687#(< ~counter~0 93)} is VALID [2022-04-08 12:38:21,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,641 INFO L290 TraceCheckUtils]: 45: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,641 INFO L290 TraceCheckUtils]: 44: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,641 INFO L272 TraceCheckUtils]: 43: Hoare triple {65687#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {65687#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {65687#(< ~counter~0 93)} is VALID [2022-04-08 12:38:21,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {65712#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65687#(< ~counter~0 93)} is VALID [2022-04-08 12:38:21,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {65712#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65712#(< ~counter~0 92)} is VALID [2022-04-08 12:38:21,643 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65136#true} {65712#(< ~counter~0 92)} #98#return; {65712#(< ~counter~0 92)} is VALID [2022-04-08 12:38:21,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,643 INFO L290 TraceCheckUtils]: 36: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,643 INFO L272 TraceCheckUtils]: 35: Hoare triple {65712#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {65712#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {65712#(< ~counter~0 92)} is VALID [2022-04-08 12:38:21,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {65737#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65712#(< ~counter~0 92)} is VALID [2022-04-08 12:38:21,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {65737#(< ~counter~0 91)} assume !(~r~0 > 0); {65737#(< ~counter~0 91)} is VALID [2022-04-08 12:38:21,645 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65136#true} {65737#(< ~counter~0 91)} #96#return; {65737#(< ~counter~0 91)} is VALID [2022-04-08 12:38:21,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,645 INFO L272 TraceCheckUtils]: 27: Hoare triple {65737#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {65737#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {65737#(< ~counter~0 91)} is VALID [2022-04-08 12:38:21,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {65762#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65737#(< ~counter~0 91)} is VALID [2022-04-08 12:38:21,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {65762#(< ~counter~0 90)} assume !!(0 != ~r~0); {65762#(< ~counter~0 90)} is VALID [2022-04-08 12:38:21,647 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65136#true} {65762#(< ~counter~0 90)} #94#return; {65762#(< ~counter~0 90)} is VALID [2022-04-08 12:38:21,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,647 INFO L272 TraceCheckUtils]: 19: Hoare triple {65762#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {65762#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {65762#(< ~counter~0 90)} is VALID [2022-04-08 12:38:21,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {65787#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65762#(< ~counter~0 90)} is VALID [2022-04-08 12:38:21,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {65787#(< ~counter~0 89)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65787#(< ~counter~0 89)} is VALID [2022-04-08 12:38:21,648 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65136#true} {65787#(< ~counter~0 89)} #92#return; {65787#(< ~counter~0 89)} is VALID [2022-04-08 12:38:21,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,649 INFO L272 TraceCheckUtils]: 11: Hoare triple {65787#(< ~counter~0 89)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,649 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65136#true} {65787#(< ~counter~0 89)} #90#return; {65787#(< ~counter~0 89)} is VALID [2022-04-08 12:38:21,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 12:38:21,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 12:38:21,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 12:38:21,649 INFO L272 TraceCheckUtils]: 6: Hoare triple {65787#(< ~counter~0 89)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 12:38:21,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {65787#(< ~counter~0 89)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {65787#(< ~counter~0 89)} is VALID [2022-04-08 12:38:21,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {65787#(< ~counter~0 89)} call #t~ret9 := main(); {65787#(< ~counter~0 89)} is VALID [2022-04-08 12:38:21,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65787#(< ~counter~0 89)} {65136#true} #102#return; {65787#(< ~counter~0 89)} is VALID [2022-04-08 12:38:21,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {65787#(< ~counter~0 89)} assume true; {65787#(< ~counter~0 89)} is VALID [2022-04-08 12:38:21,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {65136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {65787#(< ~counter~0 89)} is VALID [2022-04-08 12:38:21,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {65136#true} call ULTIMATE.init(); {65136#true} is VALID [2022-04-08 12:38:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 82 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 12:38:21,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:21,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126070153] [2022-04-08 12:38:21,651 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:21,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18100991] [2022-04-08 12:38:21,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18100991] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:21,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:21,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-08 12:38:21,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:21,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1574170676] [2022-04-08 12:38:21,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1574170676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:21,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:21,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 12:38:21,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646510600] [2022-04-08 12:38:21,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:21,652 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 113 [2022-04-08 12:38:21,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:21,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:21,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:21,737 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 12:38:21,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:21,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 12:38:21,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-08 12:38:21,738 INFO L87 Difference]: Start difference. First operand 560 states and 768 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:24,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:24,398 INFO L93 Difference]: Finished difference Result 781 states and 1101 transitions. [2022-04-08 12:38:24,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 12:38:24,398 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 113 [2022-04-08 12:38:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-08 12:38:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-08 12:38:24,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 256 transitions. [2022-04-08 12:38:24,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:24,631 INFO L225 Difference]: With dead ends: 781 [2022-04-08 12:38:24,632 INFO L226 Difference]: Without dead ends: 588 [2022-04-08 12:38:24,632 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=555, Invalid=777, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 12:38:24,633 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 163 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 12:38:24,633 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 262 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 12:38:24,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-08 12:38:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 578. [2022-04-08 12:38:26,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:26,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:26,262 INFO L74 IsIncluded]: Start isIncluded. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:26,262 INFO L87 Difference]: Start difference. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:26,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:26,275 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-08 12:38:26,275 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-08 12:38:26,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:26,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:26,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 588 states. [2022-04-08 12:38:26,277 INFO L87 Difference]: Start difference. First operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 588 states. [2022-04-08 12:38:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:26,296 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-08 12:38:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-08 12:38:26,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:26,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:26,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:26,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 790 transitions. [2022-04-08 12:38:26,313 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 790 transitions. Word has length 113 [2022-04-08 12:38:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:26,313 INFO L478 AbstractCegarLoop]: Abstraction has 578 states and 790 transitions. [2022-04-08 12:38:26,313 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:26,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 790 transitions. [2022-04-08 12:38:29,454 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-08 12:38:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 790 transitions. [2022-04-08 12:38:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-08 12:38:29,456 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:29,456 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:38:29,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-08 12:38:29,656 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-08 12:38:29,656 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 13 times [2022-04-08 12:38:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:29,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006231968] [2022-04-08 12:38:29,657 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 14 times [2022-04-08 12:38:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:29,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280974738] [2022-04-08 12:38:29,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:29,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:29,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:29,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233066287] [2022-04-08 12:38:29,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:38:29,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:29,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:29,679 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:38:29,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-08 12:38:29,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:38:29,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:29,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 12:38:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:29,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:30,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {69753#true} call ULTIMATE.init(); {69753#true} is VALID [2022-04-08 12:38:30,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {69753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {69761#(<= ~counter~0 0)} assume true; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69761#(<= ~counter~0 0)} {69753#true} #102#return; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {69761#(<= ~counter~0 0)} call #t~ret9 := main(); {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {69761#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {69761#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {69761#(<= ~counter~0 0)} ~cond := #in~cond; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {69761#(<= ~counter~0 0)} assume !(0 == ~cond); {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {69761#(<= ~counter~0 0)} assume true; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,322 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69761#(<= ~counter~0 0)} {69761#(<= ~counter~0 0)} #90#return; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,322 INFO L272 TraceCheckUtils]: 11: Hoare triple {69761#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {69761#(<= ~counter~0 0)} ~cond := #in~cond; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {69761#(<= ~counter~0 0)} assume !(0 == ~cond); {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {69761#(<= ~counter~0 0)} assume true; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,323 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69761#(<= ~counter~0 0)} {69761#(<= ~counter~0 0)} #92#return; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {69761#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:30,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {69761#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69810#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:30,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {69810#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {69810#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:30,326 INFO L272 TraceCheckUtils]: 19: Hoare triple {69810#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69810#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:30,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {69810#(<= ~counter~0 1)} ~cond := #in~cond; {69810#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:30,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {69810#(<= ~counter~0 1)} assume !(0 == ~cond); {69810#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:30,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {69810#(<= ~counter~0 1)} assume true; {69810#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:30,327 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69810#(<= ~counter~0 1)} {69810#(<= ~counter~0 1)} #94#return; {69810#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:30,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {69810#(<= ~counter~0 1)} assume !!(0 != ~r~0); {69810#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:30,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {69810#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69835#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:30,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {69835#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {69835#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:30,329 INFO L272 TraceCheckUtils]: 27: Hoare triple {69835#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69835#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:30,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {69835#(<= ~counter~0 2)} ~cond := #in~cond; {69835#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:30,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {69835#(<= ~counter~0 2)} assume !(0 == ~cond); {69835#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:30,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {69835#(<= ~counter~0 2)} assume true; {69835#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:30,330 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69835#(<= ~counter~0 2)} {69835#(<= ~counter~0 2)} #96#return; {69835#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:30,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {69835#(<= ~counter~0 2)} assume !(~r~0 > 0); {69835#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:30,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {69835#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69860#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:30,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {69860#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {69860#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:30,332 INFO L272 TraceCheckUtils]: 35: Hoare triple {69860#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69860#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:30,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {69860#(<= ~counter~0 3)} ~cond := #in~cond; {69860#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:30,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {69860#(<= ~counter~0 3)} assume !(0 == ~cond); {69860#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:30,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {69860#(<= ~counter~0 3)} assume true; {69860#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:30,333 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69860#(<= ~counter~0 3)} {69860#(<= ~counter~0 3)} #98#return; {69860#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:30,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {69860#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69860#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:30,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {69860#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69885#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:30,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {69885#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {69885#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:30,335 INFO L272 TraceCheckUtils]: 43: Hoare triple {69885#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69885#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:30,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {69885#(<= ~counter~0 4)} ~cond := #in~cond; {69885#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:30,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {69885#(<= ~counter~0 4)} assume !(0 == ~cond); {69885#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:30,336 INFO L290 TraceCheckUtils]: 46: Hoare triple {69885#(<= ~counter~0 4)} assume true; {69885#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:30,336 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69885#(<= ~counter~0 4)} {69885#(<= ~counter~0 4)} #98#return; {69885#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:30,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {69885#(<= ~counter~0 4)} assume !(~r~0 < 0); {69885#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:30,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {69885#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69910#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:30,337 INFO L290 TraceCheckUtils]: 50: Hoare triple {69910#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {69910#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:30,338 INFO L272 TraceCheckUtils]: 51: Hoare triple {69910#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69910#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:30,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {69910#(<= ~counter~0 5)} ~cond := #in~cond; {69910#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:30,338 INFO L290 TraceCheckUtils]: 53: Hoare triple {69910#(<= ~counter~0 5)} assume !(0 == ~cond); {69910#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:30,339 INFO L290 TraceCheckUtils]: 54: Hoare triple {69910#(<= ~counter~0 5)} assume true; {69910#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:30,339 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69910#(<= ~counter~0 5)} {69910#(<= ~counter~0 5)} #94#return; {69910#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:30,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {69910#(<= ~counter~0 5)} assume !!(0 != ~r~0); {69910#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:30,340 INFO L290 TraceCheckUtils]: 57: Hoare triple {69910#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69935#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:30,340 INFO L290 TraceCheckUtils]: 58: Hoare triple {69935#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {69935#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:30,341 INFO L272 TraceCheckUtils]: 59: Hoare triple {69935#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69935#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:30,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {69935#(<= ~counter~0 6)} ~cond := #in~cond; {69935#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:30,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {69935#(<= ~counter~0 6)} assume !(0 == ~cond); {69935#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:30,342 INFO L290 TraceCheckUtils]: 62: Hoare triple {69935#(<= ~counter~0 6)} assume true; {69935#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:30,342 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69935#(<= ~counter~0 6)} {69935#(<= ~counter~0 6)} #96#return; {69935#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:30,342 INFO L290 TraceCheckUtils]: 64: Hoare triple {69935#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69935#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:30,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {69935#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69960#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:30,343 INFO L290 TraceCheckUtils]: 66: Hoare triple {69960#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {69960#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:30,344 INFO L272 TraceCheckUtils]: 67: Hoare triple {69960#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69960#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:30,344 INFO L290 TraceCheckUtils]: 68: Hoare triple {69960#(<= ~counter~0 7)} ~cond := #in~cond; {69960#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:30,344 INFO L290 TraceCheckUtils]: 69: Hoare triple {69960#(<= ~counter~0 7)} assume !(0 == ~cond); {69960#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:30,345 INFO L290 TraceCheckUtils]: 70: Hoare triple {69960#(<= ~counter~0 7)} assume true; {69960#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:30,345 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69960#(<= ~counter~0 7)} {69960#(<= ~counter~0 7)} #96#return; {69960#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:30,345 INFO L290 TraceCheckUtils]: 72: Hoare triple {69960#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69960#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:30,346 INFO L290 TraceCheckUtils]: 73: Hoare triple {69960#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69985#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:30,346 INFO L290 TraceCheckUtils]: 74: Hoare triple {69985#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {69985#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:30,347 INFO L272 TraceCheckUtils]: 75: Hoare triple {69985#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69985#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:30,347 INFO L290 TraceCheckUtils]: 76: Hoare triple {69985#(<= ~counter~0 8)} ~cond := #in~cond; {69985#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:30,347 INFO L290 TraceCheckUtils]: 77: Hoare triple {69985#(<= ~counter~0 8)} assume !(0 == ~cond); {69985#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:30,348 INFO L290 TraceCheckUtils]: 78: Hoare triple {69985#(<= ~counter~0 8)} assume true; {69985#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:30,348 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69985#(<= ~counter~0 8)} {69985#(<= ~counter~0 8)} #96#return; {69985#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:30,348 INFO L290 TraceCheckUtils]: 80: Hoare triple {69985#(<= ~counter~0 8)} assume !(~r~0 > 0); {69985#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:30,349 INFO L290 TraceCheckUtils]: 81: Hoare triple {69985#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70010#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:30,349 INFO L290 TraceCheckUtils]: 82: Hoare triple {70010#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {70010#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:30,350 INFO L272 TraceCheckUtils]: 83: Hoare triple {70010#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70010#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:30,350 INFO L290 TraceCheckUtils]: 84: Hoare triple {70010#(<= ~counter~0 9)} ~cond := #in~cond; {70010#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:30,350 INFO L290 TraceCheckUtils]: 85: Hoare triple {70010#(<= ~counter~0 9)} assume !(0 == ~cond); {70010#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:30,351 INFO L290 TraceCheckUtils]: 86: Hoare triple {70010#(<= ~counter~0 9)} assume true; {70010#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:30,351 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70010#(<= ~counter~0 9)} {70010#(<= ~counter~0 9)} #98#return; {70010#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:30,351 INFO L290 TraceCheckUtils]: 88: Hoare triple {70010#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70010#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:30,352 INFO L290 TraceCheckUtils]: 89: Hoare triple {70010#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70035#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:30,352 INFO L290 TraceCheckUtils]: 90: Hoare triple {70035#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {70035#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:30,353 INFO L272 TraceCheckUtils]: 91: Hoare triple {70035#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70035#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:30,353 INFO L290 TraceCheckUtils]: 92: Hoare triple {70035#(<= ~counter~0 10)} ~cond := #in~cond; {70035#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:30,353 INFO L290 TraceCheckUtils]: 93: Hoare triple {70035#(<= ~counter~0 10)} assume !(0 == ~cond); {70035#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:30,354 INFO L290 TraceCheckUtils]: 94: Hoare triple {70035#(<= ~counter~0 10)} assume true; {70035#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:30,354 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {70035#(<= ~counter~0 10)} {70035#(<= ~counter~0 10)} #98#return; {70035#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:30,354 INFO L290 TraceCheckUtils]: 96: Hoare triple {70035#(<= ~counter~0 10)} assume !(~r~0 < 0); {70035#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:30,355 INFO L290 TraceCheckUtils]: 97: Hoare triple {70035#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70060#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:30,355 INFO L290 TraceCheckUtils]: 98: Hoare triple {70060#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {70060#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:30,356 INFO L272 TraceCheckUtils]: 99: Hoare triple {70060#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70060#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:30,356 INFO L290 TraceCheckUtils]: 100: Hoare triple {70060#(<= ~counter~0 11)} ~cond := #in~cond; {70060#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:30,356 INFO L290 TraceCheckUtils]: 101: Hoare triple {70060#(<= ~counter~0 11)} assume !(0 == ~cond); {70060#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:30,357 INFO L290 TraceCheckUtils]: 102: Hoare triple {70060#(<= ~counter~0 11)} assume true; {70060#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:30,357 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {70060#(<= ~counter~0 11)} {70060#(<= ~counter~0 11)} #94#return; {70060#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:30,357 INFO L290 TraceCheckUtils]: 104: Hoare triple {70060#(<= ~counter~0 11)} assume !!(0 != ~r~0); {70060#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:30,358 INFO L290 TraceCheckUtils]: 105: Hoare triple {70060#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70085#(<= |main_#t~post7| 11)} is VALID [2022-04-08 12:38:30,358 INFO L290 TraceCheckUtils]: 106: Hoare triple {70085#(<= |main_#t~post7| 11)} assume !(#t~post7 < 100);havoc #t~post7; {69754#false} is VALID [2022-04-08 12:38:30,358 INFO L290 TraceCheckUtils]: 107: Hoare triple {69754#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69754#false} is VALID [2022-04-08 12:38:30,358 INFO L290 TraceCheckUtils]: 108: Hoare triple {69754#false} assume !(#t~post8 < 100);havoc #t~post8; {69754#false} is VALID [2022-04-08 12:38:30,358 INFO L290 TraceCheckUtils]: 109: Hoare triple {69754#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69754#false} is VALID [2022-04-08 12:38:30,358 INFO L290 TraceCheckUtils]: 110: Hoare triple {69754#false} assume !(#t~post6 < 100);havoc #t~post6; {69754#false} is VALID [2022-04-08 12:38:30,358 INFO L272 TraceCheckUtils]: 111: Hoare triple {69754#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69754#false} is VALID [2022-04-08 12:38:30,358 INFO L290 TraceCheckUtils]: 112: Hoare triple {69754#false} ~cond := #in~cond; {69754#false} is VALID [2022-04-08 12:38:30,358 INFO L290 TraceCheckUtils]: 113: Hoare triple {69754#false} assume 0 == ~cond; {69754#false} is VALID [2022-04-08 12:38:30,358 INFO L290 TraceCheckUtils]: 114: Hoare triple {69754#false} assume !false; {69754#false} is VALID [2022-04-08 12:38:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 288 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:38:30,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:30,990 INFO L290 TraceCheckUtils]: 114: Hoare triple {69754#false} assume !false; {69754#false} is VALID [2022-04-08 12:38:30,990 INFO L290 TraceCheckUtils]: 113: Hoare triple {69754#false} assume 0 == ~cond; {69754#false} is VALID [2022-04-08 12:38:30,990 INFO L290 TraceCheckUtils]: 112: Hoare triple {69754#false} ~cond := #in~cond; {69754#false} is VALID [2022-04-08 12:38:30,990 INFO L272 TraceCheckUtils]: 111: Hoare triple {69754#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69754#false} is VALID [2022-04-08 12:38:30,990 INFO L290 TraceCheckUtils]: 110: Hoare triple {69754#false} assume !(#t~post6 < 100);havoc #t~post6; {69754#false} is VALID [2022-04-08 12:38:30,990 INFO L290 TraceCheckUtils]: 109: Hoare triple {69754#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69754#false} is VALID [2022-04-08 12:38:30,990 INFO L290 TraceCheckUtils]: 108: Hoare triple {69754#false} assume !(#t~post8 < 100);havoc #t~post8; {69754#false} is VALID [2022-04-08 12:38:30,990 INFO L290 TraceCheckUtils]: 107: Hoare triple {69754#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69754#false} is VALID [2022-04-08 12:38:30,990 INFO L290 TraceCheckUtils]: 106: Hoare triple {70137#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {69754#false} is VALID [2022-04-08 12:38:30,991 INFO L290 TraceCheckUtils]: 105: Hoare triple {70141#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70137#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:38:30,991 INFO L290 TraceCheckUtils]: 104: Hoare triple {70141#(< ~counter~0 100)} assume !!(0 != ~r~0); {70141#(< ~counter~0 100)} is VALID [2022-04-08 12:38:30,991 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69753#true} {70141#(< ~counter~0 100)} #94#return; {70141#(< ~counter~0 100)} is VALID [2022-04-08 12:38:30,992 INFO L290 TraceCheckUtils]: 102: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:30,992 INFO L290 TraceCheckUtils]: 101: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:30,992 INFO L290 TraceCheckUtils]: 100: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:30,992 INFO L272 TraceCheckUtils]: 99: Hoare triple {70141#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:30,992 INFO L290 TraceCheckUtils]: 98: Hoare triple {70141#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {70141#(< ~counter~0 100)} is VALID [2022-04-08 12:38:30,993 INFO L290 TraceCheckUtils]: 97: Hoare triple {70166#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70141#(< ~counter~0 100)} is VALID [2022-04-08 12:38:30,994 INFO L290 TraceCheckUtils]: 96: Hoare triple {70166#(< ~counter~0 99)} assume !(~r~0 < 0); {70166#(< ~counter~0 99)} is VALID [2022-04-08 12:38:30,994 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69753#true} {70166#(< ~counter~0 99)} #98#return; {70166#(< ~counter~0 99)} is VALID [2022-04-08 12:38:30,994 INFO L290 TraceCheckUtils]: 94: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:30,994 INFO L290 TraceCheckUtils]: 93: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:30,994 INFO L290 TraceCheckUtils]: 92: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:30,994 INFO L272 TraceCheckUtils]: 91: Hoare triple {70166#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:30,995 INFO L290 TraceCheckUtils]: 90: Hoare triple {70166#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {70166#(< ~counter~0 99)} is VALID [2022-04-08 12:38:30,995 INFO L290 TraceCheckUtils]: 89: Hoare triple {70191#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70166#(< ~counter~0 99)} is VALID [2022-04-08 12:38:30,996 INFO L290 TraceCheckUtils]: 88: Hoare triple {70191#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70191#(< ~counter~0 98)} is VALID [2022-04-08 12:38:30,996 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69753#true} {70191#(< ~counter~0 98)} #98#return; {70191#(< ~counter~0 98)} is VALID [2022-04-08 12:38:30,996 INFO L290 TraceCheckUtils]: 86: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:30,996 INFO L290 TraceCheckUtils]: 85: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:30,996 INFO L290 TraceCheckUtils]: 84: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:30,996 INFO L272 TraceCheckUtils]: 83: Hoare triple {70191#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:30,997 INFO L290 TraceCheckUtils]: 82: Hoare triple {70191#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {70191#(< ~counter~0 98)} is VALID [2022-04-08 12:38:30,997 INFO L290 TraceCheckUtils]: 81: Hoare triple {70216#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70191#(< ~counter~0 98)} is VALID [2022-04-08 12:38:30,998 INFO L290 TraceCheckUtils]: 80: Hoare triple {70216#(< ~counter~0 97)} assume !(~r~0 > 0); {70216#(< ~counter~0 97)} is VALID [2022-04-08 12:38:30,998 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69753#true} {70216#(< ~counter~0 97)} #96#return; {70216#(< ~counter~0 97)} is VALID [2022-04-08 12:38:30,998 INFO L290 TraceCheckUtils]: 78: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:30,998 INFO L290 TraceCheckUtils]: 77: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:30,998 INFO L290 TraceCheckUtils]: 76: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:30,998 INFO L272 TraceCheckUtils]: 75: Hoare triple {70216#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:31,008 INFO L290 TraceCheckUtils]: 74: Hoare triple {70216#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {70216#(< ~counter~0 97)} is VALID [2022-04-08 12:38:31,009 INFO L290 TraceCheckUtils]: 73: Hoare triple {70241#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70216#(< ~counter~0 97)} is VALID [2022-04-08 12:38:31,009 INFO L290 TraceCheckUtils]: 72: Hoare triple {70241#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70241#(< ~counter~0 96)} is VALID [2022-04-08 12:38:31,010 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69753#true} {70241#(< ~counter~0 96)} #96#return; {70241#(< ~counter~0 96)} is VALID [2022-04-08 12:38:31,010 INFO L290 TraceCheckUtils]: 70: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:31,010 INFO L290 TraceCheckUtils]: 69: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:31,010 INFO L290 TraceCheckUtils]: 68: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:31,010 INFO L272 TraceCheckUtils]: 67: Hoare triple {70241#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:31,010 INFO L290 TraceCheckUtils]: 66: Hoare triple {70241#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {70241#(< ~counter~0 96)} is VALID [2022-04-08 12:38:31,011 INFO L290 TraceCheckUtils]: 65: Hoare triple {70266#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70241#(< ~counter~0 96)} is VALID [2022-04-08 12:38:31,011 INFO L290 TraceCheckUtils]: 64: Hoare triple {70266#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70266#(< ~counter~0 95)} is VALID [2022-04-08 12:38:31,012 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69753#true} {70266#(< ~counter~0 95)} #96#return; {70266#(< ~counter~0 95)} is VALID [2022-04-08 12:38:31,012 INFO L290 TraceCheckUtils]: 62: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:31,012 INFO L290 TraceCheckUtils]: 61: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:31,012 INFO L290 TraceCheckUtils]: 60: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:31,012 INFO L272 TraceCheckUtils]: 59: Hoare triple {70266#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:31,012 INFO L290 TraceCheckUtils]: 58: Hoare triple {70266#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {70266#(< ~counter~0 95)} is VALID [2022-04-08 12:38:31,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {70291#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70266#(< ~counter~0 95)} is VALID [2022-04-08 12:38:31,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {70291#(< ~counter~0 94)} assume !!(0 != ~r~0); {70291#(< ~counter~0 94)} is VALID [2022-04-08 12:38:31,014 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69753#true} {70291#(< ~counter~0 94)} #94#return; {70291#(< ~counter~0 94)} is VALID [2022-04-08 12:38:31,014 INFO L290 TraceCheckUtils]: 54: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:31,014 INFO L290 TraceCheckUtils]: 53: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:31,014 INFO L290 TraceCheckUtils]: 52: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:31,014 INFO L272 TraceCheckUtils]: 51: Hoare triple {70291#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:31,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {70291#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {70291#(< ~counter~0 94)} is VALID [2022-04-08 12:38:31,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {70316#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70291#(< ~counter~0 94)} is VALID [2022-04-08 12:38:31,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {70316#(< ~counter~0 93)} assume !(~r~0 < 0); {70316#(< ~counter~0 93)} is VALID [2022-04-08 12:38:31,016 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69753#true} {70316#(< ~counter~0 93)} #98#return; {70316#(< ~counter~0 93)} is VALID [2022-04-08 12:38:31,016 INFO L290 TraceCheckUtils]: 46: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:31,016 INFO L290 TraceCheckUtils]: 45: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:31,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:31,016 INFO L272 TraceCheckUtils]: 43: Hoare triple {70316#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:31,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {70316#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {70316#(< ~counter~0 93)} is VALID [2022-04-08 12:38:31,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {70341#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70316#(< ~counter~0 93)} is VALID [2022-04-08 12:38:31,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {70341#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70341#(< ~counter~0 92)} is VALID [2022-04-08 12:38:31,018 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69753#true} {70341#(< ~counter~0 92)} #98#return; {70341#(< ~counter~0 92)} is VALID [2022-04-08 12:38:31,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:31,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:31,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:31,018 INFO L272 TraceCheckUtils]: 35: Hoare triple {70341#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:31,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {70341#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {70341#(< ~counter~0 92)} is VALID [2022-04-08 12:38:31,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {70366#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70341#(< ~counter~0 92)} is VALID [2022-04-08 12:38:31,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {70366#(< ~counter~0 91)} assume !(~r~0 > 0); {70366#(< ~counter~0 91)} is VALID [2022-04-08 12:38:31,020 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69753#true} {70366#(< ~counter~0 91)} #96#return; {70366#(< ~counter~0 91)} is VALID [2022-04-08 12:38:31,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:31,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:31,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:31,020 INFO L272 TraceCheckUtils]: 27: Hoare triple {70366#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:31,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {70366#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {70366#(< ~counter~0 91)} is VALID [2022-04-08 12:38:31,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {70391#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70366#(< ~counter~0 91)} is VALID [2022-04-08 12:38:31,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {70391#(< ~counter~0 90)} assume !!(0 != ~r~0); {70391#(< ~counter~0 90)} is VALID [2022-04-08 12:38:31,021 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69753#true} {70391#(< ~counter~0 90)} #94#return; {70391#(< ~counter~0 90)} is VALID [2022-04-08 12:38:31,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:31,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:31,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:31,022 INFO L272 TraceCheckUtils]: 19: Hoare triple {70391#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:31,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {70391#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {70391#(< ~counter~0 90)} is VALID [2022-04-08 12:38:31,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {70416#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70391#(< ~counter~0 90)} is VALID [2022-04-08 12:38:31,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {70416#(< ~counter~0 89)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {70416#(< ~counter~0 89)} is VALID [2022-04-08 12:38:31,023 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69753#true} {70416#(< ~counter~0 89)} #92#return; {70416#(< ~counter~0 89)} is VALID [2022-04-08 12:38:31,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:31,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:31,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:31,024 INFO L272 TraceCheckUtils]: 11: Hoare triple {70416#(< ~counter~0 89)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:31,024 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69753#true} {70416#(< ~counter~0 89)} #90#return; {70416#(< ~counter~0 89)} is VALID [2022-04-08 12:38:31,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 12:38:31,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 12:38:31,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 12:38:31,024 INFO L272 TraceCheckUtils]: 6: Hoare triple {70416#(< ~counter~0 89)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 12:38:31,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {70416#(< ~counter~0 89)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {70416#(< ~counter~0 89)} is VALID [2022-04-08 12:38:31,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {70416#(< ~counter~0 89)} call #t~ret9 := main(); {70416#(< ~counter~0 89)} is VALID [2022-04-08 12:38:31,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70416#(< ~counter~0 89)} {69753#true} #102#return; {70416#(< ~counter~0 89)} is VALID [2022-04-08 12:38:31,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {70416#(< ~counter~0 89)} assume true; {70416#(< ~counter~0 89)} is VALID [2022-04-08 12:38:31,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {69753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {70416#(< ~counter~0 89)} is VALID [2022-04-08 12:38:31,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {69753#true} call ULTIMATE.init(); {69753#true} is VALID [2022-04-08 12:38:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 12:38:31,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:31,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280974738] [2022-04-08 12:38:31,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:31,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233066287] [2022-04-08 12:38:31,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233066287] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:31,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:31,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-08 12:38:31,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:31,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006231968] [2022-04-08 12:38:31,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006231968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:31,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:31,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 12:38:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572226201] [2022-04-08 12:38:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:31,027 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-04-08 12:38:31,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:31,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:31,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:31,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 12:38:31,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 12:38:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-08 12:38:31,117 INFO L87 Difference]: Start difference. First operand 578 states and 790 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:33,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:33,711 INFO L93 Difference]: Finished difference Result 791 states and 1114 transitions. [2022-04-08 12:38:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 12:38:33,711 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-04-08 12:38:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-08 12:38:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-08 12:38:33,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 256 transitions. [2022-04-08 12:38:33,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:33,946 INFO L225 Difference]: With dead ends: 791 [2022-04-08 12:38:33,946 INFO L226 Difference]: Without dead ends: 594 [2022-04-08 12:38:33,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=590, Invalid=816, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 12:38:33,947 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 124 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 12:38:33,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 313 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 12:38:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-04-08 12:38:35,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-04-08 12:38:35,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:35,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:35,705 INFO L74 IsIncluded]: Start isIncluded. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:35,705 INFO L87 Difference]: Start difference. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:35,723 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-08 12:38:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-08 12:38:35,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:35,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:35,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 594 states. [2022-04-08 12:38:35,724 INFO L87 Difference]: Start difference. First operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 594 states. [2022-04-08 12:38:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:35,738 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-08 12:38:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-08 12:38:35,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:35,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:35,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:35,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 12:38:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 806 transitions. [2022-04-08 12:38:35,758 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 806 transitions. Word has length 115 [2022-04-08 12:38:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:35,759 INFO L478 AbstractCegarLoop]: Abstraction has 594 states and 806 transitions. [2022-04-08 12:38:35,759 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 12:38:35,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 594 states and 806 transitions. [2022-04-08 12:38:39,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 806 edges. 805 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-08 12:38:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 12:38:39,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:39,772 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:38:39,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-08 12:38:39,972 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-08 12:38:39,972 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 7 times [2022-04-08 12:38:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:39,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [126487356] [2022-04-08 12:38:39,973 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 8 times [2022-04-08 12:38:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:39,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787244044] [2022-04-08 12:38:39,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:39,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:39,985 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:39,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418833194] [2022-04-08 12:38:39,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:38:39,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:39,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:39,986 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:38:39,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-08 12:38:40,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:38:40,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:40,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 12:38:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:40,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:40,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {74448#true} call ULTIMATE.init(); {74448#true} is VALID [2022-04-08 12:38:40,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {74448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {74456#(<= ~counter~0 0)} assume true; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74456#(<= ~counter~0 0)} {74448#true} #102#return; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {74456#(<= ~counter~0 0)} call #t~ret9 := main(); {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {74456#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {74456#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {74456#(<= ~counter~0 0)} ~cond := #in~cond; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {74456#(<= ~counter~0 0)} assume !(0 == ~cond); {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {74456#(<= ~counter~0 0)} assume true; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74456#(<= ~counter~0 0)} {74456#(<= ~counter~0 0)} #90#return; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,724 INFO L272 TraceCheckUtils]: 11: Hoare triple {74456#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {74456#(<= ~counter~0 0)} ~cond := #in~cond; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {74456#(<= ~counter~0 0)} assume !(0 == ~cond); {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {74456#(<= ~counter~0 0)} assume true; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,726 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74456#(<= ~counter~0 0)} {74456#(<= ~counter~0 0)} #92#return; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {74456#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:40,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {74456#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74505#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:40,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {74505#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {74505#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:40,728 INFO L272 TraceCheckUtils]: 19: Hoare triple {74505#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74505#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:40,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {74505#(<= ~counter~0 1)} ~cond := #in~cond; {74505#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:40,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {74505#(<= ~counter~0 1)} assume !(0 == ~cond); {74505#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:40,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {74505#(<= ~counter~0 1)} assume true; {74505#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:40,729 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74505#(<= ~counter~0 1)} {74505#(<= ~counter~0 1)} #94#return; {74505#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:40,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {74505#(<= ~counter~0 1)} assume !!(0 != ~r~0); {74505#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:40,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {74505#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74530#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:40,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {74530#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {74530#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:40,731 INFO L272 TraceCheckUtils]: 27: Hoare triple {74530#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74530#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:40,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {74530#(<= ~counter~0 2)} ~cond := #in~cond; {74530#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:40,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {74530#(<= ~counter~0 2)} assume !(0 == ~cond); {74530#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:40,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {74530#(<= ~counter~0 2)} assume true; {74530#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:40,732 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74530#(<= ~counter~0 2)} {74530#(<= ~counter~0 2)} #96#return; {74530#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:40,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {74530#(<= ~counter~0 2)} assume !(~r~0 > 0); {74530#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:40,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {74530#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74555#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:40,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {74555#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {74555#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:40,734 INFO L272 TraceCheckUtils]: 35: Hoare triple {74555#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74555#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:40,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {74555#(<= ~counter~0 3)} ~cond := #in~cond; {74555#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:40,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {74555#(<= ~counter~0 3)} assume !(0 == ~cond); {74555#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:40,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {74555#(<= ~counter~0 3)} assume true; {74555#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:40,735 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74555#(<= ~counter~0 3)} {74555#(<= ~counter~0 3)} #98#return; {74555#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:40,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {74555#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74555#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:40,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {74555#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74580#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:40,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {74580#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {74580#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:40,737 INFO L272 TraceCheckUtils]: 43: Hoare triple {74580#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74580#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:40,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {74580#(<= ~counter~0 4)} ~cond := #in~cond; {74580#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:40,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {74580#(<= ~counter~0 4)} assume !(0 == ~cond); {74580#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:40,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {74580#(<= ~counter~0 4)} assume true; {74580#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:40,739 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74580#(<= ~counter~0 4)} {74580#(<= ~counter~0 4)} #98#return; {74580#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:40,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {74580#(<= ~counter~0 4)} assume !(~r~0 < 0); {74580#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:40,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {74580#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74605#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:40,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {74605#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {74605#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:40,740 INFO L272 TraceCheckUtils]: 51: Hoare triple {74605#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74605#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:40,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {74605#(<= ~counter~0 5)} ~cond := #in~cond; {74605#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:40,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {74605#(<= ~counter~0 5)} assume !(0 == ~cond); {74605#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:40,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {74605#(<= ~counter~0 5)} assume true; {74605#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:40,742 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74605#(<= ~counter~0 5)} {74605#(<= ~counter~0 5)} #94#return; {74605#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:40,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {74605#(<= ~counter~0 5)} assume !!(0 != ~r~0); {74605#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:40,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {74605#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74630#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:40,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {74630#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {74630#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:40,743 INFO L272 TraceCheckUtils]: 59: Hoare triple {74630#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74630#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:40,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {74630#(<= ~counter~0 6)} ~cond := #in~cond; {74630#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:40,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {74630#(<= ~counter~0 6)} assume !(0 == ~cond); {74630#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:40,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {74630#(<= ~counter~0 6)} assume true; {74630#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:40,745 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74630#(<= ~counter~0 6)} {74630#(<= ~counter~0 6)} #96#return; {74630#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:40,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {74630#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74630#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:40,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {74630#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74655#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:40,746 INFO L290 TraceCheckUtils]: 66: Hoare triple {74655#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {74655#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:40,746 INFO L272 TraceCheckUtils]: 67: Hoare triple {74655#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74655#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:40,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {74655#(<= ~counter~0 7)} ~cond := #in~cond; {74655#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:40,764 INFO L290 TraceCheckUtils]: 69: Hoare triple {74655#(<= ~counter~0 7)} assume !(0 == ~cond); {74655#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:40,764 INFO L290 TraceCheckUtils]: 70: Hoare triple {74655#(<= ~counter~0 7)} assume true; {74655#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:40,765 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74655#(<= ~counter~0 7)} {74655#(<= ~counter~0 7)} #96#return; {74655#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:40,765 INFO L290 TraceCheckUtils]: 72: Hoare triple {74655#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74655#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:40,767 INFO L290 TraceCheckUtils]: 73: Hoare triple {74655#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74680#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:40,767 INFO L290 TraceCheckUtils]: 74: Hoare triple {74680#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {74680#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:40,768 INFO L272 TraceCheckUtils]: 75: Hoare triple {74680#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74680#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:40,768 INFO L290 TraceCheckUtils]: 76: Hoare triple {74680#(<= ~counter~0 8)} ~cond := #in~cond; {74680#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:40,768 INFO L290 TraceCheckUtils]: 77: Hoare triple {74680#(<= ~counter~0 8)} assume !(0 == ~cond); {74680#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:40,768 INFO L290 TraceCheckUtils]: 78: Hoare triple {74680#(<= ~counter~0 8)} assume true; {74680#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:40,769 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74680#(<= ~counter~0 8)} {74680#(<= ~counter~0 8)} #96#return; {74680#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:40,769 INFO L290 TraceCheckUtils]: 80: Hoare triple {74680#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74680#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:40,770 INFO L290 TraceCheckUtils]: 81: Hoare triple {74680#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74705#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:40,770 INFO L290 TraceCheckUtils]: 82: Hoare triple {74705#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {74705#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:40,771 INFO L272 TraceCheckUtils]: 83: Hoare triple {74705#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74705#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:40,771 INFO L290 TraceCheckUtils]: 84: Hoare triple {74705#(<= ~counter~0 9)} ~cond := #in~cond; {74705#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:40,771 INFO L290 TraceCheckUtils]: 85: Hoare triple {74705#(<= ~counter~0 9)} assume !(0 == ~cond); {74705#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:40,771 INFO L290 TraceCheckUtils]: 86: Hoare triple {74705#(<= ~counter~0 9)} assume true; {74705#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:40,772 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74705#(<= ~counter~0 9)} {74705#(<= ~counter~0 9)} #96#return; {74705#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:40,772 INFO L290 TraceCheckUtils]: 88: Hoare triple {74705#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74705#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:40,773 INFO L290 TraceCheckUtils]: 89: Hoare triple {74705#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74730#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:40,773 INFO L290 TraceCheckUtils]: 90: Hoare triple {74730#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {74730#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:40,774 INFO L272 TraceCheckUtils]: 91: Hoare triple {74730#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74730#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:40,774 INFO L290 TraceCheckUtils]: 92: Hoare triple {74730#(<= ~counter~0 10)} ~cond := #in~cond; {74730#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:40,774 INFO L290 TraceCheckUtils]: 93: Hoare triple {74730#(<= ~counter~0 10)} assume !(0 == ~cond); {74730#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:40,775 INFO L290 TraceCheckUtils]: 94: Hoare triple {74730#(<= ~counter~0 10)} assume true; {74730#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:40,775 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74730#(<= ~counter~0 10)} {74730#(<= ~counter~0 10)} #96#return; {74730#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:40,775 INFO L290 TraceCheckUtils]: 96: Hoare triple {74730#(<= ~counter~0 10)} assume !(~r~0 > 0); {74730#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:40,776 INFO L290 TraceCheckUtils]: 97: Hoare triple {74730#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74755#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:40,776 INFO L290 TraceCheckUtils]: 98: Hoare triple {74755#(<= ~counter~0 11)} assume !!(#t~post8 < 100);havoc #t~post8; {74755#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:40,777 INFO L272 TraceCheckUtils]: 99: Hoare triple {74755#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74755#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:40,777 INFO L290 TraceCheckUtils]: 100: Hoare triple {74755#(<= ~counter~0 11)} ~cond := #in~cond; {74755#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:40,777 INFO L290 TraceCheckUtils]: 101: Hoare triple {74755#(<= ~counter~0 11)} assume !(0 == ~cond); {74755#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:40,778 INFO L290 TraceCheckUtils]: 102: Hoare triple {74755#(<= ~counter~0 11)} assume true; {74755#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:40,778 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74755#(<= ~counter~0 11)} {74755#(<= ~counter~0 11)} #98#return; {74755#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:40,778 INFO L290 TraceCheckUtils]: 104: Hoare triple {74755#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74755#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:40,779 INFO L290 TraceCheckUtils]: 105: Hoare triple {74755#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74780#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:40,779 INFO L290 TraceCheckUtils]: 106: Hoare triple {74780#(<= ~counter~0 12)} assume !!(#t~post8 < 100);havoc #t~post8; {74780#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:40,780 INFO L272 TraceCheckUtils]: 107: Hoare triple {74780#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74780#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:40,780 INFO L290 TraceCheckUtils]: 108: Hoare triple {74780#(<= ~counter~0 12)} ~cond := #in~cond; {74780#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:40,780 INFO L290 TraceCheckUtils]: 109: Hoare triple {74780#(<= ~counter~0 12)} assume !(0 == ~cond); {74780#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:40,781 INFO L290 TraceCheckUtils]: 110: Hoare triple {74780#(<= ~counter~0 12)} assume true; {74780#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:40,781 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {74780#(<= ~counter~0 12)} {74780#(<= ~counter~0 12)} #98#return; {74780#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:40,781 INFO L290 TraceCheckUtils]: 112: Hoare triple {74780#(<= ~counter~0 12)} assume !(~r~0 < 0); {74780#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:40,782 INFO L290 TraceCheckUtils]: 113: Hoare triple {74780#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74805#(<= |main_#t~post6| 12)} is VALID [2022-04-08 12:38:40,783 INFO L290 TraceCheckUtils]: 114: Hoare triple {74805#(<= |main_#t~post6| 12)} assume !(#t~post6 < 100);havoc #t~post6; {74449#false} is VALID [2022-04-08 12:38:40,783 INFO L272 TraceCheckUtils]: 115: Hoare triple {74449#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74449#false} is VALID [2022-04-08 12:38:40,783 INFO L290 TraceCheckUtils]: 116: Hoare triple {74449#false} ~cond := #in~cond; {74449#false} is VALID [2022-04-08 12:38:40,783 INFO L290 TraceCheckUtils]: 117: Hoare triple {74449#false} assume 0 == ~cond; {74449#false} is VALID [2022-04-08 12:38:40,784 INFO L290 TraceCheckUtils]: 118: Hoare triple {74449#false} assume !false; {74449#false} is VALID [2022-04-08 12:38:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 356 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:38:40,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:41,554 INFO L290 TraceCheckUtils]: 118: Hoare triple {74449#false} assume !false; {74449#false} is VALID [2022-04-08 12:38:41,554 INFO L290 TraceCheckUtils]: 117: Hoare triple {74449#false} assume 0 == ~cond; {74449#false} is VALID [2022-04-08 12:38:41,554 INFO L290 TraceCheckUtils]: 116: Hoare triple {74449#false} ~cond := #in~cond; {74449#false} is VALID [2022-04-08 12:38:41,555 INFO L272 TraceCheckUtils]: 115: Hoare triple {74449#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74449#false} is VALID [2022-04-08 12:38:41,555 INFO L290 TraceCheckUtils]: 114: Hoare triple {74833#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {74449#false} is VALID [2022-04-08 12:38:41,555 INFO L290 TraceCheckUtils]: 113: Hoare triple {74837#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74833#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:38:41,556 INFO L290 TraceCheckUtils]: 112: Hoare triple {74837#(< ~counter~0 100)} assume !(~r~0 < 0); {74837#(< ~counter~0 100)} is VALID [2022-04-08 12:38:41,556 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {74448#true} {74837#(< ~counter~0 100)} #98#return; {74837#(< ~counter~0 100)} is VALID [2022-04-08 12:38:41,556 INFO L290 TraceCheckUtils]: 110: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,556 INFO L290 TraceCheckUtils]: 109: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,556 INFO L290 TraceCheckUtils]: 108: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,557 INFO L272 TraceCheckUtils]: 107: Hoare triple {74837#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,557 INFO L290 TraceCheckUtils]: 106: Hoare triple {74837#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {74837#(< ~counter~0 100)} is VALID [2022-04-08 12:38:41,559 INFO L290 TraceCheckUtils]: 105: Hoare triple {74862#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74837#(< ~counter~0 100)} is VALID [2022-04-08 12:38:41,559 INFO L290 TraceCheckUtils]: 104: Hoare triple {74862#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74862#(< ~counter~0 99)} is VALID [2022-04-08 12:38:41,560 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74448#true} {74862#(< ~counter~0 99)} #98#return; {74862#(< ~counter~0 99)} is VALID [2022-04-08 12:38:41,560 INFO L290 TraceCheckUtils]: 102: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,560 INFO L290 TraceCheckUtils]: 101: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,560 INFO L290 TraceCheckUtils]: 100: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,560 INFO L272 TraceCheckUtils]: 99: Hoare triple {74862#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,560 INFO L290 TraceCheckUtils]: 98: Hoare triple {74862#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {74862#(< ~counter~0 99)} is VALID [2022-04-08 12:38:41,561 INFO L290 TraceCheckUtils]: 97: Hoare triple {74887#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74862#(< ~counter~0 99)} is VALID [2022-04-08 12:38:41,561 INFO L290 TraceCheckUtils]: 96: Hoare triple {74887#(< ~counter~0 98)} assume !(~r~0 > 0); {74887#(< ~counter~0 98)} is VALID [2022-04-08 12:38:41,562 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74448#true} {74887#(< ~counter~0 98)} #96#return; {74887#(< ~counter~0 98)} is VALID [2022-04-08 12:38:41,562 INFO L290 TraceCheckUtils]: 94: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,562 INFO L290 TraceCheckUtils]: 93: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,562 INFO L290 TraceCheckUtils]: 92: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,562 INFO L272 TraceCheckUtils]: 91: Hoare triple {74887#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,563 INFO L290 TraceCheckUtils]: 90: Hoare triple {74887#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {74887#(< ~counter~0 98)} is VALID [2022-04-08 12:38:41,563 INFO L290 TraceCheckUtils]: 89: Hoare triple {74912#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74887#(< ~counter~0 98)} is VALID [2022-04-08 12:38:41,564 INFO L290 TraceCheckUtils]: 88: Hoare triple {74912#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74912#(< ~counter~0 97)} is VALID [2022-04-08 12:38:41,564 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74448#true} {74912#(< ~counter~0 97)} #96#return; {74912#(< ~counter~0 97)} is VALID [2022-04-08 12:38:41,565 INFO L290 TraceCheckUtils]: 86: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,565 INFO L290 TraceCheckUtils]: 85: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,565 INFO L290 TraceCheckUtils]: 84: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,565 INFO L272 TraceCheckUtils]: 83: Hoare triple {74912#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,565 INFO L290 TraceCheckUtils]: 82: Hoare triple {74912#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {74912#(< ~counter~0 97)} is VALID [2022-04-08 12:38:41,566 INFO L290 TraceCheckUtils]: 81: Hoare triple {74937#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74912#(< ~counter~0 97)} is VALID [2022-04-08 12:38:41,566 INFO L290 TraceCheckUtils]: 80: Hoare triple {74937#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74937#(< ~counter~0 96)} is VALID [2022-04-08 12:38:41,567 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74448#true} {74937#(< ~counter~0 96)} #96#return; {74937#(< ~counter~0 96)} is VALID [2022-04-08 12:38:41,567 INFO L290 TraceCheckUtils]: 78: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,567 INFO L290 TraceCheckUtils]: 77: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,567 INFO L290 TraceCheckUtils]: 76: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,567 INFO L272 TraceCheckUtils]: 75: Hoare triple {74937#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,568 INFO L290 TraceCheckUtils]: 74: Hoare triple {74937#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {74937#(< ~counter~0 96)} is VALID [2022-04-08 12:38:41,569 INFO L290 TraceCheckUtils]: 73: Hoare triple {74962#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74937#(< ~counter~0 96)} is VALID [2022-04-08 12:38:41,569 INFO L290 TraceCheckUtils]: 72: Hoare triple {74962#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74962#(< ~counter~0 95)} is VALID [2022-04-08 12:38:41,569 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74448#true} {74962#(< ~counter~0 95)} #96#return; {74962#(< ~counter~0 95)} is VALID [2022-04-08 12:38:41,570 INFO L290 TraceCheckUtils]: 70: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,570 INFO L290 TraceCheckUtils]: 69: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,570 INFO L290 TraceCheckUtils]: 68: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,570 INFO L272 TraceCheckUtils]: 67: Hoare triple {74962#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,570 INFO L290 TraceCheckUtils]: 66: Hoare triple {74962#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {74962#(< ~counter~0 95)} is VALID [2022-04-08 12:38:41,571 INFO L290 TraceCheckUtils]: 65: Hoare triple {74987#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74962#(< ~counter~0 95)} is VALID [2022-04-08 12:38:41,571 INFO L290 TraceCheckUtils]: 64: Hoare triple {74987#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74987#(< ~counter~0 94)} is VALID [2022-04-08 12:38:41,572 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74448#true} {74987#(< ~counter~0 94)} #96#return; {74987#(< ~counter~0 94)} is VALID [2022-04-08 12:38:41,572 INFO L290 TraceCheckUtils]: 62: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,572 INFO L290 TraceCheckUtils]: 60: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,572 INFO L272 TraceCheckUtils]: 59: Hoare triple {74987#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,573 INFO L290 TraceCheckUtils]: 58: Hoare triple {74987#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {74987#(< ~counter~0 94)} is VALID [2022-04-08 12:38:41,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {75012#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74987#(< ~counter~0 94)} is VALID [2022-04-08 12:38:41,574 INFO L290 TraceCheckUtils]: 56: Hoare triple {75012#(< ~counter~0 93)} assume !!(0 != ~r~0); {75012#(< ~counter~0 93)} is VALID [2022-04-08 12:38:41,574 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74448#true} {75012#(< ~counter~0 93)} #94#return; {75012#(< ~counter~0 93)} is VALID [2022-04-08 12:38:41,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,575 INFO L290 TraceCheckUtils]: 53: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,575 INFO L272 TraceCheckUtils]: 51: Hoare triple {75012#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,575 INFO L290 TraceCheckUtils]: 50: Hoare triple {75012#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {75012#(< ~counter~0 93)} is VALID [2022-04-08 12:38:41,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {75037#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75012#(< ~counter~0 93)} is VALID [2022-04-08 12:38:41,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {75037#(< ~counter~0 92)} assume !(~r~0 < 0); {75037#(< ~counter~0 92)} is VALID [2022-04-08 12:38:41,577 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74448#true} {75037#(< ~counter~0 92)} #98#return; {75037#(< ~counter~0 92)} is VALID [2022-04-08 12:38:41,577 INFO L290 TraceCheckUtils]: 46: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,577 INFO L272 TraceCheckUtils]: 43: Hoare triple {75037#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {75037#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {75037#(< ~counter~0 92)} is VALID [2022-04-08 12:38:41,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {75062#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75037#(< ~counter~0 92)} is VALID [2022-04-08 12:38:41,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {75062#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75062#(< ~counter~0 91)} is VALID [2022-04-08 12:38:41,579 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74448#true} {75062#(< ~counter~0 91)} #98#return; {75062#(< ~counter~0 91)} is VALID [2022-04-08 12:38:41,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,580 INFO L272 TraceCheckUtils]: 35: Hoare triple {75062#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {75062#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {75062#(< ~counter~0 91)} is VALID [2022-04-08 12:38:41,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {75087#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75062#(< ~counter~0 91)} is VALID [2022-04-08 12:38:41,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {75087#(< ~counter~0 90)} assume !(~r~0 > 0); {75087#(< ~counter~0 90)} is VALID [2022-04-08 12:38:41,582 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74448#true} {75087#(< ~counter~0 90)} #96#return; {75087#(< ~counter~0 90)} is VALID [2022-04-08 12:38:41,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,582 INFO L272 TraceCheckUtils]: 27: Hoare triple {75087#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {75087#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {75087#(< ~counter~0 90)} is VALID [2022-04-08 12:38:41,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {75112#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75087#(< ~counter~0 90)} is VALID [2022-04-08 12:38:41,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {75112#(< ~counter~0 89)} assume !!(0 != ~r~0); {75112#(< ~counter~0 89)} is VALID [2022-04-08 12:38:41,584 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74448#true} {75112#(< ~counter~0 89)} #94#return; {75112#(< ~counter~0 89)} is VALID [2022-04-08 12:38:41,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,585 INFO L272 TraceCheckUtils]: 19: Hoare triple {75112#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {75112#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {75112#(< ~counter~0 89)} is VALID [2022-04-08 12:38:41,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {75137#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75112#(< ~counter~0 89)} is VALID [2022-04-08 12:38:41,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {75137#(< ~counter~0 88)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {75137#(< ~counter~0 88)} is VALID [2022-04-08 12:38:41,587 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74448#true} {75137#(< ~counter~0 88)} #92#return; {75137#(< ~counter~0 88)} is VALID [2022-04-08 12:38:41,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,587 INFO L272 TraceCheckUtils]: 11: Hoare triple {75137#(< ~counter~0 88)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,588 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74448#true} {75137#(< ~counter~0 88)} #90#return; {75137#(< ~counter~0 88)} is VALID [2022-04-08 12:38:41,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 12:38:41,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 12:38:41,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 12:38:41,588 INFO L272 TraceCheckUtils]: 6: Hoare triple {75137#(< ~counter~0 88)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 12:38:41,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {75137#(< ~counter~0 88)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {75137#(< ~counter~0 88)} is VALID [2022-04-08 12:38:41,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {75137#(< ~counter~0 88)} call #t~ret9 := main(); {75137#(< ~counter~0 88)} is VALID [2022-04-08 12:38:41,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75137#(< ~counter~0 88)} {74448#true} #102#return; {75137#(< ~counter~0 88)} is VALID [2022-04-08 12:38:41,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {75137#(< ~counter~0 88)} assume true; {75137#(< ~counter~0 88)} is VALID [2022-04-08 12:38:41,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {74448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {75137#(< ~counter~0 88)} is VALID [2022-04-08 12:38:41,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {74448#true} call ULTIMATE.init(); {74448#true} is VALID [2022-04-08 12:38:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 92 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-08 12:38:41,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:41,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787244044] [2022-04-08 12:38:41,591 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:41,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418833194] [2022-04-08 12:38:41,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418833194] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:41,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:41,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-08 12:38:41,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:41,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [126487356] [2022-04-08 12:38:41,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [126487356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:41,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:41,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 12:38:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209468527] [2022-04-08 12:38:41,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:41,593 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 119 [2022-04-08 12:38:41,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:41,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:38:41,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:41,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 12:38:41,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:41,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 12:38:41,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-08 12:38:41,727 INFO L87 Difference]: Start difference. First operand 594 states and 806 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:38:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:44,674 INFO L93 Difference]: Finished difference Result 649 states and 883 transitions. [2022-04-08 12:38:44,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 12:38:44,674 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 119 [2022-04-08 12:38:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:38:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-08 12:38:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:38:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-08 12:38:44,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 254 transitions. [2022-04-08 12:38:44,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:44,917 INFO L225 Difference]: With dead ends: 649 [2022-04-08 12:38:44,917 INFO L226 Difference]: Without dead ends: 638 [2022-04-08 12:38:44,917 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=620, Invalid=862, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 12:38:44,918 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 163 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:38:44,918 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 295 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 12:38:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-04-08 12:38:46,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 616. [2022-04-08 12:38:46,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:46,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 12:38:46,725 INFO L74 IsIncluded]: Start isIncluded. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 12:38:46,726 INFO L87 Difference]: Start difference. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 12:38:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:46,742 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-08 12:38:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-08 12:38:46,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:46,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:46,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 638 states. [2022-04-08 12:38:46,744 INFO L87 Difference]: Start difference. First operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 638 states. [2022-04-08 12:38:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:46,758 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-08 12:38:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-08 12:38:46,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:46,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:46,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:46,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 12:38:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 841 transitions. [2022-04-08 12:38:46,782 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 841 transitions. Word has length 119 [2022-04-08 12:38:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:46,782 INFO L478 AbstractCegarLoop]: Abstraction has 616 states and 841 transitions. [2022-04-08 12:38:46,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:38:46,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 616 states and 841 transitions. [2022-04-08 12:38:51,204 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-08 12:38:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 841 transitions. [2022-04-08 12:38:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-08 12:38:51,205 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:51,205 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 7, 7, 7, 7, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:38:51,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-04-08 12:38:51,405 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-08 12:38:51,406 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 17 times [2022-04-08 12:38:51,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:51,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1611638994] [2022-04-08 12:38:51,406 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 18 times [2022-04-08 12:38:51,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:51,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792143315] [2022-04-08 12:38:51,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:51,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:51,418 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:51,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923333426] [2022-04-08 12:38:51,419 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:38:51,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:51,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:51,422 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:38:51,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-08 12:38:51,974 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 12:38:51,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:51,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 12:38:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:52,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:52,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {79015#true} call ULTIMATE.init(); {79015#true} is VALID [2022-04-08 12:38:52,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {79015#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {79023#(<= ~counter~0 0)} assume true; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79023#(<= ~counter~0 0)} {79015#true} #102#return; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {79023#(<= ~counter~0 0)} call #t~ret9 := main(); {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {79023#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,604 INFO L272 TraceCheckUtils]: 6: Hoare triple {79023#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {79023#(<= ~counter~0 0)} ~cond := #in~cond; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {79023#(<= ~counter~0 0)} assume !(0 == ~cond); {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {79023#(<= ~counter~0 0)} assume true; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,605 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79023#(<= ~counter~0 0)} {79023#(<= ~counter~0 0)} #90#return; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,605 INFO L272 TraceCheckUtils]: 11: Hoare triple {79023#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {79023#(<= ~counter~0 0)} ~cond := #in~cond; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {79023#(<= ~counter~0 0)} assume !(0 == ~cond); {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {79023#(<= ~counter~0 0)} assume true; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,606 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79023#(<= ~counter~0 0)} {79023#(<= ~counter~0 0)} #92#return; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {79023#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:52,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {79023#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79072#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:52,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {79072#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {79072#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:52,609 INFO L272 TraceCheckUtils]: 19: Hoare triple {79072#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79072#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:52,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {79072#(<= ~counter~0 1)} ~cond := #in~cond; {79072#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:52,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {79072#(<= ~counter~0 1)} assume !(0 == ~cond); {79072#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:52,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {79072#(<= ~counter~0 1)} assume true; {79072#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:52,610 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79072#(<= ~counter~0 1)} {79072#(<= ~counter~0 1)} #94#return; {79072#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:52,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {79072#(<= ~counter~0 1)} assume !!(0 != ~r~0); {79072#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:52,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {79072#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79097#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:52,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {79097#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {79097#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:52,612 INFO L272 TraceCheckUtils]: 27: Hoare triple {79097#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79097#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:52,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {79097#(<= ~counter~0 2)} ~cond := #in~cond; {79097#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:52,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {79097#(<= ~counter~0 2)} assume !(0 == ~cond); {79097#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:52,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {79097#(<= ~counter~0 2)} assume true; {79097#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:52,614 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79097#(<= ~counter~0 2)} {79097#(<= ~counter~0 2)} #96#return; {79097#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:52,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {79097#(<= ~counter~0 2)} assume !(~r~0 > 0); {79097#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:52,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {79097#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79122#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:52,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {79122#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {79122#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:52,616 INFO L272 TraceCheckUtils]: 35: Hoare triple {79122#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79122#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:52,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {79122#(<= ~counter~0 3)} ~cond := #in~cond; {79122#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:52,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {79122#(<= ~counter~0 3)} assume !(0 == ~cond); {79122#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:52,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {79122#(<= ~counter~0 3)} assume true; {79122#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:52,617 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79122#(<= ~counter~0 3)} {79122#(<= ~counter~0 3)} #98#return; {79122#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:52,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {79122#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79122#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:52,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {79122#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79147#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:52,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {79147#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {79147#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:52,619 INFO L272 TraceCheckUtils]: 43: Hoare triple {79147#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79147#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:52,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {79147#(<= ~counter~0 4)} ~cond := #in~cond; {79147#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:52,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {79147#(<= ~counter~0 4)} assume !(0 == ~cond); {79147#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:52,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {79147#(<= ~counter~0 4)} assume true; {79147#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:52,620 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79147#(<= ~counter~0 4)} {79147#(<= ~counter~0 4)} #98#return; {79147#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:52,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {79147#(<= ~counter~0 4)} assume !(~r~0 < 0); {79147#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:52,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {79147#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79172#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:52,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {79172#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {79172#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:52,622 INFO L272 TraceCheckUtils]: 51: Hoare triple {79172#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79172#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:52,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {79172#(<= ~counter~0 5)} ~cond := #in~cond; {79172#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:52,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {79172#(<= ~counter~0 5)} assume !(0 == ~cond); {79172#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:52,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {79172#(<= ~counter~0 5)} assume true; {79172#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:52,624 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79172#(<= ~counter~0 5)} {79172#(<= ~counter~0 5)} #94#return; {79172#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:52,624 INFO L290 TraceCheckUtils]: 56: Hoare triple {79172#(<= ~counter~0 5)} assume !!(0 != ~r~0); {79172#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:52,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {79172#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79197#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:52,625 INFO L290 TraceCheckUtils]: 58: Hoare triple {79197#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {79197#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:52,626 INFO L272 TraceCheckUtils]: 59: Hoare triple {79197#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79197#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:52,626 INFO L290 TraceCheckUtils]: 60: Hoare triple {79197#(<= ~counter~0 6)} ~cond := #in~cond; {79197#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:52,626 INFO L290 TraceCheckUtils]: 61: Hoare triple {79197#(<= ~counter~0 6)} assume !(0 == ~cond); {79197#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:52,626 INFO L290 TraceCheckUtils]: 62: Hoare triple {79197#(<= ~counter~0 6)} assume true; {79197#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:52,627 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79197#(<= ~counter~0 6)} {79197#(<= ~counter~0 6)} #96#return; {79197#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:52,627 INFO L290 TraceCheckUtils]: 64: Hoare triple {79197#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79197#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:52,628 INFO L290 TraceCheckUtils]: 65: Hoare triple {79197#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79222#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:52,628 INFO L290 TraceCheckUtils]: 66: Hoare triple {79222#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {79222#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:52,629 INFO L272 TraceCheckUtils]: 67: Hoare triple {79222#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79222#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:52,629 INFO L290 TraceCheckUtils]: 68: Hoare triple {79222#(<= ~counter~0 7)} ~cond := #in~cond; {79222#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:52,629 INFO L290 TraceCheckUtils]: 69: Hoare triple {79222#(<= ~counter~0 7)} assume !(0 == ~cond); {79222#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:52,630 INFO L290 TraceCheckUtils]: 70: Hoare triple {79222#(<= ~counter~0 7)} assume true; {79222#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:52,630 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79222#(<= ~counter~0 7)} {79222#(<= ~counter~0 7)} #96#return; {79222#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:52,630 INFO L290 TraceCheckUtils]: 72: Hoare triple {79222#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79222#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:52,632 INFO L290 TraceCheckUtils]: 73: Hoare triple {79222#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79247#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:52,632 INFO L290 TraceCheckUtils]: 74: Hoare triple {79247#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {79247#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:52,632 INFO L272 TraceCheckUtils]: 75: Hoare triple {79247#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79247#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:52,633 INFO L290 TraceCheckUtils]: 76: Hoare triple {79247#(<= ~counter~0 8)} ~cond := #in~cond; {79247#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:52,633 INFO L290 TraceCheckUtils]: 77: Hoare triple {79247#(<= ~counter~0 8)} assume !(0 == ~cond); {79247#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:52,633 INFO L290 TraceCheckUtils]: 78: Hoare triple {79247#(<= ~counter~0 8)} assume true; {79247#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:52,634 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79247#(<= ~counter~0 8)} {79247#(<= ~counter~0 8)} #96#return; {79247#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:52,634 INFO L290 TraceCheckUtils]: 80: Hoare triple {79247#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79247#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:52,635 INFO L290 TraceCheckUtils]: 81: Hoare triple {79247#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79272#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:52,635 INFO L290 TraceCheckUtils]: 82: Hoare triple {79272#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {79272#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:52,636 INFO L272 TraceCheckUtils]: 83: Hoare triple {79272#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79272#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:52,636 INFO L290 TraceCheckUtils]: 84: Hoare triple {79272#(<= ~counter~0 9)} ~cond := #in~cond; {79272#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:52,636 INFO L290 TraceCheckUtils]: 85: Hoare triple {79272#(<= ~counter~0 9)} assume !(0 == ~cond); {79272#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:52,636 INFO L290 TraceCheckUtils]: 86: Hoare triple {79272#(<= ~counter~0 9)} assume true; {79272#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:52,637 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79272#(<= ~counter~0 9)} {79272#(<= ~counter~0 9)} #96#return; {79272#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:52,637 INFO L290 TraceCheckUtils]: 88: Hoare triple {79272#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79272#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:52,638 INFO L290 TraceCheckUtils]: 89: Hoare triple {79272#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79297#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:52,638 INFO L290 TraceCheckUtils]: 90: Hoare triple {79297#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {79297#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:52,639 INFO L272 TraceCheckUtils]: 91: Hoare triple {79297#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79297#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:52,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {79297#(<= ~counter~0 10)} ~cond := #in~cond; {79297#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:52,639 INFO L290 TraceCheckUtils]: 93: Hoare triple {79297#(<= ~counter~0 10)} assume !(0 == ~cond); {79297#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:52,640 INFO L290 TraceCheckUtils]: 94: Hoare triple {79297#(<= ~counter~0 10)} assume true; {79297#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:52,640 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79297#(<= ~counter~0 10)} {79297#(<= ~counter~0 10)} #96#return; {79297#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:52,646 INFO L290 TraceCheckUtils]: 96: Hoare triple {79297#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79297#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:52,649 INFO L290 TraceCheckUtils]: 97: Hoare triple {79297#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79322#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:52,649 INFO L290 TraceCheckUtils]: 98: Hoare triple {79322#(<= ~counter~0 11)} assume !!(#t~post7 < 100);havoc #t~post7; {79322#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:52,650 INFO L272 TraceCheckUtils]: 99: Hoare triple {79322#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79322#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:52,650 INFO L290 TraceCheckUtils]: 100: Hoare triple {79322#(<= ~counter~0 11)} ~cond := #in~cond; {79322#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:52,650 INFO L290 TraceCheckUtils]: 101: Hoare triple {79322#(<= ~counter~0 11)} assume !(0 == ~cond); {79322#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:52,650 INFO L290 TraceCheckUtils]: 102: Hoare triple {79322#(<= ~counter~0 11)} assume true; {79322#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:52,651 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79322#(<= ~counter~0 11)} {79322#(<= ~counter~0 11)} #96#return; {79322#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:52,651 INFO L290 TraceCheckUtils]: 104: Hoare triple {79322#(<= ~counter~0 11)} assume !(~r~0 > 0); {79322#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:52,652 INFO L290 TraceCheckUtils]: 105: Hoare triple {79322#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79347#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:52,652 INFO L290 TraceCheckUtils]: 106: Hoare triple {79347#(<= ~counter~0 12)} assume !!(#t~post8 < 100);havoc #t~post8; {79347#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:52,653 INFO L272 TraceCheckUtils]: 107: Hoare triple {79347#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79347#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:52,653 INFO L290 TraceCheckUtils]: 108: Hoare triple {79347#(<= ~counter~0 12)} ~cond := #in~cond; {79347#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:52,653 INFO L290 TraceCheckUtils]: 109: Hoare triple {79347#(<= ~counter~0 12)} assume !(0 == ~cond); {79347#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:52,654 INFO L290 TraceCheckUtils]: 110: Hoare triple {79347#(<= ~counter~0 12)} assume true; {79347#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:52,654 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79347#(<= ~counter~0 12)} {79347#(<= ~counter~0 12)} #98#return; {79347#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:52,654 INFO L290 TraceCheckUtils]: 112: Hoare triple {79347#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79347#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:52,655 INFO L290 TraceCheckUtils]: 113: Hoare triple {79347#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79372#(<= |main_#t~post8| 12)} is VALID [2022-04-08 12:38:52,655 INFO L290 TraceCheckUtils]: 114: Hoare triple {79372#(<= |main_#t~post8| 12)} assume !(#t~post8 < 100);havoc #t~post8; {79016#false} is VALID [2022-04-08 12:38:52,655 INFO L290 TraceCheckUtils]: 115: Hoare triple {79016#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79016#false} is VALID [2022-04-08 12:38:52,655 INFO L290 TraceCheckUtils]: 116: Hoare triple {79016#false} assume !(#t~post6 < 100);havoc #t~post6; {79016#false} is VALID [2022-04-08 12:38:52,655 INFO L272 TraceCheckUtils]: 117: Hoare triple {79016#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79016#false} is VALID [2022-04-08 12:38:52,655 INFO L290 TraceCheckUtils]: 118: Hoare triple {79016#false} ~cond := #in~cond; {79016#false} is VALID [2022-04-08 12:38:52,655 INFO L290 TraceCheckUtils]: 119: Hoare triple {79016#false} assume 0 == ~cond; {79016#false} is VALID [2022-04-08 12:38:52,655 INFO L290 TraceCheckUtils]: 120: Hoare triple {79016#false} assume !false; {79016#false} is VALID [2022-04-08 12:38:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 370 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:38:52,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:53,342 INFO L290 TraceCheckUtils]: 120: Hoare triple {79016#false} assume !false; {79016#false} is VALID [2022-04-08 12:38:53,342 INFO L290 TraceCheckUtils]: 119: Hoare triple {79016#false} assume 0 == ~cond; {79016#false} is VALID [2022-04-08 12:38:53,342 INFO L290 TraceCheckUtils]: 118: Hoare triple {79016#false} ~cond := #in~cond; {79016#false} is VALID [2022-04-08 12:38:53,342 INFO L272 TraceCheckUtils]: 117: Hoare triple {79016#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79016#false} is VALID [2022-04-08 12:38:53,342 INFO L290 TraceCheckUtils]: 116: Hoare triple {79016#false} assume !(#t~post6 < 100);havoc #t~post6; {79016#false} is VALID [2022-04-08 12:38:53,342 INFO L290 TraceCheckUtils]: 115: Hoare triple {79016#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79016#false} is VALID [2022-04-08 12:38:53,342 INFO L290 TraceCheckUtils]: 114: Hoare triple {79412#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {79016#false} is VALID [2022-04-08 12:38:53,343 INFO L290 TraceCheckUtils]: 113: Hoare triple {79416#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79412#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:38:53,343 INFO L290 TraceCheckUtils]: 112: Hoare triple {79416#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79416#(< ~counter~0 100)} is VALID [2022-04-08 12:38:53,344 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79015#true} {79416#(< ~counter~0 100)} #98#return; {79416#(< ~counter~0 100)} is VALID [2022-04-08 12:38:53,344 INFO L290 TraceCheckUtils]: 110: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,344 INFO L290 TraceCheckUtils]: 109: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,344 INFO L290 TraceCheckUtils]: 108: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,344 INFO L272 TraceCheckUtils]: 107: Hoare triple {79416#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,344 INFO L290 TraceCheckUtils]: 106: Hoare triple {79416#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {79416#(< ~counter~0 100)} is VALID [2022-04-08 12:38:53,346 INFO L290 TraceCheckUtils]: 105: Hoare triple {79441#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79416#(< ~counter~0 100)} is VALID [2022-04-08 12:38:53,346 INFO L290 TraceCheckUtils]: 104: Hoare triple {79441#(< ~counter~0 99)} assume !(~r~0 > 0); {79441#(< ~counter~0 99)} is VALID [2022-04-08 12:38:53,346 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79015#true} {79441#(< ~counter~0 99)} #96#return; {79441#(< ~counter~0 99)} is VALID [2022-04-08 12:38:53,347 INFO L290 TraceCheckUtils]: 102: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,347 INFO L290 TraceCheckUtils]: 101: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,347 INFO L290 TraceCheckUtils]: 100: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,347 INFO L272 TraceCheckUtils]: 99: Hoare triple {79441#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,347 INFO L290 TraceCheckUtils]: 98: Hoare triple {79441#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {79441#(< ~counter~0 99)} is VALID [2022-04-08 12:38:53,348 INFO L290 TraceCheckUtils]: 97: Hoare triple {79466#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79441#(< ~counter~0 99)} is VALID [2022-04-08 12:38:53,348 INFO L290 TraceCheckUtils]: 96: Hoare triple {79466#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79466#(< ~counter~0 98)} is VALID [2022-04-08 12:38:53,349 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79015#true} {79466#(< ~counter~0 98)} #96#return; {79466#(< ~counter~0 98)} is VALID [2022-04-08 12:38:53,349 INFO L290 TraceCheckUtils]: 94: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,349 INFO L290 TraceCheckUtils]: 93: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,349 INFO L290 TraceCheckUtils]: 92: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,349 INFO L272 TraceCheckUtils]: 91: Hoare triple {79466#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,350 INFO L290 TraceCheckUtils]: 90: Hoare triple {79466#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {79466#(< ~counter~0 98)} is VALID [2022-04-08 12:38:53,351 INFO L290 TraceCheckUtils]: 89: Hoare triple {79491#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79466#(< ~counter~0 98)} is VALID [2022-04-08 12:38:53,351 INFO L290 TraceCheckUtils]: 88: Hoare triple {79491#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79491#(< ~counter~0 97)} is VALID [2022-04-08 12:38:53,352 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79015#true} {79491#(< ~counter~0 97)} #96#return; {79491#(< ~counter~0 97)} is VALID [2022-04-08 12:38:53,352 INFO L290 TraceCheckUtils]: 86: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,352 INFO L290 TraceCheckUtils]: 85: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,352 INFO L290 TraceCheckUtils]: 84: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,352 INFO L272 TraceCheckUtils]: 83: Hoare triple {79491#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,352 INFO L290 TraceCheckUtils]: 82: Hoare triple {79491#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {79491#(< ~counter~0 97)} is VALID [2022-04-08 12:38:53,353 INFO L290 TraceCheckUtils]: 81: Hoare triple {79516#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79491#(< ~counter~0 97)} is VALID [2022-04-08 12:38:53,354 INFO L290 TraceCheckUtils]: 80: Hoare triple {79516#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79516#(< ~counter~0 96)} is VALID [2022-04-08 12:38:53,354 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79015#true} {79516#(< ~counter~0 96)} #96#return; {79516#(< ~counter~0 96)} is VALID [2022-04-08 12:38:53,355 INFO L290 TraceCheckUtils]: 78: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,355 INFO L290 TraceCheckUtils]: 77: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,355 INFO L290 TraceCheckUtils]: 76: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,355 INFO L272 TraceCheckUtils]: 75: Hoare triple {79516#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,355 INFO L290 TraceCheckUtils]: 74: Hoare triple {79516#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {79516#(< ~counter~0 96)} is VALID [2022-04-08 12:38:53,356 INFO L290 TraceCheckUtils]: 73: Hoare triple {79541#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79516#(< ~counter~0 96)} is VALID [2022-04-08 12:38:53,356 INFO L290 TraceCheckUtils]: 72: Hoare triple {79541#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79541#(< ~counter~0 95)} is VALID [2022-04-08 12:38:53,357 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79015#true} {79541#(< ~counter~0 95)} #96#return; {79541#(< ~counter~0 95)} is VALID [2022-04-08 12:38:53,357 INFO L290 TraceCheckUtils]: 70: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,357 INFO L290 TraceCheckUtils]: 69: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,357 INFO L290 TraceCheckUtils]: 68: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,357 INFO L272 TraceCheckUtils]: 67: Hoare triple {79541#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,357 INFO L290 TraceCheckUtils]: 66: Hoare triple {79541#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {79541#(< ~counter~0 95)} is VALID [2022-04-08 12:38:53,358 INFO L290 TraceCheckUtils]: 65: Hoare triple {79566#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79541#(< ~counter~0 95)} is VALID [2022-04-08 12:38:53,358 INFO L290 TraceCheckUtils]: 64: Hoare triple {79566#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79566#(< ~counter~0 94)} is VALID [2022-04-08 12:38:53,359 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79015#true} {79566#(< ~counter~0 94)} #96#return; {79566#(< ~counter~0 94)} is VALID [2022-04-08 12:38:53,359 INFO L290 TraceCheckUtils]: 62: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,359 INFO L290 TraceCheckUtils]: 61: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,359 INFO L290 TraceCheckUtils]: 60: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,359 INFO L272 TraceCheckUtils]: 59: Hoare triple {79566#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,359 INFO L290 TraceCheckUtils]: 58: Hoare triple {79566#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {79566#(< ~counter~0 94)} is VALID [2022-04-08 12:38:53,360 INFO L290 TraceCheckUtils]: 57: Hoare triple {79591#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79566#(< ~counter~0 94)} is VALID [2022-04-08 12:38:53,360 INFO L290 TraceCheckUtils]: 56: Hoare triple {79591#(< ~counter~0 93)} assume !!(0 != ~r~0); {79591#(< ~counter~0 93)} is VALID [2022-04-08 12:38:53,361 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79015#true} {79591#(< ~counter~0 93)} #94#return; {79591#(< ~counter~0 93)} is VALID [2022-04-08 12:38:53,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,361 INFO L290 TraceCheckUtils]: 53: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,361 INFO L290 TraceCheckUtils]: 52: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,361 INFO L272 TraceCheckUtils]: 51: Hoare triple {79591#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,361 INFO L290 TraceCheckUtils]: 50: Hoare triple {79591#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {79591#(< ~counter~0 93)} is VALID [2022-04-08 12:38:53,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {79616#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79591#(< ~counter~0 93)} is VALID [2022-04-08 12:38:53,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {79616#(< ~counter~0 92)} assume !(~r~0 < 0); {79616#(< ~counter~0 92)} is VALID [2022-04-08 12:38:53,363 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79015#true} {79616#(< ~counter~0 92)} #98#return; {79616#(< ~counter~0 92)} is VALID [2022-04-08 12:38:53,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,363 INFO L272 TraceCheckUtils]: 43: Hoare triple {79616#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {79616#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {79616#(< ~counter~0 92)} is VALID [2022-04-08 12:38:53,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {79641#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79616#(< ~counter~0 92)} is VALID [2022-04-08 12:38:53,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {79641#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79641#(< ~counter~0 91)} is VALID [2022-04-08 12:38:53,365 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79015#true} {79641#(< ~counter~0 91)} #98#return; {79641#(< ~counter~0 91)} is VALID [2022-04-08 12:38:53,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,365 INFO L272 TraceCheckUtils]: 35: Hoare triple {79641#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {79641#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {79641#(< ~counter~0 91)} is VALID [2022-04-08 12:38:53,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {79666#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79641#(< ~counter~0 91)} is VALID [2022-04-08 12:38:53,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {79666#(< ~counter~0 90)} assume !(~r~0 > 0); {79666#(< ~counter~0 90)} is VALID [2022-04-08 12:38:53,367 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79015#true} {79666#(< ~counter~0 90)} #96#return; {79666#(< ~counter~0 90)} is VALID [2022-04-08 12:38:53,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,367 INFO L272 TraceCheckUtils]: 27: Hoare triple {79666#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {79666#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {79666#(< ~counter~0 90)} is VALID [2022-04-08 12:38:53,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {79691#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79666#(< ~counter~0 90)} is VALID [2022-04-08 12:38:53,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {79691#(< ~counter~0 89)} assume !!(0 != ~r~0); {79691#(< ~counter~0 89)} is VALID [2022-04-08 12:38:53,369 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79015#true} {79691#(< ~counter~0 89)} #94#return; {79691#(< ~counter~0 89)} is VALID [2022-04-08 12:38:53,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,369 INFO L272 TraceCheckUtils]: 19: Hoare triple {79691#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {79691#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {79691#(< ~counter~0 89)} is VALID [2022-04-08 12:38:53,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {79716#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79691#(< ~counter~0 89)} is VALID [2022-04-08 12:38:53,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {79716#(< ~counter~0 88)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79716#(< ~counter~0 88)} is VALID [2022-04-08 12:38:53,371 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79015#true} {79716#(< ~counter~0 88)} #92#return; {79716#(< ~counter~0 88)} is VALID [2022-04-08 12:38:53,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,371 INFO L272 TraceCheckUtils]: 11: Hoare triple {79716#(< ~counter~0 88)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79015#true} {79716#(< ~counter~0 88)} #90#return; {79716#(< ~counter~0 88)} is VALID [2022-04-08 12:38:53,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 12:38:53,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 12:38:53,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 12:38:53,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {79716#(< ~counter~0 88)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 12:38:53,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {79716#(< ~counter~0 88)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {79716#(< ~counter~0 88)} is VALID [2022-04-08 12:38:53,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {79716#(< ~counter~0 88)} call #t~ret9 := main(); {79716#(< ~counter~0 88)} is VALID [2022-04-08 12:38:53,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79716#(< ~counter~0 88)} {79015#true} #102#return; {79716#(< ~counter~0 88)} is VALID [2022-04-08 12:38:53,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {79716#(< ~counter~0 88)} assume true; {79716#(< ~counter~0 88)} is VALID [2022-04-08 12:38:53,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {79015#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {79716#(< ~counter~0 88)} is VALID [2022-04-08 12:38:53,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {79015#true} call ULTIMATE.init(); {79015#true} is VALID [2022-04-08 12:38:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 106 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-08 12:38:53,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:53,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792143315] [2022-04-08 12:38:53,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:53,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923333426] [2022-04-08 12:38:53,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923333426] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:53,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:53,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-08 12:38:53,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:53,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1611638994] [2022-04-08 12:38:53,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1611638994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:53,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:53,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 12:38:53,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773682947] [2022-04-08 12:38:53,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:53,375 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 121 [2022-04-08 12:38:53,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:53,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:38:53,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:53,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 12:38:53,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:53,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 12:38:53,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-08 12:38:53,477 INFO L87 Difference]: Start difference. First operand 616 states and 841 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:38:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:56,386 INFO L93 Difference]: Finished difference Result 837 states and 1174 transitions. [2022-04-08 12:38:56,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 12:38:56,386 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 121 [2022-04-08 12:38:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:38:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-08 12:38:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:38:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-08 12:38:56,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 276 transitions. [2022-04-08 12:38:56,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:56,662 INFO L225 Difference]: With dead ends: 837 [2022-04-08 12:38:56,662 INFO L226 Difference]: Without dead ends: 644 [2022-04-08 12:38:56,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=653, Invalid=907, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 12:38:56,663 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 172 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 12:38:56,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 304 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 12:38:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-04-08 12:38:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 634. [2022-04-08 12:38:58,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:58,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 12:38:58,577 INFO L74 IsIncluded]: Start isIncluded. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 12:38:58,578 INFO L87 Difference]: Start difference. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 12:38:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:58,601 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-08 12:38:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-08 12:38:58,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:58,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:58,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 644 states. [2022-04-08 12:38:58,603 INFO L87 Difference]: Start difference. First operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 644 states. [2022-04-08 12:38:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:58,625 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-08 12:38:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-08 12:38:58,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:58,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:58,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:58,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 12:38:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 863 transitions. [2022-04-08 12:38:58,647 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 863 transitions. Word has length 121 [2022-04-08 12:38:58,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:58,647 INFO L478 AbstractCegarLoop]: Abstraction has 634 states and 863 transitions. [2022-04-08 12:38:58,647 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:38:58,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 634 states and 863 transitions. [2022-04-08 12:39:02,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 863 edges. 863 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 863 transitions. [2022-04-08 12:39:02,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 12:39:02,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:39:02,734 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:39:02,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-08 12:39:02,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-08 12:39:02,935 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:39:02,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:39:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 15 times [2022-04-08 12:39:02,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:02,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1443071673] [2022-04-08 12:39:02,936 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:39:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 16 times [2022-04-08 12:39:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:39:02,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048335003] [2022-04-08 12:39:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:39:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:39:02,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:39:02,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479020303] [2022-04-08 12:39:02,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:39:02,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:02,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:39:02,951 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:39:02,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-08 12:39:03,105 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:39:03,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:39:03,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 12:39:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:39:03,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:39:03,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {84020#true} call ULTIMATE.init(); {84020#true} is VALID [2022-04-08 12:39:03,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {84020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {84028#(<= ~counter~0 0)} assume true; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84028#(<= ~counter~0 0)} {84020#true} #102#return; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {84028#(<= ~counter~0 0)} call #t~ret9 := main(); {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {84028#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,725 INFO L272 TraceCheckUtils]: 6: Hoare triple {84028#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {84028#(<= ~counter~0 0)} ~cond := #in~cond; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {84028#(<= ~counter~0 0)} assume !(0 == ~cond); {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {84028#(<= ~counter~0 0)} assume true; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,726 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84028#(<= ~counter~0 0)} {84028#(<= ~counter~0 0)} #90#return; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,726 INFO L272 TraceCheckUtils]: 11: Hoare triple {84028#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {84028#(<= ~counter~0 0)} ~cond := #in~cond; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {84028#(<= ~counter~0 0)} assume !(0 == ~cond); {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {84028#(<= ~counter~0 0)} assume true; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,727 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84028#(<= ~counter~0 0)} {84028#(<= ~counter~0 0)} #92#return; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {84028#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:03,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {84028#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84077#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:03,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {84077#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {84077#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:03,730 INFO L272 TraceCheckUtils]: 19: Hoare triple {84077#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84077#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:03,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {84077#(<= ~counter~0 1)} ~cond := #in~cond; {84077#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:03,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {84077#(<= ~counter~0 1)} assume !(0 == ~cond); {84077#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:03,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {84077#(<= ~counter~0 1)} assume true; {84077#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:03,731 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84077#(<= ~counter~0 1)} {84077#(<= ~counter~0 1)} #94#return; {84077#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:03,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {84077#(<= ~counter~0 1)} assume !!(0 != ~r~0); {84077#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:03,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {84077#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84102#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:03,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {84102#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {84102#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:03,733 INFO L272 TraceCheckUtils]: 27: Hoare triple {84102#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84102#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:03,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {84102#(<= ~counter~0 2)} ~cond := #in~cond; {84102#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:03,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {84102#(<= ~counter~0 2)} assume !(0 == ~cond); {84102#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:03,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {84102#(<= ~counter~0 2)} assume true; {84102#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:03,734 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84102#(<= ~counter~0 2)} {84102#(<= ~counter~0 2)} #96#return; {84102#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:03,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {84102#(<= ~counter~0 2)} assume !(~r~0 > 0); {84102#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:03,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {84102#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84127#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:03,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {84127#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {84127#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:03,736 INFO L272 TraceCheckUtils]: 35: Hoare triple {84127#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84127#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:03,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {84127#(<= ~counter~0 3)} ~cond := #in~cond; {84127#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:03,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {84127#(<= ~counter~0 3)} assume !(0 == ~cond); {84127#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:03,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {84127#(<= ~counter~0 3)} assume true; {84127#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:03,738 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84127#(<= ~counter~0 3)} {84127#(<= ~counter~0 3)} #98#return; {84127#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:03,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {84127#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84127#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:03,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {84127#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84152#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:03,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {84152#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {84152#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:03,740 INFO L272 TraceCheckUtils]: 43: Hoare triple {84152#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84152#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:03,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {84152#(<= ~counter~0 4)} ~cond := #in~cond; {84152#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:03,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {84152#(<= ~counter~0 4)} assume !(0 == ~cond); {84152#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:03,741 INFO L290 TraceCheckUtils]: 46: Hoare triple {84152#(<= ~counter~0 4)} assume true; {84152#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:03,741 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84152#(<= ~counter~0 4)} {84152#(<= ~counter~0 4)} #98#return; {84152#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:03,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {84152#(<= ~counter~0 4)} assume !(~r~0 < 0); {84152#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:03,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {84152#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84177#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:03,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {84177#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {84177#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:03,743 INFO L272 TraceCheckUtils]: 51: Hoare triple {84177#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84177#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:03,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {84177#(<= ~counter~0 5)} ~cond := #in~cond; {84177#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:03,744 INFO L290 TraceCheckUtils]: 53: Hoare triple {84177#(<= ~counter~0 5)} assume !(0 == ~cond); {84177#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:03,744 INFO L290 TraceCheckUtils]: 54: Hoare triple {84177#(<= ~counter~0 5)} assume true; {84177#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:03,744 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84177#(<= ~counter~0 5)} {84177#(<= ~counter~0 5)} #94#return; {84177#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:03,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {84177#(<= ~counter~0 5)} assume !!(0 != ~r~0); {84177#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:03,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {84177#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84202#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:03,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {84202#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {84202#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:03,746 INFO L272 TraceCheckUtils]: 59: Hoare triple {84202#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84202#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:03,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {84202#(<= ~counter~0 6)} ~cond := #in~cond; {84202#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:03,747 INFO L290 TraceCheckUtils]: 61: Hoare triple {84202#(<= ~counter~0 6)} assume !(0 == ~cond); {84202#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:03,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {84202#(<= ~counter~0 6)} assume true; {84202#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:03,747 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84202#(<= ~counter~0 6)} {84202#(<= ~counter~0 6)} #96#return; {84202#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:03,748 INFO L290 TraceCheckUtils]: 64: Hoare triple {84202#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84202#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:03,748 INFO L290 TraceCheckUtils]: 65: Hoare triple {84202#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84227#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:03,749 INFO L290 TraceCheckUtils]: 66: Hoare triple {84227#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {84227#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:03,749 INFO L272 TraceCheckUtils]: 67: Hoare triple {84227#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84227#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:03,749 INFO L290 TraceCheckUtils]: 68: Hoare triple {84227#(<= ~counter~0 7)} ~cond := #in~cond; {84227#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:03,750 INFO L290 TraceCheckUtils]: 69: Hoare triple {84227#(<= ~counter~0 7)} assume !(0 == ~cond); {84227#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:03,750 INFO L290 TraceCheckUtils]: 70: Hoare triple {84227#(<= ~counter~0 7)} assume true; {84227#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:03,750 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84227#(<= ~counter~0 7)} {84227#(<= ~counter~0 7)} #96#return; {84227#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:03,751 INFO L290 TraceCheckUtils]: 72: Hoare triple {84227#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84227#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:03,751 INFO L290 TraceCheckUtils]: 73: Hoare triple {84227#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84252#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:03,752 INFO L290 TraceCheckUtils]: 74: Hoare triple {84252#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {84252#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:03,752 INFO L272 TraceCheckUtils]: 75: Hoare triple {84252#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84252#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:03,752 INFO L290 TraceCheckUtils]: 76: Hoare triple {84252#(<= ~counter~0 8)} ~cond := #in~cond; {84252#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:03,753 INFO L290 TraceCheckUtils]: 77: Hoare triple {84252#(<= ~counter~0 8)} assume !(0 == ~cond); {84252#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:03,753 INFO L290 TraceCheckUtils]: 78: Hoare triple {84252#(<= ~counter~0 8)} assume true; {84252#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:03,753 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84252#(<= ~counter~0 8)} {84252#(<= ~counter~0 8)} #96#return; {84252#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:03,754 INFO L290 TraceCheckUtils]: 80: Hoare triple {84252#(<= ~counter~0 8)} assume !(~r~0 > 0); {84252#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:03,754 INFO L290 TraceCheckUtils]: 81: Hoare triple {84252#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84277#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:03,755 INFO L290 TraceCheckUtils]: 82: Hoare triple {84277#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {84277#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:03,755 INFO L272 TraceCheckUtils]: 83: Hoare triple {84277#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84277#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:03,755 INFO L290 TraceCheckUtils]: 84: Hoare triple {84277#(<= ~counter~0 9)} ~cond := #in~cond; {84277#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:03,756 INFO L290 TraceCheckUtils]: 85: Hoare triple {84277#(<= ~counter~0 9)} assume !(0 == ~cond); {84277#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:03,756 INFO L290 TraceCheckUtils]: 86: Hoare triple {84277#(<= ~counter~0 9)} assume true; {84277#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:03,756 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84277#(<= ~counter~0 9)} {84277#(<= ~counter~0 9)} #98#return; {84277#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:03,757 INFO L290 TraceCheckUtils]: 88: Hoare triple {84277#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84277#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:03,758 INFO L290 TraceCheckUtils]: 89: Hoare triple {84277#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84302#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:03,758 INFO L290 TraceCheckUtils]: 90: Hoare triple {84302#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {84302#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:03,758 INFO L272 TraceCheckUtils]: 91: Hoare triple {84302#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84302#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:03,759 INFO L290 TraceCheckUtils]: 92: Hoare triple {84302#(<= ~counter~0 10)} ~cond := #in~cond; {84302#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:03,759 INFO L290 TraceCheckUtils]: 93: Hoare triple {84302#(<= ~counter~0 10)} assume !(0 == ~cond); {84302#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:03,759 INFO L290 TraceCheckUtils]: 94: Hoare triple {84302#(<= ~counter~0 10)} assume true; {84302#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:03,760 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84302#(<= ~counter~0 10)} {84302#(<= ~counter~0 10)} #98#return; {84302#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:03,760 INFO L290 TraceCheckUtils]: 96: Hoare triple {84302#(<= ~counter~0 10)} assume !(~r~0 < 0); {84302#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:03,761 INFO L290 TraceCheckUtils]: 97: Hoare triple {84302#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84327#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:03,761 INFO L290 TraceCheckUtils]: 98: Hoare triple {84327#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {84327#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:03,761 INFO L272 TraceCheckUtils]: 99: Hoare triple {84327#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84327#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:03,762 INFO L290 TraceCheckUtils]: 100: Hoare triple {84327#(<= ~counter~0 11)} ~cond := #in~cond; {84327#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:03,762 INFO L290 TraceCheckUtils]: 101: Hoare triple {84327#(<= ~counter~0 11)} assume !(0 == ~cond); {84327#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:03,762 INFO L290 TraceCheckUtils]: 102: Hoare triple {84327#(<= ~counter~0 11)} assume true; {84327#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:03,763 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84327#(<= ~counter~0 11)} {84327#(<= ~counter~0 11)} #94#return; {84327#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:03,763 INFO L290 TraceCheckUtils]: 104: Hoare triple {84327#(<= ~counter~0 11)} assume !!(0 != ~r~0); {84327#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:03,764 INFO L290 TraceCheckUtils]: 105: Hoare triple {84327#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84352#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:03,764 INFO L290 TraceCheckUtils]: 106: Hoare triple {84352#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {84352#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:03,764 INFO L272 TraceCheckUtils]: 107: Hoare triple {84352#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84352#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:03,765 INFO L290 TraceCheckUtils]: 108: Hoare triple {84352#(<= ~counter~0 12)} ~cond := #in~cond; {84352#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:03,765 INFO L290 TraceCheckUtils]: 109: Hoare triple {84352#(<= ~counter~0 12)} assume !(0 == ~cond); {84352#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:03,765 INFO L290 TraceCheckUtils]: 110: Hoare triple {84352#(<= ~counter~0 12)} assume true; {84352#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:03,766 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84352#(<= ~counter~0 12)} {84352#(<= ~counter~0 12)} #96#return; {84352#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:03,766 INFO L290 TraceCheckUtils]: 112: Hoare triple {84352#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84352#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:03,766 INFO L290 TraceCheckUtils]: 113: Hoare triple {84352#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84377#(<= |main_#t~post7| 12)} is VALID [2022-04-08 12:39:03,767 INFO L290 TraceCheckUtils]: 114: Hoare triple {84377#(<= |main_#t~post7| 12)} assume !(#t~post7 < 100);havoc #t~post7; {84021#false} is VALID [2022-04-08 12:39:03,767 INFO L290 TraceCheckUtils]: 115: Hoare triple {84021#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84021#false} is VALID [2022-04-08 12:39:03,767 INFO L290 TraceCheckUtils]: 116: Hoare triple {84021#false} assume !(#t~post8 < 100);havoc #t~post8; {84021#false} is VALID [2022-04-08 12:39:03,767 INFO L290 TraceCheckUtils]: 117: Hoare triple {84021#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84021#false} is VALID [2022-04-08 12:39:03,767 INFO L290 TraceCheckUtils]: 118: Hoare triple {84021#false} assume !(#t~post6 < 100);havoc #t~post6; {84021#false} is VALID [2022-04-08 12:39:03,767 INFO L272 TraceCheckUtils]: 119: Hoare triple {84021#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84021#false} is VALID [2022-04-08 12:39:03,767 INFO L290 TraceCheckUtils]: 120: Hoare triple {84021#false} ~cond := #in~cond; {84021#false} is VALID [2022-04-08 12:39:03,767 INFO L290 TraceCheckUtils]: 121: Hoare triple {84021#false} assume 0 == ~cond; {84021#false} is VALID [2022-04-08 12:39:03,767 INFO L290 TraceCheckUtils]: 122: Hoare triple {84021#false} assume !false; {84021#false} is VALID [2022-04-08 12:39:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 350 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:39:03,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:39:04,455 INFO L290 TraceCheckUtils]: 122: Hoare triple {84021#false} assume !false; {84021#false} is VALID [2022-04-08 12:39:04,455 INFO L290 TraceCheckUtils]: 121: Hoare triple {84021#false} assume 0 == ~cond; {84021#false} is VALID [2022-04-08 12:39:04,455 INFO L290 TraceCheckUtils]: 120: Hoare triple {84021#false} ~cond := #in~cond; {84021#false} is VALID [2022-04-08 12:39:04,455 INFO L272 TraceCheckUtils]: 119: Hoare triple {84021#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84021#false} is VALID [2022-04-08 12:39:04,455 INFO L290 TraceCheckUtils]: 118: Hoare triple {84021#false} assume !(#t~post6 < 100);havoc #t~post6; {84021#false} is VALID [2022-04-08 12:39:04,455 INFO L290 TraceCheckUtils]: 117: Hoare triple {84021#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84021#false} is VALID [2022-04-08 12:39:04,455 INFO L290 TraceCheckUtils]: 116: Hoare triple {84021#false} assume !(#t~post8 < 100);havoc #t~post8; {84021#false} is VALID [2022-04-08 12:39:04,455 INFO L290 TraceCheckUtils]: 115: Hoare triple {84021#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84021#false} is VALID [2022-04-08 12:39:04,456 INFO L290 TraceCheckUtils]: 114: Hoare triple {84429#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {84021#false} is VALID [2022-04-08 12:39:04,456 INFO L290 TraceCheckUtils]: 113: Hoare triple {84433#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84429#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:39:04,456 INFO L290 TraceCheckUtils]: 112: Hoare triple {84433#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84433#(< ~counter~0 100)} is VALID [2022-04-08 12:39:04,457 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84020#true} {84433#(< ~counter~0 100)} #96#return; {84433#(< ~counter~0 100)} is VALID [2022-04-08 12:39:04,457 INFO L290 TraceCheckUtils]: 110: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,457 INFO L290 TraceCheckUtils]: 109: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,457 INFO L290 TraceCheckUtils]: 108: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,457 INFO L272 TraceCheckUtils]: 107: Hoare triple {84433#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,457 INFO L290 TraceCheckUtils]: 106: Hoare triple {84433#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {84433#(< ~counter~0 100)} is VALID [2022-04-08 12:39:04,459 INFO L290 TraceCheckUtils]: 105: Hoare triple {84458#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84433#(< ~counter~0 100)} is VALID [2022-04-08 12:39:04,459 INFO L290 TraceCheckUtils]: 104: Hoare triple {84458#(< ~counter~0 99)} assume !!(0 != ~r~0); {84458#(< ~counter~0 99)} is VALID [2022-04-08 12:39:04,460 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84020#true} {84458#(< ~counter~0 99)} #94#return; {84458#(< ~counter~0 99)} is VALID [2022-04-08 12:39:04,460 INFO L290 TraceCheckUtils]: 102: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,460 INFO L290 TraceCheckUtils]: 101: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,460 INFO L290 TraceCheckUtils]: 100: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,460 INFO L272 TraceCheckUtils]: 99: Hoare triple {84458#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,460 INFO L290 TraceCheckUtils]: 98: Hoare triple {84458#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {84458#(< ~counter~0 99)} is VALID [2022-04-08 12:39:04,461 INFO L290 TraceCheckUtils]: 97: Hoare triple {84483#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84458#(< ~counter~0 99)} is VALID [2022-04-08 12:39:04,461 INFO L290 TraceCheckUtils]: 96: Hoare triple {84483#(< ~counter~0 98)} assume !(~r~0 < 0); {84483#(< ~counter~0 98)} is VALID [2022-04-08 12:39:04,462 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84020#true} {84483#(< ~counter~0 98)} #98#return; {84483#(< ~counter~0 98)} is VALID [2022-04-08 12:39:04,462 INFO L290 TraceCheckUtils]: 94: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,462 INFO L290 TraceCheckUtils]: 93: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,462 INFO L290 TraceCheckUtils]: 92: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,462 INFO L272 TraceCheckUtils]: 91: Hoare triple {84483#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,462 INFO L290 TraceCheckUtils]: 90: Hoare triple {84483#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {84483#(< ~counter~0 98)} is VALID [2022-04-08 12:39:04,463 INFO L290 TraceCheckUtils]: 89: Hoare triple {84508#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84483#(< ~counter~0 98)} is VALID [2022-04-08 12:39:04,463 INFO L290 TraceCheckUtils]: 88: Hoare triple {84508#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84508#(< ~counter~0 97)} is VALID [2022-04-08 12:39:04,464 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84020#true} {84508#(< ~counter~0 97)} #98#return; {84508#(< ~counter~0 97)} is VALID [2022-04-08 12:39:04,464 INFO L290 TraceCheckUtils]: 86: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,464 INFO L290 TraceCheckUtils]: 85: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,464 INFO L290 TraceCheckUtils]: 84: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,464 INFO L272 TraceCheckUtils]: 83: Hoare triple {84508#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,464 INFO L290 TraceCheckUtils]: 82: Hoare triple {84508#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {84508#(< ~counter~0 97)} is VALID [2022-04-08 12:39:04,465 INFO L290 TraceCheckUtils]: 81: Hoare triple {84533#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84508#(< ~counter~0 97)} is VALID [2022-04-08 12:39:04,465 INFO L290 TraceCheckUtils]: 80: Hoare triple {84533#(< ~counter~0 96)} assume !(~r~0 > 0); {84533#(< ~counter~0 96)} is VALID [2022-04-08 12:39:04,466 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84020#true} {84533#(< ~counter~0 96)} #96#return; {84533#(< ~counter~0 96)} is VALID [2022-04-08 12:39:04,466 INFO L290 TraceCheckUtils]: 78: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,466 INFO L290 TraceCheckUtils]: 77: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,466 INFO L290 TraceCheckUtils]: 76: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,466 INFO L272 TraceCheckUtils]: 75: Hoare triple {84533#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,466 INFO L290 TraceCheckUtils]: 74: Hoare triple {84533#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {84533#(< ~counter~0 96)} is VALID [2022-04-08 12:39:04,467 INFO L290 TraceCheckUtils]: 73: Hoare triple {84558#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84533#(< ~counter~0 96)} is VALID [2022-04-08 12:39:04,467 INFO L290 TraceCheckUtils]: 72: Hoare triple {84558#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84558#(< ~counter~0 95)} is VALID [2022-04-08 12:39:04,468 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84020#true} {84558#(< ~counter~0 95)} #96#return; {84558#(< ~counter~0 95)} is VALID [2022-04-08 12:39:04,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,468 INFO L272 TraceCheckUtils]: 67: Hoare triple {84558#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,468 INFO L290 TraceCheckUtils]: 66: Hoare triple {84558#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {84558#(< ~counter~0 95)} is VALID [2022-04-08 12:39:04,469 INFO L290 TraceCheckUtils]: 65: Hoare triple {84583#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84558#(< ~counter~0 95)} is VALID [2022-04-08 12:39:04,469 INFO L290 TraceCheckUtils]: 64: Hoare triple {84583#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84583#(< ~counter~0 94)} is VALID [2022-04-08 12:39:04,470 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84020#true} {84583#(< ~counter~0 94)} #96#return; {84583#(< ~counter~0 94)} is VALID [2022-04-08 12:39:04,470 INFO L290 TraceCheckUtils]: 62: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,470 INFO L290 TraceCheckUtils]: 61: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,470 INFO L290 TraceCheckUtils]: 60: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,470 INFO L272 TraceCheckUtils]: 59: Hoare triple {84583#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {84583#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {84583#(< ~counter~0 94)} is VALID [2022-04-08 12:39:04,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {84608#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84583#(< ~counter~0 94)} is VALID [2022-04-08 12:39:04,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {84608#(< ~counter~0 93)} assume !!(0 != ~r~0); {84608#(< ~counter~0 93)} is VALID [2022-04-08 12:39:04,472 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84020#true} {84608#(< ~counter~0 93)} #94#return; {84608#(< ~counter~0 93)} is VALID [2022-04-08 12:39:04,472 INFO L290 TraceCheckUtils]: 54: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,472 INFO L290 TraceCheckUtils]: 53: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,472 INFO L290 TraceCheckUtils]: 52: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,472 INFO L272 TraceCheckUtils]: 51: Hoare triple {84608#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,472 INFO L290 TraceCheckUtils]: 50: Hoare triple {84608#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {84608#(< ~counter~0 93)} is VALID [2022-04-08 12:39:04,473 INFO L290 TraceCheckUtils]: 49: Hoare triple {84633#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84608#(< ~counter~0 93)} is VALID [2022-04-08 12:39:04,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {84633#(< ~counter~0 92)} assume !(~r~0 < 0); {84633#(< ~counter~0 92)} is VALID [2022-04-08 12:39:04,474 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84020#true} {84633#(< ~counter~0 92)} #98#return; {84633#(< ~counter~0 92)} is VALID [2022-04-08 12:39:04,474 INFO L290 TraceCheckUtils]: 46: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,474 INFO L290 TraceCheckUtils]: 45: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,474 INFO L290 TraceCheckUtils]: 44: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,474 INFO L272 TraceCheckUtils]: 43: Hoare triple {84633#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,474 INFO L290 TraceCheckUtils]: 42: Hoare triple {84633#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {84633#(< ~counter~0 92)} is VALID [2022-04-08 12:39:04,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {84658#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84633#(< ~counter~0 92)} is VALID [2022-04-08 12:39:04,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {84658#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84658#(< ~counter~0 91)} is VALID [2022-04-08 12:39:04,476 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84020#true} {84658#(< ~counter~0 91)} #98#return; {84658#(< ~counter~0 91)} is VALID [2022-04-08 12:39:04,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,476 INFO L272 TraceCheckUtils]: 35: Hoare triple {84658#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {84658#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {84658#(< ~counter~0 91)} is VALID [2022-04-08 12:39:04,477 INFO L290 TraceCheckUtils]: 33: Hoare triple {84683#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84658#(< ~counter~0 91)} is VALID [2022-04-08 12:39:04,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {84683#(< ~counter~0 90)} assume !(~r~0 > 0); {84683#(< ~counter~0 90)} is VALID [2022-04-08 12:39:04,478 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84020#true} {84683#(< ~counter~0 90)} #96#return; {84683#(< ~counter~0 90)} is VALID [2022-04-08 12:39:04,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,478 INFO L272 TraceCheckUtils]: 27: Hoare triple {84683#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {84683#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {84683#(< ~counter~0 90)} is VALID [2022-04-08 12:39:04,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {84708#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84683#(< ~counter~0 90)} is VALID [2022-04-08 12:39:04,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {84708#(< ~counter~0 89)} assume !!(0 != ~r~0); {84708#(< ~counter~0 89)} is VALID [2022-04-08 12:39:04,480 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84020#true} {84708#(< ~counter~0 89)} #94#return; {84708#(< ~counter~0 89)} is VALID [2022-04-08 12:39:04,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,480 INFO L272 TraceCheckUtils]: 19: Hoare triple {84708#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {84708#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {84708#(< ~counter~0 89)} is VALID [2022-04-08 12:39:04,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {84733#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84708#(< ~counter~0 89)} is VALID [2022-04-08 12:39:04,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {84733#(< ~counter~0 88)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {84733#(< ~counter~0 88)} is VALID [2022-04-08 12:39:04,482 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84020#true} {84733#(< ~counter~0 88)} #92#return; {84733#(< ~counter~0 88)} is VALID [2022-04-08 12:39:04,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,482 INFO L272 TraceCheckUtils]: 11: Hoare triple {84733#(< ~counter~0 88)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,482 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84020#true} {84733#(< ~counter~0 88)} #90#return; {84733#(< ~counter~0 88)} is VALID [2022-04-08 12:39:04,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 12:39:04,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 12:39:04,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 12:39:04,483 INFO L272 TraceCheckUtils]: 6: Hoare triple {84733#(< ~counter~0 88)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 12:39:04,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {84733#(< ~counter~0 88)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {84733#(< ~counter~0 88)} is VALID [2022-04-08 12:39:04,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {84733#(< ~counter~0 88)} call #t~ret9 := main(); {84733#(< ~counter~0 88)} is VALID [2022-04-08 12:39:04,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84733#(< ~counter~0 88)} {84020#true} #102#return; {84733#(< ~counter~0 88)} is VALID [2022-04-08 12:39:04,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {84733#(< ~counter~0 88)} assume true; {84733#(< ~counter~0 88)} is VALID [2022-04-08 12:39:04,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {84020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {84733#(< ~counter~0 88)} is VALID [2022-04-08 12:39:04,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {84020#true} call ULTIMATE.init(); {84020#true} is VALID [2022-04-08 12:39:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 86 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-08 12:39:04,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:39:04,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048335003] [2022-04-08 12:39:04,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:39:04,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479020303] [2022-04-08 12:39:04,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479020303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:39:04,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:39:04,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-08 12:39:04,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:39:04,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1443071673] [2022-04-08 12:39:04,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1443071673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:39:04,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:39:04,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 12:39:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380682386] [2022-04-08 12:39:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:39:04,486 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 123 [2022-04-08 12:39:04,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:39:04,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:39:04,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:04,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 12:39:04,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:04,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 12:39:04,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-08 12:39:04,588 INFO L87 Difference]: Start difference. First operand 634 states and 863 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:39:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:07,534 INFO L93 Difference]: Finished difference Result 847 states and 1187 transitions. [2022-04-08 12:39:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 12:39:07,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-08 12:39:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:39:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:39:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-08 12:39:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:39:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-08 12:39:07,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 276 transitions. [2022-04-08 12:39:07,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:07,829 INFO L225 Difference]: With dead ends: 847 [2022-04-08 12:39:07,829 INFO L226 Difference]: Without dead ends: 650 [2022-04-08 12:39:07,830 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=691, Invalid=949, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 12:39:07,830 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 171 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 12:39:07,830 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 281 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 12:39:07,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-04-08 12:39:09,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-04-08 12:39:09,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:39:09,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 12:39:09,824 INFO L74 IsIncluded]: Start isIncluded. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 12:39:09,824 INFO L87 Difference]: Start difference. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 12:39:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:09,839 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-08 12:39:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-08 12:39:09,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:09,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:09,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 650 states. [2022-04-08 12:39:09,841 INFO L87 Difference]: Start difference. First operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 650 states. [2022-04-08 12:39:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:09,858 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-08 12:39:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-08 12:39:09,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:09,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:09,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:39:09,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:39:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 12:39:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 879 transitions. [2022-04-08 12:39:09,879 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 879 transitions. Word has length 123 [2022-04-08 12:39:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:39:09,879 INFO L478 AbstractCegarLoop]: Abstraction has 650 states and 879 transitions. [2022-04-08 12:39:09,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 12:39:09,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 650 states and 879 transitions. [2022-04-08 12:39:13,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 879 edges. 879 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-08 12:39:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-08 12:39:13,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:39:13,929 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:39:13,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-08 12:39:14,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:14,131 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:39:14,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:39:14,132 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 9 times [2022-04-08 12:39:14,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:14,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1508638841] [2022-04-08 12:39:14,132 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:39:14,132 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 10 times [2022-04-08 12:39:14,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:39:14,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767843856] [2022-04-08 12:39:14,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:39:14,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:39:14,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:39:14,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140135231] [2022-04-08 12:39:14,153 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:39:14,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:14,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:39:14,154 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:39:14,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-08 12:39:14,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:39:14,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:39:14,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 12:39:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:39:14,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:39:14,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {89103#true} call ULTIMATE.init(); {89103#true} is VALID [2022-04-08 12:39:14,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {89103#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {89111#(<= ~counter~0 0)} assume true; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89111#(<= ~counter~0 0)} {89103#true} #102#return; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {89111#(<= ~counter~0 0)} call #t~ret9 := main(); {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {89111#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,872 INFO L272 TraceCheckUtils]: 6: Hoare triple {89111#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {89111#(<= ~counter~0 0)} ~cond := #in~cond; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {89111#(<= ~counter~0 0)} assume !(0 == ~cond); {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {89111#(<= ~counter~0 0)} assume true; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,873 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89111#(<= ~counter~0 0)} {89111#(<= ~counter~0 0)} #90#return; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,873 INFO L272 TraceCheckUtils]: 11: Hoare triple {89111#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {89111#(<= ~counter~0 0)} ~cond := #in~cond; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {89111#(<= ~counter~0 0)} assume !(0 == ~cond); {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {89111#(<= ~counter~0 0)} assume true; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,874 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89111#(<= ~counter~0 0)} {89111#(<= ~counter~0 0)} #92#return; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {89111#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:14,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {89111#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89160#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:14,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {89160#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {89160#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:14,877 INFO L272 TraceCheckUtils]: 19: Hoare triple {89160#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89160#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:14,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {89160#(<= ~counter~0 1)} ~cond := #in~cond; {89160#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:14,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {89160#(<= ~counter~0 1)} assume !(0 == ~cond); {89160#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:14,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {89160#(<= ~counter~0 1)} assume true; {89160#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:14,879 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89160#(<= ~counter~0 1)} {89160#(<= ~counter~0 1)} #94#return; {89160#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:14,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {89160#(<= ~counter~0 1)} assume !!(0 != ~r~0); {89160#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:14,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {89160#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89185#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:14,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {89185#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {89185#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:14,881 INFO L272 TraceCheckUtils]: 27: Hoare triple {89185#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89185#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:14,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {89185#(<= ~counter~0 2)} ~cond := #in~cond; {89185#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:14,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {89185#(<= ~counter~0 2)} assume !(0 == ~cond); {89185#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:14,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {89185#(<= ~counter~0 2)} assume true; {89185#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:14,882 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89185#(<= ~counter~0 2)} {89185#(<= ~counter~0 2)} #96#return; {89185#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:14,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {89185#(<= ~counter~0 2)} assume !(~r~0 > 0); {89185#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:14,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {89185#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89210#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:14,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {89210#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {89210#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:14,884 INFO L272 TraceCheckUtils]: 35: Hoare triple {89210#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89210#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:14,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {89210#(<= ~counter~0 3)} ~cond := #in~cond; {89210#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:14,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {89210#(<= ~counter~0 3)} assume !(0 == ~cond); {89210#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:14,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {89210#(<= ~counter~0 3)} assume true; {89210#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:14,885 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89210#(<= ~counter~0 3)} {89210#(<= ~counter~0 3)} #98#return; {89210#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:14,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {89210#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89210#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:14,887 INFO L290 TraceCheckUtils]: 41: Hoare triple {89210#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89235#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:14,887 INFO L290 TraceCheckUtils]: 42: Hoare triple {89235#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {89235#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:14,887 INFO L272 TraceCheckUtils]: 43: Hoare triple {89235#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89235#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:14,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {89235#(<= ~counter~0 4)} ~cond := #in~cond; {89235#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:14,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {89235#(<= ~counter~0 4)} assume !(0 == ~cond); {89235#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:14,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {89235#(<= ~counter~0 4)} assume true; {89235#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:14,889 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89235#(<= ~counter~0 4)} {89235#(<= ~counter~0 4)} #98#return; {89235#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:14,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {89235#(<= ~counter~0 4)} assume !(~r~0 < 0); {89235#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:14,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {89235#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89260#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:14,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {89260#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {89260#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:14,891 INFO L272 TraceCheckUtils]: 51: Hoare triple {89260#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89260#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:14,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {89260#(<= ~counter~0 5)} ~cond := #in~cond; {89260#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:14,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {89260#(<= ~counter~0 5)} assume !(0 == ~cond); {89260#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:14,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {89260#(<= ~counter~0 5)} assume true; {89260#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:14,899 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89260#(<= ~counter~0 5)} {89260#(<= ~counter~0 5)} #94#return; {89260#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:14,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {89260#(<= ~counter~0 5)} assume !!(0 != ~r~0); {89260#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:14,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {89260#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89285#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:14,902 INFO L290 TraceCheckUtils]: 58: Hoare triple {89285#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {89285#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:14,902 INFO L272 TraceCheckUtils]: 59: Hoare triple {89285#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89285#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:14,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {89285#(<= ~counter~0 6)} ~cond := #in~cond; {89285#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:14,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {89285#(<= ~counter~0 6)} assume !(0 == ~cond); {89285#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:14,903 INFO L290 TraceCheckUtils]: 62: Hoare triple {89285#(<= ~counter~0 6)} assume true; {89285#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:14,903 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89285#(<= ~counter~0 6)} {89285#(<= ~counter~0 6)} #96#return; {89285#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:14,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {89285#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89285#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:14,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {89285#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89310#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:14,905 INFO L290 TraceCheckUtils]: 66: Hoare triple {89310#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {89310#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:14,905 INFO L272 TraceCheckUtils]: 67: Hoare triple {89310#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89310#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:14,906 INFO L290 TraceCheckUtils]: 68: Hoare triple {89310#(<= ~counter~0 7)} ~cond := #in~cond; {89310#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:14,906 INFO L290 TraceCheckUtils]: 69: Hoare triple {89310#(<= ~counter~0 7)} assume !(0 == ~cond); {89310#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:14,906 INFO L290 TraceCheckUtils]: 70: Hoare triple {89310#(<= ~counter~0 7)} assume true; {89310#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:14,907 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89310#(<= ~counter~0 7)} {89310#(<= ~counter~0 7)} #96#return; {89310#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:14,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {89310#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89310#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:14,908 INFO L290 TraceCheckUtils]: 73: Hoare triple {89310#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89335#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:14,908 INFO L290 TraceCheckUtils]: 74: Hoare triple {89335#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {89335#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:14,909 INFO L272 TraceCheckUtils]: 75: Hoare triple {89335#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89335#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:14,909 INFO L290 TraceCheckUtils]: 76: Hoare triple {89335#(<= ~counter~0 8)} ~cond := #in~cond; {89335#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:14,909 INFO L290 TraceCheckUtils]: 77: Hoare triple {89335#(<= ~counter~0 8)} assume !(0 == ~cond); {89335#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:14,909 INFO L290 TraceCheckUtils]: 78: Hoare triple {89335#(<= ~counter~0 8)} assume true; {89335#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:14,910 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89335#(<= ~counter~0 8)} {89335#(<= ~counter~0 8)} #96#return; {89335#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:14,910 INFO L290 TraceCheckUtils]: 80: Hoare triple {89335#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89335#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:14,911 INFO L290 TraceCheckUtils]: 81: Hoare triple {89335#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89360#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:14,911 INFO L290 TraceCheckUtils]: 82: Hoare triple {89360#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {89360#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:14,912 INFO L272 TraceCheckUtils]: 83: Hoare triple {89360#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89360#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:14,912 INFO L290 TraceCheckUtils]: 84: Hoare triple {89360#(<= ~counter~0 9)} ~cond := #in~cond; {89360#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:14,912 INFO L290 TraceCheckUtils]: 85: Hoare triple {89360#(<= ~counter~0 9)} assume !(0 == ~cond); {89360#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:14,913 INFO L290 TraceCheckUtils]: 86: Hoare triple {89360#(<= ~counter~0 9)} assume true; {89360#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:14,913 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89360#(<= ~counter~0 9)} {89360#(<= ~counter~0 9)} #96#return; {89360#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:14,913 INFO L290 TraceCheckUtils]: 88: Hoare triple {89360#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89360#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:14,914 INFO L290 TraceCheckUtils]: 89: Hoare triple {89360#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89385#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:14,915 INFO L290 TraceCheckUtils]: 90: Hoare triple {89385#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {89385#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:14,915 INFO L272 TraceCheckUtils]: 91: Hoare triple {89385#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89385#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:14,915 INFO L290 TraceCheckUtils]: 92: Hoare triple {89385#(<= ~counter~0 10)} ~cond := #in~cond; {89385#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:14,916 INFO L290 TraceCheckUtils]: 93: Hoare triple {89385#(<= ~counter~0 10)} assume !(0 == ~cond); {89385#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:14,916 INFO L290 TraceCheckUtils]: 94: Hoare triple {89385#(<= ~counter~0 10)} assume true; {89385#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:14,916 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89385#(<= ~counter~0 10)} {89385#(<= ~counter~0 10)} #96#return; {89385#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:14,917 INFO L290 TraceCheckUtils]: 96: Hoare triple {89385#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89385#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:14,918 INFO L290 TraceCheckUtils]: 97: Hoare triple {89385#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89410#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:14,918 INFO L290 TraceCheckUtils]: 98: Hoare triple {89410#(<= ~counter~0 11)} assume !!(#t~post7 < 100);havoc #t~post7; {89410#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:14,919 INFO L272 TraceCheckUtils]: 99: Hoare triple {89410#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89410#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:14,919 INFO L290 TraceCheckUtils]: 100: Hoare triple {89410#(<= ~counter~0 11)} ~cond := #in~cond; {89410#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:14,919 INFO L290 TraceCheckUtils]: 101: Hoare triple {89410#(<= ~counter~0 11)} assume !(0 == ~cond); {89410#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:14,919 INFO L290 TraceCheckUtils]: 102: Hoare triple {89410#(<= ~counter~0 11)} assume true; {89410#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:14,920 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89410#(<= ~counter~0 11)} {89410#(<= ~counter~0 11)} #96#return; {89410#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:14,920 INFO L290 TraceCheckUtils]: 104: Hoare triple {89410#(<= ~counter~0 11)} assume !(~r~0 > 0); {89410#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:14,921 INFO L290 TraceCheckUtils]: 105: Hoare triple {89410#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89435#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:14,921 INFO L290 TraceCheckUtils]: 106: Hoare triple {89435#(<= ~counter~0 12)} assume !!(#t~post8 < 100);havoc #t~post8; {89435#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:14,922 INFO L272 TraceCheckUtils]: 107: Hoare triple {89435#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89435#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:14,922 INFO L290 TraceCheckUtils]: 108: Hoare triple {89435#(<= ~counter~0 12)} ~cond := #in~cond; {89435#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:14,922 INFO L290 TraceCheckUtils]: 109: Hoare triple {89435#(<= ~counter~0 12)} assume !(0 == ~cond); {89435#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:14,923 INFO L290 TraceCheckUtils]: 110: Hoare triple {89435#(<= ~counter~0 12)} assume true; {89435#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:14,923 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89435#(<= ~counter~0 12)} {89435#(<= ~counter~0 12)} #98#return; {89435#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:14,923 INFO L290 TraceCheckUtils]: 112: Hoare triple {89435#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89435#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:14,924 INFO L290 TraceCheckUtils]: 113: Hoare triple {89435#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89460#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:14,925 INFO L290 TraceCheckUtils]: 114: Hoare triple {89460#(<= ~counter~0 13)} assume !!(#t~post8 < 100);havoc #t~post8; {89460#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:14,925 INFO L272 TraceCheckUtils]: 115: Hoare triple {89460#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89460#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:14,925 INFO L290 TraceCheckUtils]: 116: Hoare triple {89460#(<= ~counter~0 13)} ~cond := #in~cond; {89460#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:14,926 INFO L290 TraceCheckUtils]: 117: Hoare triple {89460#(<= ~counter~0 13)} assume !(0 == ~cond); {89460#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:14,926 INFO L290 TraceCheckUtils]: 118: Hoare triple {89460#(<= ~counter~0 13)} assume true; {89460#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:14,926 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89460#(<= ~counter~0 13)} {89460#(<= ~counter~0 13)} #98#return; {89460#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:14,927 INFO L290 TraceCheckUtils]: 120: Hoare triple {89460#(<= ~counter~0 13)} assume !(~r~0 < 0); {89460#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:14,927 INFO L290 TraceCheckUtils]: 121: Hoare triple {89460#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89485#(<= |main_#t~post6| 13)} is VALID [2022-04-08 12:39:14,927 INFO L290 TraceCheckUtils]: 122: Hoare triple {89485#(<= |main_#t~post6| 13)} assume !(#t~post6 < 100);havoc #t~post6; {89104#false} is VALID [2022-04-08 12:39:14,927 INFO L272 TraceCheckUtils]: 123: Hoare triple {89104#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89104#false} is VALID [2022-04-08 12:39:14,927 INFO L290 TraceCheckUtils]: 124: Hoare triple {89104#false} ~cond := #in~cond; {89104#false} is VALID [2022-04-08 12:39:14,927 INFO L290 TraceCheckUtils]: 125: Hoare triple {89104#false} assume 0 == ~cond; {89104#false} is VALID [2022-04-08 12:39:14,927 INFO L290 TraceCheckUtils]: 126: Hoare triple {89104#false} assume !false; {89104#false} is VALID [2022-04-08 12:39:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 428 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:39:14,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:39:15,653 INFO L290 TraceCheckUtils]: 126: Hoare triple {89104#false} assume !false; {89104#false} is VALID [2022-04-08 12:39:15,653 INFO L290 TraceCheckUtils]: 125: Hoare triple {89104#false} assume 0 == ~cond; {89104#false} is VALID [2022-04-08 12:39:15,653 INFO L290 TraceCheckUtils]: 124: Hoare triple {89104#false} ~cond := #in~cond; {89104#false} is VALID [2022-04-08 12:39:15,654 INFO L272 TraceCheckUtils]: 123: Hoare triple {89104#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89104#false} is VALID [2022-04-08 12:39:15,654 INFO L290 TraceCheckUtils]: 122: Hoare triple {89513#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {89104#false} is VALID [2022-04-08 12:39:15,654 INFO L290 TraceCheckUtils]: 121: Hoare triple {89517#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89513#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:39:15,654 INFO L290 TraceCheckUtils]: 120: Hoare triple {89517#(< ~counter~0 100)} assume !(~r~0 < 0); {89517#(< ~counter~0 100)} is VALID [2022-04-08 12:39:15,655 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89103#true} {89517#(< ~counter~0 100)} #98#return; {89517#(< ~counter~0 100)} is VALID [2022-04-08 12:39:15,655 INFO L290 TraceCheckUtils]: 118: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,655 INFO L290 TraceCheckUtils]: 117: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,655 INFO L290 TraceCheckUtils]: 116: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,655 INFO L272 TraceCheckUtils]: 115: Hoare triple {89517#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,655 INFO L290 TraceCheckUtils]: 114: Hoare triple {89517#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {89517#(< ~counter~0 100)} is VALID [2022-04-08 12:39:15,657 INFO L290 TraceCheckUtils]: 113: Hoare triple {89542#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89517#(< ~counter~0 100)} is VALID [2022-04-08 12:39:15,658 INFO L290 TraceCheckUtils]: 112: Hoare triple {89542#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89542#(< ~counter~0 99)} is VALID [2022-04-08 12:39:15,658 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89103#true} {89542#(< ~counter~0 99)} #98#return; {89542#(< ~counter~0 99)} is VALID [2022-04-08 12:39:15,658 INFO L290 TraceCheckUtils]: 110: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,658 INFO L290 TraceCheckUtils]: 109: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,658 INFO L290 TraceCheckUtils]: 108: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,658 INFO L272 TraceCheckUtils]: 107: Hoare triple {89542#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,659 INFO L290 TraceCheckUtils]: 106: Hoare triple {89542#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {89542#(< ~counter~0 99)} is VALID [2022-04-08 12:39:15,660 INFO L290 TraceCheckUtils]: 105: Hoare triple {89567#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89542#(< ~counter~0 99)} is VALID [2022-04-08 12:39:15,660 INFO L290 TraceCheckUtils]: 104: Hoare triple {89567#(< ~counter~0 98)} assume !(~r~0 > 0); {89567#(< ~counter~0 98)} is VALID [2022-04-08 12:39:15,660 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89103#true} {89567#(< ~counter~0 98)} #96#return; {89567#(< ~counter~0 98)} is VALID [2022-04-08 12:39:15,660 INFO L290 TraceCheckUtils]: 102: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,660 INFO L290 TraceCheckUtils]: 101: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,660 INFO L290 TraceCheckUtils]: 100: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,661 INFO L272 TraceCheckUtils]: 99: Hoare triple {89567#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,661 INFO L290 TraceCheckUtils]: 98: Hoare triple {89567#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {89567#(< ~counter~0 98)} is VALID [2022-04-08 12:39:15,662 INFO L290 TraceCheckUtils]: 97: Hoare triple {89592#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89567#(< ~counter~0 98)} is VALID [2022-04-08 12:39:15,662 INFO L290 TraceCheckUtils]: 96: Hoare triple {89592#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89592#(< ~counter~0 97)} is VALID [2022-04-08 12:39:15,662 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89103#true} {89592#(< ~counter~0 97)} #96#return; {89592#(< ~counter~0 97)} is VALID [2022-04-08 12:39:15,662 INFO L290 TraceCheckUtils]: 94: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,662 INFO L290 TraceCheckUtils]: 93: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,663 INFO L290 TraceCheckUtils]: 92: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,663 INFO L272 TraceCheckUtils]: 91: Hoare triple {89592#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,663 INFO L290 TraceCheckUtils]: 90: Hoare triple {89592#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {89592#(< ~counter~0 97)} is VALID [2022-04-08 12:39:15,664 INFO L290 TraceCheckUtils]: 89: Hoare triple {89617#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89592#(< ~counter~0 97)} is VALID [2022-04-08 12:39:15,664 INFO L290 TraceCheckUtils]: 88: Hoare triple {89617#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89617#(< ~counter~0 96)} is VALID [2022-04-08 12:39:15,664 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89103#true} {89617#(< ~counter~0 96)} #96#return; {89617#(< ~counter~0 96)} is VALID [2022-04-08 12:39:15,664 INFO L290 TraceCheckUtils]: 86: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,665 INFO L290 TraceCheckUtils]: 85: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,665 INFO L290 TraceCheckUtils]: 84: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,665 INFO L272 TraceCheckUtils]: 83: Hoare triple {89617#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,665 INFO L290 TraceCheckUtils]: 82: Hoare triple {89617#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {89617#(< ~counter~0 96)} is VALID [2022-04-08 12:39:15,666 INFO L290 TraceCheckUtils]: 81: Hoare triple {89642#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89617#(< ~counter~0 96)} is VALID [2022-04-08 12:39:15,666 INFO L290 TraceCheckUtils]: 80: Hoare triple {89642#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89642#(< ~counter~0 95)} is VALID [2022-04-08 12:39:15,666 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89103#true} {89642#(< ~counter~0 95)} #96#return; {89642#(< ~counter~0 95)} is VALID [2022-04-08 12:39:15,667 INFO L290 TraceCheckUtils]: 78: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,667 INFO L290 TraceCheckUtils]: 77: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,667 INFO L290 TraceCheckUtils]: 76: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,667 INFO L272 TraceCheckUtils]: 75: Hoare triple {89642#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,667 INFO L290 TraceCheckUtils]: 74: Hoare triple {89642#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {89642#(< ~counter~0 95)} is VALID [2022-04-08 12:39:15,668 INFO L290 TraceCheckUtils]: 73: Hoare triple {89667#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89642#(< ~counter~0 95)} is VALID [2022-04-08 12:39:15,668 INFO L290 TraceCheckUtils]: 72: Hoare triple {89667#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89667#(< ~counter~0 94)} is VALID [2022-04-08 12:39:15,669 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89103#true} {89667#(< ~counter~0 94)} #96#return; {89667#(< ~counter~0 94)} is VALID [2022-04-08 12:39:15,669 INFO L290 TraceCheckUtils]: 70: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,669 INFO L290 TraceCheckUtils]: 69: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,669 INFO L290 TraceCheckUtils]: 68: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,669 INFO L272 TraceCheckUtils]: 67: Hoare triple {89667#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,669 INFO L290 TraceCheckUtils]: 66: Hoare triple {89667#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {89667#(< ~counter~0 94)} is VALID [2022-04-08 12:39:15,670 INFO L290 TraceCheckUtils]: 65: Hoare triple {89692#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89667#(< ~counter~0 94)} is VALID [2022-04-08 12:39:15,670 INFO L290 TraceCheckUtils]: 64: Hoare triple {89692#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89692#(< ~counter~0 93)} is VALID [2022-04-08 12:39:15,671 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89103#true} {89692#(< ~counter~0 93)} #96#return; {89692#(< ~counter~0 93)} is VALID [2022-04-08 12:39:15,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,671 INFO L290 TraceCheckUtils]: 61: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,671 INFO L290 TraceCheckUtils]: 60: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,671 INFO L272 TraceCheckUtils]: 59: Hoare triple {89692#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,671 INFO L290 TraceCheckUtils]: 58: Hoare triple {89692#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {89692#(< ~counter~0 93)} is VALID [2022-04-08 12:39:15,672 INFO L290 TraceCheckUtils]: 57: Hoare triple {89717#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89692#(< ~counter~0 93)} is VALID [2022-04-08 12:39:15,673 INFO L290 TraceCheckUtils]: 56: Hoare triple {89717#(< ~counter~0 92)} assume !!(0 != ~r~0); {89717#(< ~counter~0 92)} is VALID [2022-04-08 12:39:15,673 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89103#true} {89717#(< ~counter~0 92)} #94#return; {89717#(< ~counter~0 92)} is VALID [2022-04-08 12:39:15,673 INFO L290 TraceCheckUtils]: 54: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,673 INFO L290 TraceCheckUtils]: 53: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,673 INFO L290 TraceCheckUtils]: 52: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,673 INFO L272 TraceCheckUtils]: 51: Hoare triple {89717#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,673 INFO L290 TraceCheckUtils]: 50: Hoare triple {89717#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {89717#(< ~counter~0 92)} is VALID [2022-04-08 12:39:15,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {89742#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89717#(< ~counter~0 92)} is VALID [2022-04-08 12:39:15,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {89742#(< ~counter~0 91)} assume !(~r~0 < 0); {89742#(< ~counter~0 91)} is VALID [2022-04-08 12:39:15,675 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89103#true} {89742#(< ~counter~0 91)} #98#return; {89742#(< ~counter~0 91)} is VALID [2022-04-08 12:39:15,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,675 INFO L272 TraceCheckUtils]: 43: Hoare triple {89742#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,676 INFO L290 TraceCheckUtils]: 42: Hoare triple {89742#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {89742#(< ~counter~0 91)} is VALID [2022-04-08 12:39:15,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {89767#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89742#(< ~counter~0 91)} is VALID [2022-04-08 12:39:15,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {89767#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89767#(< ~counter~0 90)} is VALID [2022-04-08 12:39:15,677 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89103#true} {89767#(< ~counter~0 90)} #98#return; {89767#(< ~counter~0 90)} is VALID [2022-04-08 12:39:15,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,677 INFO L272 TraceCheckUtils]: 35: Hoare triple {89767#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {89767#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {89767#(< ~counter~0 90)} is VALID [2022-04-08 12:39:15,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {89792#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89767#(< ~counter~0 90)} is VALID [2022-04-08 12:39:15,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {89792#(< ~counter~0 89)} assume !(~r~0 > 0); {89792#(< ~counter~0 89)} is VALID [2022-04-08 12:39:15,679 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89103#true} {89792#(< ~counter~0 89)} #96#return; {89792#(< ~counter~0 89)} is VALID [2022-04-08 12:39:15,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,680 INFO L272 TraceCheckUtils]: 27: Hoare triple {89792#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {89792#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {89792#(< ~counter~0 89)} is VALID [2022-04-08 12:39:15,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {89817#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89792#(< ~counter~0 89)} is VALID [2022-04-08 12:39:15,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {89817#(< ~counter~0 88)} assume !!(0 != ~r~0); {89817#(< ~counter~0 88)} is VALID [2022-04-08 12:39:15,682 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89103#true} {89817#(< ~counter~0 88)} #94#return; {89817#(< ~counter~0 88)} is VALID [2022-04-08 12:39:15,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,682 INFO L272 TraceCheckUtils]: 19: Hoare triple {89817#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {89817#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {89817#(< ~counter~0 88)} is VALID [2022-04-08 12:39:15,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {89842#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89817#(< ~counter~0 88)} is VALID [2022-04-08 12:39:15,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {89842#(< ~counter~0 87)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89842#(< ~counter~0 87)} is VALID [2022-04-08 12:39:15,684 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89103#true} {89842#(< ~counter~0 87)} #92#return; {89842#(< ~counter~0 87)} is VALID [2022-04-08 12:39:15,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,684 INFO L272 TraceCheckUtils]: 11: Hoare triple {89842#(< ~counter~0 87)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,684 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89103#true} {89842#(< ~counter~0 87)} #90#return; {89842#(< ~counter~0 87)} is VALID [2022-04-08 12:39:15,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 12:39:15,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 12:39:15,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 12:39:15,684 INFO L272 TraceCheckUtils]: 6: Hoare triple {89842#(< ~counter~0 87)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 12:39:15,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {89842#(< ~counter~0 87)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {89842#(< ~counter~0 87)} is VALID [2022-04-08 12:39:15,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {89842#(< ~counter~0 87)} call #t~ret9 := main(); {89842#(< ~counter~0 87)} is VALID [2022-04-08 12:39:15,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89842#(< ~counter~0 87)} {89103#true} #102#return; {89842#(< ~counter~0 87)} is VALID [2022-04-08 12:39:15,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {89842#(< ~counter~0 87)} assume true; {89842#(< ~counter~0 87)} is VALID [2022-04-08 12:39:15,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {89103#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {89842#(< ~counter~0 87)} is VALID [2022-04-08 12:39:15,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {89103#true} call ULTIMATE.init(); {89103#true} is VALID [2022-04-08 12:39:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 116 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-08 12:39:15,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:39:15,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767843856] [2022-04-08 12:39:15,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:39:15,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140135231] [2022-04-08 12:39:15,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140135231] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:39:15,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:39:15,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-08 12:39:15,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:39:15,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1508638841] [2022-04-08 12:39:15,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1508638841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:39:15,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:39:15,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 12:39:15,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081861694] [2022-04-08 12:39:15,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:39:15,687 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 127 [2022-04-08 12:39:15,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:39:15,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:15,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:15,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 12:39:15,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:15,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 12:39:15,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-08 12:39:15,813 INFO L87 Difference]: Start difference. First operand 650 states and 879 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:19,208 INFO L93 Difference]: Finished difference Result 705 states and 956 transitions. [2022-04-08 12:39:19,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 12:39:19,209 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 127 [2022-04-08 12:39:19,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:39:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-08 12:39:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-08 12:39:19,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 274 transitions. [2022-04-08 12:39:19,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:19,479 INFO L225 Difference]: With dead ends: 705 [2022-04-08 12:39:19,479 INFO L226 Difference]: Without dead ends: 694 [2022-04-08 12:39:19,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=723, Invalid=999, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 12:39:19,479 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 186 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:39:19,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 309 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 12:39:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-04-08 12:39:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 672. [2022-04-08 12:39:21,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:39:21,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 12:39:21,548 INFO L74 IsIncluded]: Start isIncluded. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 12:39:21,549 INFO L87 Difference]: Start difference. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 12:39:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:21,565 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-08 12:39:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-08 12:39:21,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:21,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:21,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 694 states. [2022-04-08 12:39:21,567 INFO L87 Difference]: Start difference. First operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 694 states. [2022-04-08 12:39:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:21,594 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-08 12:39:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-08 12:39:21,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:21,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:21,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:39:21,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:39:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 12:39:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 914 transitions. [2022-04-08 12:39:21,615 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 914 transitions. Word has length 127 [2022-04-08 12:39:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:39:21,615 INFO L478 AbstractCegarLoop]: Abstraction has 672 states and 914 transitions. [2022-04-08 12:39:21,615 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:21,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 672 states and 914 transitions. [2022-04-08 12:39:24,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 914 edges. 914 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 914 transitions. [2022-04-08 12:39:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-08 12:39:24,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:39:24,928 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:39:24,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-08 12:39:25,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:25,131 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:39:25,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:39:25,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 19 times [2022-04-08 12:39:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:25,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [784563503] [2022-04-08 12:39:25,132 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:39:25,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 20 times [2022-04-08 12:39:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:39:25,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963971784] [2022-04-08 12:39:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:39:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:39:25,151 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:39:25,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780134356] [2022-04-08 12:39:25,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:39:25,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:25,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:39:25,153 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:39:25,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-08 12:39:25,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:39:25,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:39:25,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 12:39:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:39:25,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:39:25,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {94058#true} call ULTIMATE.init(); {94058#true} is VALID [2022-04-08 12:39:25,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {94058#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {94066#(<= ~counter~0 0)} assume true; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94066#(<= ~counter~0 0)} {94058#true} #102#return; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {94066#(<= ~counter~0 0)} call #t~ret9 := main(); {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {94066#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,956 INFO L272 TraceCheckUtils]: 6: Hoare triple {94066#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {94066#(<= ~counter~0 0)} ~cond := #in~cond; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {94066#(<= ~counter~0 0)} assume !(0 == ~cond); {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {94066#(<= ~counter~0 0)} assume true; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,957 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94066#(<= ~counter~0 0)} {94066#(<= ~counter~0 0)} #90#return; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,957 INFO L272 TraceCheckUtils]: 11: Hoare triple {94066#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {94066#(<= ~counter~0 0)} ~cond := #in~cond; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {94066#(<= ~counter~0 0)} assume !(0 == ~cond); {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {94066#(<= ~counter~0 0)} assume true; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,958 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94066#(<= ~counter~0 0)} {94066#(<= ~counter~0 0)} #92#return; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {94066#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:25,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {94066#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94115#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:25,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {94115#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {94115#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:25,961 INFO L272 TraceCheckUtils]: 19: Hoare triple {94115#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94115#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:25,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {94115#(<= ~counter~0 1)} ~cond := #in~cond; {94115#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:25,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {94115#(<= ~counter~0 1)} assume !(0 == ~cond); {94115#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:25,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {94115#(<= ~counter~0 1)} assume true; {94115#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:25,962 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94115#(<= ~counter~0 1)} {94115#(<= ~counter~0 1)} #94#return; {94115#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:25,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {94115#(<= ~counter~0 1)} assume !!(0 != ~r~0); {94115#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:25,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {94115#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94140#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:25,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {94140#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {94140#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:25,964 INFO L272 TraceCheckUtils]: 27: Hoare triple {94140#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94140#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:25,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {94140#(<= ~counter~0 2)} ~cond := #in~cond; {94140#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:25,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {94140#(<= ~counter~0 2)} assume !(0 == ~cond); {94140#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:25,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {94140#(<= ~counter~0 2)} assume true; {94140#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:25,965 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94140#(<= ~counter~0 2)} {94140#(<= ~counter~0 2)} #96#return; {94140#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:25,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {94140#(<= ~counter~0 2)} assume !(~r~0 > 0); {94140#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:25,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {94140#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94165#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:25,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {94165#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {94165#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:25,967 INFO L272 TraceCheckUtils]: 35: Hoare triple {94165#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94165#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:25,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {94165#(<= ~counter~0 3)} ~cond := #in~cond; {94165#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:25,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {94165#(<= ~counter~0 3)} assume !(0 == ~cond); {94165#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:25,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {94165#(<= ~counter~0 3)} assume true; {94165#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:25,969 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94165#(<= ~counter~0 3)} {94165#(<= ~counter~0 3)} #98#return; {94165#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:25,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {94165#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94165#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:25,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {94165#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94190#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:25,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {94190#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {94190#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:25,970 INFO L272 TraceCheckUtils]: 43: Hoare triple {94190#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94190#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:25,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {94190#(<= ~counter~0 4)} ~cond := #in~cond; {94190#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:25,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {94190#(<= ~counter~0 4)} assume !(0 == ~cond); {94190#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:25,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {94190#(<= ~counter~0 4)} assume true; {94190#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:25,972 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94190#(<= ~counter~0 4)} {94190#(<= ~counter~0 4)} #98#return; {94190#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:25,972 INFO L290 TraceCheckUtils]: 48: Hoare triple {94190#(<= ~counter~0 4)} assume !(~r~0 < 0); {94190#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:25,973 INFO L290 TraceCheckUtils]: 49: Hoare triple {94190#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94215#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:25,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {94215#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {94215#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:25,974 INFO L272 TraceCheckUtils]: 51: Hoare triple {94215#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94215#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:25,974 INFO L290 TraceCheckUtils]: 52: Hoare triple {94215#(<= ~counter~0 5)} ~cond := #in~cond; {94215#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:25,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {94215#(<= ~counter~0 5)} assume !(0 == ~cond); {94215#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:25,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {94215#(<= ~counter~0 5)} assume true; {94215#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:25,975 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94215#(<= ~counter~0 5)} {94215#(<= ~counter~0 5)} #94#return; {94215#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:25,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {94215#(<= ~counter~0 5)} assume !!(0 != ~r~0); {94215#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:25,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {94215#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94240#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:25,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {94240#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {94240#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:25,977 INFO L272 TraceCheckUtils]: 59: Hoare triple {94240#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94240#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:25,977 INFO L290 TraceCheckUtils]: 60: Hoare triple {94240#(<= ~counter~0 6)} ~cond := #in~cond; {94240#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:25,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {94240#(<= ~counter~0 6)} assume !(0 == ~cond); {94240#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:25,977 INFO L290 TraceCheckUtils]: 62: Hoare triple {94240#(<= ~counter~0 6)} assume true; {94240#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:25,978 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94240#(<= ~counter~0 6)} {94240#(<= ~counter~0 6)} #96#return; {94240#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:25,978 INFO L290 TraceCheckUtils]: 64: Hoare triple {94240#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94240#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:25,979 INFO L290 TraceCheckUtils]: 65: Hoare triple {94240#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94265#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:25,979 INFO L290 TraceCheckUtils]: 66: Hoare triple {94265#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {94265#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:25,980 INFO L272 TraceCheckUtils]: 67: Hoare triple {94265#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94265#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:25,980 INFO L290 TraceCheckUtils]: 68: Hoare triple {94265#(<= ~counter~0 7)} ~cond := #in~cond; {94265#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:25,980 INFO L290 TraceCheckUtils]: 69: Hoare triple {94265#(<= ~counter~0 7)} assume !(0 == ~cond); {94265#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:25,981 INFO L290 TraceCheckUtils]: 70: Hoare triple {94265#(<= ~counter~0 7)} assume true; {94265#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:25,981 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94265#(<= ~counter~0 7)} {94265#(<= ~counter~0 7)} #96#return; {94265#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:25,981 INFO L290 TraceCheckUtils]: 72: Hoare triple {94265#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94265#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:25,982 INFO L290 TraceCheckUtils]: 73: Hoare triple {94265#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94290#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:25,982 INFO L290 TraceCheckUtils]: 74: Hoare triple {94290#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {94290#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:25,983 INFO L272 TraceCheckUtils]: 75: Hoare triple {94290#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94290#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:25,983 INFO L290 TraceCheckUtils]: 76: Hoare triple {94290#(<= ~counter~0 8)} ~cond := #in~cond; {94290#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:25,983 INFO L290 TraceCheckUtils]: 77: Hoare triple {94290#(<= ~counter~0 8)} assume !(0 == ~cond); {94290#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:25,984 INFO L290 TraceCheckUtils]: 78: Hoare triple {94290#(<= ~counter~0 8)} assume true; {94290#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:25,984 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94290#(<= ~counter~0 8)} {94290#(<= ~counter~0 8)} #96#return; {94290#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:25,984 INFO L290 TraceCheckUtils]: 80: Hoare triple {94290#(<= ~counter~0 8)} assume !(~r~0 > 0); {94290#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:25,985 INFO L290 TraceCheckUtils]: 81: Hoare triple {94290#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94315#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:25,986 INFO L290 TraceCheckUtils]: 82: Hoare triple {94315#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {94315#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:25,986 INFO L272 TraceCheckUtils]: 83: Hoare triple {94315#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94315#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:25,986 INFO L290 TraceCheckUtils]: 84: Hoare triple {94315#(<= ~counter~0 9)} ~cond := #in~cond; {94315#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:25,987 INFO L290 TraceCheckUtils]: 85: Hoare triple {94315#(<= ~counter~0 9)} assume !(0 == ~cond); {94315#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:25,987 INFO L290 TraceCheckUtils]: 86: Hoare triple {94315#(<= ~counter~0 9)} assume true; {94315#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:25,987 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94315#(<= ~counter~0 9)} {94315#(<= ~counter~0 9)} #98#return; {94315#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:25,988 INFO L290 TraceCheckUtils]: 88: Hoare triple {94315#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94315#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:25,989 INFO L290 TraceCheckUtils]: 89: Hoare triple {94315#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94340#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:25,989 INFO L290 TraceCheckUtils]: 90: Hoare triple {94340#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {94340#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:25,989 INFO L272 TraceCheckUtils]: 91: Hoare triple {94340#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94340#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:25,990 INFO L290 TraceCheckUtils]: 92: Hoare triple {94340#(<= ~counter~0 10)} ~cond := #in~cond; {94340#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:25,990 INFO L290 TraceCheckUtils]: 93: Hoare triple {94340#(<= ~counter~0 10)} assume !(0 == ~cond); {94340#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:25,990 INFO L290 TraceCheckUtils]: 94: Hoare triple {94340#(<= ~counter~0 10)} assume true; {94340#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:25,991 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94340#(<= ~counter~0 10)} {94340#(<= ~counter~0 10)} #98#return; {94340#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:25,991 INFO L290 TraceCheckUtils]: 96: Hoare triple {94340#(<= ~counter~0 10)} assume !(~r~0 < 0); {94340#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:25,992 INFO L290 TraceCheckUtils]: 97: Hoare triple {94340#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94365#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:25,992 INFO L290 TraceCheckUtils]: 98: Hoare triple {94365#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {94365#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:25,992 INFO L272 TraceCheckUtils]: 99: Hoare triple {94365#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94365#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:25,993 INFO L290 TraceCheckUtils]: 100: Hoare triple {94365#(<= ~counter~0 11)} ~cond := #in~cond; {94365#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:25,993 INFO L290 TraceCheckUtils]: 101: Hoare triple {94365#(<= ~counter~0 11)} assume !(0 == ~cond); {94365#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:25,993 INFO L290 TraceCheckUtils]: 102: Hoare triple {94365#(<= ~counter~0 11)} assume true; {94365#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:25,994 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94365#(<= ~counter~0 11)} {94365#(<= ~counter~0 11)} #94#return; {94365#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:25,994 INFO L290 TraceCheckUtils]: 104: Hoare triple {94365#(<= ~counter~0 11)} assume !!(0 != ~r~0); {94365#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:25,995 INFO L290 TraceCheckUtils]: 105: Hoare triple {94365#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94390#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:25,995 INFO L290 TraceCheckUtils]: 106: Hoare triple {94390#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {94390#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:25,996 INFO L272 TraceCheckUtils]: 107: Hoare triple {94390#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94390#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:25,996 INFO L290 TraceCheckUtils]: 108: Hoare triple {94390#(<= ~counter~0 12)} ~cond := #in~cond; {94390#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:25,996 INFO L290 TraceCheckUtils]: 109: Hoare triple {94390#(<= ~counter~0 12)} assume !(0 == ~cond); {94390#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:25,996 INFO L290 TraceCheckUtils]: 110: Hoare triple {94390#(<= ~counter~0 12)} assume true; {94390#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:25,997 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94390#(<= ~counter~0 12)} {94390#(<= ~counter~0 12)} #96#return; {94390#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:25,997 INFO L290 TraceCheckUtils]: 112: Hoare triple {94390#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94390#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:25,998 INFO L290 TraceCheckUtils]: 113: Hoare triple {94390#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94415#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:25,998 INFO L290 TraceCheckUtils]: 114: Hoare triple {94415#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {94415#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:25,999 INFO L272 TraceCheckUtils]: 115: Hoare triple {94415#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94415#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:25,999 INFO L290 TraceCheckUtils]: 116: Hoare triple {94415#(<= ~counter~0 13)} ~cond := #in~cond; {94415#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:25,999 INFO L290 TraceCheckUtils]: 117: Hoare triple {94415#(<= ~counter~0 13)} assume !(0 == ~cond); {94415#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:25,999 INFO L290 TraceCheckUtils]: 118: Hoare triple {94415#(<= ~counter~0 13)} assume true; {94415#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:26,000 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94415#(<= ~counter~0 13)} {94415#(<= ~counter~0 13)} #96#return; {94415#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:26,000 INFO L290 TraceCheckUtils]: 120: Hoare triple {94415#(<= ~counter~0 13)} assume !(~r~0 > 0); {94415#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:26,000 INFO L290 TraceCheckUtils]: 121: Hoare triple {94415#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94440#(<= |main_#t~post8| 13)} is VALID [2022-04-08 12:39:26,001 INFO L290 TraceCheckUtils]: 122: Hoare triple {94440#(<= |main_#t~post8| 13)} assume !(#t~post8 < 100);havoc #t~post8; {94059#false} is VALID [2022-04-08 12:39:26,001 INFO L290 TraceCheckUtils]: 123: Hoare triple {94059#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94059#false} is VALID [2022-04-08 12:39:26,001 INFO L290 TraceCheckUtils]: 124: Hoare triple {94059#false} assume !(#t~post6 < 100);havoc #t~post6; {94059#false} is VALID [2022-04-08 12:39:26,001 INFO L272 TraceCheckUtils]: 125: Hoare triple {94059#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94059#false} is VALID [2022-04-08 12:39:26,001 INFO L290 TraceCheckUtils]: 126: Hoare triple {94059#false} ~cond := #in~cond; {94059#false} is VALID [2022-04-08 12:39:26,001 INFO L290 TraceCheckUtils]: 127: Hoare triple {94059#false} assume 0 == ~cond; {94059#false} is VALID [2022-04-08 12:39:26,001 INFO L290 TraceCheckUtils]: 128: Hoare triple {94059#false} assume !false; {94059#false} is VALID [2022-04-08 12:39:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 416 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:39:26,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:39:26,800 INFO L290 TraceCheckUtils]: 128: Hoare triple {94059#false} assume !false; {94059#false} is VALID [2022-04-08 12:39:26,800 INFO L290 TraceCheckUtils]: 127: Hoare triple {94059#false} assume 0 == ~cond; {94059#false} is VALID [2022-04-08 12:39:26,800 INFO L290 TraceCheckUtils]: 126: Hoare triple {94059#false} ~cond := #in~cond; {94059#false} is VALID [2022-04-08 12:39:26,800 INFO L272 TraceCheckUtils]: 125: Hoare triple {94059#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94059#false} is VALID [2022-04-08 12:39:26,800 INFO L290 TraceCheckUtils]: 124: Hoare triple {94059#false} assume !(#t~post6 < 100);havoc #t~post6; {94059#false} is VALID [2022-04-08 12:39:26,801 INFO L290 TraceCheckUtils]: 123: Hoare triple {94059#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94059#false} is VALID [2022-04-08 12:39:26,801 INFO L290 TraceCheckUtils]: 122: Hoare triple {94480#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {94059#false} is VALID [2022-04-08 12:39:26,801 INFO L290 TraceCheckUtils]: 121: Hoare triple {94484#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94480#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:39:26,801 INFO L290 TraceCheckUtils]: 120: Hoare triple {94484#(< ~counter~0 100)} assume !(~r~0 > 0); {94484#(< ~counter~0 100)} is VALID [2022-04-08 12:39:26,802 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94058#true} {94484#(< ~counter~0 100)} #96#return; {94484#(< ~counter~0 100)} is VALID [2022-04-08 12:39:26,802 INFO L290 TraceCheckUtils]: 118: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,802 INFO L290 TraceCheckUtils]: 117: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,802 INFO L290 TraceCheckUtils]: 116: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,802 INFO L272 TraceCheckUtils]: 115: Hoare triple {94484#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,802 INFO L290 TraceCheckUtils]: 114: Hoare triple {94484#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {94484#(< ~counter~0 100)} is VALID [2022-04-08 12:39:26,804 INFO L290 TraceCheckUtils]: 113: Hoare triple {94509#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94484#(< ~counter~0 100)} is VALID [2022-04-08 12:39:26,805 INFO L290 TraceCheckUtils]: 112: Hoare triple {94509#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94509#(< ~counter~0 99)} is VALID [2022-04-08 12:39:26,805 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94058#true} {94509#(< ~counter~0 99)} #96#return; {94509#(< ~counter~0 99)} is VALID [2022-04-08 12:39:26,805 INFO L290 TraceCheckUtils]: 110: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,805 INFO L290 TraceCheckUtils]: 109: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,805 INFO L290 TraceCheckUtils]: 108: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,805 INFO L272 TraceCheckUtils]: 107: Hoare triple {94509#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,805 INFO L290 TraceCheckUtils]: 106: Hoare triple {94509#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {94509#(< ~counter~0 99)} is VALID [2022-04-08 12:39:26,806 INFO L290 TraceCheckUtils]: 105: Hoare triple {94534#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94509#(< ~counter~0 99)} is VALID [2022-04-08 12:39:26,807 INFO L290 TraceCheckUtils]: 104: Hoare triple {94534#(< ~counter~0 98)} assume !!(0 != ~r~0); {94534#(< ~counter~0 98)} is VALID [2022-04-08 12:39:26,807 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94058#true} {94534#(< ~counter~0 98)} #94#return; {94534#(< ~counter~0 98)} is VALID [2022-04-08 12:39:26,807 INFO L290 TraceCheckUtils]: 102: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,807 INFO L290 TraceCheckUtils]: 101: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,807 INFO L290 TraceCheckUtils]: 100: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,807 INFO L272 TraceCheckUtils]: 99: Hoare triple {94534#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,808 INFO L290 TraceCheckUtils]: 98: Hoare triple {94534#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {94534#(< ~counter~0 98)} is VALID [2022-04-08 12:39:26,808 INFO L290 TraceCheckUtils]: 97: Hoare triple {94559#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94534#(< ~counter~0 98)} is VALID [2022-04-08 12:39:26,809 INFO L290 TraceCheckUtils]: 96: Hoare triple {94559#(< ~counter~0 97)} assume !(~r~0 < 0); {94559#(< ~counter~0 97)} is VALID [2022-04-08 12:39:26,809 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94058#true} {94559#(< ~counter~0 97)} #98#return; {94559#(< ~counter~0 97)} is VALID [2022-04-08 12:39:26,809 INFO L290 TraceCheckUtils]: 94: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,809 INFO L290 TraceCheckUtils]: 93: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,809 INFO L290 TraceCheckUtils]: 92: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,809 INFO L272 TraceCheckUtils]: 91: Hoare triple {94559#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,810 INFO L290 TraceCheckUtils]: 90: Hoare triple {94559#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {94559#(< ~counter~0 97)} is VALID [2022-04-08 12:39:26,810 INFO L290 TraceCheckUtils]: 89: Hoare triple {94584#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94559#(< ~counter~0 97)} is VALID [2022-04-08 12:39:26,811 INFO L290 TraceCheckUtils]: 88: Hoare triple {94584#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94584#(< ~counter~0 96)} is VALID [2022-04-08 12:39:26,811 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94058#true} {94584#(< ~counter~0 96)} #98#return; {94584#(< ~counter~0 96)} is VALID [2022-04-08 12:39:26,811 INFO L290 TraceCheckUtils]: 86: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,811 INFO L290 TraceCheckUtils]: 85: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,811 INFO L290 TraceCheckUtils]: 84: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,811 INFO L272 TraceCheckUtils]: 83: Hoare triple {94584#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,812 INFO L290 TraceCheckUtils]: 82: Hoare triple {94584#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {94584#(< ~counter~0 96)} is VALID [2022-04-08 12:39:26,813 INFO L290 TraceCheckUtils]: 81: Hoare triple {94609#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94584#(< ~counter~0 96)} is VALID [2022-04-08 12:39:26,813 INFO L290 TraceCheckUtils]: 80: Hoare triple {94609#(< ~counter~0 95)} assume !(~r~0 > 0); {94609#(< ~counter~0 95)} is VALID [2022-04-08 12:39:26,813 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94058#true} {94609#(< ~counter~0 95)} #96#return; {94609#(< ~counter~0 95)} is VALID [2022-04-08 12:39:26,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,813 INFO L290 TraceCheckUtils]: 77: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,814 INFO L290 TraceCheckUtils]: 76: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,814 INFO L272 TraceCheckUtils]: 75: Hoare triple {94609#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,814 INFO L290 TraceCheckUtils]: 74: Hoare triple {94609#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {94609#(< ~counter~0 95)} is VALID [2022-04-08 12:39:26,815 INFO L290 TraceCheckUtils]: 73: Hoare triple {94634#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94609#(< ~counter~0 95)} is VALID [2022-04-08 12:39:26,815 INFO L290 TraceCheckUtils]: 72: Hoare triple {94634#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94634#(< ~counter~0 94)} is VALID [2022-04-08 12:39:26,815 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94058#true} {94634#(< ~counter~0 94)} #96#return; {94634#(< ~counter~0 94)} is VALID [2022-04-08 12:39:26,816 INFO L290 TraceCheckUtils]: 70: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,816 INFO L290 TraceCheckUtils]: 69: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,816 INFO L290 TraceCheckUtils]: 68: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,816 INFO L272 TraceCheckUtils]: 67: Hoare triple {94634#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,816 INFO L290 TraceCheckUtils]: 66: Hoare triple {94634#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {94634#(< ~counter~0 94)} is VALID [2022-04-08 12:39:26,817 INFO L290 TraceCheckUtils]: 65: Hoare triple {94659#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94634#(< ~counter~0 94)} is VALID [2022-04-08 12:39:26,817 INFO L290 TraceCheckUtils]: 64: Hoare triple {94659#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94659#(< ~counter~0 93)} is VALID [2022-04-08 12:39:26,818 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94058#true} {94659#(< ~counter~0 93)} #96#return; {94659#(< ~counter~0 93)} is VALID [2022-04-08 12:39:26,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,818 INFO L290 TraceCheckUtils]: 61: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,818 INFO L290 TraceCheckUtils]: 60: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,818 INFO L272 TraceCheckUtils]: 59: Hoare triple {94659#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,818 INFO L290 TraceCheckUtils]: 58: Hoare triple {94659#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {94659#(< ~counter~0 93)} is VALID [2022-04-08 12:39:26,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {94684#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94659#(< ~counter~0 93)} is VALID [2022-04-08 12:39:26,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {94684#(< ~counter~0 92)} assume !!(0 != ~r~0); {94684#(< ~counter~0 92)} is VALID [2022-04-08 12:39:26,820 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94058#true} {94684#(< ~counter~0 92)} #94#return; {94684#(< ~counter~0 92)} is VALID [2022-04-08 12:39:26,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,820 INFO L272 TraceCheckUtils]: 51: Hoare triple {94684#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {94684#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {94684#(< ~counter~0 92)} is VALID [2022-04-08 12:39:26,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {94709#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94684#(< ~counter~0 92)} is VALID [2022-04-08 12:39:26,822 INFO L290 TraceCheckUtils]: 48: Hoare triple {94709#(< ~counter~0 91)} assume !(~r~0 < 0); {94709#(< ~counter~0 91)} is VALID [2022-04-08 12:39:26,822 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94058#true} {94709#(< ~counter~0 91)} #98#return; {94709#(< ~counter~0 91)} is VALID [2022-04-08 12:39:26,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,822 INFO L290 TraceCheckUtils]: 44: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,822 INFO L272 TraceCheckUtils]: 43: Hoare triple {94709#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {94709#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {94709#(< ~counter~0 91)} is VALID [2022-04-08 12:39:26,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {94734#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94709#(< ~counter~0 91)} is VALID [2022-04-08 12:39:26,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {94734#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94734#(< ~counter~0 90)} is VALID [2022-04-08 12:39:26,824 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94058#true} {94734#(< ~counter~0 90)} #98#return; {94734#(< ~counter~0 90)} is VALID [2022-04-08 12:39:26,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,825 INFO L272 TraceCheckUtils]: 35: Hoare triple {94734#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {94734#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {94734#(< ~counter~0 90)} is VALID [2022-04-08 12:39:26,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {94759#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94734#(< ~counter~0 90)} is VALID [2022-04-08 12:39:26,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {94759#(< ~counter~0 89)} assume !(~r~0 > 0); {94759#(< ~counter~0 89)} is VALID [2022-04-08 12:39:26,827 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94058#true} {94759#(< ~counter~0 89)} #96#return; {94759#(< ~counter~0 89)} is VALID [2022-04-08 12:39:26,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,827 INFO L272 TraceCheckUtils]: 27: Hoare triple {94759#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {94759#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {94759#(< ~counter~0 89)} is VALID [2022-04-08 12:39:26,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {94784#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94759#(< ~counter~0 89)} is VALID [2022-04-08 12:39:26,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {94784#(< ~counter~0 88)} assume !!(0 != ~r~0); {94784#(< ~counter~0 88)} is VALID [2022-04-08 12:39:26,829 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94058#true} {94784#(< ~counter~0 88)} #94#return; {94784#(< ~counter~0 88)} is VALID [2022-04-08 12:39:26,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,829 INFO L272 TraceCheckUtils]: 19: Hoare triple {94784#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {94784#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {94784#(< ~counter~0 88)} is VALID [2022-04-08 12:39:26,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {94809#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94784#(< ~counter~0 88)} is VALID [2022-04-08 12:39:26,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {94809#(< ~counter~0 87)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {94809#(< ~counter~0 87)} is VALID [2022-04-08 12:39:26,831 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94058#true} {94809#(< ~counter~0 87)} #92#return; {94809#(< ~counter~0 87)} is VALID [2022-04-08 12:39:26,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,831 INFO L272 TraceCheckUtils]: 11: Hoare triple {94809#(< ~counter~0 87)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,832 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94058#true} {94809#(< ~counter~0 87)} #90#return; {94809#(< ~counter~0 87)} is VALID [2022-04-08 12:39:26,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 12:39:26,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 12:39:26,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 12:39:26,832 INFO L272 TraceCheckUtils]: 6: Hoare triple {94809#(< ~counter~0 87)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 12:39:26,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {94809#(< ~counter~0 87)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {94809#(< ~counter~0 87)} is VALID [2022-04-08 12:39:26,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {94809#(< ~counter~0 87)} call #t~ret9 := main(); {94809#(< ~counter~0 87)} is VALID [2022-04-08 12:39:26,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94809#(< ~counter~0 87)} {94058#true} #102#return; {94809#(< ~counter~0 87)} is VALID [2022-04-08 12:39:26,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {94809#(< ~counter~0 87)} assume true; {94809#(< ~counter~0 87)} is VALID [2022-04-08 12:39:26,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {94058#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {94809#(< ~counter~0 87)} is VALID [2022-04-08 12:39:26,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {94058#true} call ULTIMATE.init(); {94058#true} is VALID [2022-04-08 12:39:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-08 12:39:26,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:39:26,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963971784] [2022-04-08 12:39:26,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:39:26,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780134356] [2022-04-08 12:39:26,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780134356] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:39:26,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:39:26,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-08 12:39:26,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:39:26,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [784563503] [2022-04-08 12:39:26,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [784563503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:39:26,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:39:26,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 12:39:26,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608223986] [2022-04-08 12:39:26,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:39:26,835 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 129 [2022-04-08 12:39:26,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:39:26,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:26,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:26,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 12:39:26,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:26,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 12:39:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-08 12:39:26,953 INFO L87 Difference]: Start difference. First operand 672 states and 914 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:30,377 INFO L93 Difference]: Finished difference Result 893 states and 1247 transitions. [2022-04-08 12:39:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 12:39:30,377 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 129 [2022-04-08 12:39:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:39:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-08 12:39:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-08 12:39:30,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 296 transitions. [2022-04-08 12:39:30,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:30,695 INFO L225 Difference]: With dead ends: 893 [2022-04-08 12:39:30,695 INFO L226 Difference]: Without dead ends: 700 [2022-04-08 12:39:30,695 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-08 12:39:30,696 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 216 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:39:30,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 292 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 12:39:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-04-08 12:39:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 690. [2022-04-08 12:39:32,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:39:32,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 12:39:32,858 INFO L74 IsIncluded]: Start isIncluded. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 12:39:32,858 INFO L87 Difference]: Start difference. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 12:39:32,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:32,875 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-08 12:39:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-08 12:39:32,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:32,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:32,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 700 states. [2022-04-08 12:39:32,877 INFO L87 Difference]: Start difference. First operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 700 states. [2022-04-08 12:39:32,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:32,894 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-08 12:39:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-08 12:39:32,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:32,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:32,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:39:32,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:39:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 12:39:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 936 transitions. [2022-04-08 12:39:32,923 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 936 transitions. Word has length 129 [2022-04-08 12:39:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:39:32,923 INFO L478 AbstractCegarLoop]: Abstraction has 690 states and 936 transitions. [2022-04-08 12:39:32,923 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:32,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 690 states and 936 transitions. [2022-04-08 12:39:37,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 936 edges. 936 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 936 transitions. [2022-04-08 12:39:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 12:39:37,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:39:37,753 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:39:37,769 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-08 12:39:37,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-08 12:39:37,954 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:39:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:39:37,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 17 times [2022-04-08 12:39:37,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:37,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2009844805] [2022-04-08 12:39:37,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:39:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 18 times [2022-04-08 12:39:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:39:37,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205653330] [2022-04-08 12:39:37,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:39:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:39:37,973 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:39:37,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648587417] [2022-04-08 12:39:37,973 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:39:37,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:37,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:39:37,974 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:39:37,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-08 12:39:38,153 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 12:39:38,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:39:38,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 12:39:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:39:38,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:39:38,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {99451#true} call ULTIMATE.init(); {99451#true} is VALID [2022-04-08 12:39:38,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {99451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {99459#(<= ~counter~0 0)} assume true; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99459#(<= ~counter~0 0)} {99451#true} #102#return; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {99459#(<= ~counter~0 0)} call #t~ret9 := main(); {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {99459#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,829 INFO L272 TraceCheckUtils]: 6: Hoare triple {99459#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {99459#(<= ~counter~0 0)} ~cond := #in~cond; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {99459#(<= ~counter~0 0)} assume !(0 == ~cond); {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {99459#(<= ~counter~0 0)} assume true; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,830 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99459#(<= ~counter~0 0)} {99459#(<= ~counter~0 0)} #90#return; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,831 INFO L272 TraceCheckUtils]: 11: Hoare triple {99459#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {99459#(<= ~counter~0 0)} ~cond := #in~cond; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {99459#(<= ~counter~0 0)} assume !(0 == ~cond); {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {99459#(<= ~counter~0 0)} assume true; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,832 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99459#(<= ~counter~0 0)} {99459#(<= ~counter~0 0)} #92#return; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {99459#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {99459#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99508#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {99508#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {99508#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,835 INFO L272 TraceCheckUtils]: 19: Hoare triple {99508#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99508#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {99508#(<= ~counter~0 1)} ~cond := #in~cond; {99508#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {99508#(<= ~counter~0 1)} assume !(0 == ~cond); {99508#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {99508#(<= ~counter~0 1)} assume true; {99508#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,836 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99508#(<= ~counter~0 1)} {99508#(<= ~counter~0 1)} #94#return; {99508#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {99508#(<= ~counter~0 1)} assume !!(0 != ~r~0); {99508#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {99508#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99533#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {99533#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {99533#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,838 INFO L272 TraceCheckUtils]: 27: Hoare triple {99533#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99533#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {99533#(<= ~counter~0 2)} ~cond := #in~cond; {99533#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {99533#(<= ~counter~0 2)} assume !(0 == ~cond); {99533#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {99533#(<= ~counter~0 2)} assume true; {99533#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,839 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99533#(<= ~counter~0 2)} {99533#(<= ~counter~0 2)} #96#return; {99533#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {99533#(<= ~counter~0 2)} assume !(~r~0 > 0); {99533#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {99533#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99558#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:38,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {99558#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {99558#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:38,841 INFO L272 TraceCheckUtils]: 35: Hoare triple {99558#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99558#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:38,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {99558#(<= ~counter~0 3)} ~cond := #in~cond; {99558#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:38,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {99558#(<= ~counter~0 3)} assume !(0 == ~cond); {99558#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:38,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {99558#(<= ~counter~0 3)} assume true; {99558#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:38,842 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99558#(<= ~counter~0 3)} {99558#(<= ~counter~0 3)} #98#return; {99558#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:38,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {99558#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99558#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:38,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {99558#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99583#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {99583#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {99583#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,844 INFO L272 TraceCheckUtils]: 43: Hoare triple {99583#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99583#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {99583#(<= ~counter~0 4)} ~cond := #in~cond; {99583#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,845 INFO L290 TraceCheckUtils]: 45: Hoare triple {99583#(<= ~counter~0 4)} assume !(0 == ~cond); {99583#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,845 INFO L290 TraceCheckUtils]: 46: Hoare triple {99583#(<= ~counter~0 4)} assume true; {99583#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,846 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99583#(<= ~counter~0 4)} {99583#(<= ~counter~0 4)} #98#return; {99583#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {99583#(<= ~counter~0 4)} assume !(~r~0 < 0); {99583#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,847 INFO L290 TraceCheckUtils]: 49: Hoare triple {99583#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99608#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,847 INFO L290 TraceCheckUtils]: 50: Hoare triple {99608#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {99608#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,848 INFO L272 TraceCheckUtils]: 51: Hoare triple {99608#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99608#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {99608#(<= ~counter~0 5)} ~cond := #in~cond; {99608#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {99608#(<= ~counter~0 5)} assume !(0 == ~cond); {99608#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {99608#(<= ~counter~0 5)} assume true; {99608#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,849 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99608#(<= ~counter~0 5)} {99608#(<= ~counter~0 5)} #94#return; {99608#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,849 INFO L290 TraceCheckUtils]: 56: Hoare triple {99608#(<= ~counter~0 5)} assume !!(0 != ~r~0); {99608#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {99608#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99633#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,850 INFO L290 TraceCheckUtils]: 58: Hoare triple {99633#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {99633#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,851 INFO L272 TraceCheckUtils]: 59: Hoare triple {99633#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99633#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,851 INFO L290 TraceCheckUtils]: 60: Hoare triple {99633#(<= ~counter~0 6)} ~cond := #in~cond; {99633#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,851 INFO L290 TraceCheckUtils]: 61: Hoare triple {99633#(<= ~counter~0 6)} assume !(0 == ~cond); {99633#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,851 INFO L290 TraceCheckUtils]: 62: Hoare triple {99633#(<= ~counter~0 6)} assume true; {99633#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,852 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99633#(<= ~counter~0 6)} {99633#(<= ~counter~0 6)} #96#return; {99633#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,852 INFO L290 TraceCheckUtils]: 64: Hoare triple {99633#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99633#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,853 INFO L290 TraceCheckUtils]: 65: Hoare triple {99633#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99658#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,853 INFO L290 TraceCheckUtils]: 66: Hoare triple {99658#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {99658#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,854 INFO L272 TraceCheckUtils]: 67: Hoare triple {99658#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99658#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,854 INFO L290 TraceCheckUtils]: 68: Hoare triple {99658#(<= ~counter~0 7)} ~cond := #in~cond; {99658#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,854 INFO L290 TraceCheckUtils]: 69: Hoare triple {99658#(<= ~counter~0 7)} assume !(0 == ~cond); {99658#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,855 INFO L290 TraceCheckUtils]: 70: Hoare triple {99658#(<= ~counter~0 7)} assume true; {99658#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,855 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99658#(<= ~counter~0 7)} {99658#(<= ~counter~0 7)} #96#return; {99658#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,855 INFO L290 TraceCheckUtils]: 72: Hoare triple {99658#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99658#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,856 INFO L290 TraceCheckUtils]: 73: Hoare triple {99658#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99683#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,856 INFO L290 TraceCheckUtils]: 74: Hoare triple {99683#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {99683#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,857 INFO L272 TraceCheckUtils]: 75: Hoare triple {99683#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99683#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,857 INFO L290 TraceCheckUtils]: 76: Hoare triple {99683#(<= ~counter~0 8)} ~cond := #in~cond; {99683#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,857 INFO L290 TraceCheckUtils]: 77: Hoare triple {99683#(<= ~counter~0 8)} assume !(0 == ~cond); {99683#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,858 INFO L290 TraceCheckUtils]: 78: Hoare triple {99683#(<= ~counter~0 8)} assume true; {99683#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,858 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99683#(<= ~counter~0 8)} {99683#(<= ~counter~0 8)} #96#return; {99683#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,858 INFO L290 TraceCheckUtils]: 80: Hoare triple {99683#(<= ~counter~0 8)} assume !(~r~0 > 0); {99683#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,859 INFO L290 TraceCheckUtils]: 81: Hoare triple {99683#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99708#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,860 INFO L290 TraceCheckUtils]: 82: Hoare triple {99708#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {99708#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,860 INFO L272 TraceCheckUtils]: 83: Hoare triple {99708#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99708#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,860 INFO L290 TraceCheckUtils]: 84: Hoare triple {99708#(<= ~counter~0 9)} ~cond := #in~cond; {99708#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,861 INFO L290 TraceCheckUtils]: 85: Hoare triple {99708#(<= ~counter~0 9)} assume !(0 == ~cond); {99708#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,861 INFO L290 TraceCheckUtils]: 86: Hoare triple {99708#(<= ~counter~0 9)} assume true; {99708#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,861 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99708#(<= ~counter~0 9)} {99708#(<= ~counter~0 9)} #98#return; {99708#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,862 INFO L290 TraceCheckUtils]: 88: Hoare triple {99708#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99708#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,862 INFO L290 TraceCheckUtils]: 89: Hoare triple {99708#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99733#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,863 INFO L290 TraceCheckUtils]: 90: Hoare triple {99733#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {99733#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,863 INFO L272 TraceCheckUtils]: 91: Hoare triple {99733#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99733#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,864 INFO L290 TraceCheckUtils]: 92: Hoare triple {99733#(<= ~counter~0 10)} ~cond := #in~cond; {99733#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,864 INFO L290 TraceCheckUtils]: 93: Hoare triple {99733#(<= ~counter~0 10)} assume !(0 == ~cond); {99733#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,864 INFO L290 TraceCheckUtils]: 94: Hoare triple {99733#(<= ~counter~0 10)} assume true; {99733#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,865 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99733#(<= ~counter~0 10)} {99733#(<= ~counter~0 10)} #98#return; {99733#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,865 INFO L290 TraceCheckUtils]: 96: Hoare triple {99733#(<= ~counter~0 10)} assume !(~r~0 < 0); {99733#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,866 INFO L290 TraceCheckUtils]: 97: Hoare triple {99733#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99758#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,866 INFO L290 TraceCheckUtils]: 98: Hoare triple {99758#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {99758#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,866 INFO L272 TraceCheckUtils]: 99: Hoare triple {99758#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99758#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,867 INFO L290 TraceCheckUtils]: 100: Hoare triple {99758#(<= ~counter~0 11)} ~cond := #in~cond; {99758#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,867 INFO L290 TraceCheckUtils]: 101: Hoare triple {99758#(<= ~counter~0 11)} assume !(0 == ~cond); {99758#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,867 INFO L290 TraceCheckUtils]: 102: Hoare triple {99758#(<= ~counter~0 11)} assume true; {99758#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,868 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99758#(<= ~counter~0 11)} {99758#(<= ~counter~0 11)} #94#return; {99758#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,868 INFO L290 TraceCheckUtils]: 104: Hoare triple {99758#(<= ~counter~0 11)} assume !!(0 != ~r~0); {99758#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,869 INFO L290 TraceCheckUtils]: 105: Hoare triple {99758#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99783#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,869 INFO L290 TraceCheckUtils]: 106: Hoare triple {99783#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {99783#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,870 INFO L272 TraceCheckUtils]: 107: Hoare triple {99783#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99783#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,870 INFO L290 TraceCheckUtils]: 108: Hoare triple {99783#(<= ~counter~0 12)} ~cond := #in~cond; {99783#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,870 INFO L290 TraceCheckUtils]: 109: Hoare triple {99783#(<= ~counter~0 12)} assume !(0 == ~cond); {99783#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,870 INFO L290 TraceCheckUtils]: 110: Hoare triple {99783#(<= ~counter~0 12)} assume true; {99783#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,871 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99783#(<= ~counter~0 12)} {99783#(<= ~counter~0 12)} #96#return; {99783#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,871 INFO L290 TraceCheckUtils]: 112: Hoare triple {99783#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99783#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,872 INFO L290 TraceCheckUtils]: 113: Hoare triple {99783#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99808#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,872 INFO L290 TraceCheckUtils]: 114: Hoare triple {99808#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {99808#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,873 INFO L272 TraceCheckUtils]: 115: Hoare triple {99808#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99808#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,873 INFO L290 TraceCheckUtils]: 116: Hoare triple {99808#(<= ~counter~0 13)} ~cond := #in~cond; {99808#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,873 INFO L290 TraceCheckUtils]: 117: Hoare triple {99808#(<= ~counter~0 13)} assume !(0 == ~cond); {99808#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,874 INFO L290 TraceCheckUtils]: 118: Hoare triple {99808#(<= ~counter~0 13)} assume true; {99808#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,874 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99808#(<= ~counter~0 13)} {99808#(<= ~counter~0 13)} #96#return; {99808#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,874 INFO L290 TraceCheckUtils]: 120: Hoare triple {99808#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99808#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,875 INFO L290 TraceCheckUtils]: 121: Hoare triple {99808#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99833#(<= |main_#t~post7| 13)} is VALID [2022-04-08 12:39:38,875 INFO L290 TraceCheckUtils]: 122: Hoare triple {99833#(<= |main_#t~post7| 13)} assume !(#t~post7 < 100);havoc #t~post7; {99452#false} is VALID [2022-04-08 12:39:38,875 INFO L290 TraceCheckUtils]: 123: Hoare triple {99452#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99452#false} is VALID [2022-04-08 12:39:38,875 INFO L290 TraceCheckUtils]: 124: Hoare triple {99452#false} assume !(#t~post8 < 100);havoc #t~post8; {99452#false} is VALID [2022-04-08 12:39:38,875 INFO L290 TraceCheckUtils]: 125: Hoare triple {99452#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99452#false} is VALID [2022-04-08 12:39:38,875 INFO L290 TraceCheckUtils]: 126: Hoare triple {99452#false} assume !(#t~post6 < 100);havoc #t~post6; {99452#false} is VALID [2022-04-08 12:39:38,875 INFO L272 TraceCheckUtils]: 127: Hoare triple {99452#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99452#false} is VALID [2022-04-08 12:39:38,875 INFO L290 TraceCheckUtils]: 128: Hoare triple {99452#false} ~cond := #in~cond; {99452#false} is VALID [2022-04-08 12:39:38,875 INFO L290 TraceCheckUtils]: 129: Hoare triple {99452#false} assume 0 == ~cond; {99452#false} is VALID [2022-04-08 12:39:38,875 INFO L290 TraceCheckUtils]: 130: Hoare triple {99452#false} assume !false; {99452#false} is VALID [2022-04-08 12:39:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 420 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:39:38,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:39:39,643 INFO L290 TraceCheckUtils]: 130: Hoare triple {99452#false} assume !false; {99452#false} is VALID [2022-04-08 12:39:39,643 INFO L290 TraceCheckUtils]: 129: Hoare triple {99452#false} assume 0 == ~cond; {99452#false} is VALID [2022-04-08 12:39:39,643 INFO L290 TraceCheckUtils]: 128: Hoare triple {99452#false} ~cond := #in~cond; {99452#false} is VALID [2022-04-08 12:39:39,643 INFO L272 TraceCheckUtils]: 127: Hoare triple {99452#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99452#false} is VALID [2022-04-08 12:39:39,643 INFO L290 TraceCheckUtils]: 126: Hoare triple {99452#false} assume !(#t~post6 < 100);havoc #t~post6; {99452#false} is VALID [2022-04-08 12:39:39,643 INFO L290 TraceCheckUtils]: 125: Hoare triple {99452#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99452#false} is VALID [2022-04-08 12:39:39,644 INFO L290 TraceCheckUtils]: 124: Hoare triple {99452#false} assume !(#t~post8 < 100);havoc #t~post8; {99452#false} is VALID [2022-04-08 12:39:39,644 INFO L290 TraceCheckUtils]: 123: Hoare triple {99452#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99452#false} is VALID [2022-04-08 12:39:39,647 INFO L290 TraceCheckUtils]: 122: Hoare triple {99885#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {99452#false} is VALID [2022-04-08 12:39:39,647 INFO L290 TraceCheckUtils]: 121: Hoare triple {99889#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99885#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:39:39,648 INFO L290 TraceCheckUtils]: 120: Hoare triple {99889#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99889#(< ~counter~0 100)} is VALID [2022-04-08 12:39:39,648 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99451#true} {99889#(< ~counter~0 100)} #96#return; {99889#(< ~counter~0 100)} is VALID [2022-04-08 12:39:39,648 INFO L290 TraceCheckUtils]: 118: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,648 INFO L290 TraceCheckUtils]: 117: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,648 INFO L290 TraceCheckUtils]: 116: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,649 INFO L272 TraceCheckUtils]: 115: Hoare triple {99889#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,649 INFO L290 TraceCheckUtils]: 114: Hoare triple {99889#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {99889#(< ~counter~0 100)} is VALID [2022-04-08 12:39:39,651 INFO L290 TraceCheckUtils]: 113: Hoare triple {99914#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99889#(< ~counter~0 100)} is VALID [2022-04-08 12:39:39,651 INFO L290 TraceCheckUtils]: 112: Hoare triple {99914#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99914#(< ~counter~0 99)} is VALID [2022-04-08 12:39:39,652 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99451#true} {99914#(< ~counter~0 99)} #96#return; {99914#(< ~counter~0 99)} is VALID [2022-04-08 12:39:39,652 INFO L290 TraceCheckUtils]: 110: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,652 INFO L290 TraceCheckUtils]: 109: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,652 INFO L290 TraceCheckUtils]: 108: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,652 INFO L272 TraceCheckUtils]: 107: Hoare triple {99914#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,652 INFO L290 TraceCheckUtils]: 106: Hoare triple {99914#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {99914#(< ~counter~0 99)} is VALID [2022-04-08 12:39:39,653 INFO L290 TraceCheckUtils]: 105: Hoare triple {99939#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99914#(< ~counter~0 99)} is VALID [2022-04-08 12:39:39,653 INFO L290 TraceCheckUtils]: 104: Hoare triple {99939#(< ~counter~0 98)} assume !!(0 != ~r~0); {99939#(< ~counter~0 98)} is VALID [2022-04-08 12:39:39,654 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99451#true} {99939#(< ~counter~0 98)} #94#return; {99939#(< ~counter~0 98)} is VALID [2022-04-08 12:39:39,654 INFO L290 TraceCheckUtils]: 102: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,654 INFO L290 TraceCheckUtils]: 101: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,654 INFO L290 TraceCheckUtils]: 100: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,654 INFO L272 TraceCheckUtils]: 99: Hoare triple {99939#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,654 INFO L290 TraceCheckUtils]: 98: Hoare triple {99939#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {99939#(< ~counter~0 98)} is VALID [2022-04-08 12:39:39,655 INFO L290 TraceCheckUtils]: 97: Hoare triple {99964#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99939#(< ~counter~0 98)} is VALID [2022-04-08 12:39:39,655 INFO L290 TraceCheckUtils]: 96: Hoare triple {99964#(< ~counter~0 97)} assume !(~r~0 < 0); {99964#(< ~counter~0 97)} is VALID [2022-04-08 12:39:39,656 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99451#true} {99964#(< ~counter~0 97)} #98#return; {99964#(< ~counter~0 97)} is VALID [2022-04-08 12:39:39,656 INFO L290 TraceCheckUtils]: 94: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,656 INFO L290 TraceCheckUtils]: 93: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,656 INFO L290 TraceCheckUtils]: 92: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,656 INFO L272 TraceCheckUtils]: 91: Hoare triple {99964#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,656 INFO L290 TraceCheckUtils]: 90: Hoare triple {99964#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {99964#(< ~counter~0 97)} is VALID [2022-04-08 12:39:39,657 INFO L290 TraceCheckUtils]: 89: Hoare triple {99989#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99964#(< ~counter~0 97)} is VALID [2022-04-08 12:39:39,657 INFO L290 TraceCheckUtils]: 88: Hoare triple {99989#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99989#(< ~counter~0 96)} is VALID [2022-04-08 12:39:39,658 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99451#true} {99989#(< ~counter~0 96)} #98#return; {99989#(< ~counter~0 96)} is VALID [2022-04-08 12:39:39,658 INFO L290 TraceCheckUtils]: 86: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,658 INFO L290 TraceCheckUtils]: 85: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,658 INFO L290 TraceCheckUtils]: 84: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,658 INFO L272 TraceCheckUtils]: 83: Hoare triple {99989#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,658 INFO L290 TraceCheckUtils]: 82: Hoare triple {99989#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {99989#(< ~counter~0 96)} is VALID [2022-04-08 12:39:39,659 INFO L290 TraceCheckUtils]: 81: Hoare triple {100014#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99989#(< ~counter~0 96)} is VALID [2022-04-08 12:39:39,660 INFO L290 TraceCheckUtils]: 80: Hoare triple {100014#(< ~counter~0 95)} assume !(~r~0 > 0); {100014#(< ~counter~0 95)} is VALID [2022-04-08 12:39:39,660 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99451#true} {100014#(< ~counter~0 95)} #96#return; {100014#(< ~counter~0 95)} is VALID [2022-04-08 12:39:39,660 INFO L290 TraceCheckUtils]: 78: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,660 INFO L290 TraceCheckUtils]: 77: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,660 INFO L290 TraceCheckUtils]: 76: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,660 INFO L272 TraceCheckUtils]: 75: Hoare triple {100014#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,660 INFO L290 TraceCheckUtils]: 74: Hoare triple {100014#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {100014#(< ~counter~0 95)} is VALID [2022-04-08 12:39:39,661 INFO L290 TraceCheckUtils]: 73: Hoare triple {100039#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100014#(< ~counter~0 95)} is VALID [2022-04-08 12:39:39,662 INFO L290 TraceCheckUtils]: 72: Hoare triple {100039#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100039#(< ~counter~0 94)} is VALID [2022-04-08 12:39:39,662 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99451#true} {100039#(< ~counter~0 94)} #96#return; {100039#(< ~counter~0 94)} is VALID [2022-04-08 12:39:39,662 INFO L290 TraceCheckUtils]: 70: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,662 INFO L290 TraceCheckUtils]: 69: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,662 INFO L290 TraceCheckUtils]: 68: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,662 INFO L272 TraceCheckUtils]: 67: Hoare triple {100039#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,663 INFO L290 TraceCheckUtils]: 66: Hoare triple {100039#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {100039#(< ~counter~0 94)} is VALID [2022-04-08 12:39:39,663 INFO L290 TraceCheckUtils]: 65: Hoare triple {100064#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100039#(< ~counter~0 94)} is VALID [2022-04-08 12:39:39,664 INFO L290 TraceCheckUtils]: 64: Hoare triple {100064#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100064#(< ~counter~0 93)} is VALID [2022-04-08 12:39:39,664 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99451#true} {100064#(< ~counter~0 93)} #96#return; {100064#(< ~counter~0 93)} is VALID [2022-04-08 12:39:39,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,664 INFO L290 TraceCheckUtils]: 60: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,664 INFO L272 TraceCheckUtils]: 59: Hoare triple {100064#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {100064#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {100064#(< ~counter~0 93)} is VALID [2022-04-08 12:39:39,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {100089#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100064#(< ~counter~0 93)} is VALID [2022-04-08 12:39:39,666 INFO L290 TraceCheckUtils]: 56: Hoare triple {100089#(< ~counter~0 92)} assume !!(0 != ~r~0); {100089#(< ~counter~0 92)} is VALID [2022-04-08 12:39:39,666 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99451#true} {100089#(< ~counter~0 92)} #94#return; {100089#(< ~counter~0 92)} is VALID [2022-04-08 12:39:39,666 INFO L290 TraceCheckUtils]: 54: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,667 INFO L272 TraceCheckUtils]: 51: Hoare triple {100089#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,667 INFO L290 TraceCheckUtils]: 50: Hoare triple {100089#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {100089#(< ~counter~0 92)} is VALID [2022-04-08 12:39:39,668 INFO L290 TraceCheckUtils]: 49: Hoare triple {100114#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100089#(< ~counter~0 92)} is VALID [2022-04-08 12:39:39,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {100114#(< ~counter~0 91)} assume !(~r~0 < 0); {100114#(< ~counter~0 91)} is VALID [2022-04-08 12:39:39,668 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99451#true} {100114#(< ~counter~0 91)} #98#return; {100114#(< ~counter~0 91)} is VALID [2022-04-08 12:39:39,669 INFO L290 TraceCheckUtils]: 46: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,669 INFO L290 TraceCheckUtils]: 45: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,669 INFO L290 TraceCheckUtils]: 44: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,669 INFO L272 TraceCheckUtils]: 43: Hoare triple {100114#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {100114#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {100114#(< ~counter~0 91)} is VALID [2022-04-08 12:39:39,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {100139#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100114#(< ~counter~0 91)} is VALID [2022-04-08 12:39:39,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {100139#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100139#(< ~counter~0 90)} is VALID [2022-04-08 12:39:39,671 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99451#true} {100139#(< ~counter~0 90)} #98#return; {100139#(< ~counter~0 90)} is VALID [2022-04-08 12:39:39,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,671 INFO L272 TraceCheckUtils]: 35: Hoare triple {100139#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {100139#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {100139#(< ~counter~0 90)} is VALID [2022-04-08 12:39:39,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {100164#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100139#(< ~counter~0 90)} is VALID [2022-04-08 12:39:39,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {100164#(< ~counter~0 89)} assume !(~r~0 > 0); {100164#(< ~counter~0 89)} is VALID [2022-04-08 12:39:39,673 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99451#true} {100164#(< ~counter~0 89)} #96#return; {100164#(< ~counter~0 89)} is VALID [2022-04-08 12:39:39,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,673 INFO L272 TraceCheckUtils]: 27: Hoare triple {100164#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {100164#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {100164#(< ~counter~0 89)} is VALID [2022-04-08 12:39:39,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {100189#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100164#(< ~counter~0 89)} is VALID [2022-04-08 12:39:39,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {100189#(< ~counter~0 88)} assume !!(0 != ~r~0); {100189#(< ~counter~0 88)} is VALID [2022-04-08 12:39:39,675 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99451#true} {100189#(< ~counter~0 88)} #94#return; {100189#(< ~counter~0 88)} is VALID [2022-04-08 12:39:39,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,675 INFO L272 TraceCheckUtils]: 19: Hoare triple {100189#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {100189#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {100189#(< ~counter~0 88)} is VALID [2022-04-08 12:39:39,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {100214#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100189#(< ~counter~0 88)} is VALID [2022-04-08 12:39:39,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {100214#(< ~counter~0 87)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {100214#(< ~counter~0 87)} is VALID [2022-04-08 12:39:39,677 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99451#true} {100214#(< ~counter~0 87)} #92#return; {100214#(< ~counter~0 87)} is VALID [2022-04-08 12:39:39,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,677 INFO L272 TraceCheckUtils]: 11: Hoare triple {100214#(< ~counter~0 87)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,677 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99451#true} {100214#(< ~counter~0 87)} #90#return; {100214#(< ~counter~0 87)} is VALID [2022-04-08 12:39:39,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 12:39:39,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 12:39:39,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 12:39:39,678 INFO L272 TraceCheckUtils]: 6: Hoare triple {100214#(< ~counter~0 87)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 12:39:39,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {100214#(< ~counter~0 87)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {100214#(< ~counter~0 87)} is VALID [2022-04-08 12:39:39,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {100214#(< ~counter~0 87)} call #t~ret9 := main(); {100214#(< ~counter~0 87)} is VALID [2022-04-08 12:39:39,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100214#(< ~counter~0 87)} {99451#true} #102#return; {100214#(< ~counter~0 87)} is VALID [2022-04-08 12:39:39,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {100214#(< ~counter~0 87)} assume true; {100214#(< ~counter~0 87)} is VALID [2022-04-08 12:39:39,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {99451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {100214#(< ~counter~0 87)} is VALID [2022-04-08 12:39:39,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {99451#true} call ULTIMATE.init(); {99451#true} is VALID [2022-04-08 12:39:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-08 12:39:39,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:39:39,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205653330] [2022-04-08 12:39:39,680 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:39:39,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648587417] [2022-04-08 12:39:39,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648587417] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:39:39,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:39:39,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-08 12:39:39,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:39:39,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2009844805] [2022-04-08 12:39:39,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2009844805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:39:39,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:39:39,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 12:39:39,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332291626] [2022-04-08 12:39:39,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:39:39,681 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 131 [2022-04-08 12:39:39,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:39:39,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:39,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:39,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 12:39:39,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:39,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 12:39:39,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-08 12:39:39,790 INFO L87 Difference]: Start difference. First operand 690 states and 936 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:43,367 INFO L93 Difference]: Finished difference Result 903 states and 1260 transitions. [2022-04-08 12:39:43,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 12:39:43,368 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 131 [2022-04-08 12:39:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:39:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-08 12:39:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-08 12:39:43,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 296 transitions. [2022-04-08 12:39:43,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:43,666 INFO L225 Difference]: With dead ends: 903 [2022-04-08 12:39:43,666 INFO L226 Difference]: Without dead ends: 706 [2022-04-08 12:39:43,667 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-08 12:39:43,667 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 207 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:39:43,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 315 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 12:39:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-04-08 12:39:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2022-04-08 12:39:45,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:39:45,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 12:39:45,922 INFO L74 IsIncluded]: Start isIncluded. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 12:39:45,922 INFO L87 Difference]: Start difference. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 12:39:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:45,939 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-08 12:39:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-08 12:39:45,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:45,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:45,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 706 states. [2022-04-08 12:39:45,940 INFO L87 Difference]: Start difference. First operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 706 states. [2022-04-08 12:39:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:45,956 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-08 12:39:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-08 12:39:45,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:45,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:45,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:39:45,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:39:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 12:39:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 952 transitions. [2022-04-08 12:39:45,979 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 952 transitions. Word has length 131 [2022-04-08 12:39:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:39:45,979 INFO L478 AbstractCegarLoop]: Abstraction has 706 states and 952 transitions. [2022-04-08 12:39:45,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 12:39:45,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 706 states and 952 transitions. [2022-04-08 12:39:51,103 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-08 12:39:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-08 12:39:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 12:39:51,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:39:51,105 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:39:51,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-08 12:39:51,305 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:51,305 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:39:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:39:51,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 11 times [2022-04-08 12:39:51,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:51,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [405349372] [2022-04-08 12:39:51,306 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:39:51,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 12 times [2022-04-08 12:39:51,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:39:51,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115268523] [2022-04-08 12:39:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:39:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:39:51,318 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:39:51,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1539493468] [2022-04-08 12:39:51,318 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:39:51,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:51,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:39:51,319 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:39:51,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-08 12:39:51,405 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 12:39:51,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:39:51,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 12:39:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:39:51,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:39:52,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {104922#true} call ULTIMATE.init(); {104922#true} is VALID [2022-04-08 12:39:52,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {104922#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {104922#true} is VALID [2022-04-08 12:39:52,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104922#true} {104922#true} #102#return; {104922#true} is VALID [2022-04-08 12:39:52,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {104922#true} call #t~ret9 := main(); {104922#true} is VALID [2022-04-08 12:39:52,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {104922#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {104922#true} is VALID [2022-04-08 12:39:52,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {104922#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {104922#true} {104922#true} #90#return; {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L272 TraceCheckUtils]: 11: Hoare triple {104922#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {104922#true} {104922#true} #92#return; {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {104922#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {104922#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {104922#true} assume !!(#t~post6 < 100);havoc #t~post6; {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L272 TraceCheckUtils]: 19: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {104922#true} {104922#true} #94#return; {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {104922#true} assume !!(0 != ~r~0); {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {104922#true} assume !!(#t~post7 < 100);havoc #t~post7; {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L272 TraceCheckUtils]: 27: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {104922#true} assume !(~r~0 > 0); {104922#true} is VALID [2022-04-08 12:39:52,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {104922#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {104922#true} assume !!(#t~post8 < 100);havoc #t~post8; {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L272 TraceCheckUtils]: 35: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {104922#true} {104922#true} #98#return; {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {104922#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {104922#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {104922#true} assume !!(#t~post8 < 100);havoc #t~post8; {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L272 TraceCheckUtils]: 43: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,060 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {104922#true} {104922#true} #98#return; {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {104922#true} assume !(~r~0 < 0); {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {104922#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {104922#true} assume !!(#t~post6 < 100);havoc #t~post6; {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L272 TraceCheckUtils]: 51: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L290 TraceCheckUtils]: 54: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {104922#true} {104922#true} #94#return; {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {104922#true} assume !!(0 != ~r~0); {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {104922#true} assume !!(#t~post7 < 100);havoc #t~post7; {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L272 TraceCheckUtils]: 59: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {104922#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L290 TraceCheckUtils]: 65: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L290 TraceCheckUtils]: 66: Hoare triple {104922#true} assume !!(#t~post7 < 100);havoc #t~post7; {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L272 TraceCheckUtils]: 67: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L290 TraceCheckUtils]: 68: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L290 TraceCheckUtils]: 69: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L290 TraceCheckUtils]: 72: Hoare triple {104922#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L290 TraceCheckUtils]: 73: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L290 TraceCheckUtils]: 74: Hoare triple {104922#true} assume !!(#t~post7 < 100);havoc #t~post7; {104922#true} is VALID [2022-04-08 12:39:52,062 INFO L272 TraceCheckUtils]: 75: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L290 TraceCheckUtils]: 76: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L290 TraceCheckUtils]: 77: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L290 TraceCheckUtils]: 78: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L290 TraceCheckUtils]: 80: Hoare triple {104922#true} assume !(~r~0 > 0); {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L290 TraceCheckUtils]: 81: Hoare triple {104922#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L290 TraceCheckUtils]: 82: Hoare triple {104922#true} assume !!(#t~post8 < 100);havoc #t~post8; {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L272 TraceCheckUtils]: 83: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L290 TraceCheckUtils]: 84: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L290 TraceCheckUtils]: 85: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L290 TraceCheckUtils]: 86: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {104922#true} {104922#true} #98#return; {104922#true} is VALID [2022-04-08 12:39:52,063 INFO L290 TraceCheckUtils]: 88: Hoare triple {104922#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L290 TraceCheckUtils]: 89: Hoare triple {104922#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L290 TraceCheckUtils]: 90: Hoare triple {104922#true} assume !!(#t~post8 < 100);havoc #t~post8; {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L272 TraceCheckUtils]: 91: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L290 TraceCheckUtils]: 92: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L290 TraceCheckUtils]: 93: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L290 TraceCheckUtils]: 94: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {104922#true} {104922#true} #98#return; {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L290 TraceCheckUtils]: 96: Hoare triple {104922#true} assume !(~r~0 < 0); {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L290 TraceCheckUtils]: 97: Hoare triple {104922#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L290 TraceCheckUtils]: 98: Hoare triple {104922#true} assume !!(#t~post6 < 100);havoc #t~post6; {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L272 TraceCheckUtils]: 99: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L290 TraceCheckUtils]: 100: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L290 TraceCheckUtils]: 101: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,064 INFO L290 TraceCheckUtils]: 102: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,065 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {104922#true} {104922#true} #94#return; {104922#true} is VALID [2022-04-08 12:39:52,065 INFO L290 TraceCheckUtils]: 104: Hoare triple {104922#true} assume !!(0 != ~r~0); {104922#true} is VALID [2022-04-08 12:39:52,065 INFO L290 TraceCheckUtils]: 105: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-08 12:39:52,065 INFO L290 TraceCheckUtils]: 106: Hoare triple {104922#true} assume !!(#t~post7 < 100);havoc #t~post7; {104922#true} is VALID [2022-04-08 12:39:52,065 INFO L272 TraceCheckUtils]: 107: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,065 INFO L290 TraceCheckUtils]: 108: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,065 INFO L290 TraceCheckUtils]: 109: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,065 INFO L290 TraceCheckUtils]: 110: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,065 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-08 12:39:52,065 INFO L290 TraceCheckUtils]: 112: Hoare triple {104922#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104922#true} is VALID [2022-04-08 12:39:52,065 INFO L290 TraceCheckUtils]: 113: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-08 12:39:52,065 INFO L290 TraceCheckUtils]: 114: Hoare triple {104922#true} assume !!(#t~post7 < 100);havoc #t~post7; {104922#true} is VALID [2022-04-08 12:39:52,072 INFO L272 TraceCheckUtils]: 115: Hoare triple {104922#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,072 INFO L290 TraceCheckUtils]: 116: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 12:39:52,072 INFO L290 TraceCheckUtils]: 117: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 12:39:52,072 INFO L290 TraceCheckUtils]: 118: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 12:39:52,073 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-08 12:39:52,074 INFO L290 TraceCheckUtils]: 120: Hoare triple {104922#true} assume !(~r~0 > 0); {105287#(not (< 0 main_~r~0))} is VALID [2022-04-08 12:39:52,074 INFO L290 TraceCheckUtils]: 121: Hoare triple {105287#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105287#(not (< 0 main_~r~0))} is VALID [2022-04-08 12:39:52,074 INFO L290 TraceCheckUtils]: 122: Hoare triple {105287#(not (< 0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {105287#(not (< 0 main_~r~0))} is VALID [2022-04-08 12:39:52,074 INFO L272 TraceCheckUtils]: 123: Hoare triple {105287#(not (< 0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 12:39:52,075 INFO L290 TraceCheckUtils]: 124: Hoare triple {104922#true} ~cond := #in~cond; {105300#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:39:52,075 INFO L290 TraceCheckUtils]: 125: Hoare triple {105300#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {105304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:39:52,075 INFO L290 TraceCheckUtils]: 126: Hoare triple {105304#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {105304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:39:52,076 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {105304#(not (= |__VERIFIER_assert_#in~cond| 0))} {105287#(not (< 0 main_~r~0))} #98#return; {105311#(and (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) (not (< 0 main_~r~0)))} is VALID [2022-04-08 12:39:52,079 INFO L290 TraceCheckUtils]: 128: Hoare triple {105311#(and (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {105315#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-08 12:39:52,079 INFO L290 TraceCheckUtils]: 129: Hoare triple {105315#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105315#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-08 12:39:52,080 INFO L290 TraceCheckUtils]: 130: Hoare triple {105315#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} assume !(#t~post6 < 100);havoc #t~post6; {105315#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-08 12:39:52,081 INFO L272 TraceCheckUtils]: 131: Hoare triple {105315#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:39:52,081 INFO L290 TraceCheckUtils]: 132: Hoare triple {105325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {105329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:39:52,082 INFO L290 TraceCheckUtils]: 133: Hoare triple {105329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {104923#false} is VALID [2022-04-08 12:39:52,082 INFO L290 TraceCheckUtils]: 134: Hoare triple {104923#false} assume !false; {104923#false} is VALID [2022-04-08 12:39:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 88 proven. 1 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-08 12:39:52,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:39:54,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:39:54,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115268523] [2022-04-08 12:39:54,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:39:54,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539493468] [2022-04-08 12:39:54,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539493468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 12:39:54,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:39:54,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 12:39:54,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:39:54,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [405349372] [2022-04-08 12:39:54,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [405349372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:39:54,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:39:54,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:39:54,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864442670] [2022-04-08 12:39:54,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:39:54,594 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-08 12:39:54,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:39:54,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 12:39:54,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:54,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:39:54,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:54,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:39:54,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-04-08 12:39:54,640 INFO L87 Difference]: Start difference. First operand 706 states and 952 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 12:39:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:57,953 INFO L93 Difference]: Finished difference Result 758 states and 1028 transitions. [2022-04-08 12:39:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 12:39:57,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-08 12:39:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:39:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 12:39:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-08 12:39:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 12:39:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-08 12:39:57,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-08 12:39:58,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:58,058 INFO L225 Difference]: With dead ends: 758 [2022-04-08 12:39:58,058 INFO L226 Difference]: Without dead ends: 746 [2022-04-08 12:39:58,059 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2022-04-08 12:39:58,059 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 28 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 12:39:58,059 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 251 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 12:39:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-04-08 12:40:00,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 683. [2022-04-08 12:40:00,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:40:00,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-08 12:40:00,247 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-08 12:40:00,248 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-08 12:40:00,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:00,266 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-08 12:40:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-08 12:40:00,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:40:00,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:40:00,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 746 states. [2022-04-08 12:40:00,268 INFO L87 Difference]: Start difference. First operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 746 states. [2022-04-08 12:40:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:00,286 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-08 12:40:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-08 12:40:00,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:40:00,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:40:00,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:40:00,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:40:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-08 12:40:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 912 transitions. [2022-04-08 12:40:00,312 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 912 transitions. Word has length 135 [2022-04-08 12:40:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:40:00,312 INFO L478 AbstractCegarLoop]: Abstraction has 683 states and 912 transitions. [2022-04-08 12:40:00,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 12:40:00,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 683 states and 912 transitions. [2022-04-08 12:40:05,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 912 edges. 911 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:40:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 912 transitions. [2022-04-08 12:40:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 12:40:05,465 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:40:05,465 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 8, 8, 8, 8, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:40:05,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-08 12:40:05,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-08 12:40:05,665 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:40:05,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:40:05,666 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 13 times [2022-04-08 12:40:05,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:05,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [797056436] [2022-04-08 12:40:05,666 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:40:05,666 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 14 times [2022-04-08 12:40:05,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:40:05,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554397704] [2022-04-08 12:40:05,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:40:05,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:40:05,683 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:40:05,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801422679] [2022-04-08 12:40:05,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:40:05,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:40:05,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:40:05,684 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:40:05,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-08 12:40:05,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:40:05,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:40:05,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 12:40:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:40:05,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:40:06,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {109742#true} call ULTIMATE.init(); {109742#true} is VALID [2022-04-08 12:40:06,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {109742#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {109750#(<= ~counter~0 0)} assume true; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109750#(<= ~counter~0 0)} {109742#true} #102#return; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {109750#(<= ~counter~0 0)} call #t~ret9 := main(); {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {109750#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,554 INFO L272 TraceCheckUtils]: 6: Hoare triple {109750#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {109750#(<= ~counter~0 0)} ~cond := #in~cond; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {109750#(<= ~counter~0 0)} assume !(0 == ~cond); {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {109750#(<= ~counter~0 0)} assume true; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,555 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109750#(<= ~counter~0 0)} {109750#(<= ~counter~0 0)} #90#return; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,556 INFO L272 TraceCheckUtils]: 11: Hoare triple {109750#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {109750#(<= ~counter~0 0)} ~cond := #in~cond; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {109750#(<= ~counter~0 0)} assume !(0 == ~cond); {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {109750#(<= ~counter~0 0)} assume true; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,557 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109750#(<= ~counter~0 0)} {109750#(<= ~counter~0 0)} #92#return; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {109750#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:06,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {109750#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109799#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:06,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {109799#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {109799#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:06,560 INFO L272 TraceCheckUtils]: 19: Hoare triple {109799#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109799#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:06,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {109799#(<= ~counter~0 1)} ~cond := #in~cond; {109799#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:06,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {109799#(<= ~counter~0 1)} assume !(0 == ~cond); {109799#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:06,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {109799#(<= ~counter~0 1)} assume true; {109799#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:06,561 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {109799#(<= ~counter~0 1)} {109799#(<= ~counter~0 1)} #94#return; {109799#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:06,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {109799#(<= ~counter~0 1)} assume !!(0 != ~r~0); {109799#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:06,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {109799#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109824#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:06,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {109824#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {109824#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:06,563 INFO L272 TraceCheckUtils]: 27: Hoare triple {109824#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109824#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:06,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {109824#(<= ~counter~0 2)} ~cond := #in~cond; {109824#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:06,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {109824#(<= ~counter~0 2)} assume !(0 == ~cond); {109824#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:06,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {109824#(<= ~counter~0 2)} assume true; {109824#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:06,564 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {109824#(<= ~counter~0 2)} {109824#(<= ~counter~0 2)} #96#return; {109824#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:06,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {109824#(<= ~counter~0 2)} assume !(~r~0 > 0); {109824#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:06,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {109824#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109849#(<= ~counter~0 3)} is VALID [2022-04-08 12:40:06,566 INFO L290 TraceCheckUtils]: 34: Hoare triple {109849#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {109849#(<= ~counter~0 3)} is VALID [2022-04-08 12:40:06,566 INFO L272 TraceCheckUtils]: 35: Hoare triple {109849#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109849#(<= ~counter~0 3)} is VALID [2022-04-08 12:40:06,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {109849#(<= ~counter~0 3)} ~cond := #in~cond; {109849#(<= ~counter~0 3)} is VALID [2022-04-08 12:40:06,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {109849#(<= ~counter~0 3)} assume !(0 == ~cond); {109849#(<= ~counter~0 3)} is VALID [2022-04-08 12:40:06,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {109849#(<= ~counter~0 3)} assume true; {109849#(<= ~counter~0 3)} is VALID [2022-04-08 12:40:06,568 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109849#(<= ~counter~0 3)} {109849#(<= ~counter~0 3)} #98#return; {109849#(<= ~counter~0 3)} is VALID [2022-04-08 12:40:06,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {109849#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {109849#(<= ~counter~0 3)} is VALID [2022-04-08 12:40:06,569 INFO L290 TraceCheckUtils]: 41: Hoare triple {109849#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109874#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:06,569 INFO L290 TraceCheckUtils]: 42: Hoare triple {109874#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {109874#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:06,570 INFO L272 TraceCheckUtils]: 43: Hoare triple {109874#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109874#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:06,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {109874#(<= ~counter~0 4)} ~cond := #in~cond; {109874#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:06,570 INFO L290 TraceCheckUtils]: 45: Hoare triple {109874#(<= ~counter~0 4)} assume !(0 == ~cond); {109874#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:06,570 INFO L290 TraceCheckUtils]: 46: Hoare triple {109874#(<= ~counter~0 4)} assume true; {109874#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:06,571 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {109874#(<= ~counter~0 4)} {109874#(<= ~counter~0 4)} #98#return; {109874#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:06,571 INFO L290 TraceCheckUtils]: 48: Hoare triple {109874#(<= ~counter~0 4)} assume !(~r~0 < 0); {109874#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:06,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {109874#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109899#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:06,572 INFO L290 TraceCheckUtils]: 50: Hoare triple {109899#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {109899#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:06,573 INFO L272 TraceCheckUtils]: 51: Hoare triple {109899#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109899#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:06,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {109899#(<= ~counter~0 5)} ~cond := #in~cond; {109899#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:06,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {109899#(<= ~counter~0 5)} assume !(0 == ~cond); {109899#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:06,574 INFO L290 TraceCheckUtils]: 54: Hoare triple {109899#(<= ~counter~0 5)} assume true; {109899#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:06,574 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {109899#(<= ~counter~0 5)} {109899#(<= ~counter~0 5)} #94#return; {109899#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:06,574 INFO L290 TraceCheckUtils]: 56: Hoare triple {109899#(<= ~counter~0 5)} assume !!(0 != ~r~0); {109899#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:06,575 INFO L290 TraceCheckUtils]: 57: Hoare triple {109899#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109924#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:06,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {109924#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {109924#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:06,576 INFO L272 TraceCheckUtils]: 59: Hoare triple {109924#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109924#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:06,576 INFO L290 TraceCheckUtils]: 60: Hoare triple {109924#(<= ~counter~0 6)} ~cond := #in~cond; {109924#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:06,577 INFO L290 TraceCheckUtils]: 61: Hoare triple {109924#(<= ~counter~0 6)} assume !(0 == ~cond); {109924#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:06,577 INFO L290 TraceCheckUtils]: 62: Hoare triple {109924#(<= ~counter~0 6)} assume true; {109924#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:06,577 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109924#(<= ~counter~0 6)} {109924#(<= ~counter~0 6)} #96#return; {109924#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:06,578 INFO L290 TraceCheckUtils]: 64: Hoare triple {109924#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109924#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:06,579 INFO L290 TraceCheckUtils]: 65: Hoare triple {109924#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109949#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:06,579 INFO L290 TraceCheckUtils]: 66: Hoare triple {109949#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {109949#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:06,579 INFO L272 TraceCheckUtils]: 67: Hoare triple {109949#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109949#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:06,580 INFO L290 TraceCheckUtils]: 68: Hoare triple {109949#(<= ~counter~0 7)} ~cond := #in~cond; {109949#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:06,580 INFO L290 TraceCheckUtils]: 69: Hoare triple {109949#(<= ~counter~0 7)} assume !(0 == ~cond); {109949#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:06,580 INFO L290 TraceCheckUtils]: 70: Hoare triple {109949#(<= ~counter~0 7)} assume true; {109949#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:06,581 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {109949#(<= ~counter~0 7)} {109949#(<= ~counter~0 7)} #96#return; {109949#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:06,581 INFO L290 TraceCheckUtils]: 72: Hoare triple {109949#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109949#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:06,582 INFO L290 TraceCheckUtils]: 73: Hoare triple {109949#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109974#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:06,582 INFO L290 TraceCheckUtils]: 74: Hoare triple {109974#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {109974#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:06,583 INFO L272 TraceCheckUtils]: 75: Hoare triple {109974#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109974#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:06,583 INFO L290 TraceCheckUtils]: 76: Hoare triple {109974#(<= ~counter~0 8)} ~cond := #in~cond; {109974#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:06,583 INFO L290 TraceCheckUtils]: 77: Hoare triple {109974#(<= ~counter~0 8)} assume !(0 == ~cond); {109974#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:06,583 INFO L290 TraceCheckUtils]: 78: Hoare triple {109974#(<= ~counter~0 8)} assume true; {109974#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:06,584 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {109974#(<= ~counter~0 8)} {109974#(<= ~counter~0 8)} #96#return; {109974#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:06,584 INFO L290 TraceCheckUtils]: 80: Hoare triple {109974#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109974#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:06,585 INFO L290 TraceCheckUtils]: 81: Hoare triple {109974#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109999#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:06,585 INFO L290 TraceCheckUtils]: 82: Hoare triple {109999#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {109999#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:06,586 INFO L272 TraceCheckUtils]: 83: Hoare triple {109999#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109999#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:06,586 INFO L290 TraceCheckUtils]: 84: Hoare triple {109999#(<= ~counter~0 9)} ~cond := #in~cond; {109999#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:06,586 INFO L290 TraceCheckUtils]: 85: Hoare triple {109999#(<= ~counter~0 9)} assume !(0 == ~cond); {109999#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:06,587 INFO L290 TraceCheckUtils]: 86: Hoare triple {109999#(<= ~counter~0 9)} assume true; {109999#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:06,587 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {109999#(<= ~counter~0 9)} {109999#(<= ~counter~0 9)} #96#return; {109999#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:06,587 INFO L290 TraceCheckUtils]: 88: Hoare triple {109999#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109999#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:06,588 INFO L290 TraceCheckUtils]: 89: Hoare triple {109999#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110024#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:06,589 INFO L290 TraceCheckUtils]: 90: Hoare triple {110024#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {110024#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:06,589 INFO L272 TraceCheckUtils]: 91: Hoare triple {110024#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {110024#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:06,589 INFO L290 TraceCheckUtils]: 92: Hoare triple {110024#(<= ~counter~0 10)} ~cond := #in~cond; {110024#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:06,590 INFO L290 TraceCheckUtils]: 93: Hoare triple {110024#(<= ~counter~0 10)} assume !(0 == ~cond); {110024#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:06,590 INFO L290 TraceCheckUtils]: 94: Hoare triple {110024#(<= ~counter~0 10)} assume true; {110024#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:06,590 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {110024#(<= ~counter~0 10)} {110024#(<= ~counter~0 10)} #96#return; {110024#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:06,591 INFO L290 TraceCheckUtils]: 96: Hoare triple {110024#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110024#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:06,592 INFO L290 TraceCheckUtils]: 97: Hoare triple {110024#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110049#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:06,592 INFO L290 TraceCheckUtils]: 98: Hoare triple {110049#(<= ~counter~0 11)} assume !!(#t~post7 < 100);havoc #t~post7; {110049#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:06,592 INFO L272 TraceCheckUtils]: 99: Hoare triple {110049#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {110049#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:06,593 INFO L290 TraceCheckUtils]: 100: Hoare triple {110049#(<= ~counter~0 11)} ~cond := #in~cond; {110049#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:06,593 INFO L290 TraceCheckUtils]: 101: Hoare triple {110049#(<= ~counter~0 11)} assume !(0 == ~cond); {110049#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:06,593 INFO L290 TraceCheckUtils]: 102: Hoare triple {110049#(<= ~counter~0 11)} assume true; {110049#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:06,594 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {110049#(<= ~counter~0 11)} {110049#(<= ~counter~0 11)} #96#return; {110049#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:06,594 INFO L290 TraceCheckUtils]: 104: Hoare triple {110049#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110049#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:06,595 INFO L290 TraceCheckUtils]: 105: Hoare triple {110049#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110074#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:06,595 INFO L290 TraceCheckUtils]: 106: Hoare triple {110074#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {110074#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:06,596 INFO L272 TraceCheckUtils]: 107: Hoare triple {110074#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {110074#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:06,596 INFO L290 TraceCheckUtils]: 108: Hoare triple {110074#(<= ~counter~0 12)} ~cond := #in~cond; {110074#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:06,596 INFO L290 TraceCheckUtils]: 109: Hoare triple {110074#(<= ~counter~0 12)} assume !(0 == ~cond); {110074#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:06,596 INFO L290 TraceCheckUtils]: 110: Hoare triple {110074#(<= ~counter~0 12)} assume true; {110074#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:06,597 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {110074#(<= ~counter~0 12)} {110074#(<= ~counter~0 12)} #96#return; {110074#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:06,597 INFO L290 TraceCheckUtils]: 112: Hoare triple {110074#(<= ~counter~0 12)} assume !(~r~0 > 0); {110074#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:06,598 INFO L290 TraceCheckUtils]: 113: Hoare triple {110074#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110099#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:06,598 INFO L290 TraceCheckUtils]: 114: Hoare triple {110099#(<= ~counter~0 13)} assume !!(#t~post8 < 100);havoc #t~post8; {110099#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:06,599 INFO L272 TraceCheckUtils]: 115: Hoare triple {110099#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {110099#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:06,599 INFO L290 TraceCheckUtils]: 116: Hoare triple {110099#(<= ~counter~0 13)} ~cond := #in~cond; {110099#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:06,599 INFO L290 TraceCheckUtils]: 117: Hoare triple {110099#(<= ~counter~0 13)} assume !(0 == ~cond); {110099#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:06,600 INFO L290 TraceCheckUtils]: 118: Hoare triple {110099#(<= ~counter~0 13)} assume true; {110099#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:06,600 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {110099#(<= ~counter~0 13)} {110099#(<= ~counter~0 13)} #98#return; {110099#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:06,600 INFO L290 TraceCheckUtils]: 120: Hoare triple {110099#(<= ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110099#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:06,601 INFO L290 TraceCheckUtils]: 121: Hoare triple {110099#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110124#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:06,602 INFO L290 TraceCheckUtils]: 122: Hoare triple {110124#(<= ~counter~0 14)} assume !!(#t~post8 < 100);havoc #t~post8; {110124#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:06,602 INFO L272 TraceCheckUtils]: 123: Hoare triple {110124#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {110124#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:06,602 INFO L290 TraceCheckUtils]: 124: Hoare triple {110124#(<= ~counter~0 14)} ~cond := #in~cond; {110124#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:06,603 INFO L290 TraceCheckUtils]: 125: Hoare triple {110124#(<= ~counter~0 14)} assume !(0 == ~cond); {110124#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:06,603 INFO L290 TraceCheckUtils]: 126: Hoare triple {110124#(<= ~counter~0 14)} assume true; {110124#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:06,603 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {110124#(<= ~counter~0 14)} {110124#(<= ~counter~0 14)} #98#return; {110124#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:06,604 INFO L290 TraceCheckUtils]: 128: Hoare triple {110124#(<= ~counter~0 14)} assume !(~r~0 < 0); {110124#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:06,604 INFO L290 TraceCheckUtils]: 129: Hoare triple {110124#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110149#(<= |main_#t~post6| 14)} is VALID [2022-04-08 12:40:06,604 INFO L290 TraceCheckUtils]: 130: Hoare triple {110149#(<= |main_#t~post6| 14)} assume !(#t~post6 < 100);havoc #t~post6; {109743#false} is VALID [2022-04-08 12:40:06,604 INFO L272 TraceCheckUtils]: 131: Hoare triple {109743#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109743#false} is VALID [2022-04-08 12:40:06,604 INFO L290 TraceCheckUtils]: 132: Hoare triple {109743#false} ~cond := #in~cond; {109743#false} is VALID [2022-04-08 12:40:06,605 INFO L290 TraceCheckUtils]: 133: Hoare triple {109743#false} assume 0 == ~cond; {109743#false} is VALID [2022-04-08 12:40:06,605 INFO L290 TraceCheckUtils]: 134: Hoare triple {109743#false} assume !false; {109743#false} is VALID [2022-04-08 12:40:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 508 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:40:06,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:40:07,473 INFO L290 TraceCheckUtils]: 134: Hoare triple {109743#false} assume !false; {109743#false} is VALID [2022-04-08 12:40:07,474 INFO L290 TraceCheckUtils]: 133: Hoare triple {109743#false} assume 0 == ~cond; {109743#false} is VALID [2022-04-08 12:40:07,474 INFO L290 TraceCheckUtils]: 132: Hoare triple {109743#false} ~cond := #in~cond; {109743#false} is VALID [2022-04-08 12:40:07,474 INFO L272 TraceCheckUtils]: 131: Hoare triple {109743#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109743#false} is VALID [2022-04-08 12:40:07,474 INFO L290 TraceCheckUtils]: 130: Hoare triple {110177#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {109743#false} is VALID [2022-04-08 12:40:07,474 INFO L290 TraceCheckUtils]: 129: Hoare triple {110181#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110177#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:40:07,475 INFO L290 TraceCheckUtils]: 128: Hoare triple {110181#(< ~counter~0 100)} assume !(~r~0 < 0); {110181#(< ~counter~0 100)} is VALID [2022-04-08 12:40:07,475 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {109742#true} {110181#(< ~counter~0 100)} #98#return; {110181#(< ~counter~0 100)} is VALID [2022-04-08 12:40:07,475 INFO L290 TraceCheckUtils]: 126: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,475 INFO L290 TraceCheckUtils]: 125: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,475 INFO L290 TraceCheckUtils]: 124: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,475 INFO L272 TraceCheckUtils]: 123: Hoare triple {110181#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,476 INFO L290 TraceCheckUtils]: 122: Hoare triple {110181#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {110181#(< ~counter~0 100)} is VALID [2022-04-08 12:40:07,478 INFO L290 TraceCheckUtils]: 121: Hoare triple {110206#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110181#(< ~counter~0 100)} is VALID [2022-04-08 12:40:07,478 INFO L290 TraceCheckUtils]: 120: Hoare triple {110206#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110206#(< ~counter~0 99)} is VALID [2022-04-08 12:40:07,479 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {109742#true} {110206#(< ~counter~0 99)} #98#return; {110206#(< ~counter~0 99)} is VALID [2022-04-08 12:40:07,479 INFO L290 TraceCheckUtils]: 118: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,479 INFO L290 TraceCheckUtils]: 117: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,479 INFO L290 TraceCheckUtils]: 116: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,479 INFO L272 TraceCheckUtils]: 115: Hoare triple {110206#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,479 INFO L290 TraceCheckUtils]: 114: Hoare triple {110206#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {110206#(< ~counter~0 99)} is VALID [2022-04-08 12:40:07,480 INFO L290 TraceCheckUtils]: 113: Hoare triple {110231#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110206#(< ~counter~0 99)} is VALID [2022-04-08 12:40:07,480 INFO L290 TraceCheckUtils]: 112: Hoare triple {110231#(< ~counter~0 98)} assume !(~r~0 > 0); {110231#(< ~counter~0 98)} is VALID [2022-04-08 12:40:07,481 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {109742#true} {110231#(< ~counter~0 98)} #96#return; {110231#(< ~counter~0 98)} is VALID [2022-04-08 12:40:07,481 INFO L290 TraceCheckUtils]: 110: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,481 INFO L290 TraceCheckUtils]: 109: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,481 INFO L290 TraceCheckUtils]: 108: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,481 INFO L272 TraceCheckUtils]: 107: Hoare triple {110231#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,481 INFO L290 TraceCheckUtils]: 106: Hoare triple {110231#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {110231#(< ~counter~0 98)} is VALID [2022-04-08 12:40:07,482 INFO L290 TraceCheckUtils]: 105: Hoare triple {110256#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110231#(< ~counter~0 98)} is VALID [2022-04-08 12:40:07,482 INFO L290 TraceCheckUtils]: 104: Hoare triple {110256#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110256#(< ~counter~0 97)} is VALID [2022-04-08 12:40:07,483 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {109742#true} {110256#(< ~counter~0 97)} #96#return; {110256#(< ~counter~0 97)} is VALID [2022-04-08 12:40:07,483 INFO L290 TraceCheckUtils]: 102: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,483 INFO L290 TraceCheckUtils]: 101: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,483 INFO L290 TraceCheckUtils]: 100: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,483 INFO L272 TraceCheckUtils]: 99: Hoare triple {110256#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,483 INFO L290 TraceCheckUtils]: 98: Hoare triple {110256#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {110256#(< ~counter~0 97)} is VALID [2022-04-08 12:40:07,484 INFO L290 TraceCheckUtils]: 97: Hoare triple {110281#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110256#(< ~counter~0 97)} is VALID [2022-04-08 12:40:07,485 INFO L290 TraceCheckUtils]: 96: Hoare triple {110281#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110281#(< ~counter~0 96)} is VALID [2022-04-08 12:40:07,485 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {109742#true} {110281#(< ~counter~0 96)} #96#return; {110281#(< ~counter~0 96)} is VALID [2022-04-08 12:40:07,485 INFO L290 TraceCheckUtils]: 94: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,485 INFO L290 TraceCheckUtils]: 93: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,485 INFO L290 TraceCheckUtils]: 92: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,485 INFO L272 TraceCheckUtils]: 91: Hoare triple {110281#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,486 INFO L290 TraceCheckUtils]: 90: Hoare triple {110281#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {110281#(< ~counter~0 96)} is VALID [2022-04-08 12:40:07,486 INFO L290 TraceCheckUtils]: 89: Hoare triple {110306#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110281#(< ~counter~0 96)} is VALID [2022-04-08 12:40:07,487 INFO L290 TraceCheckUtils]: 88: Hoare triple {110306#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110306#(< ~counter~0 95)} is VALID [2022-04-08 12:40:07,487 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {109742#true} {110306#(< ~counter~0 95)} #96#return; {110306#(< ~counter~0 95)} is VALID [2022-04-08 12:40:07,487 INFO L290 TraceCheckUtils]: 86: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,487 INFO L290 TraceCheckUtils]: 85: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,487 INFO L290 TraceCheckUtils]: 84: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,487 INFO L272 TraceCheckUtils]: 83: Hoare triple {110306#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,488 INFO L290 TraceCheckUtils]: 82: Hoare triple {110306#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {110306#(< ~counter~0 95)} is VALID [2022-04-08 12:40:07,489 INFO L290 TraceCheckUtils]: 81: Hoare triple {110331#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110306#(< ~counter~0 95)} is VALID [2022-04-08 12:40:07,489 INFO L290 TraceCheckUtils]: 80: Hoare triple {110331#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110331#(< ~counter~0 94)} is VALID [2022-04-08 12:40:07,489 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {109742#true} {110331#(< ~counter~0 94)} #96#return; {110331#(< ~counter~0 94)} is VALID [2022-04-08 12:40:07,490 INFO L290 TraceCheckUtils]: 78: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,490 INFO L290 TraceCheckUtils]: 77: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,490 INFO L290 TraceCheckUtils]: 76: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,490 INFO L272 TraceCheckUtils]: 75: Hoare triple {110331#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,490 INFO L290 TraceCheckUtils]: 74: Hoare triple {110331#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {110331#(< ~counter~0 94)} is VALID [2022-04-08 12:40:07,491 INFO L290 TraceCheckUtils]: 73: Hoare triple {110356#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110331#(< ~counter~0 94)} is VALID [2022-04-08 12:40:07,491 INFO L290 TraceCheckUtils]: 72: Hoare triple {110356#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110356#(< ~counter~0 93)} is VALID [2022-04-08 12:40:07,492 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {109742#true} {110356#(< ~counter~0 93)} #96#return; {110356#(< ~counter~0 93)} is VALID [2022-04-08 12:40:07,492 INFO L290 TraceCheckUtils]: 70: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,492 INFO L290 TraceCheckUtils]: 69: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,492 INFO L290 TraceCheckUtils]: 68: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,492 INFO L272 TraceCheckUtils]: 67: Hoare triple {110356#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,492 INFO L290 TraceCheckUtils]: 66: Hoare triple {110356#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {110356#(< ~counter~0 93)} is VALID [2022-04-08 12:40:07,493 INFO L290 TraceCheckUtils]: 65: Hoare triple {110381#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110356#(< ~counter~0 93)} is VALID [2022-04-08 12:40:07,493 INFO L290 TraceCheckUtils]: 64: Hoare triple {110381#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110381#(< ~counter~0 92)} is VALID [2022-04-08 12:40:07,494 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109742#true} {110381#(< ~counter~0 92)} #96#return; {110381#(< ~counter~0 92)} is VALID [2022-04-08 12:40:07,494 INFO L290 TraceCheckUtils]: 62: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,494 INFO L290 TraceCheckUtils]: 61: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,494 INFO L290 TraceCheckUtils]: 60: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,494 INFO L272 TraceCheckUtils]: 59: Hoare triple {110381#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,494 INFO L290 TraceCheckUtils]: 58: Hoare triple {110381#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {110381#(< ~counter~0 92)} is VALID [2022-04-08 12:40:07,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {110406#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110381#(< ~counter~0 92)} is VALID [2022-04-08 12:40:07,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {110406#(< ~counter~0 91)} assume !!(0 != ~r~0); {110406#(< ~counter~0 91)} is VALID [2022-04-08 12:40:07,496 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {109742#true} {110406#(< ~counter~0 91)} #94#return; {110406#(< ~counter~0 91)} is VALID [2022-04-08 12:40:07,496 INFO L290 TraceCheckUtils]: 54: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,496 INFO L290 TraceCheckUtils]: 53: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,496 INFO L290 TraceCheckUtils]: 52: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,496 INFO L272 TraceCheckUtils]: 51: Hoare triple {110406#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,496 INFO L290 TraceCheckUtils]: 50: Hoare triple {110406#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {110406#(< ~counter~0 91)} is VALID [2022-04-08 12:40:07,497 INFO L290 TraceCheckUtils]: 49: Hoare triple {110431#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110406#(< ~counter~0 91)} is VALID [2022-04-08 12:40:07,498 INFO L290 TraceCheckUtils]: 48: Hoare triple {110431#(< ~counter~0 90)} assume !(~r~0 < 0); {110431#(< ~counter~0 90)} is VALID [2022-04-08 12:40:07,498 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {109742#true} {110431#(< ~counter~0 90)} #98#return; {110431#(< ~counter~0 90)} is VALID [2022-04-08 12:40:07,498 INFO L290 TraceCheckUtils]: 46: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,498 INFO L272 TraceCheckUtils]: 43: Hoare triple {110431#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {110431#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {110431#(< ~counter~0 90)} is VALID [2022-04-08 12:40:07,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {110456#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110431#(< ~counter~0 90)} is VALID [2022-04-08 12:40:07,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {110456#(< ~counter~0 89)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110456#(< ~counter~0 89)} is VALID [2022-04-08 12:40:07,500 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109742#true} {110456#(< ~counter~0 89)} #98#return; {110456#(< ~counter~0 89)} is VALID [2022-04-08 12:40:07,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,501 INFO L272 TraceCheckUtils]: 35: Hoare triple {110456#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {110456#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {110456#(< ~counter~0 89)} is VALID [2022-04-08 12:40:07,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {110481#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110456#(< ~counter~0 89)} is VALID [2022-04-08 12:40:07,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {110481#(< ~counter~0 88)} assume !(~r~0 > 0); {110481#(< ~counter~0 88)} is VALID [2022-04-08 12:40:07,502 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {109742#true} {110481#(< ~counter~0 88)} #96#return; {110481#(< ~counter~0 88)} is VALID [2022-04-08 12:40:07,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,503 INFO L272 TraceCheckUtils]: 27: Hoare triple {110481#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {110481#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {110481#(< ~counter~0 88)} is VALID [2022-04-08 12:40:07,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {110506#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110481#(< ~counter~0 88)} is VALID [2022-04-08 12:40:07,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {110506#(< ~counter~0 87)} assume !!(0 != ~r~0); {110506#(< ~counter~0 87)} is VALID [2022-04-08 12:40:07,505 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {109742#true} {110506#(< ~counter~0 87)} #94#return; {110506#(< ~counter~0 87)} is VALID [2022-04-08 12:40:07,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,505 INFO L272 TraceCheckUtils]: 19: Hoare triple {110506#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {110506#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {110506#(< ~counter~0 87)} is VALID [2022-04-08 12:40:07,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {110531#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110506#(< ~counter~0 87)} is VALID [2022-04-08 12:40:07,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {110531#(< ~counter~0 86)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {110531#(< ~counter~0 86)} is VALID [2022-04-08 12:40:07,507 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109742#true} {110531#(< ~counter~0 86)} #92#return; {110531#(< ~counter~0 86)} is VALID [2022-04-08 12:40:07,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,507 INFO L272 TraceCheckUtils]: 11: Hoare triple {110531#(< ~counter~0 86)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,507 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109742#true} {110531#(< ~counter~0 86)} #90#return; {110531#(< ~counter~0 86)} is VALID [2022-04-08 12:40:07,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 12:40:07,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 12:40:07,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 12:40:07,507 INFO L272 TraceCheckUtils]: 6: Hoare triple {110531#(< ~counter~0 86)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 12:40:07,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {110531#(< ~counter~0 86)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {110531#(< ~counter~0 86)} is VALID [2022-04-08 12:40:07,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {110531#(< ~counter~0 86)} call #t~ret9 := main(); {110531#(< ~counter~0 86)} is VALID [2022-04-08 12:40:07,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110531#(< ~counter~0 86)} {109742#true} #102#return; {110531#(< ~counter~0 86)} is VALID [2022-04-08 12:40:07,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {110531#(< ~counter~0 86)} assume true; {110531#(< ~counter~0 86)} is VALID [2022-04-08 12:40:07,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {109742#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {110531#(< ~counter~0 86)} is VALID [2022-04-08 12:40:07,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {109742#true} call ULTIMATE.init(); {109742#true} is VALID [2022-04-08 12:40:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 144 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-08 12:40:07,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:40:07,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554397704] [2022-04-08 12:40:07,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:40:07,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801422679] [2022-04-08 12:40:07,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801422679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:40:07,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:40:07,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-08 12:40:07,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:40:07,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [797056436] [2022-04-08 12:40:07,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [797056436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:40:07,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:40:07,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 12:40:07,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705004306] [2022-04-08 12:40:07,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:40:07,511 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 135 [2022-04-08 12:40:07,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:40:07,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:40:07,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:40:07,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 12:40:07,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:07,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 12:40:07,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 12:40:07,646 INFO L87 Difference]: Start difference. First operand 683 states and 912 transitions. Second operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:40:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:11,495 INFO L93 Difference]: Finished difference Result 734 states and 982 transitions. [2022-04-08 12:40:11,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 12:40:11,495 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 135 [2022-04-08 12:40:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:40:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:40:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-08 12:40:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:40:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-08 12:40:11,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 294 transitions. [2022-04-08 12:40:11,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:40:11,820 INFO L225 Difference]: With dead ends: 734 [2022-04-08 12:40:11,820 INFO L226 Difference]: Without dead ends: 729 [2022-04-08 12:40:11,821 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-08 12:40:11,821 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 190 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 12:40:11,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 351 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 12:40:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-04-08 12:40:14,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 707. [2022-04-08 12:40:14,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:40:14,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 12:40:14,139 INFO L74 IsIncluded]: Start isIncluded. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 12:40:14,139 INFO L87 Difference]: Start difference. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 12:40:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:14,156 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-08 12:40:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-08 12:40:14,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:40:14,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:40:14,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 729 states. [2022-04-08 12:40:14,158 INFO L87 Difference]: Start difference. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 729 states. [2022-04-08 12:40:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:14,181 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-08 12:40:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-08 12:40:14,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:40:14,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:40:14,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:40:14,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:40:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 12:40:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-08 12:40:14,212 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 135 [2022-04-08 12:40:14,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:40:14,213 INFO L478 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-08 12:40:14,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:40:14,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-08 12:40:19,483 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-08 12:40:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-08 12:40:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-08 12:40:19,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:40:19,484 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:40:19,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-08 12:40:19,684 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:40:19,685 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:40:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:40:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 21 times [2022-04-08 12:40:19,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:19,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1251143470] [2022-04-08 12:40:19,685 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:40:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 22 times [2022-04-08 12:40:19,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:40:19,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317067995] [2022-04-08 12:40:19,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:40:19,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:40:19,698 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:40:19,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711239355] [2022-04-08 12:40:19,698 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:40:19,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:40:19,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:40:19,699 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:40:19,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-08 12:40:19,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:40:19,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:40:19,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 12:40:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:40:19,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:42:27,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {114947#true} call ULTIMATE.init(); {114947#true} is VALID [2022-04-08 12:42:27,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {114947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {114947#true} is VALID [2022-04-08 12:42:27,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:27,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114947#true} {114947#true} #102#return; {114947#true} is VALID [2022-04-08 12:42:27,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {114947#true} call #t~ret9 := main(); {114947#true} is VALID [2022-04-08 12:42:27,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {114947#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {114947#true} is VALID [2022-04-08 12:42:27,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {114947#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:27,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:27,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:27,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:27,707 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {114947#true} {114947#true} #90#return; {114947#true} is VALID [2022-04-08 12:42:27,707 INFO L272 TraceCheckUtils]: 11: Hoare triple {114947#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:27,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {114947#true} ~cond := #in~cond; {114988#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 12:42:27,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {114988#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {114992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:42:27,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {114992#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {114992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:42:27,708 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {114992#(not (= |assume_abort_if_not_#in~cond| 0))} {114947#true} #92#return; {114999#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1))} is VALID [2022-04-08 12:42:29,710 WARN L290 TraceCheckUtils]: 16: Hoare triple {114999#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1))} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is UNKNOWN [2022-04-08 12:42:29,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 12:42:29,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(#t~post6 < 100);havoc #t~post6; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 12:42:29,711 INFO L272 TraceCheckUtils]: 19: Hoare triple {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:29,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:29,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:29,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:29,712 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {114947#true} {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #94#return; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 12:42:29,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(0 != ~r~0); {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 12:42:29,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 12:42:29,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(#t~post7 < 100);havoc #t~post7; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 12:42:29,713 INFO L272 TraceCheckUtils]: 27: Hoare triple {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:29,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:29,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:29,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:29,714 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {114947#true} {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #96#return; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 12:42:29,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !(~r~0 > 0); {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 12:42:29,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 12:42:29,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(#t~post8 < 100);havoc #t~post8; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 12:42:29,715 INFO L272 TraceCheckUtils]: 35: Hoare triple {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:29,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:29,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:29,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:29,716 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {114947#true} {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #98#return; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 12:42:31,720 WARN L290 TraceCheckUtils]: 40: Hoare triple {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is UNKNOWN [2022-04-08 12:42:31,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 12:42:31,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(#t~post8 < 100);havoc #t~post8; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 12:42:31,723 INFO L272 TraceCheckUtils]: 43: Hoare triple {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:31,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:31,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:31,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:31,724 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {114947#true} {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #98#return; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 12:42:31,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !(~r~0 < 0); {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 12:42:31,726 INFO L290 TraceCheckUtils]: 49: Hoare triple {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 12:42:31,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(#t~post6 < 100);havoc #t~post6; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 12:42:31,727 INFO L272 TraceCheckUtils]: 51: Hoare triple {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:31,727 INFO L290 TraceCheckUtils]: 52: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:31,727 INFO L290 TraceCheckUtils]: 53: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:31,727 INFO L290 TraceCheckUtils]: 54: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:31,728 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {114947#true} {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #94#return; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 12:42:31,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(0 != ~r~0); {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 12:42:31,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 12:42:31,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(#t~post7 < 100);havoc #t~post7; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 12:42:31,735 INFO L272 TraceCheckUtils]: 59: Hoare triple {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:31,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:31,735 INFO L290 TraceCheckUtils]: 61: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:31,735 INFO L290 TraceCheckUtils]: 62: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:31,735 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {114947#true} {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #96#return; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 12:42:31,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115149#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-08 12:42:31,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {115149#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115149#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-08 12:42:31,753 INFO L290 TraceCheckUtils]: 66: Hoare triple {115149#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {115149#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-08 12:42:31,753 INFO L272 TraceCheckUtils]: 67: Hoare triple {115149#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:31,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:31,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:31,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:31,753 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {114947#true} {115149#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} #96#return; {115149#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-08 12:42:31,755 INFO L290 TraceCheckUtils]: 72: Hoare triple {115149#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 12:42:31,755 INFO L290 TraceCheckUtils]: 73: Hoare triple {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 12:42:31,757 INFO L290 TraceCheckUtils]: 74: Hoare triple {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post7 < 100);havoc #t~post7; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 12:42:31,757 INFO L272 TraceCheckUtils]: 75: Hoare triple {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:31,757 INFO L290 TraceCheckUtils]: 76: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:31,757 INFO L290 TraceCheckUtils]: 77: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:31,757 INFO L290 TraceCheckUtils]: 78: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:31,758 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {114947#true} {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #96#return; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 12:42:31,767 INFO L290 TraceCheckUtils]: 80: Hoare triple {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !(~r~0 > 0); {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 12:42:31,768 INFO L290 TraceCheckUtils]: 81: Hoare triple {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 12:42:31,768 INFO L290 TraceCheckUtils]: 82: Hoare triple {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post8 < 100);havoc #t~post8; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 12:42:31,768 INFO L272 TraceCheckUtils]: 83: Hoare triple {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:31,769 INFO L290 TraceCheckUtils]: 84: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:31,769 INFO L290 TraceCheckUtils]: 85: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:31,769 INFO L290 TraceCheckUtils]: 86: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:31,769 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {114947#true} {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #98#return; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 12:42:31,773 INFO L290 TraceCheckUtils]: 88: Hoare triple {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 12:42:31,775 INFO L290 TraceCheckUtils]: 89: Hoare triple {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 12:42:31,776 INFO L290 TraceCheckUtils]: 90: Hoare triple {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(#t~post8 < 100);havoc #t~post8; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 12:42:31,776 INFO L272 TraceCheckUtils]: 91: Hoare triple {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:31,776 INFO L290 TraceCheckUtils]: 92: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:31,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:31,776 INFO L290 TraceCheckUtils]: 94: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:31,777 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {114947#true} {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #98#return; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 12:42:31,785 INFO L290 TraceCheckUtils]: 96: Hoare triple {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !(~r~0 < 0); {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 12:42:31,795 INFO L290 TraceCheckUtils]: 97: Hoare triple {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 12:42:31,797 INFO L290 TraceCheckUtils]: 98: Hoare triple {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(#t~post6 < 100);havoc #t~post6; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 12:42:31,797 INFO L272 TraceCheckUtils]: 99: Hoare triple {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:31,797 INFO L290 TraceCheckUtils]: 100: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:31,797 INFO L290 TraceCheckUtils]: 101: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:31,797 INFO L290 TraceCheckUtils]: 102: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:31,798 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {114947#true} {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #94#return; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 12:42:31,799 INFO L290 TraceCheckUtils]: 104: Hoare triple {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(0 != ~r~0); {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 12:42:31,800 INFO L290 TraceCheckUtils]: 105: Hoare triple {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 12:42:31,805 INFO L290 TraceCheckUtils]: 106: Hoare triple {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(#t~post7 < 100);havoc #t~post7; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 12:42:31,805 INFO L272 TraceCheckUtils]: 107: Hoare triple {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:31,805 INFO L290 TraceCheckUtils]: 108: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:31,805 INFO L290 TraceCheckUtils]: 109: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:31,805 INFO L290 TraceCheckUtils]: 110: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:31,806 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {114947#true} {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #96#return; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 12:42:31,807 INFO L290 TraceCheckUtils]: 112: Hoare triple {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 12:42:31,809 INFO L290 TraceCheckUtils]: 113: Hoare triple {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 12:42:32,978 WARN L290 TraceCheckUtils]: 114: Hoare triple {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !!(#t~post7 < 100);havoc #t~post7; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is UNKNOWN [2022-04-08 12:42:32,978 INFO L272 TraceCheckUtils]: 115: Hoare triple {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:32,979 INFO L290 TraceCheckUtils]: 116: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:32,979 INFO L290 TraceCheckUtils]: 117: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:32,979 INFO L290 TraceCheckUtils]: 118: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:32,979 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {114947#true} {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #96#return; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 12:42:32,982 INFO L290 TraceCheckUtils]: 120: Hoare triple {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !(~r~0 > 0); {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 12:42:32,983 INFO L290 TraceCheckUtils]: 121: Hoare triple {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 12:42:32,984 INFO L290 TraceCheckUtils]: 122: Hoare triple {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !!(#t~post8 < 100);havoc #t~post8; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 12:42:32,984 INFO L272 TraceCheckUtils]: 123: Hoare triple {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:32,984 INFO L290 TraceCheckUtils]: 124: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:32,984 INFO L290 TraceCheckUtils]: 125: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:32,984 INFO L290 TraceCheckUtils]: 126: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:32,985 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {114947#true} {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #98#return; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 12:42:32,988 INFO L290 TraceCheckUtils]: 128: Hoare triple {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {114948#false} is VALID [2022-04-08 12:42:32,988 INFO L290 TraceCheckUtils]: 129: Hoare triple {114948#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {114948#false} is VALID [2022-04-08 12:42:32,988 INFO L290 TraceCheckUtils]: 130: Hoare triple {114948#false} assume !(#t~post8 < 100);havoc #t~post8; {114948#false} is VALID [2022-04-08 12:42:32,988 INFO L290 TraceCheckUtils]: 131: Hoare triple {114948#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {114948#false} is VALID [2022-04-08 12:42:32,988 INFO L290 TraceCheckUtils]: 132: Hoare triple {114948#false} assume !(#t~post6 < 100);havoc #t~post6; {114948#false} is VALID [2022-04-08 12:42:32,988 INFO L272 TraceCheckUtils]: 133: Hoare triple {114948#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114948#false} is VALID [2022-04-08 12:42:32,988 INFO L290 TraceCheckUtils]: 134: Hoare triple {114948#false} ~cond := #in~cond; {114948#false} is VALID [2022-04-08 12:42:32,988 INFO L290 TraceCheckUtils]: 135: Hoare triple {114948#false} assume 0 == ~cond; {114948#false} is VALID [2022-04-08 12:42:32,988 INFO L290 TraceCheckUtils]: 136: Hoare triple {114948#false} assume !false; {114948#false} is VALID [2022-04-08 12:42:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 47 proven. 112 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-04-08 12:42:32,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:42:35,252 INFO L290 TraceCheckUtils]: 136: Hoare triple {114948#false} assume !false; {114948#false} is VALID [2022-04-08 12:42:35,252 INFO L290 TraceCheckUtils]: 135: Hoare triple {114948#false} assume 0 == ~cond; {114948#false} is VALID [2022-04-08 12:42:35,252 INFO L290 TraceCheckUtils]: 134: Hoare triple {114948#false} ~cond := #in~cond; {114948#false} is VALID [2022-04-08 12:42:35,252 INFO L272 TraceCheckUtils]: 133: Hoare triple {114948#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114948#false} is VALID [2022-04-08 12:42:35,252 INFO L290 TraceCheckUtils]: 132: Hoare triple {114948#false} assume !(#t~post6 < 100);havoc #t~post6; {114948#false} is VALID [2022-04-08 12:42:35,252 INFO L290 TraceCheckUtils]: 131: Hoare triple {114948#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {114948#false} is VALID [2022-04-08 12:42:35,252 INFO L290 TraceCheckUtils]: 130: Hoare triple {114948#false} assume !(#t~post8 < 100);havoc #t~post8; {114948#false} is VALID [2022-04-08 12:42:35,253 INFO L290 TraceCheckUtils]: 129: Hoare triple {114948#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {114948#false} is VALID [2022-04-08 12:42:35,259 INFO L290 TraceCheckUtils]: 128: Hoare triple {115393#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {114948#false} is VALID [2022-04-08 12:42:35,260 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {114947#true} {115393#(not (< main_~r~0 0))} #98#return; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 12:42:35,260 INFO L290 TraceCheckUtils]: 126: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,260 INFO L290 TraceCheckUtils]: 125: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,260 INFO L290 TraceCheckUtils]: 124: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,260 INFO L272 TraceCheckUtils]: 123: Hoare triple {115393#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,261 INFO L290 TraceCheckUtils]: 122: Hoare triple {115393#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 12:42:35,261 INFO L290 TraceCheckUtils]: 121: Hoare triple {115393#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 12:42:35,261 INFO L290 TraceCheckUtils]: 120: Hoare triple {115393#(not (< main_~r~0 0))} assume !(~r~0 > 0); {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 12:42:35,262 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {114947#true} {115393#(not (< main_~r~0 0))} #96#return; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 12:42:35,262 INFO L290 TraceCheckUtils]: 118: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,262 INFO L290 TraceCheckUtils]: 117: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,262 INFO L290 TraceCheckUtils]: 116: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,262 INFO L272 TraceCheckUtils]: 115: Hoare triple {115393#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,263 INFO L290 TraceCheckUtils]: 114: Hoare triple {115393#(not (< main_~r~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 12:42:35,263 INFO L290 TraceCheckUtils]: 113: Hoare triple {115393#(not (< main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 12:42:35,265 INFO L290 TraceCheckUtils]: 112: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 12:42:35,266 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {114947#true} {115442#(<= main_~v~0 main_~r~0)} #96#return; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 12:42:35,266 INFO L290 TraceCheckUtils]: 110: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,266 INFO L290 TraceCheckUtils]: 109: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,266 INFO L290 TraceCheckUtils]: 108: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,266 INFO L272 TraceCheckUtils]: 107: Hoare triple {115442#(<= main_~v~0 main_~r~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,266 INFO L290 TraceCheckUtils]: 106: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(#t~post7 < 100);havoc #t~post7; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 12:42:35,267 INFO L290 TraceCheckUtils]: 105: Hoare triple {115442#(<= main_~v~0 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 12:42:35,267 INFO L290 TraceCheckUtils]: 104: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(0 != ~r~0); {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 12:42:35,268 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {114947#true} {115442#(<= main_~v~0 main_~r~0)} #94#return; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 12:42:35,268 INFO L290 TraceCheckUtils]: 102: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,268 INFO L290 TraceCheckUtils]: 101: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,269 INFO L290 TraceCheckUtils]: 100: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,269 INFO L272 TraceCheckUtils]: 99: Hoare triple {115442#(<= main_~v~0 main_~r~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,269 INFO L290 TraceCheckUtils]: 98: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(#t~post6 < 100);havoc #t~post6; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 12:42:35,270 INFO L290 TraceCheckUtils]: 97: Hoare triple {115442#(<= main_~v~0 main_~r~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 12:42:35,270 INFO L290 TraceCheckUtils]: 96: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !(~r~0 < 0); {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 12:42:35,271 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {114947#true} {115442#(<= main_~v~0 main_~r~0)} #98#return; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 12:42:35,271 INFO L290 TraceCheckUtils]: 94: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,271 INFO L290 TraceCheckUtils]: 93: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,271 INFO L290 TraceCheckUtils]: 92: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,271 INFO L272 TraceCheckUtils]: 91: Hoare triple {115442#(<= main_~v~0 main_~r~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,271 INFO L290 TraceCheckUtils]: 90: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(#t~post8 < 100);havoc #t~post8; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 12:42:35,272 INFO L290 TraceCheckUtils]: 89: Hoare triple {115442#(<= main_~v~0 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 12:42:35,275 INFO L290 TraceCheckUtils]: 88: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 12:42:35,275 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {114947#true} {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:42:35,275 INFO L290 TraceCheckUtils]: 86: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,275 INFO L290 TraceCheckUtils]: 85: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,276 INFO L290 TraceCheckUtils]: 84: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,276 INFO L272 TraceCheckUtils]: 83: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,276 INFO L290 TraceCheckUtils]: 82: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:42:35,276 INFO L290 TraceCheckUtils]: 81: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:42:35,277 INFO L290 TraceCheckUtils]: 80: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:42:35,277 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {114947#true} {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:42:35,278 INFO L290 TraceCheckUtils]: 78: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,278 INFO L290 TraceCheckUtils]: 77: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,278 INFO L290 TraceCheckUtils]: 76: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,278 INFO L272 TraceCheckUtils]: 75: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:42:35,279 INFO L290 TraceCheckUtils]: 73: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:42:35,280 INFO L290 TraceCheckUtils]: 72: Hoare triple {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 12:42:35,280 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {114947#true} {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #96#return; {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-08 12:42:35,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,281 INFO L290 TraceCheckUtils]: 69: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,281 INFO L290 TraceCheckUtils]: 68: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,281 INFO L272 TraceCheckUtils]: 67: Hoare triple {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,281 INFO L290 TraceCheckUtils]: 66: Hoare triple {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-08 12:42:35,281 INFO L290 TraceCheckUtils]: 65: Hoare triple {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-08 12:42:35,283 INFO L290 TraceCheckUtils]: 64: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-08 12:42:35,284 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {114947#true} {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #96#return; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 12:42:35,284 INFO L290 TraceCheckUtils]: 62: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,284 INFO L290 TraceCheckUtils]: 61: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,284 INFO L290 TraceCheckUtils]: 60: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,284 INFO L272 TraceCheckUtils]: 59: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post7 < 100);havoc #t~post7; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 12:42:35,285 INFO L290 TraceCheckUtils]: 57: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 12:42:35,285 INFO L290 TraceCheckUtils]: 56: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(0 != ~r~0); {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 12:42:35,286 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {114947#true} {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #94#return; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 12:42:35,286 INFO L290 TraceCheckUtils]: 54: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,286 INFO L290 TraceCheckUtils]: 52: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,286 INFO L272 TraceCheckUtils]: 51: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,287 INFO L290 TraceCheckUtils]: 50: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post6 < 100);havoc #t~post6; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 12:42:35,287 INFO L290 TraceCheckUtils]: 49: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 12:42:35,287 INFO L290 TraceCheckUtils]: 48: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !(~r~0 < 0); {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 12:42:35,288 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {114947#true} {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #98#return; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 12:42:35,288 INFO L290 TraceCheckUtils]: 46: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,288 INFO L290 TraceCheckUtils]: 44: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,288 INFO L272 TraceCheckUtils]: 43: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post8 < 100);havoc #t~post8; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 12:42:35,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 12:42:35,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 12:42:35,293 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {114947#true} {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #98#return; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 12:42:35,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,293 INFO L272 TraceCheckUtils]: 35: Hoare triple {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(#t~post8 < 100);havoc #t~post8; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 12:42:35,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 12:42:35,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !(~r~0 > 0); {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 12:42:35,303 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {114947#true} {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #96#return; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 12:42:35,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,303 INFO L272 TraceCheckUtils]: 27: Hoare triple {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(#t~post7 < 100);havoc #t~post7; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 12:42:35,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 12:42:35,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(0 != ~r~0); {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 12:42:35,305 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {114947#true} {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #94#return; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 12:42:35,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,305 INFO L272 TraceCheckUtils]: 19: Hoare triple {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(#t~post6 < 100);havoc #t~post6; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 12:42:35,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 12:42:35,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {115735#(forall ((main_~R~0 Int)) (or (<= 2 main_~R~0) (<= (+ (* main_~R~0 main_~R~0) (* main_~R~0 2)) main_~A~0) (not (< (* main_~R~0 main_~R~0) main_~A~0))))} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 12:42:35,309 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {114992#(not (= |assume_abort_if_not_#in~cond| 0))} {114947#true} #92#return; {115735#(forall ((main_~R~0 Int)) (or (<= 2 main_~R~0) (<= (+ (* main_~R~0 main_~R~0) (* main_~R~0 2)) main_~A~0) (not (< (* main_~R~0 main_~R~0) main_~A~0))))} is VALID [2022-04-08 12:42:35,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {114992#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {114992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:42:35,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {115748#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {114992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:42:35,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {114947#true} ~cond := #in~cond; {115748#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 12:42:35,310 INFO L272 TraceCheckUtils]: 11: Hoare triple {114947#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {114947#true} {114947#true} #90#return; {114947#true} is VALID [2022-04-08 12:42:35,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 12:42:35,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 12:42:35,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {114947#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 12:42:35,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {114947#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {114947#true} is VALID [2022-04-08 12:42:35,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {114947#true} call #t~ret9 := main(); {114947#true} is VALID [2022-04-08 12:42:35,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114947#true} {114947#true} #102#return; {114947#true} is VALID [2022-04-08 12:42:35,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 12:42:35,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {114947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {114947#true} is VALID [2022-04-08 12:42:35,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {114947#true} call ULTIMATE.init(); {114947#true} is VALID [2022-04-08 12:42:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 67 proven. 92 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-04-08 12:42:35,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:42:35,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317067995] [2022-04-08 12:42:35,311 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:42:35,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711239355] [2022-04-08 12:42:35,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711239355] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:42:35,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:42:35,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-08 12:42:35,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:42:35,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1251143470] [2022-04-08 12:42:35,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1251143470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:42:35,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:42:35,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 12:42:35,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058979983] [2022-04-08 12:42:35,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:42:35,312 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) Word has length 137 [2022-04-08 12:42:35,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:42:35,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-08 12:42:45,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 93 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-08 12:42:45,210 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 12:42:45,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:45,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 12:42:45,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=289, Unknown=2, NotChecked=0, Total=342 [2022-04-08 12:42:45,211 INFO L87 Difference]: Start difference. First operand 707 states and 950 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-08 12:42:51,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:42:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:57,591 INFO L93 Difference]: Finished difference Result 964 states and 1336 transitions. [2022-04-08 12:42:57,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 12:42:57,591 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) Word has length 137 [2022-04-08 12:42:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:42:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-08 12:42:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-08 12:42:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-08 12:42:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-08 12:42:57,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-08 12:43:02,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 159 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:02,300 INFO L225 Difference]: With dead ends: 964 [2022-04-08 12:43:02,300 INFO L226 Difference]: Without dead ends: 851 [2022-04-08 12:43:02,300 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=69, Invalid=391, Unknown=2, NotChecked=0, Total=462 [2022-04-08 12:43:02,301 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 26 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 12:43:02,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 559 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 1 Unknown, 285 Unchecked, 3.5s Time] [2022-04-08 12:43:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-08 12:43:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 707. [2022-04-08 12:43:04,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:43:04,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 12:43:04,783 INFO L74 IsIncluded]: Start isIncluded. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 12:43:04,783 INFO L87 Difference]: Start difference. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 12:43:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:04,807 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-08 12:43:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-08 12:43:04,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:04,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:04,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 851 states. [2022-04-08 12:43:04,809 INFO L87 Difference]: Start difference. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 851 states. [2022-04-08 12:43:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:04,833 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-08 12:43:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-08 12:43:04,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:04,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:04,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:43:04,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:43:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 12:43:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-08 12:43:04,857 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 137 [2022-04-08 12:43:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:43:04,857 INFO L478 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-08 12:43:04,857 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-08 12:43:04,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-08 12:43:15,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 948 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-08 12:43:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-08 12:43:15,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:43:15,489 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:43:15,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-08 12:43:15,689 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:43:15,690 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:43:15,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:43:15,690 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 23 times [2022-04-08 12:43:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:43:15,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1127749500] [2022-04-08 12:43:15,690 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:43:15,690 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 24 times [2022-04-08 12:43:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:43:15,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297119329] [2022-04-08 12:43:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:43:15,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:43:15,704 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:43:15,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [724418200] [2022-04-08 12:43:15,704 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:43:15,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:43:15,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:43:15,705 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:43:15,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-08 12:43:15,891 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 12:43:15,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:43:15,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 12:43:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:43:15,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:43:16,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {120837#true} call ULTIMATE.init(); {120837#true} is VALID [2022-04-08 12:43:16,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {120837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {120845#(<= ~counter~0 0)} assume true; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120845#(<= ~counter~0 0)} {120837#true} #102#return; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {120845#(<= ~counter~0 0)} call #t~ret9 := main(); {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {120845#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {120845#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {120845#(<= ~counter~0 0)} ~cond := #in~cond; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {120845#(<= ~counter~0 0)} assume !(0 == ~cond); {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {120845#(<= ~counter~0 0)} assume true; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {120845#(<= ~counter~0 0)} {120845#(<= ~counter~0 0)} #90#return; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,668 INFO L272 TraceCheckUtils]: 11: Hoare triple {120845#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {120845#(<= ~counter~0 0)} ~cond := #in~cond; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {120845#(<= ~counter~0 0)} assume !(0 == ~cond); {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {120845#(<= ~counter~0 0)} assume true; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,670 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {120845#(<= ~counter~0 0)} {120845#(<= ~counter~0 0)} #92#return; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {120845#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:16,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {120845#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {120894#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:16,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {120894#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {120894#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:16,673 INFO L272 TraceCheckUtils]: 19: Hoare triple {120894#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120894#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:16,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {120894#(<= ~counter~0 1)} ~cond := #in~cond; {120894#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:16,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {120894#(<= ~counter~0 1)} assume !(0 == ~cond); {120894#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:16,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {120894#(<= ~counter~0 1)} assume true; {120894#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:16,674 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120894#(<= ~counter~0 1)} {120894#(<= ~counter~0 1)} #94#return; {120894#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:16,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {120894#(<= ~counter~0 1)} assume !!(0 != ~r~0); {120894#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:16,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {120894#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120919#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:16,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {120919#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {120919#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:16,676 INFO L272 TraceCheckUtils]: 27: Hoare triple {120919#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120919#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:16,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {120919#(<= ~counter~0 2)} ~cond := #in~cond; {120919#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:16,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {120919#(<= ~counter~0 2)} assume !(0 == ~cond); {120919#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:16,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {120919#(<= ~counter~0 2)} assume true; {120919#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:16,677 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {120919#(<= ~counter~0 2)} {120919#(<= ~counter~0 2)} #96#return; {120919#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:16,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {120919#(<= ~counter~0 2)} assume !(~r~0 > 0); {120919#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:16,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {120919#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {120944#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:16,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {120944#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {120944#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:16,679 INFO L272 TraceCheckUtils]: 35: Hoare triple {120944#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120944#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:16,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {120944#(<= ~counter~0 3)} ~cond := #in~cond; {120944#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:16,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {120944#(<= ~counter~0 3)} assume !(0 == ~cond); {120944#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:16,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {120944#(<= ~counter~0 3)} assume true; {120944#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:16,681 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {120944#(<= ~counter~0 3)} {120944#(<= ~counter~0 3)} #98#return; {120944#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:16,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {120944#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {120944#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:16,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {120944#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {120969#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:16,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {120969#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {120969#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:16,683 INFO L272 TraceCheckUtils]: 43: Hoare triple {120969#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120969#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:16,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {120969#(<= ~counter~0 4)} ~cond := #in~cond; {120969#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:16,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {120969#(<= ~counter~0 4)} assume !(0 == ~cond); {120969#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:16,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {120969#(<= ~counter~0 4)} assume true; {120969#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:16,684 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {120969#(<= ~counter~0 4)} {120969#(<= ~counter~0 4)} #98#return; {120969#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:16,684 INFO L290 TraceCheckUtils]: 48: Hoare triple {120969#(<= ~counter~0 4)} assume !(~r~0 < 0); {120969#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:16,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {120969#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {120994#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:16,686 INFO L290 TraceCheckUtils]: 50: Hoare triple {120994#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {120994#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:16,686 INFO L272 TraceCheckUtils]: 51: Hoare triple {120994#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120994#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:16,686 INFO L290 TraceCheckUtils]: 52: Hoare triple {120994#(<= ~counter~0 5)} ~cond := #in~cond; {120994#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:16,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {120994#(<= ~counter~0 5)} assume !(0 == ~cond); {120994#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:16,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {120994#(<= ~counter~0 5)} assume true; {120994#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:16,687 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {120994#(<= ~counter~0 5)} {120994#(<= ~counter~0 5)} #94#return; {120994#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:16,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {120994#(<= ~counter~0 5)} assume !!(0 != ~r~0); {120994#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:16,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {120994#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121019#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:16,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {121019#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {121019#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:16,689 INFO L272 TraceCheckUtils]: 59: Hoare triple {121019#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121019#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:16,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {121019#(<= ~counter~0 6)} ~cond := #in~cond; {121019#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:16,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {121019#(<= ~counter~0 6)} assume !(0 == ~cond); {121019#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:16,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {121019#(<= ~counter~0 6)} assume true; {121019#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:16,691 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {121019#(<= ~counter~0 6)} {121019#(<= ~counter~0 6)} #96#return; {121019#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:16,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {121019#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121019#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:16,692 INFO L290 TraceCheckUtils]: 65: Hoare triple {121019#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121044#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:16,692 INFO L290 TraceCheckUtils]: 66: Hoare triple {121044#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {121044#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:16,693 INFO L272 TraceCheckUtils]: 67: Hoare triple {121044#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121044#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:16,693 INFO L290 TraceCheckUtils]: 68: Hoare triple {121044#(<= ~counter~0 7)} ~cond := #in~cond; {121044#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:16,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {121044#(<= ~counter~0 7)} assume !(0 == ~cond); {121044#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:16,694 INFO L290 TraceCheckUtils]: 70: Hoare triple {121044#(<= ~counter~0 7)} assume true; {121044#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:16,694 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {121044#(<= ~counter~0 7)} {121044#(<= ~counter~0 7)} #96#return; {121044#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:16,694 INFO L290 TraceCheckUtils]: 72: Hoare triple {121044#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121044#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:16,695 INFO L290 TraceCheckUtils]: 73: Hoare triple {121044#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121069#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:16,696 INFO L290 TraceCheckUtils]: 74: Hoare triple {121069#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {121069#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:16,696 INFO L272 TraceCheckUtils]: 75: Hoare triple {121069#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121069#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:16,696 INFO L290 TraceCheckUtils]: 76: Hoare triple {121069#(<= ~counter~0 8)} ~cond := #in~cond; {121069#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:16,697 INFO L290 TraceCheckUtils]: 77: Hoare triple {121069#(<= ~counter~0 8)} assume !(0 == ~cond); {121069#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:16,697 INFO L290 TraceCheckUtils]: 78: Hoare triple {121069#(<= ~counter~0 8)} assume true; {121069#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:16,697 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {121069#(<= ~counter~0 8)} {121069#(<= ~counter~0 8)} #96#return; {121069#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:16,698 INFO L290 TraceCheckUtils]: 80: Hoare triple {121069#(<= ~counter~0 8)} assume !(~r~0 > 0); {121069#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:16,699 INFO L290 TraceCheckUtils]: 81: Hoare triple {121069#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121094#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:16,699 INFO L290 TraceCheckUtils]: 82: Hoare triple {121094#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {121094#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:16,699 INFO L272 TraceCheckUtils]: 83: Hoare triple {121094#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121094#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:16,700 INFO L290 TraceCheckUtils]: 84: Hoare triple {121094#(<= ~counter~0 9)} ~cond := #in~cond; {121094#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:16,700 INFO L290 TraceCheckUtils]: 85: Hoare triple {121094#(<= ~counter~0 9)} assume !(0 == ~cond); {121094#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:16,700 INFO L290 TraceCheckUtils]: 86: Hoare triple {121094#(<= ~counter~0 9)} assume true; {121094#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:16,701 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {121094#(<= ~counter~0 9)} {121094#(<= ~counter~0 9)} #98#return; {121094#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:16,701 INFO L290 TraceCheckUtils]: 88: Hoare triple {121094#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121094#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:16,702 INFO L290 TraceCheckUtils]: 89: Hoare triple {121094#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121119#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:16,702 INFO L290 TraceCheckUtils]: 90: Hoare triple {121119#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {121119#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:16,703 INFO L272 TraceCheckUtils]: 91: Hoare triple {121119#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121119#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:16,703 INFO L290 TraceCheckUtils]: 92: Hoare triple {121119#(<= ~counter~0 10)} ~cond := #in~cond; {121119#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:16,703 INFO L290 TraceCheckUtils]: 93: Hoare triple {121119#(<= ~counter~0 10)} assume !(0 == ~cond); {121119#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:16,703 INFO L290 TraceCheckUtils]: 94: Hoare triple {121119#(<= ~counter~0 10)} assume true; {121119#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:16,704 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {121119#(<= ~counter~0 10)} {121119#(<= ~counter~0 10)} #98#return; {121119#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:16,704 INFO L290 TraceCheckUtils]: 96: Hoare triple {121119#(<= ~counter~0 10)} assume !(~r~0 < 0); {121119#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:16,705 INFO L290 TraceCheckUtils]: 97: Hoare triple {121119#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121144#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:16,705 INFO L290 TraceCheckUtils]: 98: Hoare triple {121144#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {121144#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:16,706 INFO L272 TraceCheckUtils]: 99: Hoare triple {121144#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121144#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:16,706 INFO L290 TraceCheckUtils]: 100: Hoare triple {121144#(<= ~counter~0 11)} ~cond := #in~cond; {121144#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:16,706 INFO L290 TraceCheckUtils]: 101: Hoare triple {121144#(<= ~counter~0 11)} assume !(0 == ~cond); {121144#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:16,707 INFO L290 TraceCheckUtils]: 102: Hoare triple {121144#(<= ~counter~0 11)} assume true; {121144#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:16,707 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {121144#(<= ~counter~0 11)} {121144#(<= ~counter~0 11)} #94#return; {121144#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:16,708 INFO L290 TraceCheckUtils]: 104: Hoare triple {121144#(<= ~counter~0 11)} assume !!(0 != ~r~0); {121144#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:16,709 INFO L290 TraceCheckUtils]: 105: Hoare triple {121144#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121169#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:16,709 INFO L290 TraceCheckUtils]: 106: Hoare triple {121169#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {121169#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:16,709 INFO L272 TraceCheckUtils]: 107: Hoare triple {121169#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121169#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:16,710 INFO L290 TraceCheckUtils]: 108: Hoare triple {121169#(<= ~counter~0 12)} ~cond := #in~cond; {121169#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:16,710 INFO L290 TraceCheckUtils]: 109: Hoare triple {121169#(<= ~counter~0 12)} assume !(0 == ~cond); {121169#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:16,710 INFO L290 TraceCheckUtils]: 110: Hoare triple {121169#(<= ~counter~0 12)} assume true; {121169#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:16,711 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {121169#(<= ~counter~0 12)} {121169#(<= ~counter~0 12)} #96#return; {121169#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:16,711 INFO L290 TraceCheckUtils]: 112: Hoare triple {121169#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121169#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:16,712 INFO L290 TraceCheckUtils]: 113: Hoare triple {121169#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121194#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:16,712 INFO L290 TraceCheckUtils]: 114: Hoare triple {121194#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {121194#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:16,713 INFO L272 TraceCheckUtils]: 115: Hoare triple {121194#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121194#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:16,713 INFO L290 TraceCheckUtils]: 116: Hoare triple {121194#(<= ~counter~0 13)} ~cond := #in~cond; {121194#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:16,713 INFO L290 TraceCheckUtils]: 117: Hoare triple {121194#(<= ~counter~0 13)} assume !(0 == ~cond); {121194#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:16,713 INFO L290 TraceCheckUtils]: 118: Hoare triple {121194#(<= ~counter~0 13)} assume true; {121194#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:16,714 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {121194#(<= ~counter~0 13)} {121194#(<= ~counter~0 13)} #96#return; {121194#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:16,714 INFO L290 TraceCheckUtils]: 120: Hoare triple {121194#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121194#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:16,715 INFO L290 TraceCheckUtils]: 121: Hoare triple {121194#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121219#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:16,716 INFO L290 TraceCheckUtils]: 122: Hoare triple {121219#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {121219#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:16,716 INFO L272 TraceCheckUtils]: 123: Hoare triple {121219#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121219#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:16,716 INFO L290 TraceCheckUtils]: 124: Hoare triple {121219#(<= ~counter~0 14)} ~cond := #in~cond; {121219#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:16,717 INFO L290 TraceCheckUtils]: 125: Hoare triple {121219#(<= ~counter~0 14)} assume !(0 == ~cond); {121219#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:16,717 INFO L290 TraceCheckUtils]: 126: Hoare triple {121219#(<= ~counter~0 14)} assume true; {121219#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:16,717 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {121219#(<= ~counter~0 14)} {121219#(<= ~counter~0 14)} #96#return; {121219#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:16,718 INFO L290 TraceCheckUtils]: 128: Hoare triple {121219#(<= ~counter~0 14)} assume !(~r~0 > 0); {121219#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:16,719 INFO L290 TraceCheckUtils]: 129: Hoare triple {121219#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121244#(<= ~counter~0 15)} is VALID [2022-04-08 12:43:16,719 INFO L290 TraceCheckUtils]: 130: Hoare triple {121244#(<= ~counter~0 15)} assume !(#t~post8 < 100);havoc #t~post8; {121244#(<= ~counter~0 15)} is VALID [2022-04-08 12:43:16,719 INFO L290 TraceCheckUtils]: 131: Hoare triple {121244#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121251#(<= |main_#t~post6| 15)} is VALID [2022-04-08 12:43:16,719 INFO L290 TraceCheckUtils]: 132: Hoare triple {121251#(<= |main_#t~post6| 15)} assume !(#t~post6 < 100);havoc #t~post6; {120838#false} is VALID [2022-04-08 12:43:16,720 INFO L272 TraceCheckUtils]: 133: Hoare triple {120838#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120838#false} is VALID [2022-04-08 12:43:16,720 INFO L290 TraceCheckUtils]: 134: Hoare triple {120838#false} ~cond := #in~cond; {120838#false} is VALID [2022-04-08 12:43:16,720 INFO L290 TraceCheckUtils]: 135: Hoare triple {120838#false} assume 0 == ~cond; {120838#false} is VALID [2022-04-08 12:43:16,720 INFO L290 TraceCheckUtils]: 136: Hoare triple {120838#false} assume !false; {120838#false} is VALID [2022-04-08 12:43:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 28 proven. 498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:43:16,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:43:17,673 INFO L290 TraceCheckUtils]: 136: Hoare triple {120838#false} assume !false; {120838#false} is VALID [2022-04-08 12:43:17,673 INFO L290 TraceCheckUtils]: 135: Hoare triple {120838#false} assume 0 == ~cond; {120838#false} is VALID [2022-04-08 12:43:17,673 INFO L290 TraceCheckUtils]: 134: Hoare triple {120838#false} ~cond := #in~cond; {120838#false} is VALID [2022-04-08 12:43:17,673 INFO L272 TraceCheckUtils]: 133: Hoare triple {120838#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120838#false} is VALID [2022-04-08 12:43:17,673 INFO L290 TraceCheckUtils]: 132: Hoare triple {121279#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {120838#false} is VALID [2022-04-08 12:43:17,674 INFO L290 TraceCheckUtils]: 131: Hoare triple {121283#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121279#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:43:17,674 INFO L290 TraceCheckUtils]: 130: Hoare triple {121283#(< ~counter~0 100)} assume !(#t~post8 < 100);havoc #t~post8; {121283#(< ~counter~0 100)} is VALID [2022-04-08 12:43:17,676 INFO L290 TraceCheckUtils]: 129: Hoare triple {121290#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121283#(< ~counter~0 100)} is VALID [2022-04-08 12:43:17,677 INFO L290 TraceCheckUtils]: 128: Hoare triple {121290#(< ~counter~0 99)} assume !(~r~0 > 0); {121290#(< ~counter~0 99)} is VALID [2022-04-08 12:43:17,677 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {120837#true} {121290#(< ~counter~0 99)} #96#return; {121290#(< ~counter~0 99)} is VALID [2022-04-08 12:43:17,677 INFO L290 TraceCheckUtils]: 126: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,677 INFO L290 TraceCheckUtils]: 125: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,677 INFO L290 TraceCheckUtils]: 124: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,677 INFO L272 TraceCheckUtils]: 123: Hoare triple {121290#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,678 INFO L290 TraceCheckUtils]: 122: Hoare triple {121290#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {121290#(< ~counter~0 99)} is VALID [2022-04-08 12:43:17,679 INFO L290 TraceCheckUtils]: 121: Hoare triple {121315#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121290#(< ~counter~0 99)} is VALID [2022-04-08 12:43:17,679 INFO L290 TraceCheckUtils]: 120: Hoare triple {121315#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121315#(< ~counter~0 98)} is VALID [2022-04-08 12:43:17,680 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {120837#true} {121315#(< ~counter~0 98)} #96#return; {121315#(< ~counter~0 98)} is VALID [2022-04-08 12:43:17,680 INFO L290 TraceCheckUtils]: 118: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,680 INFO L290 TraceCheckUtils]: 117: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,680 INFO L290 TraceCheckUtils]: 116: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,680 INFO L272 TraceCheckUtils]: 115: Hoare triple {121315#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,680 INFO L290 TraceCheckUtils]: 114: Hoare triple {121315#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {121315#(< ~counter~0 98)} is VALID [2022-04-08 12:43:17,682 INFO L290 TraceCheckUtils]: 113: Hoare triple {121340#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121315#(< ~counter~0 98)} is VALID [2022-04-08 12:43:17,682 INFO L290 TraceCheckUtils]: 112: Hoare triple {121340#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121340#(< ~counter~0 97)} is VALID [2022-04-08 12:43:17,682 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {120837#true} {121340#(< ~counter~0 97)} #96#return; {121340#(< ~counter~0 97)} is VALID [2022-04-08 12:43:17,683 INFO L290 TraceCheckUtils]: 110: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,683 INFO L290 TraceCheckUtils]: 109: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,683 INFO L290 TraceCheckUtils]: 108: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,683 INFO L272 TraceCheckUtils]: 107: Hoare triple {121340#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,683 INFO L290 TraceCheckUtils]: 106: Hoare triple {121340#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {121340#(< ~counter~0 97)} is VALID [2022-04-08 12:43:17,684 INFO L290 TraceCheckUtils]: 105: Hoare triple {121365#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121340#(< ~counter~0 97)} is VALID [2022-04-08 12:43:17,684 INFO L290 TraceCheckUtils]: 104: Hoare triple {121365#(< ~counter~0 96)} assume !!(0 != ~r~0); {121365#(< ~counter~0 96)} is VALID [2022-04-08 12:43:17,685 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {120837#true} {121365#(< ~counter~0 96)} #94#return; {121365#(< ~counter~0 96)} is VALID [2022-04-08 12:43:17,685 INFO L290 TraceCheckUtils]: 102: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,685 INFO L290 TraceCheckUtils]: 101: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,685 INFO L290 TraceCheckUtils]: 100: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,685 INFO L272 TraceCheckUtils]: 99: Hoare triple {121365#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,685 INFO L290 TraceCheckUtils]: 98: Hoare triple {121365#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {121365#(< ~counter~0 96)} is VALID [2022-04-08 12:43:17,687 INFO L290 TraceCheckUtils]: 97: Hoare triple {121390#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121365#(< ~counter~0 96)} is VALID [2022-04-08 12:43:17,687 INFO L290 TraceCheckUtils]: 96: Hoare triple {121390#(< ~counter~0 95)} assume !(~r~0 < 0); {121390#(< ~counter~0 95)} is VALID [2022-04-08 12:43:17,688 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {120837#true} {121390#(< ~counter~0 95)} #98#return; {121390#(< ~counter~0 95)} is VALID [2022-04-08 12:43:17,688 INFO L290 TraceCheckUtils]: 94: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,688 INFO L290 TraceCheckUtils]: 93: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,688 INFO L290 TraceCheckUtils]: 92: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,688 INFO L272 TraceCheckUtils]: 91: Hoare triple {121390#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,688 INFO L290 TraceCheckUtils]: 90: Hoare triple {121390#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {121390#(< ~counter~0 95)} is VALID [2022-04-08 12:43:17,689 INFO L290 TraceCheckUtils]: 89: Hoare triple {121415#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121390#(< ~counter~0 95)} is VALID [2022-04-08 12:43:17,689 INFO L290 TraceCheckUtils]: 88: Hoare triple {121415#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121415#(< ~counter~0 94)} is VALID [2022-04-08 12:43:17,690 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {120837#true} {121415#(< ~counter~0 94)} #98#return; {121415#(< ~counter~0 94)} is VALID [2022-04-08 12:43:17,690 INFO L290 TraceCheckUtils]: 86: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,690 INFO L290 TraceCheckUtils]: 85: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,690 INFO L290 TraceCheckUtils]: 84: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,690 INFO L272 TraceCheckUtils]: 83: Hoare triple {121415#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,690 INFO L290 TraceCheckUtils]: 82: Hoare triple {121415#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {121415#(< ~counter~0 94)} is VALID [2022-04-08 12:43:17,692 INFO L290 TraceCheckUtils]: 81: Hoare triple {121440#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121415#(< ~counter~0 94)} is VALID [2022-04-08 12:43:17,692 INFO L290 TraceCheckUtils]: 80: Hoare triple {121440#(< ~counter~0 93)} assume !(~r~0 > 0); {121440#(< ~counter~0 93)} is VALID [2022-04-08 12:43:17,692 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {120837#true} {121440#(< ~counter~0 93)} #96#return; {121440#(< ~counter~0 93)} is VALID [2022-04-08 12:43:17,692 INFO L290 TraceCheckUtils]: 78: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,692 INFO L290 TraceCheckUtils]: 77: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,693 INFO L290 TraceCheckUtils]: 76: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,693 INFO L272 TraceCheckUtils]: 75: Hoare triple {121440#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,693 INFO L290 TraceCheckUtils]: 74: Hoare triple {121440#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {121440#(< ~counter~0 93)} is VALID [2022-04-08 12:43:17,694 INFO L290 TraceCheckUtils]: 73: Hoare triple {121465#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121440#(< ~counter~0 93)} is VALID [2022-04-08 12:43:17,694 INFO L290 TraceCheckUtils]: 72: Hoare triple {121465#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121465#(< ~counter~0 92)} is VALID [2022-04-08 12:43:17,695 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {120837#true} {121465#(< ~counter~0 92)} #96#return; {121465#(< ~counter~0 92)} is VALID [2022-04-08 12:43:17,695 INFO L290 TraceCheckUtils]: 70: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,695 INFO L290 TraceCheckUtils]: 69: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,695 INFO L290 TraceCheckUtils]: 68: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,695 INFO L272 TraceCheckUtils]: 67: Hoare triple {121465#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,695 INFO L290 TraceCheckUtils]: 66: Hoare triple {121465#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {121465#(< ~counter~0 92)} is VALID [2022-04-08 12:43:17,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {121490#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121465#(< ~counter~0 92)} is VALID [2022-04-08 12:43:17,697 INFO L290 TraceCheckUtils]: 64: Hoare triple {121490#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121490#(< ~counter~0 91)} is VALID [2022-04-08 12:43:17,697 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {120837#true} {121490#(< ~counter~0 91)} #96#return; {121490#(< ~counter~0 91)} is VALID [2022-04-08 12:43:17,697 INFO L290 TraceCheckUtils]: 62: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,697 INFO L290 TraceCheckUtils]: 61: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,697 INFO L290 TraceCheckUtils]: 60: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,697 INFO L272 TraceCheckUtils]: 59: Hoare triple {121490#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,698 INFO L290 TraceCheckUtils]: 58: Hoare triple {121490#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {121490#(< ~counter~0 91)} is VALID [2022-04-08 12:43:17,699 INFO L290 TraceCheckUtils]: 57: Hoare triple {121515#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121490#(< ~counter~0 91)} is VALID [2022-04-08 12:43:17,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {121515#(< ~counter~0 90)} assume !!(0 != ~r~0); {121515#(< ~counter~0 90)} is VALID [2022-04-08 12:43:17,699 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {120837#true} {121515#(< ~counter~0 90)} #94#return; {121515#(< ~counter~0 90)} is VALID [2022-04-08 12:43:17,700 INFO L290 TraceCheckUtils]: 54: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,700 INFO L290 TraceCheckUtils]: 53: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,700 INFO L290 TraceCheckUtils]: 52: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,700 INFO L272 TraceCheckUtils]: 51: Hoare triple {121515#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {121515#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {121515#(< ~counter~0 90)} is VALID [2022-04-08 12:43:17,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {121540#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121515#(< ~counter~0 90)} is VALID [2022-04-08 12:43:17,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {121540#(< ~counter~0 89)} assume !(~r~0 < 0); {121540#(< ~counter~0 89)} is VALID [2022-04-08 12:43:17,702 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {120837#true} {121540#(< ~counter~0 89)} #98#return; {121540#(< ~counter~0 89)} is VALID [2022-04-08 12:43:17,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,702 INFO L290 TraceCheckUtils]: 45: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,702 INFO L272 TraceCheckUtils]: 43: Hoare triple {121540#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {121540#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {121540#(< ~counter~0 89)} is VALID [2022-04-08 12:43:17,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {121565#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121540#(< ~counter~0 89)} is VALID [2022-04-08 12:43:17,704 INFO L290 TraceCheckUtils]: 40: Hoare triple {121565#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121565#(< ~counter~0 88)} is VALID [2022-04-08 12:43:17,705 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {120837#true} {121565#(< ~counter~0 88)} #98#return; {121565#(< ~counter~0 88)} is VALID [2022-04-08 12:43:17,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,705 INFO L272 TraceCheckUtils]: 35: Hoare triple {121565#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {121565#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {121565#(< ~counter~0 88)} is VALID [2022-04-08 12:43:17,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {121590#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121565#(< ~counter~0 88)} is VALID [2022-04-08 12:43:17,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {121590#(< ~counter~0 87)} assume !(~r~0 > 0); {121590#(< ~counter~0 87)} is VALID [2022-04-08 12:43:17,707 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {120837#true} {121590#(< ~counter~0 87)} #96#return; {121590#(< ~counter~0 87)} is VALID [2022-04-08 12:43:17,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,707 INFO L272 TraceCheckUtils]: 27: Hoare triple {121590#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {121590#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {121590#(< ~counter~0 87)} is VALID [2022-04-08 12:43:17,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {121615#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121590#(< ~counter~0 87)} is VALID [2022-04-08 12:43:17,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {121615#(< ~counter~0 86)} assume !!(0 != ~r~0); {121615#(< ~counter~0 86)} is VALID [2022-04-08 12:43:17,710 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120837#true} {121615#(< ~counter~0 86)} #94#return; {121615#(< ~counter~0 86)} is VALID [2022-04-08 12:43:17,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,710 INFO L272 TraceCheckUtils]: 19: Hoare triple {121615#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {121615#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {121615#(< ~counter~0 86)} is VALID [2022-04-08 12:43:17,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {121640#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121615#(< ~counter~0 86)} is VALID [2022-04-08 12:43:17,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {121640#(< ~counter~0 85)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {121640#(< ~counter~0 85)} is VALID [2022-04-08 12:43:17,712 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {120837#true} {121640#(< ~counter~0 85)} #92#return; {121640#(< ~counter~0 85)} is VALID [2022-04-08 12:43:17,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,712 INFO L272 TraceCheckUtils]: 11: Hoare triple {121640#(< ~counter~0 85)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,713 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {120837#true} {121640#(< ~counter~0 85)} #90#return; {121640#(< ~counter~0 85)} is VALID [2022-04-08 12:43:17,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 12:43:17,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 12:43:17,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 12:43:17,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {121640#(< ~counter~0 85)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 12:43:17,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {121640#(< ~counter~0 85)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {121640#(< ~counter~0 85)} is VALID [2022-04-08 12:43:17,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {121640#(< ~counter~0 85)} call #t~ret9 := main(); {121640#(< ~counter~0 85)} is VALID [2022-04-08 12:43:17,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121640#(< ~counter~0 85)} {120837#true} #102#return; {121640#(< ~counter~0 85)} is VALID [2022-04-08 12:43:17,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {121640#(< ~counter~0 85)} assume true; {121640#(< ~counter~0 85)} is VALID [2022-04-08 12:43:17,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {120837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {121640#(< ~counter~0 85)} is VALID [2022-04-08 12:43:17,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {120837#true} call ULTIMATE.init(); {120837#true} is VALID [2022-04-08 12:43:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 28 proven. 134 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-08 12:43:17,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:43:17,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297119329] [2022-04-08 12:43:17,715 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:43:17,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724418200] [2022-04-08 12:43:17,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724418200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:43:17,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:43:17,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-08 12:43:17,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:43:17,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1127749500] [2022-04-08 12:43:17,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1127749500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:43:17,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:43:17,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 12:43:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287750738] [2022-04-08 12:43:17,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:43:17,716 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 137 [2022-04-08 12:43:17,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:43:17,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:43:17,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:17,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 12:43:17,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:43:17,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 12:43:17,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 12:43:17,875 INFO L87 Difference]: Start difference. First operand 707 states and 950 transitions. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:43:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:22,713 INFO L93 Difference]: Finished difference Result 807 states and 1089 transitions. [2022-04-08 12:43:22,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 12:43:22,713 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 137 [2022-04-08 12:43:22,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:43:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:43:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 12:43:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:43:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 12:43:22,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-08 12:43:23,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:23,124 INFO L225 Difference]: With dead ends: 807 [2022-04-08 12:43:23,124 INFO L226 Difference]: Without dead ends: 802 [2022-04-08 12:43:23,125 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=953, Invalid=1303, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 12:43:23,126 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 293 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 12:43:23,126 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 336 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 12:43:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-04-08 12:43:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 775. [2022-04-08 12:43:25,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:43:25,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:43:25,866 INFO L74 IsIncluded]: Start isIncluded. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:43:25,866 INFO L87 Difference]: Start difference. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:43:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:25,887 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-08 12:43:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-08 12:43:25,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:25,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:25,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 802 states. [2022-04-08 12:43:25,889 INFO L87 Difference]: Start difference. First operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 802 states. [2022-04-08 12:43:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:25,911 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-08 12:43:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-08 12:43:25,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:25,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:25,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:43:25,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:43:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:43:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1047 transitions. [2022-04-08 12:43:25,955 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1047 transitions. Word has length 137 [2022-04-08 12:43:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:43:25,956 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1047 transitions. [2022-04-08 12:43:25,956 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:43:25,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1047 transitions. [2022-04-08 12:43:36,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1047 edges. 1046 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1047 transitions. [2022-04-08 12:43:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-08 12:43:36,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:43:36,412 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 8, 7, 7, 7, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:43:36,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-08 12:43:36,612 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-08 12:43:36,612 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:43:36,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:43:36,612 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 19 times [2022-04-08 12:43:36,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:43:36,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1124450145] [2022-04-08 12:43:36,613 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:43:36,613 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 20 times [2022-04-08 12:43:36,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:43:36,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743008826] [2022-04-08 12:43:36,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:43:36,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:43:36,626 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:43:36,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [342136032] [2022-04-08 12:43:36,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:43:36,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:43:36,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:43:36,627 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:43:36,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-08 12:43:36,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:43:36,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:43:36,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 12:43:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:43:36,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:43:37,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {126486#true} call ULTIMATE.init(); {126486#true} is VALID [2022-04-08 12:43:37,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {126486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {126494#(<= ~counter~0 0)} assume true; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126494#(<= ~counter~0 0)} {126486#true} #102#return; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {126494#(<= ~counter~0 0)} call #t~ret9 := main(); {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {126494#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,487 INFO L272 TraceCheckUtils]: 6: Hoare triple {126494#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {126494#(<= ~counter~0 0)} ~cond := #in~cond; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {126494#(<= ~counter~0 0)} assume !(0 == ~cond); {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {126494#(<= ~counter~0 0)} assume true; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,488 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126494#(<= ~counter~0 0)} {126494#(<= ~counter~0 0)} #90#return; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,489 INFO L272 TraceCheckUtils]: 11: Hoare triple {126494#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {126494#(<= ~counter~0 0)} ~cond := #in~cond; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {126494#(<= ~counter~0 0)} assume !(0 == ~cond); {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {126494#(<= ~counter~0 0)} assume true; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,490 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126494#(<= ~counter~0 0)} {126494#(<= ~counter~0 0)} #92#return; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {126494#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:37,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {126494#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126543#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:37,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {126543#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {126543#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:37,496 INFO L272 TraceCheckUtils]: 19: Hoare triple {126543#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126543#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:37,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {126543#(<= ~counter~0 1)} ~cond := #in~cond; {126543#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:37,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {126543#(<= ~counter~0 1)} assume !(0 == ~cond); {126543#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:37,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {126543#(<= ~counter~0 1)} assume true; {126543#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:37,497 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126543#(<= ~counter~0 1)} {126543#(<= ~counter~0 1)} #94#return; {126543#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:37,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {126543#(<= ~counter~0 1)} assume !!(0 != ~r~0); {126543#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:37,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {126543#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126568#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:37,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {126568#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {126568#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:37,502 INFO L272 TraceCheckUtils]: 27: Hoare triple {126568#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126568#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:37,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {126568#(<= ~counter~0 2)} ~cond := #in~cond; {126568#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:37,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {126568#(<= ~counter~0 2)} assume !(0 == ~cond); {126568#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:37,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {126568#(<= ~counter~0 2)} assume true; {126568#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:37,503 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126568#(<= ~counter~0 2)} {126568#(<= ~counter~0 2)} #96#return; {126568#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:37,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {126568#(<= ~counter~0 2)} assume !(~r~0 > 0); {126568#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:37,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {126568#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126593#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:37,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {126593#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {126593#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:37,508 INFO L272 TraceCheckUtils]: 35: Hoare triple {126593#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126593#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:37,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {126593#(<= ~counter~0 3)} ~cond := #in~cond; {126593#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:37,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {126593#(<= ~counter~0 3)} assume !(0 == ~cond); {126593#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:37,509 INFO L290 TraceCheckUtils]: 38: Hoare triple {126593#(<= ~counter~0 3)} assume true; {126593#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:37,509 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126593#(<= ~counter~0 3)} {126593#(<= ~counter~0 3)} #98#return; {126593#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:37,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {126593#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {126593#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:37,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {126593#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126618#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:37,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {126618#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {126618#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:37,515 INFO L272 TraceCheckUtils]: 43: Hoare triple {126618#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126618#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:37,515 INFO L290 TraceCheckUtils]: 44: Hoare triple {126618#(<= ~counter~0 4)} ~cond := #in~cond; {126618#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:37,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {126618#(<= ~counter~0 4)} assume !(0 == ~cond); {126618#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:37,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {126618#(<= ~counter~0 4)} assume true; {126618#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:37,516 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126618#(<= ~counter~0 4)} {126618#(<= ~counter~0 4)} #98#return; {126618#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:37,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {126618#(<= ~counter~0 4)} assume !(~r~0 < 0); {126618#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:37,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {126618#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126643#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:37,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {126643#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {126643#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:37,522 INFO L272 TraceCheckUtils]: 51: Hoare triple {126643#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126643#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:37,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {126643#(<= ~counter~0 5)} ~cond := #in~cond; {126643#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:37,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {126643#(<= ~counter~0 5)} assume !(0 == ~cond); {126643#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:37,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {126643#(<= ~counter~0 5)} assume true; {126643#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:37,523 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126643#(<= ~counter~0 5)} {126643#(<= ~counter~0 5)} #94#return; {126643#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:37,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {126643#(<= ~counter~0 5)} assume !!(0 != ~r~0); {126643#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:37,528 INFO L290 TraceCheckUtils]: 57: Hoare triple {126643#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126668#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:37,529 INFO L290 TraceCheckUtils]: 58: Hoare triple {126668#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {126668#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:37,529 INFO L272 TraceCheckUtils]: 59: Hoare triple {126668#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126668#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:37,530 INFO L290 TraceCheckUtils]: 60: Hoare triple {126668#(<= ~counter~0 6)} ~cond := #in~cond; {126668#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:37,530 INFO L290 TraceCheckUtils]: 61: Hoare triple {126668#(<= ~counter~0 6)} assume !(0 == ~cond); {126668#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:37,530 INFO L290 TraceCheckUtils]: 62: Hoare triple {126668#(<= ~counter~0 6)} assume true; {126668#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:37,531 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126668#(<= ~counter~0 6)} {126668#(<= ~counter~0 6)} #96#return; {126668#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:37,531 INFO L290 TraceCheckUtils]: 64: Hoare triple {126668#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126668#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:37,535 INFO L290 TraceCheckUtils]: 65: Hoare triple {126668#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126693#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:37,535 INFO L290 TraceCheckUtils]: 66: Hoare triple {126693#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {126693#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:37,536 INFO L272 TraceCheckUtils]: 67: Hoare triple {126693#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126693#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:37,536 INFO L290 TraceCheckUtils]: 68: Hoare triple {126693#(<= ~counter~0 7)} ~cond := #in~cond; {126693#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:37,536 INFO L290 TraceCheckUtils]: 69: Hoare triple {126693#(<= ~counter~0 7)} assume !(0 == ~cond); {126693#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:37,536 INFO L290 TraceCheckUtils]: 70: Hoare triple {126693#(<= ~counter~0 7)} assume true; {126693#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:37,537 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126693#(<= ~counter~0 7)} {126693#(<= ~counter~0 7)} #96#return; {126693#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:37,537 INFO L290 TraceCheckUtils]: 72: Hoare triple {126693#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126693#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:37,541 INFO L290 TraceCheckUtils]: 73: Hoare triple {126693#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126718#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:37,541 INFO L290 TraceCheckUtils]: 74: Hoare triple {126718#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {126718#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:37,542 INFO L272 TraceCheckUtils]: 75: Hoare triple {126718#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126718#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:37,542 INFO L290 TraceCheckUtils]: 76: Hoare triple {126718#(<= ~counter~0 8)} ~cond := #in~cond; {126718#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:37,542 INFO L290 TraceCheckUtils]: 77: Hoare triple {126718#(<= ~counter~0 8)} assume !(0 == ~cond); {126718#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:37,542 INFO L290 TraceCheckUtils]: 78: Hoare triple {126718#(<= ~counter~0 8)} assume true; {126718#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:37,543 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126718#(<= ~counter~0 8)} {126718#(<= ~counter~0 8)} #96#return; {126718#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:37,543 INFO L290 TraceCheckUtils]: 80: Hoare triple {126718#(<= ~counter~0 8)} assume !(~r~0 > 0); {126718#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:37,547 INFO L290 TraceCheckUtils]: 81: Hoare triple {126718#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126743#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:37,547 INFO L290 TraceCheckUtils]: 82: Hoare triple {126743#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {126743#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:37,548 INFO L272 TraceCheckUtils]: 83: Hoare triple {126743#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126743#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:37,548 INFO L290 TraceCheckUtils]: 84: Hoare triple {126743#(<= ~counter~0 9)} ~cond := #in~cond; {126743#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:37,548 INFO L290 TraceCheckUtils]: 85: Hoare triple {126743#(<= ~counter~0 9)} assume !(0 == ~cond); {126743#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:37,549 INFO L290 TraceCheckUtils]: 86: Hoare triple {126743#(<= ~counter~0 9)} assume true; {126743#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:37,549 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126743#(<= ~counter~0 9)} {126743#(<= ~counter~0 9)} #98#return; {126743#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:37,549 INFO L290 TraceCheckUtils]: 88: Hoare triple {126743#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {126743#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:37,553 INFO L290 TraceCheckUtils]: 89: Hoare triple {126743#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126768#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:37,554 INFO L290 TraceCheckUtils]: 90: Hoare triple {126768#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {126768#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:37,554 INFO L272 TraceCheckUtils]: 91: Hoare triple {126768#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126768#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:37,554 INFO L290 TraceCheckUtils]: 92: Hoare triple {126768#(<= ~counter~0 10)} ~cond := #in~cond; {126768#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:37,555 INFO L290 TraceCheckUtils]: 93: Hoare triple {126768#(<= ~counter~0 10)} assume !(0 == ~cond); {126768#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:37,555 INFO L290 TraceCheckUtils]: 94: Hoare triple {126768#(<= ~counter~0 10)} assume true; {126768#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:37,555 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126768#(<= ~counter~0 10)} {126768#(<= ~counter~0 10)} #98#return; {126768#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:37,556 INFO L290 TraceCheckUtils]: 96: Hoare triple {126768#(<= ~counter~0 10)} assume !(~r~0 < 0); {126768#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:37,559 INFO L290 TraceCheckUtils]: 97: Hoare triple {126768#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126793#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:37,559 INFO L290 TraceCheckUtils]: 98: Hoare triple {126793#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {126793#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:37,560 INFO L272 TraceCheckUtils]: 99: Hoare triple {126793#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126793#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:37,560 INFO L290 TraceCheckUtils]: 100: Hoare triple {126793#(<= ~counter~0 11)} ~cond := #in~cond; {126793#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:37,560 INFO L290 TraceCheckUtils]: 101: Hoare triple {126793#(<= ~counter~0 11)} assume !(0 == ~cond); {126793#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:37,560 INFO L290 TraceCheckUtils]: 102: Hoare triple {126793#(<= ~counter~0 11)} assume true; {126793#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:37,561 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126793#(<= ~counter~0 11)} {126793#(<= ~counter~0 11)} #94#return; {126793#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:37,561 INFO L290 TraceCheckUtils]: 104: Hoare triple {126793#(<= ~counter~0 11)} assume !!(0 != ~r~0); {126793#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:37,564 INFO L290 TraceCheckUtils]: 105: Hoare triple {126793#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126818#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:37,564 INFO L290 TraceCheckUtils]: 106: Hoare triple {126818#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {126818#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:37,565 INFO L272 TraceCheckUtils]: 107: Hoare triple {126818#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126818#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:37,565 INFO L290 TraceCheckUtils]: 108: Hoare triple {126818#(<= ~counter~0 12)} ~cond := #in~cond; {126818#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:37,565 INFO L290 TraceCheckUtils]: 109: Hoare triple {126818#(<= ~counter~0 12)} assume !(0 == ~cond); {126818#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:37,565 INFO L290 TraceCheckUtils]: 110: Hoare triple {126818#(<= ~counter~0 12)} assume true; {126818#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:37,566 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126818#(<= ~counter~0 12)} {126818#(<= ~counter~0 12)} #96#return; {126818#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:37,566 INFO L290 TraceCheckUtils]: 112: Hoare triple {126818#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126818#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:37,569 INFO L290 TraceCheckUtils]: 113: Hoare triple {126818#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126843#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:37,570 INFO L290 TraceCheckUtils]: 114: Hoare triple {126843#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {126843#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:37,570 INFO L272 TraceCheckUtils]: 115: Hoare triple {126843#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126843#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:37,571 INFO L290 TraceCheckUtils]: 116: Hoare triple {126843#(<= ~counter~0 13)} ~cond := #in~cond; {126843#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:37,571 INFO L290 TraceCheckUtils]: 117: Hoare triple {126843#(<= ~counter~0 13)} assume !(0 == ~cond); {126843#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:37,571 INFO L290 TraceCheckUtils]: 118: Hoare triple {126843#(<= ~counter~0 13)} assume true; {126843#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:37,572 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126843#(<= ~counter~0 13)} {126843#(<= ~counter~0 13)} #96#return; {126843#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:37,572 INFO L290 TraceCheckUtils]: 120: Hoare triple {126843#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126843#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:37,576 INFO L290 TraceCheckUtils]: 121: Hoare triple {126843#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126868#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:37,577 INFO L290 TraceCheckUtils]: 122: Hoare triple {126868#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {126868#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:37,577 INFO L272 TraceCheckUtils]: 123: Hoare triple {126868#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126868#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:37,578 INFO L290 TraceCheckUtils]: 124: Hoare triple {126868#(<= ~counter~0 14)} ~cond := #in~cond; {126868#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:37,578 INFO L290 TraceCheckUtils]: 125: Hoare triple {126868#(<= ~counter~0 14)} assume !(0 == ~cond); {126868#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:37,578 INFO L290 TraceCheckUtils]: 126: Hoare triple {126868#(<= ~counter~0 14)} assume true; {126868#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:37,579 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126868#(<= ~counter~0 14)} {126868#(<= ~counter~0 14)} #96#return; {126868#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:37,579 INFO L290 TraceCheckUtils]: 128: Hoare triple {126868#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126868#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:37,579 INFO L290 TraceCheckUtils]: 129: Hoare triple {126868#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126893#(<= |main_#t~post7| 14)} is VALID [2022-04-08 12:43:37,580 INFO L290 TraceCheckUtils]: 130: Hoare triple {126893#(<= |main_#t~post7| 14)} assume !(#t~post7 < 100);havoc #t~post7; {126487#false} is VALID [2022-04-08 12:43:37,580 INFO L290 TraceCheckUtils]: 131: Hoare triple {126487#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126487#false} is VALID [2022-04-08 12:43:37,580 INFO L290 TraceCheckUtils]: 132: Hoare triple {126487#false} assume !(#t~post8 < 100);havoc #t~post8; {126487#false} is VALID [2022-04-08 12:43:37,580 INFO L290 TraceCheckUtils]: 133: Hoare triple {126487#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126487#false} is VALID [2022-04-08 12:43:37,580 INFO L290 TraceCheckUtils]: 134: Hoare triple {126487#false} assume !(#t~post6 < 100);havoc #t~post6; {126487#false} is VALID [2022-04-08 12:43:37,580 INFO L272 TraceCheckUtils]: 135: Hoare triple {126487#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126487#false} is VALID [2022-04-08 12:43:37,580 INFO L290 TraceCheckUtils]: 136: Hoare triple {126487#false} ~cond := #in~cond; {126487#false} is VALID [2022-04-08 12:43:37,580 INFO L290 TraceCheckUtils]: 137: Hoare triple {126487#false} assume 0 == ~cond; {126487#false} is VALID [2022-04-08 12:43:37,580 INFO L290 TraceCheckUtils]: 138: Hoare triple {126487#false} assume !false; {126487#false} is VALID [2022-04-08 12:43:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:43:37,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:43:38,471 INFO L290 TraceCheckUtils]: 138: Hoare triple {126487#false} assume !false; {126487#false} is VALID [2022-04-08 12:43:38,472 INFO L290 TraceCheckUtils]: 137: Hoare triple {126487#false} assume 0 == ~cond; {126487#false} is VALID [2022-04-08 12:43:38,472 INFO L290 TraceCheckUtils]: 136: Hoare triple {126487#false} ~cond := #in~cond; {126487#false} is VALID [2022-04-08 12:43:38,472 INFO L272 TraceCheckUtils]: 135: Hoare triple {126487#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126487#false} is VALID [2022-04-08 12:43:38,472 INFO L290 TraceCheckUtils]: 134: Hoare triple {126487#false} assume !(#t~post6 < 100);havoc #t~post6; {126487#false} is VALID [2022-04-08 12:43:38,472 INFO L290 TraceCheckUtils]: 133: Hoare triple {126487#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126487#false} is VALID [2022-04-08 12:43:38,472 INFO L290 TraceCheckUtils]: 132: Hoare triple {126487#false} assume !(#t~post8 < 100);havoc #t~post8; {126487#false} is VALID [2022-04-08 12:43:38,472 INFO L290 TraceCheckUtils]: 131: Hoare triple {126487#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126487#false} is VALID [2022-04-08 12:43:38,472 INFO L290 TraceCheckUtils]: 130: Hoare triple {126945#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {126487#false} is VALID [2022-04-08 12:43:38,473 INFO L290 TraceCheckUtils]: 129: Hoare triple {126949#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126945#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:43:38,473 INFO L290 TraceCheckUtils]: 128: Hoare triple {126949#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126949#(< ~counter~0 100)} is VALID [2022-04-08 12:43:38,473 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126486#true} {126949#(< ~counter~0 100)} #96#return; {126949#(< ~counter~0 100)} is VALID [2022-04-08 12:43:38,473 INFO L290 TraceCheckUtils]: 126: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,473 INFO L290 TraceCheckUtils]: 125: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,474 INFO L290 TraceCheckUtils]: 124: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,474 INFO L272 TraceCheckUtils]: 123: Hoare triple {126949#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,474 INFO L290 TraceCheckUtils]: 122: Hoare triple {126949#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {126949#(< ~counter~0 100)} is VALID [2022-04-08 12:43:38,477 INFO L290 TraceCheckUtils]: 121: Hoare triple {126974#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126949#(< ~counter~0 100)} is VALID [2022-04-08 12:43:38,477 INFO L290 TraceCheckUtils]: 120: Hoare triple {126974#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126974#(< ~counter~0 99)} is VALID [2022-04-08 12:43:38,478 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126486#true} {126974#(< ~counter~0 99)} #96#return; {126974#(< ~counter~0 99)} is VALID [2022-04-08 12:43:38,478 INFO L290 TraceCheckUtils]: 118: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,478 INFO L290 TraceCheckUtils]: 117: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,478 INFO L290 TraceCheckUtils]: 116: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,478 INFO L272 TraceCheckUtils]: 115: Hoare triple {126974#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,478 INFO L290 TraceCheckUtils]: 114: Hoare triple {126974#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {126974#(< ~counter~0 99)} is VALID [2022-04-08 12:43:38,480 INFO L290 TraceCheckUtils]: 113: Hoare triple {126999#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126974#(< ~counter~0 99)} is VALID [2022-04-08 12:43:38,480 INFO L290 TraceCheckUtils]: 112: Hoare triple {126999#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126999#(< ~counter~0 98)} is VALID [2022-04-08 12:43:38,481 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126486#true} {126999#(< ~counter~0 98)} #96#return; {126999#(< ~counter~0 98)} is VALID [2022-04-08 12:43:38,481 INFO L290 TraceCheckUtils]: 110: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,481 INFO L290 TraceCheckUtils]: 109: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,481 INFO L290 TraceCheckUtils]: 108: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,481 INFO L272 TraceCheckUtils]: 107: Hoare triple {126999#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,481 INFO L290 TraceCheckUtils]: 106: Hoare triple {126999#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {126999#(< ~counter~0 98)} is VALID [2022-04-08 12:43:38,483 INFO L290 TraceCheckUtils]: 105: Hoare triple {127024#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126999#(< ~counter~0 98)} is VALID [2022-04-08 12:43:38,484 INFO L290 TraceCheckUtils]: 104: Hoare triple {127024#(< ~counter~0 97)} assume !!(0 != ~r~0); {127024#(< ~counter~0 97)} is VALID [2022-04-08 12:43:38,484 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126486#true} {127024#(< ~counter~0 97)} #94#return; {127024#(< ~counter~0 97)} is VALID [2022-04-08 12:43:38,484 INFO L290 TraceCheckUtils]: 102: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,484 INFO L290 TraceCheckUtils]: 101: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,484 INFO L290 TraceCheckUtils]: 100: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,484 INFO L272 TraceCheckUtils]: 99: Hoare triple {127024#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,485 INFO L290 TraceCheckUtils]: 98: Hoare triple {127024#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {127024#(< ~counter~0 97)} is VALID [2022-04-08 12:43:38,486 INFO L290 TraceCheckUtils]: 97: Hoare triple {127049#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127024#(< ~counter~0 97)} is VALID [2022-04-08 12:43:38,487 INFO L290 TraceCheckUtils]: 96: Hoare triple {127049#(< ~counter~0 96)} assume !(~r~0 < 0); {127049#(< ~counter~0 96)} is VALID [2022-04-08 12:43:38,487 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126486#true} {127049#(< ~counter~0 96)} #98#return; {127049#(< ~counter~0 96)} is VALID [2022-04-08 12:43:38,487 INFO L290 TraceCheckUtils]: 94: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,487 INFO L290 TraceCheckUtils]: 93: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,487 INFO L290 TraceCheckUtils]: 92: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,487 INFO L272 TraceCheckUtils]: 91: Hoare triple {127049#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,488 INFO L290 TraceCheckUtils]: 90: Hoare triple {127049#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {127049#(< ~counter~0 96)} is VALID [2022-04-08 12:43:38,489 INFO L290 TraceCheckUtils]: 89: Hoare triple {127074#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127049#(< ~counter~0 96)} is VALID [2022-04-08 12:43:38,489 INFO L290 TraceCheckUtils]: 88: Hoare triple {127074#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127074#(< ~counter~0 95)} is VALID [2022-04-08 12:43:38,490 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126486#true} {127074#(< ~counter~0 95)} #98#return; {127074#(< ~counter~0 95)} is VALID [2022-04-08 12:43:38,490 INFO L290 TraceCheckUtils]: 86: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,490 INFO L290 TraceCheckUtils]: 85: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,490 INFO L290 TraceCheckUtils]: 84: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,490 INFO L272 TraceCheckUtils]: 83: Hoare triple {127074#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,490 INFO L290 TraceCheckUtils]: 82: Hoare triple {127074#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {127074#(< ~counter~0 95)} is VALID [2022-04-08 12:43:38,492 INFO L290 TraceCheckUtils]: 81: Hoare triple {127099#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127074#(< ~counter~0 95)} is VALID [2022-04-08 12:43:38,492 INFO L290 TraceCheckUtils]: 80: Hoare triple {127099#(< ~counter~0 94)} assume !(~r~0 > 0); {127099#(< ~counter~0 94)} is VALID [2022-04-08 12:43:38,493 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126486#true} {127099#(< ~counter~0 94)} #96#return; {127099#(< ~counter~0 94)} is VALID [2022-04-08 12:43:38,493 INFO L290 TraceCheckUtils]: 78: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,493 INFO L290 TraceCheckUtils]: 77: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,493 INFO L290 TraceCheckUtils]: 76: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,493 INFO L272 TraceCheckUtils]: 75: Hoare triple {127099#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,493 INFO L290 TraceCheckUtils]: 74: Hoare triple {127099#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {127099#(< ~counter~0 94)} is VALID [2022-04-08 12:43:38,494 INFO L290 TraceCheckUtils]: 73: Hoare triple {127124#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127099#(< ~counter~0 94)} is VALID [2022-04-08 12:43:38,495 INFO L290 TraceCheckUtils]: 72: Hoare triple {127124#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127124#(< ~counter~0 93)} is VALID [2022-04-08 12:43:38,495 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126486#true} {127124#(< ~counter~0 93)} #96#return; {127124#(< ~counter~0 93)} is VALID [2022-04-08 12:43:38,495 INFO L290 TraceCheckUtils]: 70: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,495 INFO L290 TraceCheckUtils]: 69: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,495 INFO L290 TraceCheckUtils]: 68: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,495 INFO L272 TraceCheckUtils]: 67: Hoare triple {127124#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,496 INFO L290 TraceCheckUtils]: 66: Hoare triple {127124#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {127124#(< ~counter~0 93)} is VALID [2022-04-08 12:43:38,497 INFO L290 TraceCheckUtils]: 65: Hoare triple {127149#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127124#(< ~counter~0 93)} is VALID [2022-04-08 12:43:38,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {127149#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127149#(< ~counter~0 92)} is VALID [2022-04-08 12:43:38,498 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126486#true} {127149#(< ~counter~0 92)} #96#return; {127149#(< ~counter~0 92)} is VALID [2022-04-08 12:43:38,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,498 INFO L272 TraceCheckUtils]: 59: Hoare triple {127149#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {127149#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {127149#(< ~counter~0 92)} is VALID [2022-04-08 12:43:38,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {127174#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127149#(< ~counter~0 92)} is VALID [2022-04-08 12:43:38,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {127174#(< ~counter~0 91)} assume !!(0 != ~r~0); {127174#(< ~counter~0 91)} is VALID [2022-04-08 12:43:38,501 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126486#true} {127174#(< ~counter~0 91)} #94#return; {127174#(< ~counter~0 91)} is VALID [2022-04-08 12:43:38,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,502 INFO L272 TraceCheckUtils]: 51: Hoare triple {127174#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {127174#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {127174#(< ~counter~0 91)} is VALID [2022-04-08 12:43:38,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {127199#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127174#(< ~counter~0 91)} is VALID [2022-04-08 12:43:38,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {127199#(< ~counter~0 90)} assume !(~r~0 < 0); {127199#(< ~counter~0 90)} is VALID [2022-04-08 12:43:38,505 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126486#true} {127199#(< ~counter~0 90)} #98#return; {127199#(< ~counter~0 90)} is VALID [2022-04-08 12:43:38,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,505 INFO L272 TraceCheckUtils]: 43: Hoare triple {127199#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {127199#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {127199#(< ~counter~0 90)} is VALID [2022-04-08 12:43:38,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {127224#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127199#(< ~counter~0 90)} is VALID [2022-04-08 12:43:38,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {127224#(< ~counter~0 89)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127224#(< ~counter~0 89)} is VALID [2022-04-08 12:43:38,509 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126486#true} {127224#(< ~counter~0 89)} #98#return; {127224#(< ~counter~0 89)} is VALID [2022-04-08 12:43:38,509 INFO L290 TraceCheckUtils]: 38: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,509 INFO L290 TraceCheckUtils]: 36: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,509 INFO L272 TraceCheckUtils]: 35: Hoare triple {127224#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {127224#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {127224#(< ~counter~0 89)} is VALID [2022-04-08 12:43:38,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {127249#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127224#(< ~counter~0 89)} is VALID [2022-04-08 12:43:38,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {127249#(< ~counter~0 88)} assume !(~r~0 > 0); {127249#(< ~counter~0 88)} is VALID [2022-04-08 12:43:38,511 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126486#true} {127249#(< ~counter~0 88)} #96#return; {127249#(< ~counter~0 88)} is VALID [2022-04-08 12:43:38,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,511 INFO L272 TraceCheckUtils]: 27: Hoare triple {127249#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {127249#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {127249#(< ~counter~0 88)} is VALID [2022-04-08 12:43:38,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {127274#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127249#(< ~counter~0 88)} is VALID [2022-04-08 12:43:38,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {127274#(< ~counter~0 87)} assume !!(0 != ~r~0); {127274#(< ~counter~0 87)} is VALID [2022-04-08 12:43:38,514 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126486#true} {127274#(< ~counter~0 87)} #94#return; {127274#(< ~counter~0 87)} is VALID [2022-04-08 12:43:38,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,515 INFO L272 TraceCheckUtils]: 19: Hoare triple {127274#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {127274#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {127274#(< ~counter~0 87)} is VALID [2022-04-08 12:43:38,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {127299#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127274#(< ~counter~0 87)} is VALID [2022-04-08 12:43:38,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {127299#(< ~counter~0 86)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {127299#(< ~counter~0 86)} is VALID [2022-04-08 12:43:38,517 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126486#true} {127299#(< ~counter~0 86)} #92#return; {127299#(< ~counter~0 86)} is VALID [2022-04-08 12:43:38,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,517 INFO L272 TraceCheckUtils]: 11: Hoare triple {127299#(< ~counter~0 86)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,518 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126486#true} {127299#(< ~counter~0 86)} #90#return; {127299#(< ~counter~0 86)} is VALID [2022-04-08 12:43:38,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 12:43:38,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 12:43:38,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 12:43:38,518 INFO L272 TraceCheckUtils]: 6: Hoare triple {127299#(< ~counter~0 86)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 12:43:38,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {127299#(< ~counter~0 86)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {127299#(< ~counter~0 86)} is VALID [2022-04-08 12:43:38,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {127299#(< ~counter~0 86)} call #t~ret9 := main(); {127299#(< ~counter~0 86)} is VALID [2022-04-08 12:43:38,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127299#(< ~counter~0 86)} {126486#true} #102#return; {127299#(< ~counter~0 86)} is VALID [2022-04-08 12:43:38,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {127299#(< ~counter~0 86)} assume true; {127299#(< ~counter~0 86)} is VALID [2022-04-08 12:43:38,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {126486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {127299#(< ~counter~0 86)} is VALID [2022-04-08 12:43:38,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {126486#true} call ULTIMATE.init(); {126486#true} is VALID [2022-04-08 12:43:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 134 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-08 12:43:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:43:38,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743008826] [2022-04-08 12:43:38,520 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:43:38,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342136032] [2022-04-08 12:43:38,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342136032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:43:38,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:43:38,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-08 12:43:38,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:43:38,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1124450145] [2022-04-08 12:43:38,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1124450145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:43:38,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:43:38,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 12:43:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180504357] [2022-04-08 12:43:38,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:43:38,521 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 139 [2022-04-08 12:43:38,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:43:38,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:43:38,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:38,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 12:43:38,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:43:38,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 12:43:38,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 12:43:38,695 INFO L87 Difference]: Start difference. First operand 775 states and 1047 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:43:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:43,669 INFO L93 Difference]: Finished difference Result 945 states and 1302 transitions. [2022-04-08 12:43:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 12:43:43,669 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 139 [2022-04-08 12:43:43,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:43:43,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:43:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 12:43:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:43:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 12:43:43,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-08 12:43:44,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:44,137 INFO L225 Difference]: With dead ends: 945 [2022-04-08 12:43:44,137 INFO L226 Difference]: Without dead ends: 775 [2022-04-08 12:43:44,138 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=917, Invalid=1245, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 12:43:44,139 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 212 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 12:43:44,139 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 324 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 12:43:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-04-08 12:43:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2022-04-08 12:43:47,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:43:47,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:43:47,168 INFO L74 IsIncluded]: Start isIncluded. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:43:47,169 INFO L87 Difference]: Start difference. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:43:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:47,189 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-08 12:43:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-08 12:43:47,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:47,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:47,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 775 states. [2022-04-08 12:43:47,192 INFO L87 Difference]: Start difference. First operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 775 states. [2022-04-08 12:43:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:47,213 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-08 12:43:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-08 12:43:47,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:47,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:47,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:43:47,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:43:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:43:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-04-08 12:43:47,243 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 139 [2022-04-08 12:43:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:43:47,243 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-04-08 12:43:47,244 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 12:43:47,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1041 transitions. [2022-04-08 12:44:03,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1041 edges. 1036 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-08 12:44:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-08 12:44:03,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:03,965 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:44:03,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-08 12:44:04,165 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-08 12:44:04,165 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 25 times [2022-04-08 12:44:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:04,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [790463912] [2022-04-08 12:44:04,166 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:44:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 26 times [2022-04-08 12:44:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:04,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142097439] [2022-04-08 12:44:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:04,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:04,180 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:44:04,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024345145] [2022-04-08 12:44:04,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:44:04,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:04,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:04,181 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:44:04,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-08 12:44:04,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:44:04,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:44:04,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 12:44:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:04,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:44:05,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {132369#true} call ULTIMATE.init(); {132369#true} is VALID [2022-04-08 12:44:05,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {132369#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {132377#(<= ~counter~0 0)} assume true; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132377#(<= ~counter~0 0)} {132369#true} #102#return; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {132377#(<= ~counter~0 0)} call #t~ret9 := main(); {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {132377#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,076 INFO L272 TraceCheckUtils]: 6: Hoare triple {132377#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {132377#(<= ~counter~0 0)} ~cond := #in~cond; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {132377#(<= ~counter~0 0)} assume !(0 == ~cond); {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {132377#(<= ~counter~0 0)} assume true; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,077 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132377#(<= ~counter~0 0)} {132377#(<= ~counter~0 0)} #90#return; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,077 INFO L272 TraceCheckUtils]: 11: Hoare triple {132377#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {132377#(<= ~counter~0 0)} ~cond := #in~cond; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {132377#(<= ~counter~0 0)} assume !(0 == ~cond); {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {132377#(<= ~counter~0 0)} assume true; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,078 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132377#(<= ~counter~0 0)} {132377#(<= ~counter~0 0)} #92#return; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {132377#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:05,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {132377#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132426#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:05,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {132426#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {132426#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:05,082 INFO L272 TraceCheckUtils]: 19: Hoare triple {132426#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132426#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:05,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {132426#(<= ~counter~0 1)} ~cond := #in~cond; {132426#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:05,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {132426#(<= ~counter~0 1)} assume !(0 == ~cond); {132426#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:05,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {132426#(<= ~counter~0 1)} assume true; {132426#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:05,084 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132426#(<= ~counter~0 1)} {132426#(<= ~counter~0 1)} #94#return; {132426#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:05,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {132426#(<= ~counter~0 1)} assume !!(0 != ~r~0); {132426#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:05,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {132426#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132451#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:05,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {132451#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {132451#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:05,087 INFO L272 TraceCheckUtils]: 27: Hoare triple {132451#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132451#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:05,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {132451#(<= ~counter~0 2)} ~cond := #in~cond; {132451#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:05,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {132451#(<= ~counter~0 2)} assume !(0 == ~cond); {132451#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:05,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {132451#(<= ~counter~0 2)} assume true; {132451#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:05,088 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132451#(<= ~counter~0 2)} {132451#(<= ~counter~0 2)} #96#return; {132451#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:05,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {132451#(<= ~counter~0 2)} assume !(~r~0 > 0); {132451#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:05,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {132451#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132476#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:05,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {132476#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {132476#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:05,091 INFO L272 TraceCheckUtils]: 35: Hoare triple {132476#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132476#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:05,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {132476#(<= ~counter~0 3)} ~cond := #in~cond; {132476#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:05,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {132476#(<= ~counter~0 3)} assume !(0 == ~cond); {132476#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:05,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {132476#(<= ~counter~0 3)} assume true; {132476#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:05,092 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132476#(<= ~counter~0 3)} {132476#(<= ~counter~0 3)} #98#return; {132476#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:05,092 INFO L290 TraceCheckUtils]: 40: Hoare triple {132476#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132476#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:05,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {132476#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132501#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:05,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {132501#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {132501#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:05,096 INFO L272 TraceCheckUtils]: 43: Hoare triple {132501#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132501#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:05,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {132501#(<= ~counter~0 4)} ~cond := #in~cond; {132501#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:05,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {132501#(<= ~counter~0 4)} assume !(0 == ~cond); {132501#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:05,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {132501#(<= ~counter~0 4)} assume true; {132501#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:05,098 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132501#(<= ~counter~0 4)} {132501#(<= ~counter~0 4)} #98#return; {132501#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:05,098 INFO L290 TraceCheckUtils]: 48: Hoare triple {132501#(<= ~counter~0 4)} assume !(~r~0 < 0); {132501#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:05,100 INFO L290 TraceCheckUtils]: 49: Hoare triple {132501#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132526#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:05,101 INFO L290 TraceCheckUtils]: 50: Hoare triple {132526#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {132526#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:05,101 INFO L272 TraceCheckUtils]: 51: Hoare triple {132526#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132526#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:05,101 INFO L290 TraceCheckUtils]: 52: Hoare triple {132526#(<= ~counter~0 5)} ~cond := #in~cond; {132526#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:05,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {132526#(<= ~counter~0 5)} assume !(0 == ~cond); {132526#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:05,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {132526#(<= ~counter~0 5)} assume true; {132526#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:05,102 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132526#(<= ~counter~0 5)} {132526#(<= ~counter~0 5)} #94#return; {132526#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:05,103 INFO L290 TraceCheckUtils]: 56: Hoare triple {132526#(<= ~counter~0 5)} assume !!(0 != ~r~0); {132526#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:05,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {132526#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132551#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:05,106 INFO L290 TraceCheckUtils]: 58: Hoare triple {132551#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {132551#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:05,106 INFO L272 TraceCheckUtils]: 59: Hoare triple {132551#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132551#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:05,107 INFO L290 TraceCheckUtils]: 60: Hoare triple {132551#(<= ~counter~0 6)} ~cond := #in~cond; {132551#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:05,107 INFO L290 TraceCheckUtils]: 61: Hoare triple {132551#(<= ~counter~0 6)} assume !(0 == ~cond); {132551#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:05,107 INFO L290 TraceCheckUtils]: 62: Hoare triple {132551#(<= ~counter~0 6)} assume true; {132551#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:05,108 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132551#(<= ~counter~0 6)} {132551#(<= ~counter~0 6)} #96#return; {132551#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:05,108 INFO L290 TraceCheckUtils]: 64: Hoare triple {132551#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132551#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:05,111 INFO L290 TraceCheckUtils]: 65: Hoare triple {132551#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132576#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:05,111 INFO L290 TraceCheckUtils]: 66: Hoare triple {132576#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {132576#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:05,112 INFO L272 TraceCheckUtils]: 67: Hoare triple {132576#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132576#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:05,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {132576#(<= ~counter~0 7)} ~cond := #in~cond; {132576#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:05,112 INFO L290 TraceCheckUtils]: 69: Hoare triple {132576#(<= ~counter~0 7)} assume !(0 == ~cond); {132576#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:05,112 INFO L290 TraceCheckUtils]: 70: Hoare triple {132576#(<= ~counter~0 7)} assume true; {132576#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:05,113 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132576#(<= ~counter~0 7)} {132576#(<= ~counter~0 7)} #96#return; {132576#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:05,113 INFO L290 TraceCheckUtils]: 72: Hoare triple {132576#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132576#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:05,115 INFO L290 TraceCheckUtils]: 73: Hoare triple {132576#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132601#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:05,116 INFO L290 TraceCheckUtils]: 74: Hoare triple {132601#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {132601#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:05,116 INFO L272 TraceCheckUtils]: 75: Hoare triple {132601#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132601#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:05,116 INFO L290 TraceCheckUtils]: 76: Hoare triple {132601#(<= ~counter~0 8)} ~cond := #in~cond; {132601#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:05,117 INFO L290 TraceCheckUtils]: 77: Hoare triple {132601#(<= ~counter~0 8)} assume !(0 == ~cond); {132601#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:05,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {132601#(<= ~counter~0 8)} assume true; {132601#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:05,117 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132601#(<= ~counter~0 8)} {132601#(<= ~counter~0 8)} #96#return; {132601#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:05,118 INFO L290 TraceCheckUtils]: 80: Hoare triple {132601#(<= ~counter~0 8)} assume !(~r~0 > 0); {132601#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:05,119 INFO L290 TraceCheckUtils]: 81: Hoare triple {132601#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132626#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:05,120 INFO L290 TraceCheckUtils]: 82: Hoare triple {132626#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {132626#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:05,120 INFO L272 TraceCheckUtils]: 83: Hoare triple {132626#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132626#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:05,120 INFO L290 TraceCheckUtils]: 84: Hoare triple {132626#(<= ~counter~0 9)} ~cond := #in~cond; {132626#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:05,121 INFO L290 TraceCheckUtils]: 85: Hoare triple {132626#(<= ~counter~0 9)} assume !(0 == ~cond); {132626#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:05,121 INFO L290 TraceCheckUtils]: 86: Hoare triple {132626#(<= ~counter~0 9)} assume true; {132626#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:05,121 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132626#(<= ~counter~0 9)} {132626#(<= ~counter~0 9)} #98#return; {132626#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:05,122 INFO L290 TraceCheckUtils]: 88: Hoare triple {132626#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132626#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:05,123 INFO L290 TraceCheckUtils]: 89: Hoare triple {132626#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132651#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:05,124 INFO L290 TraceCheckUtils]: 90: Hoare triple {132651#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {132651#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:05,124 INFO L272 TraceCheckUtils]: 91: Hoare triple {132651#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132651#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:05,124 INFO L290 TraceCheckUtils]: 92: Hoare triple {132651#(<= ~counter~0 10)} ~cond := #in~cond; {132651#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:05,125 INFO L290 TraceCheckUtils]: 93: Hoare triple {132651#(<= ~counter~0 10)} assume !(0 == ~cond); {132651#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:05,125 INFO L290 TraceCheckUtils]: 94: Hoare triple {132651#(<= ~counter~0 10)} assume true; {132651#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:05,125 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132651#(<= ~counter~0 10)} {132651#(<= ~counter~0 10)} #98#return; {132651#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:05,126 INFO L290 TraceCheckUtils]: 96: Hoare triple {132651#(<= ~counter~0 10)} assume !(~r~0 < 0); {132651#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:05,128 INFO L290 TraceCheckUtils]: 97: Hoare triple {132651#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132676#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:05,128 INFO L290 TraceCheckUtils]: 98: Hoare triple {132676#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {132676#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:05,129 INFO L272 TraceCheckUtils]: 99: Hoare triple {132676#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132676#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:05,129 INFO L290 TraceCheckUtils]: 100: Hoare triple {132676#(<= ~counter~0 11)} ~cond := #in~cond; {132676#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:05,129 INFO L290 TraceCheckUtils]: 101: Hoare triple {132676#(<= ~counter~0 11)} assume !(0 == ~cond); {132676#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:05,130 INFO L290 TraceCheckUtils]: 102: Hoare triple {132676#(<= ~counter~0 11)} assume true; {132676#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:05,130 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132676#(<= ~counter~0 11)} {132676#(<= ~counter~0 11)} #94#return; {132676#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:05,130 INFO L290 TraceCheckUtils]: 104: Hoare triple {132676#(<= ~counter~0 11)} assume !!(0 != ~r~0); {132676#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:05,132 INFO L290 TraceCheckUtils]: 105: Hoare triple {132676#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132701#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:05,133 INFO L290 TraceCheckUtils]: 106: Hoare triple {132701#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {132701#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:05,133 INFO L272 TraceCheckUtils]: 107: Hoare triple {132701#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132701#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:05,134 INFO L290 TraceCheckUtils]: 108: Hoare triple {132701#(<= ~counter~0 12)} ~cond := #in~cond; {132701#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:05,134 INFO L290 TraceCheckUtils]: 109: Hoare triple {132701#(<= ~counter~0 12)} assume !(0 == ~cond); {132701#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:05,134 INFO L290 TraceCheckUtils]: 110: Hoare triple {132701#(<= ~counter~0 12)} assume true; {132701#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:05,135 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132701#(<= ~counter~0 12)} {132701#(<= ~counter~0 12)} #96#return; {132701#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:05,135 INFO L290 TraceCheckUtils]: 112: Hoare triple {132701#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132701#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:05,138 INFO L290 TraceCheckUtils]: 113: Hoare triple {132701#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132726#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:05,138 INFO L290 TraceCheckUtils]: 114: Hoare triple {132726#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {132726#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:05,139 INFO L272 TraceCheckUtils]: 115: Hoare triple {132726#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132726#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:05,139 INFO L290 TraceCheckUtils]: 116: Hoare triple {132726#(<= ~counter~0 13)} ~cond := #in~cond; {132726#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:05,139 INFO L290 TraceCheckUtils]: 117: Hoare triple {132726#(<= ~counter~0 13)} assume !(0 == ~cond); {132726#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:05,139 INFO L290 TraceCheckUtils]: 118: Hoare triple {132726#(<= ~counter~0 13)} assume true; {132726#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:05,140 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132726#(<= ~counter~0 13)} {132726#(<= ~counter~0 13)} #96#return; {132726#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:05,140 INFO L290 TraceCheckUtils]: 120: Hoare triple {132726#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132726#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:05,143 INFO L290 TraceCheckUtils]: 121: Hoare triple {132726#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132751#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:05,143 INFO L290 TraceCheckUtils]: 122: Hoare triple {132751#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {132751#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:05,144 INFO L272 TraceCheckUtils]: 123: Hoare triple {132751#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132751#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:05,144 INFO L290 TraceCheckUtils]: 124: Hoare triple {132751#(<= ~counter~0 14)} ~cond := #in~cond; {132751#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:05,144 INFO L290 TraceCheckUtils]: 125: Hoare triple {132751#(<= ~counter~0 14)} assume !(0 == ~cond); {132751#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:05,144 INFO L290 TraceCheckUtils]: 126: Hoare triple {132751#(<= ~counter~0 14)} assume true; {132751#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:05,145 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132751#(<= ~counter~0 14)} {132751#(<= ~counter~0 14)} #96#return; {132751#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:05,145 INFO L290 TraceCheckUtils]: 128: Hoare triple {132751#(<= ~counter~0 14)} assume !(~r~0 > 0); {132751#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:05,147 INFO L290 TraceCheckUtils]: 129: Hoare triple {132751#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132776#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:05,148 INFO L290 TraceCheckUtils]: 130: Hoare triple {132776#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {132776#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:05,148 INFO L272 TraceCheckUtils]: 131: Hoare triple {132776#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132776#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:05,148 INFO L290 TraceCheckUtils]: 132: Hoare triple {132776#(<= ~counter~0 15)} ~cond := #in~cond; {132776#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:05,149 INFO L290 TraceCheckUtils]: 133: Hoare triple {132776#(<= ~counter~0 15)} assume !(0 == ~cond); {132776#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:05,149 INFO L290 TraceCheckUtils]: 134: Hoare triple {132776#(<= ~counter~0 15)} assume true; {132776#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:05,149 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {132776#(<= ~counter~0 15)} {132776#(<= ~counter~0 15)} #98#return; {132776#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:05,150 INFO L290 TraceCheckUtils]: 136: Hoare triple {132776#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132776#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:05,150 INFO L290 TraceCheckUtils]: 137: Hoare triple {132776#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132801#(<= |main_#t~post8| 15)} is VALID [2022-04-08 12:44:05,150 INFO L290 TraceCheckUtils]: 138: Hoare triple {132801#(<= |main_#t~post8| 15)} assume !(#t~post8 < 100);havoc #t~post8; {132370#false} is VALID [2022-04-08 12:44:05,150 INFO L290 TraceCheckUtils]: 139: Hoare triple {132370#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132370#false} is VALID [2022-04-08 12:44:05,151 INFO L290 TraceCheckUtils]: 140: Hoare triple {132370#false} assume !(#t~post6 < 100);havoc #t~post6; {132370#false} is VALID [2022-04-08 12:44:05,151 INFO L272 TraceCheckUtils]: 141: Hoare triple {132370#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132370#false} is VALID [2022-04-08 12:44:05,151 INFO L290 TraceCheckUtils]: 142: Hoare triple {132370#false} ~cond := #in~cond; {132370#false} is VALID [2022-04-08 12:44:05,151 INFO L290 TraceCheckUtils]: 143: Hoare triple {132370#false} assume 0 == ~cond; {132370#false} is VALID [2022-04-08 12:44:05,151 INFO L290 TraceCheckUtils]: 144: Hoare triple {132370#false} assume !false; {132370#false} is VALID [2022-04-08 12:44:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 36 proven. 566 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:44:05,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:44:06,092 INFO L290 TraceCheckUtils]: 144: Hoare triple {132370#false} assume !false; {132370#false} is VALID [2022-04-08 12:44:06,092 INFO L290 TraceCheckUtils]: 143: Hoare triple {132370#false} assume 0 == ~cond; {132370#false} is VALID [2022-04-08 12:44:06,093 INFO L290 TraceCheckUtils]: 142: Hoare triple {132370#false} ~cond := #in~cond; {132370#false} is VALID [2022-04-08 12:44:06,093 INFO L272 TraceCheckUtils]: 141: Hoare triple {132370#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132370#false} is VALID [2022-04-08 12:44:06,093 INFO L290 TraceCheckUtils]: 140: Hoare triple {132370#false} assume !(#t~post6 < 100);havoc #t~post6; {132370#false} is VALID [2022-04-08 12:44:06,093 INFO L290 TraceCheckUtils]: 139: Hoare triple {132370#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132370#false} is VALID [2022-04-08 12:44:06,093 INFO L290 TraceCheckUtils]: 138: Hoare triple {132841#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {132370#false} is VALID [2022-04-08 12:44:06,093 INFO L290 TraceCheckUtils]: 137: Hoare triple {132845#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132841#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:44:06,094 INFO L290 TraceCheckUtils]: 136: Hoare triple {132845#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132845#(< ~counter~0 100)} is VALID [2022-04-08 12:44:06,094 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {132369#true} {132845#(< ~counter~0 100)} #98#return; {132845#(< ~counter~0 100)} is VALID [2022-04-08 12:44:06,094 INFO L290 TraceCheckUtils]: 134: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,094 INFO L290 TraceCheckUtils]: 133: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,094 INFO L290 TraceCheckUtils]: 132: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,094 INFO L272 TraceCheckUtils]: 131: Hoare triple {132845#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,095 INFO L290 TraceCheckUtils]: 130: Hoare triple {132845#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {132845#(< ~counter~0 100)} is VALID [2022-04-08 12:44:06,098 INFO L290 TraceCheckUtils]: 129: Hoare triple {132870#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132845#(< ~counter~0 100)} is VALID [2022-04-08 12:44:06,098 INFO L290 TraceCheckUtils]: 128: Hoare triple {132870#(< ~counter~0 99)} assume !(~r~0 > 0); {132870#(< ~counter~0 99)} is VALID [2022-04-08 12:44:06,098 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132369#true} {132870#(< ~counter~0 99)} #96#return; {132870#(< ~counter~0 99)} is VALID [2022-04-08 12:44:06,099 INFO L290 TraceCheckUtils]: 126: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,099 INFO L290 TraceCheckUtils]: 125: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,099 INFO L290 TraceCheckUtils]: 124: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,099 INFO L272 TraceCheckUtils]: 123: Hoare triple {132870#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,099 INFO L290 TraceCheckUtils]: 122: Hoare triple {132870#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {132870#(< ~counter~0 99)} is VALID [2022-04-08 12:44:06,101 INFO L290 TraceCheckUtils]: 121: Hoare triple {132895#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132870#(< ~counter~0 99)} is VALID [2022-04-08 12:44:06,101 INFO L290 TraceCheckUtils]: 120: Hoare triple {132895#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132895#(< ~counter~0 98)} is VALID [2022-04-08 12:44:06,101 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132369#true} {132895#(< ~counter~0 98)} #96#return; {132895#(< ~counter~0 98)} is VALID [2022-04-08 12:44:06,101 INFO L290 TraceCheckUtils]: 118: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,102 INFO L290 TraceCheckUtils]: 117: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,102 INFO L290 TraceCheckUtils]: 116: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,102 INFO L272 TraceCheckUtils]: 115: Hoare triple {132895#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,102 INFO L290 TraceCheckUtils]: 114: Hoare triple {132895#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {132895#(< ~counter~0 98)} is VALID [2022-04-08 12:44:06,103 INFO L290 TraceCheckUtils]: 113: Hoare triple {132920#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132895#(< ~counter~0 98)} is VALID [2022-04-08 12:44:06,104 INFO L290 TraceCheckUtils]: 112: Hoare triple {132920#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132920#(< ~counter~0 97)} is VALID [2022-04-08 12:44:06,104 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132369#true} {132920#(< ~counter~0 97)} #96#return; {132920#(< ~counter~0 97)} is VALID [2022-04-08 12:44:06,104 INFO L290 TraceCheckUtils]: 110: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,104 INFO L290 TraceCheckUtils]: 109: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,104 INFO L290 TraceCheckUtils]: 108: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,104 INFO L272 TraceCheckUtils]: 107: Hoare triple {132920#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,105 INFO L290 TraceCheckUtils]: 106: Hoare triple {132920#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {132920#(< ~counter~0 97)} is VALID [2022-04-08 12:44:06,106 INFO L290 TraceCheckUtils]: 105: Hoare triple {132945#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132920#(< ~counter~0 97)} is VALID [2022-04-08 12:44:06,106 INFO L290 TraceCheckUtils]: 104: Hoare triple {132945#(< ~counter~0 96)} assume !!(0 != ~r~0); {132945#(< ~counter~0 96)} is VALID [2022-04-08 12:44:06,107 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132369#true} {132945#(< ~counter~0 96)} #94#return; {132945#(< ~counter~0 96)} is VALID [2022-04-08 12:44:06,107 INFO L290 TraceCheckUtils]: 102: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,107 INFO L290 TraceCheckUtils]: 101: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,107 INFO L290 TraceCheckUtils]: 100: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,107 INFO L272 TraceCheckUtils]: 99: Hoare triple {132945#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,107 INFO L290 TraceCheckUtils]: 98: Hoare triple {132945#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {132945#(< ~counter~0 96)} is VALID [2022-04-08 12:44:06,109 INFO L290 TraceCheckUtils]: 97: Hoare triple {132970#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132945#(< ~counter~0 96)} is VALID [2022-04-08 12:44:06,109 INFO L290 TraceCheckUtils]: 96: Hoare triple {132970#(< ~counter~0 95)} assume !(~r~0 < 0); {132970#(< ~counter~0 95)} is VALID [2022-04-08 12:44:06,110 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132369#true} {132970#(< ~counter~0 95)} #98#return; {132970#(< ~counter~0 95)} is VALID [2022-04-08 12:44:06,110 INFO L290 TraceCheckUtils]: 94: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,110 INFO L290 TraceCheckUtils]: 93: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,110 INFO L290 TraceCheckUtils]: 92: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,110 INFO L272 TraceCheckUtils]: 91: Hoare triple {132970#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,110 INFO L290 TraceCheckUtils]: 90: Hoare triple {132970#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {132970#(< ~counter~0 95)} is VALID [2022-04-08 12:44:06,111 INFO L290 TraceCheckUtils]: 89: Hoare triple {132995#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132970#(< ~counter~0 95)} is VALID [2022-04-08 12:44:06,112 INFO L290 TraceCheckUtils]: 88: Hoare triple {132995#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132995#(< ~counter~0 94)} is VALID [2022-04-08 12:44:06,112 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132369#true} {132995#(< ~counter~0 94)} #98#return; {132995#(< ~counter~0 94)} is VALID [2022-04-08 12:44:06,112 INFO L290 TraceCheckUtils]: 86: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,112 INFO L290 TraceCheckUtils]: 85: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,112 INFO L290 TraceCheckUtils]: 84: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,112 INFO L272 TraceCheckUtils]: 83: Hoare triple {132995#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,113 INFO L290 TraceCheckUtils]: 82: Hoare triple {132995#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {132995#(< ~counter~0 94)} is VALID [2022-04-08 12:44:06,114 INFO L290 TraceCheckUtils]: 81: Hoare triple {133020#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132995#(< ~counter~0 94)} is VALID [2022-04-08 12:44:06,114 INFO L290 TraceCheckUtils]: 80: Hoare triple {133020#(< ~counter~0 93)} assume !(~r~0 > 0); {133020#(< ~counter~0 93)} is VALID [2022-04-08 12:44:06,115 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132369#true} {133020#(< ~counter~0 93)} #96#return; {133020#(< ~counter~0 93)} is VALID [2022-04-08 12:44:06,115 INFO L290 TraceCheckUtils]: 78: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,115 INFO L290 TraceCheckUtils]: 77: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,115 INFO L290 TraceCheckUtils]: 76: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,115 INFO L272 TraceCheckUtils]: 75: Hoare triple {133020#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,115 INFO L290 TraceCheckUtils]: 74: Hoare triple {133020#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {133020#(< ~counter~0 93)} is VALID [2022-04-08 12:44:06,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {133045#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133020#(< ~counter~0 93)} is VALID [2022-04-08 12:44:06,117 INFO L290 TraceCheckUtils]: 72: Hoare triple {133045#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133045#(< ~counter~0 92)} is VALID [2022-04-08 12:44:06,117 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132369#true} {133045#(< ~counter~0 92)} #96#return; {133045#(< ~counter~0 92)} is VALID [2022-04-08 12:44:06,117 INFO L290 TraceCheckUtils]: 70: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,117 INFO L290 TraceCheckUtils]: 69: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,117 INFO L290 TraceCheckUtils]: 68: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,117 INFO L272 TraceCheckUtils]: 67: Hoare triple {133045#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {133045#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {133045#(< ~counter~0 92)} is VALID [2022-04-08 12:44:06,119 INFO L290 TraceCheckUtils]: 65: Hoare triple {133070#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133045#(< ~counter~0 92)} is VALID [2022-04-08 12:44:06,119 INFO L290 TraceCheckUtils]: 64: Hoare triple {133070#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133070#(< ~counter~0 91)} is VALID [2022-04-08 12:44:06,120 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132369#true} {133070#(< ~counter~0 91)} #96#return; {133070#(< ~counter~0 91)} is VALID [2022-04-08 12:44:06,120 INFO L290 TraceCheckUtils]: 62: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,120 INFO L290 TraceCheckUtils]: 61: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,120 INFO L290 TraceCheckUtils]: 60: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,120 INFO L272 TraceCheckUtils]: 59: Hoare triple {133070#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,120 INFO L290 TraceCheckUtils]: 58: Hoare triple {133070#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {133070#(< ~counter~0 91)} is VALID [2022-04-08 12:44:06,122 INFO L290 TraceCheckUtils]: 57: Hoare triple {133095#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133070#(< ~counter~0 91)} is VALID [2022-04-08 12:44:06,122 INFO L290 TraceCheckUtils]: 56: Hoare triple {133095#(< ~counter~0 90)} assume !!(0 != ~r~0); {133095#(< ~counter~0 90)} is VALID [2022-04-08 12:44:06,123 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132369#true} {133095#(< ~counter~0 90)} #94#return; {133095#(< ~counter~0 90)} is VALID [2022-04-08 12:44:06,123 INFO L290 TraceCheckUtils]: 54: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,123 INFO L290 TraceCheckUtils]: 53: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,123 INFO L290 TraceCheckUtils]: 52: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,123 INFO L272 TraceCheckUtils]: 51: Hoare triple {133095#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,124 INFO L290 TraceCheckUtils]: 50: Hoare triple {133095#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {133095#(< ~counter~0 90)} is VALID [2022-04-08 12:44:06,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {133120#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133095#(< ~counter~0 90)} is VALID [2022-04-08 12:44:06,126 INFO L290 TraceCheckUtils]: 48: Hoare triple {133120#(< ~counter~0 89)} assume !(~r~0 < 0); {133120#(< ~counter~0 89)} is VALID [2022-04-08 12:44:06,126 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132369#true} {133120#(< ~counter~0 89)} #98#return; {133120#(< ~counter~0 89)} is VALID [2022-04-08 12:44:06,126 INFO L290 TraceCheckUtils]: 46: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,126 INFO L290 TraceCheckUtils]: 44: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,126 INFO L272 TraceCheckUtils]: 43: Hoare triple {133120#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {133120#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {133120#(< ~counter~0 89)} is VALID [2022-04-08 12:44:06,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {133145#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133120#(< ~counter~0 89)} is VALID [2022-04-08 12:44:06,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {133145#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133145#(< ~counter~0 88)} is VALID [2022-04-08 12:44:06,130 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132369#true} {133145#(< ~counter~0 88)} #98#return; {133145#(< ~counter~0 88)} is VALID [2022-04-08 12:44:06,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,130 INFO L272 TraceCheckUtils]: 35: Hoare triple {133145#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {133145#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {133145#(< ~counter~0 88)} is VALID [2022-04-08 12:44:06,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {133170#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133145#(< ~counter~0 88)} is VALID [2022-04-08 12:44:06,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {133170#(< ~counter~0 87)} assume !(~r~0 > 0); {133170#(< ~counter~0 87)} is VALID [2022-04-08 12:44:06,132 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132369#true} {133170#(< ~counter~0 87)} #96#return; {133170#(< ~counter~0 87)} is VALID [2022-04-08 12:44:06,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,133 INFO L272 TraceCheckUtils]: 27: Hoare triple {133170#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {133170#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {133170#(< ~counter~0 87)} is VALID [2022-04-08 12:44:06,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {133195#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133170#(< ~counter~0 87)} is VALID [2022-04-08 12:44:06,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {133195#(< ~counter~0 86)} assume !!(0 != ~r~0); {133195#(< ~counter~0 86)} is VALID [2022-04-08 12:44:06,135 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132369#true} {133195#(< ~counter~0 86)} #94#return; {133195#(< ~counter~0 86)} is VALID [2022-04-08 12:44:06,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,135 INFO L272 TraceCheckUtils]: 19: Hoare triple {133195#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {133195#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {133195#(< ~counter~0 86)} is VALID [2022-04-08 12:44:06,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {133220#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133195#(< ~counter~0 86)} is VALID [2022-04-08 12:44:06,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {133220#(< ~counter~0 85)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {133220#(< ~counter~0 85)} is VALID [2022-04-08 12:44:06,137 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132369#true} {133220#(< ~counter~0 85)} #92#return; {133220#(< ~counter~0 85)} is VALID [2022-04-08 12:44:06,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,137 INFO L272 TraceCheckUtils]: 11: Hoare triple {133220#(< ~counter~0 85)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,138 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132369#true} {133220#(< ~counter~0 85)} #90#return; {133220#(< ~counter~0 85)} is VALID [2022-04-08 12:44:06,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 12:44:06,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 12:44:06,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 12:44:06,138 INFO L272 TraceCheckUtils]: 6: Hoare triple {133220#(< ~counter~0 85)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 12:44:06,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {133220#(< ~counter~0 85)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {133220#(< ~counter~0 85)} is VALID [2022-04-08 12:44:06,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {133220#(< ~counter~0 85)} call #t~ret9 := main(); {133220#(< ~counter~0 85)} is VALID [2022-04-08 12:44:06,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133220#(< ~counter~0 85)} {132369#true} #102#return; {133220#(< ~counter~0 85)} is VALID [2022-04-08 12:44:06,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {133220#(< ~counter~0 85)} assume true; {133220#(< ~counter~0 85)} is VALID [2022-04-08 12:44:06,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {132369#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {133220#(< ~counter~0 85)} is VALID [2022-04-08 12:44:06,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {132369#true} call ULTIMATE.init(); {132369#true} is VALID [2022-04-08 12:44:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 36 proven. 146 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-08 12:44:06,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:44:06,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142097439] [2022-04-08 12:44:06,140 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:44:06,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024345145] [2022-04-08 12:44:06,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024345145] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:44:06,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:44:06,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-08 12:44:06,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:44:06,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [790463912] [2022-04-08 12:44:06,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [790463912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:06,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:06,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 12:44:06,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174689310] [2022-04-08 12:44:06,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:44:06,141 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 145 [2022-04-08 12:44:06,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:44:06,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 12:44:06,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:06,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 12:44:06,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:06,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 12:44:06,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 12:44:06,333 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 12:44:11,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:11,908 INFO L93 Difference]: Finished difference Result 981 states and 1345 transitions. [2022-04-08 12:44:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 12:44:11,909 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 145 [2022-04-08 12:44:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:44:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 12:44:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-08 12:44:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 12:44:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-08 12:44:11,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 337 transitions. [2022-04-08 12:44:12,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:12,395 INFO L225 Difference]: With dead ends: 981 [2022-04-08 12:44:12,395 INFO L226 Difference]: Without dead ends: 789 [2022-04-08 12:44:12,396 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=995, Invalid=1357, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 12:44:12,397 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 274 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 12:44:12,397 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 334 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 12:44:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-04-08 12:44:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 778. [2022-04-08 12:44:15,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:44:15,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:44:15,322 INFO L74 IsIncluded]: Start isIncluded. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:44:15,323 INFO L87 Difference]: Start difference. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:44:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:15,343 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-08 12:44:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-08 12:44:15,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:15,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:15,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) Second operand 789 states. [2022-04-08 12:44:15,345 INFO L87 Difference]: Start difference. First operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) Second operand 789 states. [2022-04-08 12:44:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:15,366 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-08 12:44:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-08 12:44:15,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:15,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:15,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:44:15,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:44:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:44:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1041 transitions. [2022-04-08 12:44:15,396 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1041 transitions. Word has length 145 [2022-04-08 12:44:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:44:15,396 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 1041 transitions. [2022-04-08 12:44:15,396 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 12:44:15,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 778 states and 1041 transitions. [2022-04-08 12:44:31,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1041 edges. 1037 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1041 transitions. [2022-04-08 12:44:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-08 12:44:31,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:31,778 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 9, 8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:44:31,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-08 12:44:31,992 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-08 12:44:31,992 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:31,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 21 times [2022-04-08 12:44:31,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:31,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [606985912] [2022-04-08 12:44:31,993 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:44:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 22 times [2022-04-08 12:44:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:31,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601601772] [2022-04-08 12:44:31,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:31,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:32,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:44:32,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1876617783] [2022-04-08 12:44:32,007 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:44:32,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:32,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:32,008 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:44:32,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-08 12:44:32,181 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:44:32,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:44:32,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 12:44:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:32,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:44:32,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {138396#true} call ULTIMATE.init(); {138396#true} is VALID [2022-04-08 12:44:32,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {138396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {138404#(<= ~counter~0 0)} assume true; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138404#(<= ~counter~0 0)} {138396#true} #102#return; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {138404#(<= ~counter~0 0)} call #t~ret9 := main(); {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {138404#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,987 INFO L272 TraceCheckUtils]: 6: Hoare triple {138404#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {138404#(<= ~counter~0 0)} ~cond := #in~cond; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {138404#(<= ~counter~0 0)} assume !(0 == ~cond); {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {138404#(<= ~counter~0 0)} assume true; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,989 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138404#(<= ~counter~0 0)} {138404#(<= ~counter~0 0)} #90#return; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,989 INFO L272 TraceCheckUtils]: 11: Hoare triple {138404#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {138404#(<= ~counter~0 0)} ~cond := #in~cond; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {138404#(<= ~counter~0 0)} assume !(0 == ~cond); {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {138404#(<= ~counter~0 0)} assume true; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,990 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138404#(<= ~counter~0 0)} {138404#(<= ~counter~0 0)} #92#return; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {138404#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:32,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {138404#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138453#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:32,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {138453#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {138453#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:32,994 INFO L272 TraceCheckUtils]: 19: Hoare triple {138453#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138453#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:32,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {138453#(<= ~counter~0 1)} ~cond := #in~cond; {138453#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:32,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {138453#(<= ~counter~0 1)} assume !(0 == ~cond); {138453#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:32,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {138453#(<= ~counter~0 1)} assume true; {138453#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:32,995 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138453#(<= ~counter~0 1)} {138453#(<= ~counter~0 1)} #94#return; {138453#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:32,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {138453#(<= ~counter~0 1)} assume !!(0 != ~r~0); {138453#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:32,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {138453#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138478#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:32,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {138478#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {138478#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:32,998 INFO L272 TraceCheckUtils]: 27: Hoare triple {138478#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138478#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:32,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {138478#(<= ~counter~0 2)} ~cond := #in~cond; {138478#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:32,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {138478#(<= ~counter~0 2)} assume !(0 == ~cond); {138478#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:32,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {138478#(<= ~counter~0 2)} assume true; {138478#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:33,000 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138478#(<= ~counter~0 2)} {138478#(<= ~counter~0 2)} #96#return; {138478#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:33,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {138478#(<= ~counter~0 2)} assume !(~r~0 > 0); {138478#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:33,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {138478#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138503#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:33,002 INFO L290 TraceCheckUtils]: 34: Hoare triple {138503#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {138503#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:33,002 INFO L272 TraceCheckUtils]: 35: Hoare triple {138503#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138503#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:33,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {138503#(<= ~counter~0 3)} ~cond := #in~cond; {138503#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:33,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {138503#(<= ~counter~0 3)} assume !(0 == ~cond); {138503#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:33,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {138503#(<= ~counter~0 3)} assume true; {138503#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:33,004 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138503#(<= ~counter~0 3)} {138503#(<= ~counter~0 3)} #98#return; {138503#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:33,004 INFO L290 TraceCheckUtils]: 40: Hoare triple {138503#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {138503#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:33,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {138503#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138528#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:33,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {138528#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {138528#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:33,007 INFO L272 TraceCheckUtils]: 43: Hoare triple {138528#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138528#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:33,007 INFO L290 TraceCheckUtils]: 44: Hoare triple {138528#(<= ~counter~0 4)} ~cond := #in~cond; {138528#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:33,007 INFO L290 TraceCheckUtils]: 45: Hoare triple {138528#(<= ~counter~0 4)} assume !(0 == ~cond); {138528#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:33,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {138528#(<= ~counter~0 4)} assume true; {138528#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:33,008 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138528#(<= ~counter~0 4)} {138528#(<= ~counter~0 4)} #98#return; {138528#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:33,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {138528#(<= ~counter~0 4)} assume !(~r~0 < 0); {138528#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:33,011 INFO L290 TraceCheckUtils]: 49: Hoare triple {138528#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138553#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:33,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {138553#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {138553#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:33,012 INFO L272 TraceCheckUtils]: 51: Hoare triple {138553#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138553#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:33,012 INFO L290 TraceCheckUtils]: 52: Hoare triple {138553#(<= ~counter~0 5)} ~cond := #in~cond; {138553#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:33,012 INFO L290 TraceCheckUtils]: 53: Hoare triple {138553#(<= ~counter~0 5)} assume !(0 == ~cond); {138553#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:33,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {138553#(<= ~counter~0 5)} assume true; {138553#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:33,013 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138553#(<= ~counter~0 5)} {138553#(<= ~counter~0 5)} #94#return; {138553#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:33,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {138553#(<= ~counter~0 5)} assume !!(0 != ~r~0); {138553#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:33,015 INFO L290 TraceCheckUtils]: 57: Hoare triple {138553#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138578#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:33,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {138578#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {138578#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:33,016 INFO L272 TraceCheckUtils]: 59: Hoare triple {138578#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138578#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:33,016 INFO L290 TraceCheckUtils]: 60: Hoare triple {138578#(<= ~counter~0 6)} ~cond := #in~cond; {138578#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:33,017 INFO L290 TraceCheckUtils]: 61: Hoare triple {138578#(<= ~counter~0 6)} assume !(0 == ~cond); {138578#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:33,017 INFO L290 TraceCheckUtils]: 62: Hoare triple {138578#(<= ~counter~0 6)} assume true; {138578#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:33,017 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {138578#(<= ~counter~0 6)} {138578#(<= ~counter~0 6)} #96#return; {138578#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:33,018 INFO L290 TraceCheckUtils]: 64: Hoare triple {138578#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138578#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:33,020 INFO L290 TraceCheckUtils]: 65: Hoare triple {138578#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138603#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:33,020 INFO L290 TraceCheckUtils]: 66: Hoare triple {138603#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {138603#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:33,021 INFO L272 TraceCheckUtils]: 67: Hoare triple {138603#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138603#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:33,021 INFO L290 TraceCheckUtils]: 68: Hoare triple {138603#(<= ~counter~0 7)} ~cond := #in~cond; {138603#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:33,021 INFO L290 TraceCheckUtils]: 69: Hoare triple {138603#(<= ~counter~0 7)} assume !(0 == ~cond); {138603#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:33,021 INFO L290 TraceCheckUtils]: 70: Hoare triple {138603#(<= ~counter~0 7)} assume true; {138603#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:33,022 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {138603#(<= ~counter~0 7)} {138603#(<= ~counter~0 7)} #96#return; {138603#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:33,022 INFO L290 TraceCheckUtils]: 72: Hoare triple {138603#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138603#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:33,024 INFO L290 TraceCheckUtils]: 73: Hoare triple {138603#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138628#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:33,025 INFO L290 TraceCheckUtils]: 74: Hoare triple {138628#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {138628#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:33,025 INFO L272 TraceCheckUtils]: 75: Hoare triple {138628#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138628#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:33,025 INFO L290 TraceCheckUtils]: 76: Hoare triple {138628#(<= ~counter~0 8)} ~cond := #in~cond; {138628#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:33,026 INFO L290 TraceCheckUtils]: 77: Hoare triple {138628#(<= ~counter~0 8)} assume !(0 == ~cond); {138628#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:33,026 INFO L290 TraceCheckUtils]: 78: Hoare triple {138628#(<= ~counter~0 8)} assume true; {138628#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:33,026 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {138628#(<= ~counter~0 8)} {138628#(<= ~counter~0 8)} #96#return; {138628#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:33,027 INFO L290 TraceCheckUtils]: 80: Hoare triple {138628#(<= ~counter~0 8)} assume !(~r~0 > 0); {138628#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:33,029 INFO L290 TraceCheckUtils]: 81: Hoare triple {138628#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138653#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:33,029 INFO L290 TraceCheckUtils]: 82: Hoare triple {138653#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {138653#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:33,030 INFO L272 TraceCheckUtils]: 83: Hoare triple {138653#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138653#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:33,030 INFO L290 TraceCheckUtils]: 84: Hoare triple {138653#(<= ~counter~0 9)} ~cond := #in~cond; {138653#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:33,030 INFO L290 TraceCheckUtils]: 85: Hoare triple {138653#(<= ~counter~0 9)} assume !(0 == ~cond); {138653#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:33,030 INFO L290 TraceCheckUtils]: 86: Hoare triple {138653#(<= ~counter~0 9)} assume true; {138653#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:33,031 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {138653#(<= ~counter~0 9)} {138653#(<= ~counter~0 9)} #98#return; {138653#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:33,031 INFO L290 TraceCheckUtils]: 88: Hoare triple {138653#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {138653#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:33,034 INFO L290 TraceCheckUtils]: 89: Hoare triple {138653#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138678#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:33,034 INFO L290 TraceCheckUtils]: 90: Hoare triple {138678#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {138678#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:33,035 INFO L272 TraceCheckUtils]: 91: Hoare triple {138678#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138678#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:33,035 INFO L290 TraceCheckUtils]: 92: Hoare triple {138678#(<= ~counter~0 10)} ~cond := #in~cond; {138678#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:33,035 INFO L290 TraceCheckUtils]: 93: Hoare triple {138678#(<= ~counter~0 10)} assume !(0 == ~cond); {138678#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:33,035 INFO L290 TraceCheckUtils]: 94: Hoare triple {138678#(<= ~counter~0 10)} assume true; {138678#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:33,036 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {138678#(<= ~counter~0 10)} {138678#(<= ~counter~0 10)} #98#return; {138678#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:33,036 INFO L290 TraceCheckUtils]: 96: Hoare triple {138678#(<= ~counter~0 10)} assume !(~r~0 < 0); {138678#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:33,038 INFO L290 TraceCheckUtils]: 97: Hoare triple {138678#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138703#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:33,039 INFO L290 TraceCheckUtils]: 98: Hoare triple {138703#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {138703#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:33,039 INFO L272 TraceCheckUtils]: 99: Hoare triple {138703#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138703#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:33,039 INFO L290 TraceCheckUtils]: 100: Hoare triple {138703#(<= ~counter~0 11)} ~cond := #in~cond; {138703#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:33,040 INFO L290 TraceCheckUtils]: 101: Hoare triple {138703#(<= ~counter~0 11)} assume !(0 == ~cond); {138703#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:33,040 INFO L290 TraceCheckUtils]: 102: Hoare triple {138703#(<= ~counter~0 11)} assume true; {138703#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:33,040 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {138703#(<= ~counter~0 11)} {138703#(<= ~counter~0 11)} #94#return; {138703#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:33,041 INFO L290 TraceCheckUtils]: 104: Hoare triple {138703#(<= ~counter~0 11)} assume !!(0 != ~r~0); {138703#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:33,043 INFO L290 TraceCheckUtils]: 105: Hoare triple {138703#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138728#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:33,043 INFO L290 TraceCheckUtils]: 106: Hoare triple {138728#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {138728#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:33,044 INFO L272 TraceCheckUtils]: 107: Hoare triple {138728#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138728#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:33,044 INFO L290 TraceCheckUtils]: 108: Hoare triple {138728#(<= ~counter~0 12)} ~cond := #in~cond; {138728#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:33,044 INFO L290 TraceCheckUtils]: 109: Hoare triple {138728#(<= ~counter~0 12)} assume !(0 == ~cond); {138728#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:33,044 INFO L290 TraceCheckUtils]: 110: Hoare triple {138728#(<= ~counter~0 12)} assume true; {138728#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:33,045 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {138728#(<= ~counter~0 12)} {138728#(<= ~counter~0 12)} #96#return; {138728#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:33,045 INFO L290 TraceCheckUtils]: 112: Hoare triple {138728#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138728#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:33,048 INFO L290 TraceCheckUtils]: 113: Hoare triple {138728#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138753#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:33,048 INFO L290 TraceCheckUtils]: 114: Hoare triple {138753#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {138753#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:33,049 INFO L272 TraceCheckUtils]: 115: Hoare triple {138753#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138753#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:33,049 INFO L290 TraceCheckUtils]: 116: Hoare triple {138753#(<= ~counter~0 13)} ~cond := #in~cond; {138753#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:33,049 INFO L290 TraceCheckUtils]: 117: Hoare triple {138753#(<= ~counter~0 13)} assume !(0 == ~cond); {138753#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:33,049 INFO L290 TraceCheckUtils]: 118: Hoare triple {138753#(<= ~counter~0 13)} assume true; {138753#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:33,050 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {138753#(<= ~counter~0 13)} {138753#(<= ~counter~0 13)} #96#return; {138753#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:33,050 INFO L290 TraceCheckUtils]: 120: Hoare triple {138753#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138753#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:33,053 INFO L290 TraceCheckUtils]: 121: Hoare triple {138753#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138778#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:33,053 INFO L290 TraceCheckUtils]: 122: Hoare triple {138778#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {138778#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:33,053 INFO L272 TraceCheckUtils]: 123: Hoare triple {138778#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138778#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:33,054 INFO L290 TraceCheckUtils]: 124: Hoare triple {138778#(<= ~counter~0 14)} ~cond := #in~cond; {138778#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:33,054 INFO L290 TraceCheckUtils]: 125: Hoare triple {138778#(<= ~counter~0 14)} assume !(0 == ~cond); {138778#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:33,054 INFO L290 TraceCheckUtils]: 126: Hoare triple {138778#(<= ~counter~0 14)} assume true; {138778#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:33,055 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {138778#(<= ~counter~0 14)} {138778#(<= ~counter~0 14)} #96#return; {138778#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:33,055 INFO L290 TraceCheckUtils]: 128: Hoare triple {138778#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138778#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:33,058 INFO L290 TraceCheckUtils]: 129: Hoare triple {138778#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138803#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:33,058 INFO L290 TraceCheckUtils]: 130: Hoare triple {138803#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {138803#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:33,059 INFO L272 TraceCheckUtils]: 131: Hoare triple {138803#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138803#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:33,059 INFO L290 TraceCheckUtils]: 132: Hoare triple {138803#(<= ~counter~0 15)} ~cond := #in~cond; {138803#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:33,059 INFO L290 TraceCheckUtils]: 133: Hoare triple {138803#(<= ~counter~0 15)} assume !(0 == ~cond); {138803#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:33,060 INFO L290 TraceCheckUtils]: 134: Hoare triple {138803#(<= ~counter~0 15)} assume true; {138803#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:33,060 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {138803#(<= ~counter~0 15)} {138803#(<= ~counter~0 15)} #96#return; {138803#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:33,061 INFO L290 TraceCheckUtils]: 136: Hoare triple {138803#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138803#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:33,061 INFO L290 TraceCheckUtils]: 137: Hoare triple {138803#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138828#(<= |main_#t~post7| 15)} is VALID [2022-04-08 12:44:33,061 INFO L290 TraceCheckUtils]: 138: Hoare triple {138828#(<= |main_#t~post7| 15)} assume !(#t~post7 < 100);havoc #t~post7; {138397#false} is VALID [2022-04-08 12:44:33,061 INFO L290 TraceCheckUtils]: 139: Hoare triple {138397#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138397#false} is VALID [2022-04-08 12:44:33,061 INFO L290 TraceCheckUtils]: 140: Hoare triple {138397#false} assume !(#t~post8 < 100);havoc #t~post8; {138397#false} is VALID [2022-04-08 12:44:33,061 INFO L290 TraceCheckUtils]: 141: Hoare triple {138397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138397#false} is VALID [2022-04-08 12:44:33,061 INFO L290 TraceCheckUtils]: 142: Hoare triple {138397#false} assume !(#t~post6 < 100);havoc #t~post6; {138397#false} is VALID [2022-04-08 12:44:33,062 INFO L272 TraceCheckUtils]: 143: Hoare triple {138397#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138397#false} is VALID [2022-04-08 12:44:33,062 INFO L290 TraceCheckUtils]: 144: Hoare triple {138397#false} ~cond := #in~cond; {138397#false} is VALID [2022-04-08 12:44:33,062 INFO L290 TraceCheckUtils]: 145: Hoare triple {138397#false} assume 0 == ~cond; {138397#false} is VALID [2022-04-08 12:44:33,062 INFO L290 TraceCheckUtils]: 146: Hoare triple {138397#false} assume !false; {138397#false} is VALID [2022-04-08 12:44:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 44 proven. 584 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:44:33,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:44:34,065 INFO L290 TraceCheckUtils]: 146: Hoare triple {138397#false} assume !false; {138397#false} is VALID [2022-04-08 12:44:34,065 INFO L290 TraceCheckUtils]: 145: Hoare triple {138397#false} assume 0 == ~cond; {138397#false} is VALID [2022-04-08 12:44:34,066 INFO L290 TraceCheckUtils]: 144: Hoare triple {138397#false} ~cond := #in~cond; {138397#false} is VALID [2022-04-08 12:44:34,066 INFO L272 TraceCheckUtils]: 143: Hoare triple {138397#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138397#false} is VALID [2022-04-08 12:44:34,066 INFO L290 TraceCheckUtils]: 142: Hoare triple {138397#false} assume !(#t~post6 < 100);havoc #t~post6; {138397#false} is VALID [2022-04-08 12:44:34,066 INFO L290 TraceCheckUtils]: 141: Hoare triple {138397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138397#false} is VALID [2022-04-08 12:44:34,066 INFO L290 TraceCheckUtils]: 140: Hoare triple {138397#false} assume !(#t~post8 < 100);havoc #t~post8; {138397#false} is VALID [2022-04-08 12:44:34,066 INFO L290 TraceCheckUtils]: 139: Hoare triple {138397#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138397#false} is VALID [2022-04-08 12:44:34,066 INFO L290 TraceCheckUtils]: 138: Hoare triple {138880#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {138397#false} is VALID [2022-04-08 12:44:34,066 INFO L290 TraceCheckUtils]: 137: Hoare triple {138884#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138880#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:44:34,067 INFO L290 TraceCheckUtils]: 136: Hoare triple {138884#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138884#(< ~counter~0 100)} is VALID [2022-04-08 12:44:34,067 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {138396#true} {138884#(< ~counter~0 100)} #96#return; {138884#(< ~counter~0 100)} is VALID [2022-04-08 12:44:34,067 INFO L290 TraceCheckUtils]: 134: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,067 INFO L290 TraceCheckUtils]: 133: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,067 INFO L290 TraceCheckUtils]: 132: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,067 INFO L272 TraceCheckUtils]: 131: Hoare triple {138884#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,068 INFO L290 TraceCheckUtils]: 130: Hoare triple {138884#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {138884#(< ~counter~0 100)} is VALID [2022-04-08 12:44:34,071 INFO L290 TraceCheckUtils]: 129: Hoare triple {138909#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138884#(< ~counter~0 100)} is VALID [2022-04-08 12:44:34,071 INFO L290 TraceCheckUtils]: 128: Hoare triple {138909#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138909#(< ~counter~0 99)} is VALID [2022-04-08 12:44:34,071 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {138396#true} {138909#(< ~counter~0 99)} #96#return; {138909#(< ~counter~0 99)} is VALID [2022-04-08 12:44:34,072 INFO L290 TraceCheckUtils]: 126: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,072 INFO L290 TraceCheckUtils]: 125: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,072 INFO L290 TraceCheckUtils]: 124: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,072 INFO L272 TraceCheckUtils]: 123: Hoare triple {138909#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,072 INFO L290 TraceCheckUtils]: 122: Hoare triple {138909#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {138909#(< ~counter~0 99)} is VALID [2022-04-08 12:44:34,073 INFO L290 TraceCheckUtils]: 121: Hoare triple {138934#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138909#(< ~counter~0 99)} is VALID [2022-04-08 12:44:34,074 INFO L290 TraceCheckUtils]: 120: Hoare triple {138934#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138934#(< ~counter~0 98)} is VALID [2022-04-08 12:44:34,074 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {138396#true} {138934#(< ~counter~0 98)} #96#return; {138934#(< ~counter~0 98)} is VALID [2022-04-08 12:44:34,074 INFO L290 TraceCheckUtils]: 118: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,074 INFO L290 TraceCheckUtils]: 117: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,074 INFO L290 TraceCheckUtils]: 116: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,074 INFO L272 TraceCheckUtils]: 115: Hoare triple {138934#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,075 INFO L290 TraceCheckUtils]: 114: Hoare triple {138934#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {138934#(< ~counter~0 98)} is VALID [2022-04-08 12:44:34,076 INFO L290 TraceCheckUtils]: 113: Hoare triple {138959#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138934#(< ~counter~0 98)} is VALID [2022-04-08 12:44:34,077 INFO L290 TraceCheckUtils]: 112: Hoare triple {138959#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138959#(< ~counter~0 97)} is VALID [2022-04-08 12:44:34,077 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {138396#true} {138959#(< ~counter~0 97)} #96#return; {138959#(< ~counter~0 97)} is VALID [2022-04-08 12:44:34,077 INFO L290 TraceCheckUtils]: 110: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,077 INFO L290 TraceCheckUtils]: 109: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,077 INFO L290 TraceCheckUtils]: 108: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,077 INFO L272 TraceCheckUtils]: 107: Hoare triple {138959#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,077 INFO L290 TraceCheckUtils]: 106: Hoare triple {138959#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {138959#(< ~counter~0 97)} is VALID [2022-04-08 12:44:34,079 INFO L290 TraceCheckUtils]: 105: Hoare triple {138984#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138959#(< ~counter~0 97)} is VALID [2022-04-08 12:44:34,079 INFO L290 TraceCheckUtils]: 104: Hoare triple {138984#(< ~counter~0 96)} assume !!(0 != ~r~0); {138984#(< ~counter~0 96)} is VALID [2022-04-08 12:44:34,080 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {138396#true} {138984#(< ~counter~0 96)} #94#return; {138984#(< ~counter~0 96)} is VALID [2022-04-08 12:44:34,080 INFO L290 TraceCheckUtils]: 102: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,080 INFO L290 TraceCheckUtils]: 101: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,080 INFO L290 TraceCheckUtils]: 100: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,080 INFO L272 TraceCheckUtils]: 99: Hoare triple {138984#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,080 INFO L290 TraceCheckUtils]: 98: Hoare triple {138984#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {138984#(< ~counter~0 96)} is VALID [2022-04-08 12:44:34,082 INFO L290 TraceCheckUtils]: 97: Hoare triple {139009#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138984#(< ~counter~0 96)} is VALID [2022-04-08 12:44:34,083 INFO L290 TraceCheckUtils]: 96: Hoare triple {139009#(< ~counter~0 95)} assume !(~r~0 < 0); {139009#(< ~counter~0 95)} is VALID [2022-04-08 12:44:34,083 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {138396#true} {139009#(< ~counter~0 95)} #98#return; {139009#(< ~counter~0 95)} is VALID [2022-04-08 12:44:34,083 INFO L290 TraceCheckUtils]: 94: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,083 INFO L290 TraceCheckUtils]: 93: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,083 INFO L290 TraceCheckUtils]: 92: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,083 INFO L272 TraceCheckUtils]: 91: Hoare triple {139009#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,084 INFO L290 TraceCheckUtils]: 90: Hoare triple {139009#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {139009#(< ~counter~0 95)} is VALID [2022-04-08 12:44:34,085 INFO L290 TraceCheckUtils]: 89: Hoare triple {139034#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139009#(< ~counter~0 95)} is VALID [2022-04-08 12:44:34,085 INFO L290 TraceCheckUtils]: 88: Hoare triple {139034#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {139034#(< ~counter~0 94)} is VALID [2022-04-08 12:44:34,086 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {138396#true} {139034#(< ~counter~0 94)} #98#return; {139034#(< ~counter~0 94)} is VALID [2022-04-08 12:44:34,086 INFO L290 TraceCheckUtils]: 86: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,086 INFO L290 TraceCheckUtils]: 85: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,086 INFO L290 TraceCheckUtils]: 84: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,086 INFO L272 TraceCheckUtils]: 83: Hoare triple {139034#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,086 INFO L290 TraceCheckUtils]: 82: Hoare triple {139034#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {139034#(< ~counter~0 94)} is VALID [2022-04-08 12:44:34,088 INFO L290 TraceCheckUtils]: 81: Hoare triple {139059#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139034#(< ~counter~0 94)} is VALID [2022-04-08 12:44:34,088 INFO L290 TraceCheckUtils]: 80: Hoare triple {139059#(< ~counter~0 93)} assume !(~r~0 > 0); {139059#(< ~counter~0 93)} is VALID [2022-04-08 12:44:34,089 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {138396#true} {139059#(< ~counter~0 93)} #96#return; {139059#(< ~counter~0 93)} is VALID [2022-04-08 12:44:34,089 INFO L290 TraceCheckUtils]: 78: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,089 INFO L290 TraceCheckUtils]: 77: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,089 INFO L290 TraceCheckUtils]: 76: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,089 INFO L272 TraceCheckUtils]: 75: Hoare triple {139059#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,089 INFO L290 TraceCheckUtils]: 74: Hoare triple {139059#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {139059#(< ~counter~0 93)} is VALID [2022-04-08 12:44:34,090 INFO L290 TraceCheckUtils]: 73: Hoare triple {139084#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139059#(< ~counter~0 93)} is VALID [2022-04-08 12:44:34,091 INFO L290 TraceCheckUtils]: 72: Hoare triple {139084#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139084#(< ~counter~0 92)} is VALID [2022-04-08 12:44:34,091 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {138396#true} {139084#(< ~counter~0 92)} #96#return; {139084#(< ~counter~0 92)} is VALID [2022-04-08 12:44:34,091 INFO L290 TraceCheckUtils]: 70: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,091 INFO L290 TraceCheckUtils]: 69: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,091 INFO L290 TraceCheckUtils]: 68: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,092 INFO L272 TraceCheckUtils]: 67: Hoare triple {139084#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,092 INFO L290 TraceCheckUtils]: 66: Hoare triple {139084#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {139084#(< ~counter~0 92)} is VALID [2022-04-08 12:44:34,093 INFO L290 TraceCheckUtils]: 65: Hoare triple {139109#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139084#(< ~counter~0 92)} is VALID [2022-04-08 12:44:34,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {139109#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139109#(< ~counter~0 91)} is VALID [2022-04-08 12:44:34,094 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {138396#true} {139109#(< ~counter~0 91)} #96#return; {139109#(< ~counter~0 91)} is VALID [2022-04-08 12:44:34,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,094 INFO L272 TraceCheckUtils]: 59: Hoare triple {139109#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {139109#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {139109#(< ~counter~0 91)} is VALID [2022-04-08 12:44:34,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {139134#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139109#(< ~counter~0 91)} is VALID [2022-04-08 12:44:34,096 INFO L290 TraceCheckUtils]: 56: Hoare triple {139134#(< ~counter~0 90)} assume !!(0 != ~r~0); {139134#(< ~counter~0 90)} is VALID [2022-04-08 12:44:34,097 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138396#true} {139134#(< ~counter~0 90)} #94#return; {139134#(< ~counter~0 90)} is VALID [2022-04-08 12:44:34,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,097 INFO L290 TraceCheckUtils]: 52: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,097 INFO L272 TraceCheckUtils]: 51: Hoare triple {139134#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,097 INFO L290 TraceCheckUtils]: 50: Hoare triple {139134#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {139134#(< ~counter~0 90)} is VALID [2022-04-08 12:44:34,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {139159#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139134#(< ~counter~0 90)} is VALID [2022-04-08 12:44:34,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {139159#(< ~counter~0 89)} assume !(~r~0 < 0); {139159#(< ~counter~0 89)} is VALID [2022-04-08 12:44:34,100 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138396#true} {139159#(< ~counter~0 89)} #98#return; {139159#(< ~counter~0 89)} is VALID [2022-04-08 12:44:34,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,100 INFO L290 TraceCheckUtils]: 45: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,100 INFO L272 TraceCheckUtils]: 43: Hoare triple {139159#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {139159#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {139159#(< ~counter~0 89)} is VALID [2022-04-08 12:44:34,102 INFO L290 TraceCheckUtils]: 41: Hoare triple {139184#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139159#(< ~counter~0 89)} is VALID [2022-04-08 12:44:34,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {139184#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {139184#(< ~counter~0 88)} is VALID [2022-04-08 12:44:34,103 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138396#true} {139184#(< ~counter~0 88)} #98#return; {139184#(< ~counter~0 88)} is VALID [2022-04-08 12:44:34,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,103 INFO L272 TraceCheckUtils]: 35: Hoare triple {139184#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {139184#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {139184#(< ~counter~0 88)} is VALID [2022-04-08 12:44:34,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {139209#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139184#(< ~counter~0 88)} is VALID [2022-04-08 12:44:34,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {139209#(< ~counter~0 87)} assume !(~r~0 > 0); {139209#(< ~counter~0 87)} is VALID [2022-04-08 12:44:34,106 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138396#true} {139209#(< ~counter~0 87)} #96#return; {139209#(< ~counter~0 87)} is VALID [2022-04-08 12:44:34,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,106 INFO L272 TraceCheckUtils]: 27: Hoare triple {139209#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {139209#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {139209#(< ~counter~0 87)} is VALID [2022-04-08 12:44:34,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {139234#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139209#(< ~counter~0 87)} is VALID [2022-04-08 12:44:34,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {139234#(< ~counter~0 86)} assume !!(0 != ~r~0); {139234#(< ~counter~0 86)} is VALID [2022-04-08 12:44:34,109 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138396#true} {139234#(< ~counter~0 86)} #94#return; {139234#(< ~counter~0 86)} is VALID [2022-04-08 12:44:34,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,109 INFO L272 TraceCheckUtils]: 19: Hoare triple {139234#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {139234#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {139234#(< ~counter~0 86)} is VALID [2022-04-08 12:44:34,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {139259#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139234#(< ~counter~0 86)} is VALID [2022-04-08 12:44:34,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {139259#(< ~counter~0 85)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {139259#(< ~counter~0 85)} is VALID [2022-04-08 12:44:34,112 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138396#true} {139259#(< ~counter~0 85)} #92#return; {139259#(< ~counter~0 85)} is VALID [2022-04-08 12:44:34,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,112 INFO L272 TraceCheckUtils]: 11: Hoare triple {139259#(< ~counter~0 85)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,112 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138396#true} {139259#(< ~counter~0 85)} #90#return; {139259#(< ~counter~0 85)} is VALID [2022-04-08 12:44:34,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 12:44:34,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 12:44:34,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 12:44:34,113 INFO L272 TraceCheckUtils]: 6: Hoare triple {139259#(< ~counter~0 85)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 12:44:34,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {139259#(< ~counter~0 85)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {139259#(< ~counter~0 85)} is VALID [2022-04-08 12:44:34,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {139259#(< ~counter~0 85)} call #t~ret9 := main(); {139259#(< ~counter~0 85)} is VALID [2022-04-08 12:44:34,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139259#(< ~counter~0 85)} {138396#true} #102#return; {139259#(< ~counter~0 85)} is VALID [2022-04-08 12:44:34,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {139259#(< ~counter~0 85)} assume true; {139259#(< ~counter~0 85)} is VALID [2022-04-08 12:44:34,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {138396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {139259#(< ~counter~0 85)} is VALID [2022-04-08 12:44:34,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {138396#true} call ULTIMATE.init(); {138396#true} is VALID [2022-04-08 12:44:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 44 proven. 164 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-08 12:44:34,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:44:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601601772] [2022-04-08 12:44:34,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:44:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876617783] [2022-04-08 12:44:34,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876617783] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:44:34,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:44:34,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-08 12:44:34,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:44:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [606985912] [2022-04-08 12:44:34,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [606985912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:34,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:34,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 12:44:34,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489100145] [2022-04-08 12:44:34,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:44:34,116 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 147 [2022-04-08 12:44:34,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:44:34,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 12:44:34,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:34,308 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 12:44:34,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:34,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 12:44:34,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 12:44:34,309 INFO L87 Difference]: Start difference. First operand 778 states and 1041 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 12:44:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:39,099 INFO L93 Difference]: Finished difference Result 965 states and 1319 transitions. [2022-04-08 12:44:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 12:44:39,100 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 147 [2022-04-08 12:44:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:44:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 12:44:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-08 12:44:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 12:44:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-08 12:44:39,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 336 transitions. [2022-04-08 12:44:39,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:39,526 INFO L225 Difference]: With dead ends: 965 [2022-04-08 12:44:39,526 INFO L226 Difference]: Without dead ends: 795 [2022-04-08 12:44:39,527 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1042, Invalid=1408, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 12:44:39,527 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 219 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 12:44:39,527 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 344 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 12:44:39,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-08 12:44:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2022-04-08 12:44:42,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:44:42,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:44:42,536 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:44:42,537 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:44:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:42,557 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-08 12:44:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-08 12:44:42,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:42,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:42,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 795 states. [2022-04-08 12:44:42,560 INFO L87 Difference]: Start difference. First operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 795 states. [2022-04-08 12:44:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:42,593 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-08 12:44:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-08 12:44:42,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:42,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:42,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:44:42,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:44:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 12:44:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1058 transitions. [2022-04-08 12:44:42,640 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1058 transitions. Word has length 147 [2022-04-08 12:44:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:44:42,640 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 1058 transitions. [2022-04-08 12:44:42,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 12:44:42,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 795 states and 1058 transitions. [2022-04-08 12:44:56,726 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-08 12:44:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-08 12:44:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-08 12:44:56,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:56,728 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:44:56,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-08 12:44:56,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:56,929 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:56,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:56,929 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 15 times [2022-04-08 12:44:56,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:56,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [112714127] [2022-04-08 12:44:56,930 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:44:56,930 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 16 times [2022-04-08 12:44:56,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:56,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781500593] [2022-04-08 12:44:56,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:56,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:56,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:44:56,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207491644] [2022-04-08 12:44:56,944 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:44:56,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:56,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:56,945 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:44:56,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-08 12:44:57,066 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:44:57,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:44:57,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 12:44:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:57,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:44:57,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {144451#true} call ULTIMATE.init(); {144451#true} is VALID [2022-04-08 12:44:57,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {144451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {144459#(<= ~counter~0 0)} assume true; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144459#(<= ~counter~0 0)} {144451#true} #102#return; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {144459#(<= ~counter~0 0)} call #t~ret9 := main(); {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {144459#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {144459#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {144459#(<= ~counter~0 0)} ~cond := #in~cond; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {144459#(<= ~counter~0 0)} assume !(0 == ~cond); {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {144459#(<= ~counter~0 0)} assume true; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,900 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144459#(<= ~counter~0 0)} {144459#(<= ~counter~0 0)} #90#return; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,900 INFO L272 TraceCheckUtils]: 11: Hoare triple {144459#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {144459#(<= ~counter~0 0)} ~cond := #in~cond; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {144459#(<= ~counter~0 0)} assume !(0 == ~cond); {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {144459#(<= ~counter~0 0)} assume true; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,901 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144459#(<= ~counter~0 0)} {144459#(<= ~counter~0 0)} #92#return; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {144459#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:57,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {144459#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144508#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:57,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {144508#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {144508#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:57,906 INFO L272 TraceCheckUtils]: 19: Hoare triple {144508#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144508#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:57,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {144508#(<= ~counter~0 1)} ~cond := #in~cond; {144508#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:57,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {144508#(<= ~counter~0 1)} assume !(0 == ~cond); {144508#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:57,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {144508#(<= ~counter~0 1)} assume true; {144508#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:57,907 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144508#(<= ~counter~0 1)} {144508#(<= ~counter~0 1)} #94#return; {144508#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:57,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {144508#(<= ~counter~0 1)} assume !!(0 != ~r~0); {144508#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:57,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {144508#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144533#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:57,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {144533#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {144533#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:57,911 INFO L272 TraceCheckUtils]: 27: Hoare triple {144533#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144533#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:57,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {144533#(<= ~counter~0 2)} ~cond := #in~cond; {144533#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:57,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {144533#(<= ~counter~0 2)} assume !(0 == ~cond); {144533#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:57,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {144533#(<= ~counter~0 2)} assume true; {144533#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:57,912 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144533#(<= ~counter~0 2)} {144533#(<= ~counter~0 2)} #96#return; {144533#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:57,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {144533#(<= ~counter~0 2)} assume !(~r~0 > 0); {144533#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:57,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {144533#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144558#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:57,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {144558#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {144558#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:57,915 INFO L272 TraceCheckUtils]: 35: Hoare triple {144558#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144558#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:57,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {144558#(<= ~counter~0 3)} ~cond := #in~cond; {144558#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:57,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {144558#(<= ~counter~0 3)} assume !(0 == ~cond); {144558#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:57,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {144558#(<= ~counter~0 3)} assume true; {144558#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:57,917 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144558#(<= ~counter~0 3)} {144558#(<= ~counter~0 3)} #98#return; {144558#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:57,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {144558#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144558#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:57,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {144558#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144583#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:57,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {144583#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {144583#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:57,919 INFO L272 TraceCheckUtils]: 43: Hoare triple {144583#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144583#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:57,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {144583#(<= ~counter~0 4)} ~cond := #in~cond; {144583#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:57,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {144583#(<= ~counter~0 4)} assume !(0 == ~cond); {144583#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:57,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {144583#(<= ~counter~0 4)} assume true; {144583#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:57,921 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {144583#(<= ~counter~0 4)} {144583#(<= ~counter~0 4)} #98#return; {144583#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:57,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {144583#(<= ~counter~0 4)} assume !(~r~0 < 0); {144583#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:57,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {144583#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144608#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:57,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {144608#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {144608#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:57,923 INFO L272 TraceCheckUtils]: 51: Hoare triple {144608#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144608#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:57,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {144608#(<= ~counter~0 5)} ~cond := #in~cond; {144608#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:57,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {144608#(<= ~counter~0 5)} assume !(0 == ~cond); {144608#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:57,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {144608#(<= ~counter~0 5)} assume true; {144608#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:57,925 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {144608#(<= ~counter~0 5)} {144608#(<= ~counter~0 5)} #94#return; {144608#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:57,925 INFO L290 TraceCheckUtils]: 56: Hoare triple {144608#(<= ~counter~0 5)} assume !!(0 != ~r~0); {144608#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:57,927 INFO L290 TraceCheckUtils]: 57: Hoare triple {144608#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144633#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:57,927 INFO L290 TraceCheckUtils]: 58: Hoare triple {144633#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {144633#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:57,928 INFO L272 TraceCheckUtils]: 59: Hoare triple {144633#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144633#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:57,928 INFO L290 TraceCheckUtils]: 60: Hoare triple {144633#(<= ~counter~0 6)} ~cond := #in~cond; {144633#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:57,928 INFO L290 TraceCheckUtils]: 61: Hoare triple {144633#(<= ~counter~0 6)} assume !(0 == ~cond); {144633#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:57,929 INFO L290 TraceCheckUtils]: 62: Hoare triple {144633#(<= ~counter~0 6)} assume true; {144633#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:57,929 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {144633#(<= ~counter~0 6)} {144633#(<= ~counter~0 6)} #96#return; {144633#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:57,929 INFO L290 TraceCheckUtils]: 64: Hoare triple {144633#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144633#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:57,931 INFO L290 TraceCheckUtils]: 65: Hoare triple {144633#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144658#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:57,931 INFO L290 TraceCheckUtils]: 66: Hoare triple {144658#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {144658#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:57,932 INFO L272 TraceCheckUtils]: 67: Hoare triple {144658#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144658#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:57,932 INFO L290 TraceCheckUtils]: 68: Hoare triple {144658#(<= ~counter~0 7)} ~cond := #in~cond; {144658#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:57,932 INFO L290 TraceCheckUtils]: 69: Hoare triple {144658#(<= ~counter~0 7)} assume !(0 == ~cond); {144658#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:57,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {144658#(<= ~counter~0 7)} assume true; {144658#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:57,933 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {144658#(<= ~counter~0 7)} {144658#(<= ~counter~0 7)} #96#return; {144658#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:57,933 INFO L290 TraceCheckUtils]: 72: Hoare triple {144658#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144658#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:57,935 INFO L290 TraceCheckUtils]: 73: Hoare triple {144658#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144683#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:57,935 INFO L290 TraceCheckUtils]: 74: Hoare triple {144683#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {144683#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:57,936 INFO L272 TraceCheckUtils]: 75: Hoare triple {144683#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144683#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:57,936 INFO L290 TraceCheckUtils]: 76: Hoare triple {144683#(<= ~counter~0 8)} ~cond := #in~cond; {144683#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:57,936 INFO L290 TraceCheckUtils]: 77: Hoare triple {144683#(<= ~counter~0 8)} assume !(0 == ~cond); {144683#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:57,937 INFO L290 TraceCheckUtils]: 78: Hoare triple {144683#(<= ~counter~0 8)} assume true; {144683#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:57,937 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {144683#(<= ~counter~0 8)} {144683#(<= ~counter~0 8)} #96#return; {144683#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:57,937 INFO L290 TraceCheckUtils]: 80: Hoare triple {144683#(<= ~counter~0 8)} assume !(~r~0 > 0); {144683#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:57,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {144683#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144708#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:57,939 INFO L290 TraceCheckUtils]: 82: Hoare triple {144708#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {144708#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:57,940 INFO L272 TraceCheckUtils]: 83: Hoare triple {144708#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144708#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:57,940 INFO L290 TraceCheckUtils]: 84: Hoare triple {144708#(<= ~counter~0 9)} ~cond := #in~cond; {144708#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:57,940 INFO L290 TraceCheckUtils]: 85: Hoare triple {144708#(<= ~counter~0 9)} assume !(0 == ~cond); {144708#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:57,940 INFO L290 TraceCheckUtils]: 86: Hoare triple {144708#(<= ~counter~0 9)} assume true; {144708#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:57,941 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {144708#(<= ~counter~0 9)} {144708#(<= ~counter~0 9)} #98#return; {144708#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:57,941 INFO L290 TraceCheckUtils]: 88: Hoare triple {144708#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144708#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:57,942 INFO L290 TraceCheckUtils]: 89: Hoare triple {144708#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144733#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:57,943 INFO L290 TraceCheckUtils]: 90: Hoare triple {144733#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {144733#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:57,943 INFO L272 TraceCheckUtils]: 91: Hoare triple {144733#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144733#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:57,944 INFO L290 TraceCheckUtils]: 92: Hoare triple {144733#(<= ~counter~0 10)} ~cond := #in~cond; {144733#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:57,944 INFO L290 TraceCheckUtils]: 93: Hoare triple {144733#(<= ~counter~0 10)} assume !(0 == ~cond); {144733#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:57,944 INFO L290 TraceCheckUtils]: 94: Hoare triple {144733#(<= ~counter~0 10)} assume true; {144733#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:57,945 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {144733#(<= ~counter~0 10)} {144733#(<= ~counter~0 10)} #98#return; {144733#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:57,945 INFO L290 TraceCheckUtils]: 96: Hoare triple {144733#(<= ~counter~0 10)} assume !(~r~0 < 0); {144733#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:57,947 INFO L290 TraceCheckUtils]: 97: Hoare triple {144733#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144758#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:57,948 INFO L290 TraceCheckUtils]: 98: Hoare triple {144758#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {144758#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:57,948 INFO L272 TraceCheckUtils]: 99: Hoare triple {144758#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144758#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:57,948 INFO L290 TraceCheckUtils]: 100: Hoare triple {144758#(<= ~counter~0 11)} ~cond := #in~cond; {144758#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:57,949 INFO L290 TraceCheckUtils]: 101: Hoare triple {144758#(<= ~counter~0 11)} assume !(0 == ~cond); {144758#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:57,949 INFO L290 TraceCheckUtils]: 102: Hoare triple {144758#(<= ~counter~0 11)} assume true; {144758#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:57,949 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {144758#(<= ~counter~0 11)} {144758#(<= ~counter~0 11)} #94#return; {144758#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:57,950 INFO L290 TraceCheckUtils]: 104: Hoare triple {144758#(<= ~counter~0 11)} assume !!(0 != ~r~0); {144758#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:57,951 INFO L290 TraceCheckUtils]: 105: Hoare triple {144758#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144783#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:57,952 INFO L290 TraceCheckUtils]: 106: Hoare triple {144783#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {144783#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:57,952 INFO L272 TraceCheckUtils]: 107: Hoare triple {144783#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144783#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:57,952 INFO L290 TraceCheckUtils]: 108: Hoare triple {144783#(<= ~counter~0 12)} ~cond := #in~cond; {144783#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:57,953 INFO L290 TraceCheckUtils]: 109: Hoare triple {144783#(<= ~counter~0 12)} assume !(0 == ~cond); {144783#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:57,953 INFO L290 TraceCheckUtils]: 110: Hoare triple {144783#(<= ~counter~0 12)} assume true; {144783#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:57,953 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {144783#(<= ~counter~0 12)} {144783#(<= ~counter~0 12)} #96#return; {144783#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:57,954 INFO L290 TraceCheckUtils]: 112: Hoare triple {144783#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144783#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:57,955 INFO L290 TraceCheckUtils]: 113: Hoare triple {144783#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144808#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:57,956 INFO L290 TraceCheckUtils]: 114: Hoare triple {144808#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {144808#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:57,956 INFO L272 TraceCheckUtils]: 115: Hoare triple {144808#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144808#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:57,956 INFO L290 TraceCheckUtils]: 116: Hoare triple {144808#(<= ~counter~0 13)} ~cond := #in~cond; {144808#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:57,957 INFO L290 TraceCheckUtils]: 117: Hoare triple {144808#(<= ~counter~0 13)} assume !(0 == ~cond); {144808#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:57,957 INFO L290 TraceCheckUtils]: 118: Hoare triple {144808#(<= ~counter~0 13)} assume true; {144808#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:57,957 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {144808#(<= ~counter~0 13)} {144808#(<= ~counter~0 13)} #96#return; {144808#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:57,958 INFO L290 TraceCheckUtils]: 120: Hoare triple {144808#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144808#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:57,960 INFO L290 TraceCheckUtils]: 121: Hoare triple {144808#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144833#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:57,960 INFO L290 TraceCheckUtils]: 122: Hoare triple {144833#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {144833#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:57,961 INFO L272 TraceCheckUtils]: 123: Hoare triple {144833#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144833#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:57,961 INFO L290 TraceCheckUtils]: 124: Hoare triple {144833#(<= ~counter~0 14)} ~cond := #in~cond; {144833#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:57,961 INFO L290 TraceCheckUtils]: 125: Hoare triple {144833#(<= ~counter~0 14)} assume !(0 == ~cond); {144833#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:57,962 INFO L290 TraceCheckUtils]: 126: Hoare triple {144833#(<= ~counter~0 14)} assume true; {144833#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:57,962 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {144833#(<= ~counter~0 14)} {144833#(<= ~counter~0 14)} #96#return; {144833#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:57,962 INFO L290 TraceCheckUtils]: 128: Hoare triple {144833#(<= ~counter~0 14)} assume !(~r~0 > 0); {144833#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:57,964 INFO L290 TraceCheckUtils]: 129: Hoare triple {144833#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144858#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:57,965 INFO L290 TraceCheckUtils]: 130: Hoare triple {144858#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {144858#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:57,965 INFO L272 TraceCheckUtils]: 131: Hoare triple {144858#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144858#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:57,965 INFO L290 TraceCheckUtils]: 132: Hoare triple {144858#(<= ~counter~0 15)} ~cond := #in~cond; {144858#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:57,966 INFO L290 TraceCheckUtils]: 133: Hoare triple {144858#(<= ~counter~0 15)} assume !(0 == ~cond); {144858#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:57,966 INFO L290 TraceCheckUtils]: 134: Hoare triple {144858#(<= ~counter~0 15)} assume true; {144858#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:57,966 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {144858#(<= ~counter~0 15)} {144858#(<= ~counter~0 15)} #98#return; {144858#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:57,967 INFO L290 TraceCheckUtils]: 136: Hoare triple {144858#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144858#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:57,969 INFO L290 TraceCheckUtils]: 137: Hoare triple {144858#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144883#(<= ~counter~0 16)} is VALID [2022-04-08 12:44:57,970 INFO L290 TraceCheckUtils]: 138: Hoare triple {144883#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {144883#(<= ~counter~0 16)} is VALID [2022-04-08 12:44:57,970 INFO L272 TraceCheckUtils]: 139: Hoare triple {144883#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144883#(<= ~counter~0 16)} is VALID [2022-04-08 12:44:57,971 INFO L290 TraceCheckUtils]: 140: Hoare triple {144883#(<= ~counter~0 16)} ~cond := #in~cond; {144883#(<= ~counter~0 16)} is VALID [2022-04-08 12:44:57,971 INFO L290 TraceCheckUtils]: 141: Hoare triple {144883#(<= ~counter~0 16)} assume !(0 == ~cond); {144883#(<= ~counter~0 16)} is VALID [2022-04-08 12:44:57,971 INFO L290 TraceCheckUtils]: 142: Hoare triple {144883#(<= ~counter~0 16)} assume true; {144883#(<= ~counter~0 16)} is VALID [2022-04-08 12:44:57,972 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {144883#(<= ~counter~0 16)} {144883#(<= ~counter~0 16)} #98#return; {144883#(<= ~counter~0 16)} is VALID [2022-04-08 12:44:57,972 INFO L290 TraceCheckUtils]: 144: Hoare triple {144883#(<= ~counter~0 16)} assume !(~r~0 < 0); {144883#(<= ~counter~0 16)} is VALID [2022-04-08 12:44:57,972 INFO L290 TraceCheckUtils]: 145: Hoare triple {144883#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144908#(<= |main_#t~post6| 16)} is VALID [2022-04-08 12:44:57,973 INFO L290 TraceCheckUtils]: 146: Hoare triple {144908#(<= |main_#t~post6| 16)} assume !(#t~post6 < 100);havoc #t~post6; {144452#false} is VALID [2022-04-08 12:44:57,973 INFO L272 TraceCheckUtils]: 147: Hoare triple {144452#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144452#false} is VALID [2022-04-08 12:44:57,973 INFO L290 TraceCheckUtils]: 148: Hoare triple {144452#false} ~cond := #in~cond; {144452#false} is VALID [2022-04-08 12:44:57,973 INFO L290 TraceCheckUtils]: 149: Hoare triple {144452#false} assume 0 == ~cond; {144452#false} is VALID [2022-04-08 12:44:57,973 INFO L290 TraceCheckUtils]: 150: Hoare triple {144452#false} assume !false; {144452#false} is VALID [2022-04-08 12:44:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 32 proven. 642 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:44:57,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:44:59,003 INFO L290 TraceCheckUtils]: 150: Hoare triple {144452#false} assume !false; {144452#false} is VALID [2022-04-08 12:44:59,003 INFO L290 TraceCheckUtils]: 149: Hoare triple {144452#false} assume 0 == ~cond; {144452#false} is VALID [2022-04-08 12:44:59,003 INFO L290 TraceCheckUtils]: 148: Hoare triple {144452#false} ~cond := #in~cond; {144452#false} is VALID [2022-04-08 12:44:59,003 INFO L272 TraceCheckUtils]: 147: Hoare triple {144452#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144452#false} is VALID [2022-04-08 12:44:59,003 INFO L290 TraceCheckUtils]: 146: Hoare triple {144936#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {144452#false} is VALID [2022-04-08 12:44:59,003 INFO L290 TraceCheckUtils]: 145: Hoare triple {144940#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144936#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:44:59,004 INFO L290 TraceCheckUtils]: 144: Hoare triple {144940#(< ~counter~0 100)} assume !(~r~0 < 0); {144940#(< ~counter~0 100)} is VALID [2022-04-08 12:44:59,004 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {144451#true} {144940#(< ~counter~0 100)} #98#return; {144940#(< ~counter~0 100)} is VALID [2022-04-08 12:44:59,004 INFO L290 TraceCheckUtils]: 142: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,004 INFO L290 TraceCheckUtils]: 141: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,004 INFO L290 TraceCheckUtils]: 140: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,005 INFO L272 TraceCheckUtils]: 139: Hoare triple {144940#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,005 INFO L290 TraceCheckUtils]: 138: Hoare triple {144940#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {144940#(< ~counter~0 100)} is VALID [2022-04-08 12:44:59,008 INFO L290 TraceCheckUtils]: 137: Hoare triple {144965#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144940#(< ~counter~0 100)} is VALID [2022-04-08 12:44:59,008 INFO L290 TraceCheckUtils]: 136: Hoare triple {144965#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144965#(< ~counter~0 99)} is VALID [2022-04-08 12:44:59,009 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {144451#true} {144965#(< ~counter~0 99)} #98#return; {144965#(< ~counter~0 99)} is VALID [2022-04-08 12:44:59,009 INFO L290 TraceCheckUtils]: 134: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,009 INFO L290 TraceCheckUtils]: 133: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,009 INFO L290 TraceCheckUtils]: 132: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,009 INFO L272 TraceCheckUtils]: 131: Hoare triple {144965#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,009 INFO L290 TraceCheckUtils]: 130: Hoare triple {144965#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {144965#(< ~counter~0 99)} is VALID [2022-04-08 12:44:59,012 INFO L290 TraceCheckUtils]: 129: Hoare triple {144990#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144965#(< ~counter~0 99)} is VALID [2022-04-08 12:44:59,012 INFO L290 TraceCheckUtils]: 128: Hoare triple {144990#(< ~counter~0 98)} assume !(~r~0 > 0); {144990#(< ~counter~0 98)} is VALID [2022-04-08 12:44:59,013 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {144451#true} {144990#(< ~counter~0 98)} #96#return; {144990#(< ~counter~0 98)} is VALID [2022-04-08 12:44:59,013 INFO L290 TraceCheckUtils]: 126: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,013 INFO L290 TraceCheckUtils]: 125: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,013 INFO L290 TraceCheckUtils]: 124: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,013 INFO L272 TraceCheckUtils]: 123: Hoare triple {144990#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,013 INFO L290 TraceCheckUtils]: 122: Hoare triple {144990#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {144990#(< ~counter~0 98)} is VALID [2022-04-08 12:44:59,015 INFO L290 TraceCheckUtils]: 121: Hoare triple {145015#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144990#(< ~counter~0 98)} is VALID [2022-04-08 12:44:59,015 INFO L290 TraceCheckUtils]: 120: Hoare triple {145015#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145015#(< ~counter~0 97)} is VALID [2022-04-08 12:44:59,016 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {144451#true} {145015#(< ~counter~0 97)} #96#return; {145015#(< ~counter~0 97)} is VALID [2022-04-08 12:44:59,016 INFO L290 TraceCheckUtils]: 118: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,016 INFO L290 TraceCheckUtils]: 117: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,016 INFO L290 TraceCheckUtils]: 116: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,016 INFO L272 TraceCheckUtils]: 115: Hoare triple {145015#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,016 INFO L290 TraceCheckUtils]: 114: Hoare triple {145015#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {145015#(< ~counter~0 97)} is VALID [2022-04-08 12:44:59,018 INFO L290 TraceCheckUtils]: 113: Hoare triple {145040#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145015#(< ~counter~0 97)} is VALID [2022-04-08 12:44:59,018 INFO L290 TraceCheckUtils]: 112: Hoare triple {145040#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145040#(< ~counter~0 96)} is VALID [2022-04-08 12:44:59,019 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {144451#true} {145040#(< ~counter~0 96)} #96#return; {145040#(< ~counter~0 96)} is VALID [2022-04-08 12:44:59,019 INFO L290 TraceCheckUtils]: 110: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,019 INFO L290 TraceCheckUtils]: 109: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,019 INFO L290 TraceCheckUtils]: 108: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,019 INFO L272 TraceCheckUtils]: 107: Hoare triple {145040#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,019 INFO L290 TraceCheckUtils]: 106: Hoare triple {145040#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {145040#(< ~counter~0 96)} is VALID [2022-04-08 12:44:59,021 INFO L290 TraceCheckUtils]: 105: Hoare triple {145065#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145040#(< ~counter~0 96)} is VALID [2022-04-08 12:44:59,021 INFO L290 TraceCheckUtils]: 104: Hoare triple {145065#(< ~counter~0 95)} assume !!(0 != ~r~0); {145065#(< ~counter~0 95)} is VALID [2022-04-08 12:44:59,022 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {144451#true} {145065#(< ~counter~0 95)} #94#return; {145065#(< ~counter~0 95)} is VALID [2022-04-08 12:44:59,022 INFO L290 TraceCheckUtils]: 102: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,022 INFO L290 TraceCheckUtils]: 101: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,022 INFO L290 TraceCheckUtils]: 100: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,022 INFO L272 TraceCheckUtils]: 99: Hoare triple {145065#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,022 INFO L290 TraceCheckUtils]: 98: Hoare triple {145065#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {145065#(< ~counter~0 95)} is VALID [2022-04-08 12:44:59,024 INFO L290 TraceCheckUtils]: 97: Hoare triple {145090#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145065#(< ~counter~0 95)} is VALID [2022-04-08 12:44:59,025 INFO L290 TraceCheckUtils]: 96: Hoare triple {145090#(< ~counter~0 94)} assume !(~r~0 < 0); {145090#(< ~counter~0 94)} is VALID [2022-04-08 12:44:59,025 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {144451#true} {145090#(< ~counter~0 94)} #98#return; {145090#(< ~counter~0 94)} is VALID [2022-04-08 12:44:59,025 INFO L290 TraceCheckUtils]: 94: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,025 INFO L290 TraceCheckUtils]: 93: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,026 INFO L290 TraceCheckUtils]: 92: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,026 INFO L272 TraceCheckUtils]: 91: Hoare triple {145090#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,026 INFO L290 TraceCheckUtils]: 90: Hoare triple {145090#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {145090#(< ~counter~0 94)} is VALID [2022-04-08 12:44:59,028 INFO L290 TraceCheckUtils]: 89: Hoare triple {145115#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145090#(< ~counter~0 94)} is VALID [2022-04-08 12:44:59,028 INFO L290 TraceCheckUtils]: 88: Hoare triple {145115#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145115#(< ~counter~0 93)} is VALID [2022-04-08 12:44:59,029 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {144451#true} {145115#(< ~counter~0 93)} #98#return; {145115#(< ~counter~0 93)} is VALID [2022-04-08 12:44:59,029 INFO L290 TraceCheckUtils]: 86: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,029 INFO L290 TraceCheckUtils]: 85: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,029 INFO L290 TraceCheckUtils]: 84: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,029 INFO L272 TraceCheckUtils]: 83: Hoare triple {145115#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,029 INFO L290 TraceCheckUtils]: 82: Hoare triple {145115#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {145115#(< ~counter~0 93)} is VALID [2022-04-08 12:44:59,031 INFO L290 TraceCheckUtils]: 81: Hoare triple {145140#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145115#(< ~counter~0 93)} is VALID [2022-04-08 12:44:59,031 INFO L290 TraceCheckUtils]: 80: Hoare triple {145140#(< ~counter~0 92)} assume !(~r~0 > 0); {145140#(< ~counter~0 92)} is VALID [2022-04-08 12:44:59,032 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {144451#true} {145140#(< ~counter~0 92)} #96#return; {145140#(< ~counter~0 92)} is VALID [2022-04-08 12:44:59,032 INFO L290 TraceCheckUtils]: 78: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,032 INFO L290 TraceCheckUtils]: 77: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,032 INFO L290 TraceCheckUtils]: 76: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,032 INFO L272 TraceCheckUtils]: 75: Hoare triple {145140#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,032 INFO L290 TraceCheckUtils]: 74: Hoare triple {145140#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {145140#(< ~counter~0 92)} is VALID [2022-04-08 12:44:59,034 INFO L290 TraceCheckUtils]: 73: Hoare triple {145165#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145140#(< ~counter~0 92)} is VALID [2022-04-08 12:44:59,034 INFO L290 TraceCheckUtils]: 72: Hoare triple {145165#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145165#(< ~counter~0 91)} is VALID [2022-04-08 12:44:59,035 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {144451#true} {145165#(< ~counter~0 91)} #96#return; {145165#(< ~counter~0 91)} is VALID [2022-04-08 12:44:59,035 INFO L290 TraceCheckUtils]: 70: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,035 INFO L290 TraceCheckUtils]: 69: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,035 INFO L290 TraceCheckUtils]: 68: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,035 INFO L272 TraceCheckUtils]: 67: Hoare triple {145165#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,035 INFO L290 TraceCheckUtils]: 66: Hoare triple {145165#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {145165#(< ~counter~0 91)} is VALID [2022-04-08 12:44:59,037 INFO L290 TraceCheckUtils]: 65: Hoare triple {145190#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145165#(< ~counter~0 91)} is VALID [2022-04-08 12:44:59,038 INFO L290 TraceCheckUtils]: 64: Hoare triple {145190#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145190#(< ~counter~0 90)} is VALID [2022-04-08 12:44:59,038 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {144451#true} {145190#(< ~counter~0 90)} #96#return; {145190#(< ~counter~0 90)} is VALID [2022-04-08 12:44:59,044 INFO L290 TraceCheckUtils]: 62: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,044 INFO L290 TraceCheckUtils]: 61: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,044 INFO L290 TraceCheckUtils]: 60: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,045 INFO L272 TraceCheckUtils]: 59: Hoare triple {145190#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,045 INFO L290 TraceCheckUtils]: 58: Hoare triple {145190#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {145190#(< ~counter~0 90)} is VALID [2022-04-08 12:44:59,049 INFO L290 TraceCheckUtils]: 57: Hoare triple {145215#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145190#(< ~counter~0 90)} is VALID [2022-04-08 12:44:59,049 INFO L290 TraceCheckUtils]: 56: Hoare triple {145215#(< ~counter~0 89)} assume !!(0 != ~r~0); {145215#(< ~counter~0 89)} is VALID [2022-04-08 12:44:59,050 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {144451#true} {145215#(< ~counter~0 89)} #94#return; {145215#(< ~counter~0 89)} is VALID [2022-04-08 12:44:59,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,050 INFO L290 TraceCheckUtils]: 53: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,050 INFO L290 TraceCheckUtils]: 52: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,050 INFO L272 TraceCheckUtils]: 51: Hoare triple {145215#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {145215#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {145215#(< ~counter~0 89)} is VALID [2022-04-08 12:44:59,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {145240#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145215#(< ~counter~0 89)} is VALID [2022-04-08 12:44:59,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {145240#(< ~counter~0 88)} assume !(~r~0 < 0); {145240#(< ~counter~0 88)} is VALID [2022-04-08 12:44:59,053 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {144451#true} {145240#(< ~counter~0 88)} #98#return; {145240#(< ~counter~0 88)} is VALID [2022-04-08 12:44:59,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,054 INFO L272 TraceCheckUtils]: 43: Hoare triple {145240#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {145240#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {145240#(< ~counter~0 88)} is VALID [2022-04-08 12:44:59,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {145265#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145240#(< ~counter~0 88)} is VALID [2022-04-08 12:44:59,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {145265#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145265#(< ~counter~0 87)} is VALID [2022-04-08 12:44:59,057 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144451#true} {145265#(< ~counter~0 87)} #98#return; {145265#(< ~counter~0 87)} is VALID [2022-04-08 12:44:59,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,057 INFO L272 TraceCheckUtils]: 35: Hoare triple {145265#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {145265#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {145265#(< ~counter~0 87)} is VALID [2022-04-08 12:44:59,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {145290#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145265#(< ~counter~0 87)} is VALID [2022-04-08 12:44:59,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {145290#(< ~counter~0 86)} assume !(~r~0 > 0); {145290#(< ~counter~0 86)} is VALID [2022-04-08 12:44:59,061 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144451#true} {145290#(< ~counter~0 86)} #96#return; {145290#(< ~counter~0 86)} is VALID [2022-04-08 12:44:59,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,061 INFO L272 TraceCheckUtils]: 27: Hoare triple {145290#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {145290#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {145290#(< ~counter~0 86)} is VALID [2022-04-08 12:44:59,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {145315#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145290#(< ~counter~0 86)} is VALID [2022-04-08 12:44:59,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {145315#(< ~counter~0 85)} assume !!(0 != ~r~0); {145315#(< ~counter~0 85)} is VALID [2022-04-08 12:44:59,064 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144451#true} {145315#(< ~counter~0 85)} #94#return; {145315#(< ~counter~0 85)} is VALID [2022-04-08 12:44:59,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,065 INFO L272 TraceCheckUtils]: 19: Hoare triple {145315#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {145315#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {145315#(< ~counter~0 85)} is VALID [2022-04-08 12:44:59,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {145340#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145315#(< ~counter~0 85)} is VALID [2022-04-08 12:44:59,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {145340#(< ~counter~0 84)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {145340#(< ~counter~0 84)} is VALID [2022-04-08 12:44:59,068 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144451#true} {145340#(< ~counter~0 84)} #92#return; {145340#(< ~counter~0 84)} is VALID [2022-04-08 12:44:59,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,068 INFO L272 TraceCheckUtils]: 11: Hoare triple {145340#(< ~counter~0 84)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,069 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144451#true} {145340#(< ~counter~0 84)} #90#return; {145340#(< ~counter~0 84)} is VALID [2022-04-08 12:44:59,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 12:44:59,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 12:44:59,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 12:44:59,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {145340#(< ~counter~0 84)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 12:44:59,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {145340#(< ~counter~0 84)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {145340#(< ~counter~0 84)} is VALID [2022-04-08 12:44:59,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {145340#(< ~counter~0 84)} call #t~ret9 := main(); {145340#(< ~counter~0 84)} is VALID [2022-04-08 12:44:59,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145340#(< ~counter~0 84)} {144451#true} #102#return; {145340#(< ~counter~0 84)} is VALID [2022-04-08 12:44:59,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {145340#(< ~counter~0 84)} assume true; {145340#(< ~counter~0 84)} is VALID [2022-04-08 12:44:59,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {144451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {145340#(< ~counter~0 84)} is VALID [2022-04-08 12:44:59,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {144451#true} call ULTIMATE.init(); {144451#true} is VALID [2022-04-08 12:44:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 32 proven. 162 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-08 12:44:59,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:44:59,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781500593] [2022-04-08 12:44:59,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:44:59,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207491644] [2022-04-08 12:44:59,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207491644] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:44:59,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:44:59,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-08 12:44:59,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:44:59,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [112714127] [2022-04-08 12:44:59,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [112714127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:59,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:59,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 12:44:59,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832188088] [2022-04-08 12:44:59,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:44:59,073 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 151 [2022-04-08 12:44:59,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:44:59,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:44:59,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:59,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 12:44:59,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:59,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 12:44:59,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 12:44:59,286 INFO L87 Difference]: Start difference. First operand 795 states and 1058 transitions. Second operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:05,206 INFO L93 Difference]: Finished difference Result 846 states and 1128 transitions. [2022-04-08 12:45:05,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 12:45:05,206 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 151 [2022-04-08 12:45:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:45:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-08 12:45:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-08 12:45:05,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 334 transitions. [2022-04-08 12:45:05,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:05,731 INFO L225 Difference]: With dead ends: 846 [2022-04-08 12:45:05,731 INFO L226 Difference]: Without dead ends: 841 [2022-04-08 12:45:05,732 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-08 12:45:05,732 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 251 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 12:45:05,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 384 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 12:45:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-04-08 12:45:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 819. [2022-04-08 12:45:08,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:45:08,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 12:45:08,934 INFO L74 IsIncluded]: Start isIncluded. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 12:45:08,935 INFO L87 Difference]: Start difference. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 12:45:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:08,964 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-08 12:45:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-08 12:45:08,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:45:08,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:45:08,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) Second operand 841 states. [2022-04-08 12:45:08,967 INFO L87 Difference]: Start difference. First operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) Second operand 841 states. [2022-04-08 12:45:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:08,991 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-08 12:45:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-08 12:45:08,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:45:08,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:45:08,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:45:08,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:45:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 12:45:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1096 transitions. [2022-04-08 12:45:09,022 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1096 transitions. Word has length 151 [2022-04-08 12:45:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:45:09,022 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1096 transitions. [2022-04-08 12:45:09,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:09,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 819 states and 1096 transitions. [2022-04-08 12:45:19,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1096 edges. 1095 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1096 transitions. [2022-04-08 12:45:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-08 12:45:19,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:45:19,584 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 8, 8, 8, 8, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:45:19,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-08 12:45:19,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-08 12:45:19,785 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:45:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:45:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 27 times [2022-04-08 12:45:19,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:45:19,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1187686619] [2022-04-08 12:45:19,786 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:45:19,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 28 times [2022-04-08 12:45:19,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:45:19,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100376765] [2022-04-08 12:45:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:45:19,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:45:19,799 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:45:19,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148815831] [2022-04-08 12:45:19,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:45:19,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:45:19,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:45:19,801 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:45:19,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-08 12:45:19,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:45:19,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:45:19,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 12:45:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:45:19,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:45:20,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {150432#true} call ULTIMATE.init(); {150432#true} is VALID [2022-04-08 12:45:20,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {150432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {150440#(<= ~counter~0 0)} assume true; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150440#(<= ~counter~0 0)} {150432#true} #102#return; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {150440#(<= ~counter~0 0)} call #t~ret9 := main(); {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {150440#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,699 INFO L272 TraceCheckUtils]: 6: Hoare triple {150440#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {150440#(<= ~counter~0 0)} ~cond := #in~cond; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {150440#(<= ~counter~0 0)} assume !(0 == ~cond); {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {150440#(<= ~counter~0 0)} assume true; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,700 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150440#(<= ~counter~0 0)} {150440#(<= ~counter~0 0)} #90#return; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,700 INFO L272 TraceCheckUtils]: 11: Hoare triple {150440#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {150440#(<= ~counter~0 0)} ~cond := #in~cond; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {150440#(<= ~counter~0 0)} assume !(0 == ~cond); {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {150440#(<= ~counter~0 0)} assume true; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,701 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150440#(<= ~counter~0 0)} {150440#(<= ~counter~0 0)} #92#return; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {150440#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:20,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {150440#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150489#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:20,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {150489#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {150489#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:20,705 INFO L272 TraceCheckUtils]: 19: Hoare triple {150489#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150489#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:20,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {150489#(<= ~counter~0 1)} ~cond := #in~cond; {150489#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:20,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {150489#(<= ~counter~0 1)} assume !(0 == ~cond); {150489#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:20,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {150489#(<= ~counter~0 1)} assume true; {150489#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:20,706 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150489#(<= ~counter~0 1)} {150489#(<= ~counter~0 1)} #94#return; {150489#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:20,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {150489#(<= ~counter~0 1)} assume !!(0 != ~r~0); {150489#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:20,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {150489#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150514#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:20,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {150514#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {150514#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:20,709 INFO L272 TraceCheckUtils]: 27: Hoare triple {150514#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150514#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:20,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {150514#(<= ~counter~0 2)} ~cond := #in~cond; {150514#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:20,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {150514#(<= ~counter~0 2)} assume !(0 == ~cond); {150514#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:20,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {150514#(<= ~counter~0 2)} assume true; {150514#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:20,710 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150514#(<= ~counter~0 2)} {150514#(<= ~counter~0 2)} #96#return; {150514#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:20,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {150514#(<= ~counter~0 2)} assume !(~r~0 > 0); {150514#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:20,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {150514#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150539#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:20,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {150539#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {150539#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:20,712 INFO L272 TraceCheckUtils]: 35: Hoare triple {150539#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150539#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:20,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {150539#(<= ~counter~0 3)} ~cond := #in~cond; {150539#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:20,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {150539#(<= ~counter~0 3)} assume !(0 == ~cond); {150539#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:20,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {150539#(<= ~counter~0 3)} assume true; {150539#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:20,713 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150539#(<= ~counter~0 3)} {150539#(<= ~counter~0 3)} #98#return; {150539#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:20,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {150539#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150539#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:20,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {150539#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150564#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:20,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {150564#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {150564#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:20,715 INFO L272 TraceCheckUtils]: 43: Hoare triple {150564#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150564#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:20,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {150564#(<= ~counter~0 4)} ~cond := #in~cond; {150564#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:20,716 INFO L290 TraceCheckUtils]: 45: Hoare triple {150564#(<= ~counter~0 4)} assume !(0 == ~cond); {150564#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:20,716 INFO L290 TraceCheckUtils]: 46: Hoare triple {150564#(<= ~counter~0 4)} assume true; {150564#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:20,717 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150564#(<= ~counter~0 4)} {150564#(<= ~counter~0 4)} #98#return; {150564#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:20,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {150564#(<= ~counter~0 4)} assume !(~r~0 < 0); {150564#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:20,718 INFO L290 TraceCheckUtils]: 49: Hoare triple {150564#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150589#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:20,718 INFO L290 TraceCheckUtils]: 50: Hoare triple {150589#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {150589#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:20,719 INFO L272 TraceCheckUtils]: 51: Hoare triple {150589#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150589#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:20,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {150589#(<= ~counter~0 5)} ~cond := #in~cond; {150589#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:20,719 INFO L290 TraceCheckUtils]: 53: Hoare triple {150589#(<= ~counter~0 5)} assume !(0 == ~cond); {150589#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:20,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {150589#(<= ~counter~0 5)} assume true; {150589#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:20,720 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {150589#(<= ~counter~0 5)} {150589#(<= ~counter~0 5)} #94#return; {150589#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:20,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {150589#(<= ~counter~0 5)} assume !!(0 != ~r~0); {150589#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:20,721 INFO L290 TraceCheckUtils]: 57: Hoare triple {150589#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150614#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:20,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {150614#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {150614#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:20,722 INFO L272 TraceCheckUtils]: 59: Hoare triple {150614#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150614#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:20,722 INFO L290 TraceCheckUtils]: 60: Hoare triple {150614#(<= ~counter~0 6)} ~cond := #in~cond; {150614#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:20,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {150614#(<= ~counter~0 6)} assume !(0 == ~cond); {150614#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:20,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {150614#(<= ~counter~0 6)} assume true; {150614#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:20,723 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {150614#(<= ~counter~0 6)} {150614#(<= ~counter~0 6)} #96#return; {150614#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:20,724 INFO L290 TraceCheckUtils]: 64: Hoare triple {150614#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150614#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:20,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {150614#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150639#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:20,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {150639#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {150639#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:20,726 INFO L272 TraceCheckUtils]: 67: Hoare triple {150639#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150639#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:20,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {150639#(<= ~counter~0 7)} ~cond := #in~cond; {150639#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:20,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {150639#(<= ~counter~0 7)} assume !(0 == ~cond); {150639#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:20,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {150639#(<= ~counter~0 7)} assume true; {150639#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:20,727 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {150639#(<= ~counter~0 7)} {150639#(<= ~counter~0 7)} #96#return; {150639#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:20,727 INFO L290 TraceCheckUtils]: 72: Hoare triple {150639#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150639#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:20,728 INFO L290 TraceCheckUtils]: 73: Hoare triple {150639#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150664#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:20,729 INFO L290 TraceCheckUtils]: 74: Hoare triple {150664#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {150664#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:20,729 INFO L272 TraceCheckUtils]: 75: Hoare triple {150664#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150664#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:20,729 INFO L290 TraceCheckUtils]: 76: Hoare triple {150664#(<= ~counter~0 8)} ~cond := #in~cond; {150664#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:20,729 INFO L290 TraceCheckUtils]: 77: Hoare triple {150664#(<= ~counter~0 8)} assume !(0 == ~cond); {150664#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:20,730 INFO L290 TraceCheckUtils]: 78: Hoare triple {150664#(<= ~counter~0 8)} assume true; {150664#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:20,730 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {150664#(<= ~counter~0 8)} {150664#(<= ~counter~0 8)} #96#return; {150664#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:20,730 INFO L290 TraceCheckUtils]: 80: Hoare triple {150664#(<= ~counter~0 8)} assume !(~r~0 > 0); {150664#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:20,732 INFO L290 TraceCheckUtils]: 81: Hoare triple {150664#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150689#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:20,732 INFO L290 TraceCheckUtils]: 82: Hoare triple {150689#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {150689#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:20,732 INFO L272 TraceCheckUtils]: 83: Hoare triple {150689#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150689#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:20,733 INFO L290 TraceCheckUtils]: 84: Hoare triple {150689#(<= ~counter~0 9)} ~cond := #in~cond; {150689#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:20,733 INFO L290 TraceCheckUtils]: 85: Hoare triple {150689#(<= ~counter~0 9)} assume !(0 == ~cond); {150689#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:20,733 INFO L290 TraceCheckUtils]: 86: Hoare triple {150689#(<= ~counter~0 9)} assume true; {150689#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:20,734 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {150689#(<= ~counter~0 9)} {150689#(<= ~counter~0 9)} #98#return; {150689#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:20,734 INFO L290 TraceCheckUtils]: 88: Hoare triple {150689#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150689#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:20,735 INFO L290 TraceCheckUtils]: 89: Hoare triple {150689#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150714#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:20,735 INFO L290 TraceCheckUtils]: 90: Hoare triple {150714#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {150714#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:20,736 INFO L272 TraceCheckUtils]: 91: Hoare triple {150714#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150714#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:20,736 INFO L290 TraceCheckUtils]: 92: Hoare triple {150714#(<= ~counter~0 10)} ~cond := #in~cond; {150714#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:20,736 INFO L290 TraceCheckUtils]: 93: Hoare triple {150714#(<= ~counter~0 10)} assume !(0 == ~cond); {150714#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:20,736 INFO L290 TraceCheckUtils]: 94: Hoare triple {150714#(<= ~counter~0 10)} assume true; {150714#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:20,737 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {150714#(<= ~counter~0 10)} {150714#(<= ~counter~0 10)} #98#return; {150714#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:20,737 INFO L290 TraceCheckUtils]: 96: Hoare triple {150714#(<= ~counter~0 10)} assume !(~r~0 < 0); {150714#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:20,738 INFO L290 TraceCheckUtils]: 97: Hoare triple {150714#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150739#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:20,739 INFO L290 TraceCheckUtils]: 98: Hoare triple {150739#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {150739#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:20,739 INFO L272 TraceCheckUtils]: 99: Hoare triple {150739#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150739#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:20,739 INFO L290 TraceCheckUtils]: 100: Hoare triple {150739#(<= ~counter~0 11)} ~cond := #in~cond; {150739#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:20,740 INFO L290 TraceCheckUtils]: 101: Hoare triple {150739#(<= ~counter~0 11)} assume !(0 == ~cond); {150739#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:20,740 INFO L290 TraceCheckUtils]: 102: Hoare triple {150739#(<= ~counter~0 11)} assume true; {150739#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:20,740 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {150739#(<= ~counter~0 11)} {150739#(<= ~counter~0 11)} #94#return; {150739#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:20,741 INFO L290 TraceCheckUtils]: 104: Hoare triple {150739#(<= ~counter~0 11)} assume !!(0 != ~r~0); {150739#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:20,742 INFO L290 TraceCheckUtils]: 105: Hoare triple {150739#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150764#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:20,742 INFO L290 TraceCheckUtils]: 106: Hoare triple {150764#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {150764#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:20,742 INFO L272 TraceCheckUtils]: 107: Hoare triple {150764#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150764#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:20,743 INFO L290 TraceCheckUtils]: 108: Hoare triple {150764#(<= ~counter~0 12)} ~cond := #in~cond; {150764#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:20,743 INFO L290 TraceCheckUtils]: 109: Hoare triple {150764#(<= ~counter~0 12)} assume !(0 == ~cond); {150764#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:20,743 INFO L290 TraceCheckUtils]: 110: Hoare triple {150764#(<= ~counter~0 12)} assume true; {150764#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:20,744 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {150764#(<= ~counter~0 12)} {150764#(<= ~counter~0 12)} #96#return; {150764#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:20,744 INFO L290 TraceCheckUtils]: 112: Hoare triple {150764#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150764#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:20,745 INFO L290 TraceCheckUtils]: 113: Hoare triple {150764#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150789#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:20,745 INFO L290 TraceCheckUtils]: 114: Hoare triple {150789#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {150789#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:20,746 INFO L272 TraceCheckUtils]: 115: Hoare triple {150789#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150789#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:20,746 INFO L290 TraceCheckUtils]: 116: Hoare triple {150789#(<= ~counter~0 13)} ~cond := #in~cond; {150789#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:20,746 INFO L290 TraceCheckUtils]: 117: Hoare triple {150789#(<= ~counter~0 13)} assume !(0 == ~cond); {150789#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:20,747 INFO L290 TraceCheckUtils]: 118: Hoare triple {150789#(<= ~counter~0 13)} assume true; {150789#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:20,747 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {150789#(<= ~counter~0 13)} {150789#(<= ~counter~0 13)} #96#return; {150789#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:20,747 INFO L290 TraceCheckUtils]: 120: Hoare triple {150789#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150789#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:20,749 INFO L290 TraceCheckUtils]: 121: Hoare triple {150789#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150814#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:20,749 INFO L290 TraceCheckUtils]: 122: Hoare triple {150814#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {150814#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:20,749 INFO L272 TraceCheckUtils]: 123: Hoare triple {150814#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150814#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:20,750 INFO L290 TraceCheckUtils]: 124: Hoare triple {150814#(<= ~counter~0 14)} ~cond := #in~cond; {150814#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:20,750 INFO L290 TraceCheckUtils]: 125: Hoare triple {150814#(<= ~counter~0 14)} assume !(0 == ~cond); {150814#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:20,750 INFO L290 TraceCheckUtils]: 126: Hoare triple {150814#(<= ~counter~0 14)} assume true; {150814#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:20,751 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {150814#(<= ~counter~0 14)} {150814#(<= ~counter~0 14)} #96#return; {150814#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:20,751 INFO L290 TraceCheckUtils]: 128: Hoare triple {150814#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150814#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:20,752 INFO L290 TraceCheckUtils]: 129: Hoare triple {150814#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150839#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:20,752 INFO L290 TraceCheckUtils]: 130: Hoare triple {150839#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {150839#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:20,753 INFO L272 TraceCheckUtils]: 131: Hoare triple {150839#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150839#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:20,753 INFO L290 TraceCheckUtils]: 132: Hoare triple {150839#(<= ~counter~0 15)} ~cond := #in~cond; {150839#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:20,753 INFO L290 TraceCheckUtils]: 133: Hoare triple {150839#(<= ~counter~0 15)} assume !(0 == ~cond); {150839#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:20,753 INFO L290 TraceCheckUtils]: 134: Hoare triple {150839#(<= ~counter~0 15)} assume true; {150839#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:20,754 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {150839#(<= ~counter~0 15)} {150839#(<= ~counter~0 15)} #96#return; {150839#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:20,754 INFO L290 TraceCheckUtils]: 136: Hoare triple {150839#(<= ~counter~0 15)} assume !(~r~0 > 0); {150839#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:20,755 INFO L290 TraceCheckUtils]: 137: Hoare triple {150839#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150864#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:20,756 INFO L290 TraceCheckUtils]: 138: Hoare triple {150864#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {150864#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:20,756 INFO L272 TraceCheckUtils]: 139: Hoare triple {150864#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150864#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:20,756 INFO L290 TraceCheckUtils]: 140: Hoare triple {150864#(<= ~counter~0 16)} ~cond := #in~cond; {150864#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:20,757 INFO L290 TraceCheckUtils]: 141: Hoare triple {150864#(<= ~counter~0 16)} assume !(0 == ~cond); {150864#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:20,757 INFO L290 TraceCheckUtils]: 142: Hoare triple {150864#(<= ~counter~0 16)} assume true; {150864#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:20,757 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {150864#(<= ~counter~0 16)} {150864#(<= ~counter~0 16)} #98#return; {150864#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:20,758 INFO L290 TraceCheckUtils]: 144: Hoare triple {150864#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150864#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:20,758 INFO L290 TraceCheckUtils]: 145: Hoare triple {150864#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150889#(<= |main_#t~post8| 16)} is VALID [2022-04-08 12:45:20,758 INFO L290 TraceCheckUtils]: 146: Hoare triple {150889#(<= |main_#t~post8| 16)} assume !(#t~post8 < 100);havoc #t~post8; {150433#false} is VALID [2022-04-08 12:45:20,758 INFO L290 TraceCheckUtils]: 147: Hoare triple {150433#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150433#false} is VALID [2022-04-08 12:45:20,758 INFO L290 TraceCheckUtils]: 148: Hoare triple {150433#false} assume !(#t~post6 < 100);havoc #t~post6; {150433#false} is VALID [2022-04-08 12:45:20,758 INFO L272 TraceCheckUtils]: 149: Hoare triple {150433#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150433#false} is VALID [2022-04-08 12:45:20,758 INFO L290 TraceCheckUtils]: 150: Hoare triple {150433#false} ~cond := #in~cond; {150433#false} is VALID [2022-04-08 12:45:20,758 INFO L290 TraceCheckUtils]: 151: Hoare triple {150433#false} assume 0 == ~cond; {150433#false} is VALID [2022-04-08 12:45:20,759 INFO L290 TraceCheckUtils]: 152: Hoare triple {150433#false} assume !false; {150433#false} is VALID [2022-04-08 12:45:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 38 proven. 654 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:45:20,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:45:21,796 INFO L290 TraceCheckUtils]: 152: Hoare triple {150433#false} assume !false; {150433#false} is VALID [2022-04-08 12:45:21,796 INFO L290 TraceCheckUtils]: 151: Hoare triple {150433#false} assume 0 == ~cond; {150433#false} is VALID [2022-04-08 12:45:21,796 INFO L290 TraceCheckUtils]: 150: Hoare triple {150433#false} ~cond := #in~cond; {150433#false} is VALID [2022-04-08 12:45:21,796 INFO L272 TraceCheckUtils]: 149: Hoare triple {150433#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150433#false} is VALID [2022-04-08 12:45:21,796 INFO L290 TraceCheckUtils]: 148: Hoare triple {150433#false} assume !(#t~post6 < 100);havoc #t~post6; {150433#false} is VALID [2022-04-08 12:45:21,796 INFO L290 TraceCheckUtils]: 147: Hoare triple {150433#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150433#false} is VALID [2022-04-08 12:45:21,797 INFO L290 TraceCheckUtils]: 146: Hoare triple {150929#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {150433#false} is VALID [2022-04-08 12:45:21,797 INFO L290 TraceCheckUtils]: 145: Hoare triple {150933#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150929#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:45:21,797 INFO L290 TraceCheckUtils]: 144: Hoare triple {150933#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150933#(< ~counter~0 100)} is VALID [2022-04-08 12:45:21,798 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {150432#true} {150933#(< ~counter~0 100)} #98#return; {150933#(< ~counter~0 100)} is VALID [2022-04-08 12:45:21,798 INFO L290 TraceCheckUtils]: 142: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,798 INFO L290 TraceCheckUtils]: 141: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,798 INFO L290 TraceCheckUtils]: 140: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,798 INFO L272 TraceCheckUtils]: 139: Hoare triple {150933#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,798 INFO L290 TraceCheckUtils]: 138: Hoare triple {150933#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {150933#(< ~counter~0 100)} is VALID [2022-04-08 12:45:21,802 INFO L290 TraceCheckUtils]: 137: Hoare triple {150958#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150933#(< ~counter~0 100)} is VALID [2022-04-08 12:45:21,803 INFO L290 TraceCheckUtils]: 136: Hoare triple {150958#(< ~counter~0 99)} assume !(~r~0 > 0); {150958#(< ~counter~0 99)} is VALID [2022-04-08 12:45:21,803 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {150432#true} {150958#(< ~counter~0 99)} #96#return; {150958#(< ~counter~0 99)} is VALID [2022-04-08 12:45:21,803 INFO L290 TraceCheckUtils]: 134: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,803 INFO L290 TraceCheckUtils]: 133: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,804 INFO L290 TraceCheckUtils]: 132: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,804 INFO L272 TraceCheckUtils]: 131: Hoare triple {150958#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,804 INFO L290 TraceCheckUtils]: 130: Hoare triple {150958#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {150958#(< ~counter~0 99)} is VALID [2022-04-08 12:45:21,807 INFO L290 TraceCheckUtils]: 129: Hoare triple {150983#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150958#(< ~counter~0 99)} is VALID [2022-04-08 12:45:21,807 INFO L290 TraceCheckUtils]: 128: Hoare triple {150983#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150983#(< ~counter~0 98)} is VALID [2022-04-08 12:45:21,808 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {150432#true} {150983#(< ~counter~0 98)} #96#return; {150983#(< ~counter~0 98)} is VALID [2022-04-08 12:45:21,808 INFO L290 TraceCheckUtils]: 126: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,808 INFO L290 TraceCheckUtils]: 125: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,808 INFO L290 TraceCheckUtils]: 124: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,808 INFO L272 TraceCheckUtils]: 123: Hoare triple {150983#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,808 INFO L290 TraceCheckUtils]: 122: Hoare triple {150983#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {150983#(< ~counter~0 98)} is VALID [2022-04-08 12:45:21,811 INFO L290 TraceCheckUtils]: 121: Hoare triple {151008#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150983#(< ~counter~0 98)} is VALID [2022-04-08 12:45:21,811 INFO L290 TraceCheckUtils]: 120: Hoare triple {151008#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151008#(< ~counter~0 97)} is VALID [2022-04-08 12:45:21,812 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {150432#true} {151008#(< ~counter~0 97)} #96#return; {151008#(< ~counter~0 97)} is VALID [2022-04-08 12:45:21,812 INFO L290 TraceCheckUtils]: 118: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,812 INFO L290 TraceCheckUtils]: 117: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,812 INFO L290 TraceCheckUtils]: 116: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,812 INFO L272 TraceCheckUtils]: 115: Hoare triple {151008#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,812 INFO L290 TraceCheckUtils]: 114: Hoare triple {151008#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {151008#(< ~counter~0 97)} is VALID [2022-04-08 12:45:21,818 INFO L290 TraceCheckUtils]: 113: Hoare triple {151033#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151008#(< ~counter~0 97)} is VALID [2022-04-08 12:45:21,819 INFO L290 TraceCheckUtils]: 112: Hoare triple {151033#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151033#(< ~counter~0 96)} is VALID [2022-04-08 12:45:21,819 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {150432#true} {151033#(< ~counter~0 96)} #96#return; {151033#(< ~counter~0 96)} is VALID [2022-04-08 12:45:21,819 INFO L290 TraceCheckUtils]: 110: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,819 INFO L290 TraceCheckUtils]: 109: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,819 INFO L290 TraceCheckUtils]: 108: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,820 INFO L272 TraceCheckUtils]: 107: Hoare triple {151033#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,820 INFO L290 TraceCheckUtils]: 106: Hoare triple {151033#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {151033#(< ~counter~0 96)} is VALID [2022-04-08 12:45:21,823 INFO L290 TraceCheckUtils]: 105: Hoare triple {151058#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151033#(< ~counter~0 96)} is VALID [2022-04-08 12:45:21,823 INFO L290 TraceCheckUtils]: 104: Hoare triple {151058#(< ~counter~0 95)} assume !!(0 != ~r~0); {151058#(< ~counter~0 95)} is VALID [2022-04-08 12:45:21,824 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {150432#true} {151058#(< ~counter~0 95)} #94#return; {151058#(< ~counter~0 95)} is VALID [2022-04-08 12:45:21,824 INFO L290 TraceCheckUtils]: 102: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,824 INFO L290 TraceCheckUtils]: 101: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,824 INFO L290 TraceCheckUtils]: 100: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,824 INFO L272 TraceCheckUtils]: 99: Hoare triple {151058#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,824 INFO L290 TraceCheckUtils]: 98: Hoare triple {151058#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {151058#(< ~counter~0 95)} is VALID [2022-04-08 12:45:21,828 INFO L290 TraceCheckUtils]: 97: Hoare triple {151083#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151058#(< ~counter~0 95)} is VALID [2022-04-08 12:45:21,828 INFO L290 TraceCheckUtils]: 96: Hoare triple {151083#(< ~counter~0 94)} assume !(~r~0 < 0); {151083#(< ~counter~0 94)} is VALID [2022-04-08 12:45:21,829 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {150432#true} {151083#(< ~counter~0 94)} #98#return; {151083#(< ~counter~0 94)} is VALID [2022-04-08 12:45:21,829 INFO L290 TraceCheckUtils]: 94: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,829 INFO L290 TraceCheckUtils]: 93: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,829 INFO L290 TraceCheckUtils]: 92: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,829 INFO L272 TraceCheckUtils]: 91: Hoare triple {151083#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,829 INFO L290 TraceCheckUtils]: 90: Hoare triple {151083#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {151083#(< ~counter~0 94)} is VALID [2022-04-08 12:45:21,833 INFO L290 TraceCheckUtils]: 89: Hoare triple {151108#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151083#(< ~counter~0 94)} is VALID [2022-04-08 12:45:21,833 INFO L290 TraceCheckUtils]: 88: Hoare triple {151108#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151108#(< ~counter~0 93)} is VALID [2022-04-08 12:45:21,834 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {150432#true} {151108#(< ~counter~0 93)} #98#return; {151108#(< ~counter~0 93)} is VALID [2022-04-08 12:45:21,834 INFO L290 TraceCheckUtils]: 86: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,834 INFO L290 TraceCheckUtils]: 85: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,834 INFO L290 TraceCheckUtils]: 84: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,834 INFO L272 TraceCheckUtils]: 83: Hoare triple {151108#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,834 INFO L290 TraceCheckUtils]: 82: Hoare triple {151108#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {151108#(< ~counter~0 93)} is VALID [2022-04-08 12:45:21,838 INFO L290 TraceCheckUtils]: 81: Hoare triple {151133#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151108#(< ~counter~0 93)} is VALID [2022-04-08 12:45:21,838 INFO L290 TraceCheckUtils]: 80: Hoare triple {151133#(< ~counter~0 92)} assume !(~r~0 > 0); {151133#(< ~counter~0 92)} is VALID [2022-04-08 12:45:21,838 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {150432#true} {151133#(< ~counter~0 92)} #96#return; {151133#(< ~counter~0 92)} is VALID [2022-04-08 12:45:21,839 INFO L290 TraceCheckUtils]: 78: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,839 INFO L290 TraceCheckUtils]: 77: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,839 INFO L290 TraceCheckUtils]: 76: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,839 INFO L272 TraceCheckUtils]: 75: Hoare triple {151133#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,839 INFO L290 TraceCheckUtils]: 74: Hoare triple {151133#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {151133#(< ~counter~0 92)} is VALID [2022-04-08 12:45:21,843 INFO L290 TraceCheckUtils]: 73: Hoare triple {151158#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151133#(< ~counter~0 92)} is VALID [2022-04-08 12:45:21,843 INFO L290 TraceCheckUtils]: 72: Hoare triple {151158#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151158#(< ~counter~0 91)} is VALID [2022-04-08 12:45:21,844 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {150432#true} {151158#(< ~counter~0 91)} #96#return; {151158#(< ~counter~0 91)} is VALID [2022-04-08 12:45:21,844 INFO L290 TraceCheckUtils]: 70: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,844 INFO L290 TraceCheckUtils]: 68: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,844 INFO L272 TraceCheckUtils]: 67: Hoare triple {151158#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,844 INFO L290 TraceCheckUtils]: 66: Hoare triple {151158#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {151158#(< ~counter~0 91)} is VALID [2022-04-08 12:45:21,847 INFO L290 TraceCheckUtils]: 65: Hoare triple {151183#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151158#(< ~counter~0 91)} is VALID [2022-04-08 12:45:21,847 INFO L290 TraceCheckUtils]: 64: Hoare triple {151183#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151183#(< ~counter~0 90)} is VALID [2022-04-08 12:45:21,848 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {150432#true} {151183#(< ~counter~0 90)} #96#return; {151183#(< ~counter~0 90)} is VALID [2022-04-08 12:45:21,848 INFO L290 TraceCheckUtils]: 62: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,848 INFO L272 TraceCheckUtils]: 59: Hoare triple {151183#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,848 INFO L290 TraceCheckUtils]: 58: Hoare triple {151183#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {151183#(< ~counter~0 90)} is VALID [2022-04-08 12:45:21,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {151208#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151183#(< ~counter~0 90)} is VALID [2022-04-08 12:45:21,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {151208#(< ~counter~0 89)} assume !!(0 != ~r~0); {151208#(< ~counter~0 89)} is VALID [2022-04-08 12:45:21,851 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {150432#true} {151208#(< ~counter~0 89)} #94#return; {151208#(< ~counter~0 89)} is VALID [2022-04-08 12:45:21,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,851 INFO L272 TraceCheckUtils]: 51: Hoare triple {151208#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,852 INFO L290 TraceCheckUtils]: 50: Hoare triple {151208#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {151208#(< ~counter~0 89)} is VALID [2022-04-08 12:45:21,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {151233#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151208#(< ~counter~0 89)} is VALID [2022-04-08 12:45:21,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {151233#(< ~counter~0 88)} assume !(~r~0 < 0); {151233#(< ~counter~0 88)} is VALID [2022-04-08 12:45:21,855 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150432#true} {151233#(< ~counter~0 88)} #98#return; {151233#(< ~counter~0 88)} is VALID [2022-04-08 12:45:21,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,855 INFO L272 TraceCheckUtils]: 43: Hoare triple {151233#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,855 INFO L290 TraceCheckUtils]: 42: Hoare triple {151233#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {151233#(< ~counter~0 88)} is VALID [2022-04-08 12:45:21,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {151258#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151233#(< ~counter~0 88)} is VALID [2022-04-08 12:45:21,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {151258#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151258#(< ~counter~0 87)} is VALID [2022-04-08 12:45:21,859 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150432#true} {151258#(< ~counter~0 87)} #98#return; {151258#(< ~counter~0 87)} is VALID [2022-04-08 12:45:21,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,859 INFO L272 TraceCheckUtils]: 35: Hoare triple {151258#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {151258#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {151258#(< ~counter~0 87)} is VALID [2022-04-08 12:45:21,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {151283#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151258#(< ~counter~0 87)} is VALID [2022-04-08 12:45:21,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {151283#(< ~counter~0 86)} assume !(~r~0 > 0); {151283#(< ~counter~0 86)} is VALID [2022-04-08 12:45:21,862 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150432#true} {151283#(< ~counter~0 86)} #96#return; {151283#(< ~counter~0 86)} is VALID [2022-04-08 12:45:21,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,863 INFO L272 TraceCheckUtils]: 27: Hoare triple {151283#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {151283#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {151283#(< ~counter~0 86)} is VALID [2022-04-08 12:45:21,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {151308#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151283#(< ~counter~0 86)} is VALID [2022-04-08 12:45:21,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {151308#(< ~counter~0 85)} assume !!(0 != ~r~0); {151308#(< ~counter~0 85)} is VALID [2022-04-08 12:45:21,866 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150432#true} {151308#(< ~counter~0 85)} #94#return; {151308#(< ~counter~0 85)} is VALID [2022-04-08 12:45:21,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,866 INFO L272 TraceCheckUtils]: 19: Hoare triple {151308#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {151308#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {151308#(< ~counter~0 85)} is VALID [2022-04-08 12:45:21,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {151333#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151308#(< ~counter~0 85)} is VALID [2022-04-08 12:45:21,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {151333#(< ~counter~0 84)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {151333#(< ~counter~0 84)} is VALID [2022-04-08 12:45:21,869 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150432#true} {151333#(< ~counter~0 84)} #92#return; {151333#(< ~counter~0 84)} is VALID [2022-04-08 12:45:21,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,869 INFO L272 TraceCheckUtils]: 11: Hoare triple {151333#(< ~counter~0 84)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150432#true} {151333#(< ~counter~0 84)} #90#return; {151333#(< ~counter~0 84)} is VALID [2022-04-08 12:45:21,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 12:45:21,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 12:45:21,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 12:45:21,870 INFO L272 TraceCheckUtils]: 6: Hoare triple {151333#(< ~counter~0 84)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 12:45:21,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {151333#(< ~counter~0 84)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {151333#(< ~counter~0 84)} is VALID [2022-04-08 12:45:21,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {151333#(< ~counter~0 84)} call #t~ret9 := main(); {151333#(< ~counter~0 84)} is VALID [2022-04-08 12:45:21,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151333#(< ~counter~0 84)} {150432#true} #102#return; {151333#(< ~counter~0 84)} is VALID [2022-04-08 12:45:21,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {151333#(< ~counter~0 84)} assume true; {151333#(< ~counter~0 84)} is VALID [2022-04-08 12:45:21,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {150432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {151333#(< ~counter~0 84)} is VALID [2022-04-08 12:45:21,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {150432#true} call ULTIMATE.init(); {150432#true} is VALID [2022-04-08 12:45:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 38 proven. 174 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-08 12:45:21,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:45:21,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100376765] [2022-04-08 12:45:21,872 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:45:21,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148815831] [2022-04-08 12:45:21,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148815831] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:45:21,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:45:21,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-08 12:45:21,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:45:21,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1187686619] [2022-04-08 12:45:21,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1187686619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:45:21,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:45:21,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 12:45:21,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507509042] [2022-04-08 12:45:21,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:45:21,873 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 153 [2022-04-08 12:45:21,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:45:21,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:22,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:22,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 12:45:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:45:22,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 12:45:22,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 12:45:22,120 INFO L87 Difference]: Start difference. First operand 819 states and 1096 transitions. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:28,020 INFO L93 Difference]: Finished difference Result 1023 states and 1398 transitions. [2022-04-08 12:45:28,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 12:45:28,020 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 153 [2022-04-08 12:45:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:45:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-08 12:45:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-08 12:45:28,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 356 transitions. [2022-04-08 12:45:28,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:28,609 INFO L225 Difference]: With dead ends: 1023 [2022-04-08 12:45:28,609 INFO L226 Difference]: Without dead ends: 845 [2022-04-08 12:45:28,610 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1125, Invalid=1527, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 12:45:28,610 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 287 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 12:45:28,610 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 359 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 12:45:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-04-08 12:45:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 834. [2022-04-08 12:45:31,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:45:31,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 12:45:31,824 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 12:45:31,824 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 12:45:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:31,847 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-08 12:45:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-08 12:45:31,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:45:31,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:45:31,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) Second operand 845 states. [2022-04-08 12:45:31,849 INFO L87 Difference]: Start difference. First operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) Second operand 845 states. [2022-04-08 12:45:31,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:31,873 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-08 12:45:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-08 12:45:31,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:45:31,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:45:31,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:45:31,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:45:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 12:45:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1114 transitions. [2022-04-08 12:45:31,911 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1114 transitions. Word has length 153 [2022-04-08 12:45:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:45:31,911 INFO L478 AbstractCegarLoop]: Abstraction has 834 states and 1114 transitions. [2022-04-08 12:45:31,912 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:31,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 834 states and 1114 transitions. [2022-04-08 12:45:43,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1114 edges. 1114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1114 transitions. [2022-04-08 12:45:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-08 12:45:43,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:45:43,897 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 10, 9, 9, 9, 7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:45:43,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-04-08 12:45:44,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:45:44,099 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:45:44,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:45:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 23 times [2022-04-08 12:45:44,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:45:44,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [528199612] [2022-04-08 12:45:44,100 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:45:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 24 times [2022-04-08 12:45:44,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:45:44,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004892480] [2022-04-08 12:45:44,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:45:44,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:45:44,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:45:44,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [785088932] [2022-04-08 12:45:44,114 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:45:44,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:45:44,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:45:44,115 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:45:44,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-08 12:45:44,349 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 12:45:44,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:45:44,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 12:45:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:45:44,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:45:45,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {156819#true} call ULTIMATE.init(); {156819#true} is VALID [2022-04-08 12:45:45,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {156819#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {156827#(<= ~counter~0 0)} assume true; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156827#(<= ~counter~0 0)} {156819#true} #102#return; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {156827#(<= ~counter~0 0)} call #t~ret9 := main(); {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {156827#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {156827#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {156827#(<= ~counter~0 0)} ~cond := #in~cond; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {156827#(<= ~counter~0 0)} assume !(0 == ~cond); {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {156827#(<= ~counter~0 0)} assume true; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {156827#(<= ~counter~0 0)} {156827#(<= ~counter~0 0)} #90#return; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,209 INFO L272 TraceCheckUtils]: 11: Hoare triple {156827#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {156827#(<= ~counter~0 0)} ~cond := #in~cond; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {156827#(<= ~counter~0 0)} assume !(0 == ~cond); {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {156827#(<= ~counter~0 0)} assume true; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,211 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {156827#(<= ~counter~0 0)} {156827#(<= ~counter~0 0)} #92#return; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {156827#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:45,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {156827#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156876#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:45,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {156876#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {156876#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:45,215 INFO L272 TraceCheckUtils]: 19: Hoare triple {156876#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156876#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:45,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {156876#(<= ~counter~0 1)} ~cond := #in~cond; {156876#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:45,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {156876#(<= ~counter~0 1)} assume !(0 == ~cond); {156876#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:45,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {156876#(<= ~counter~0 1)} assume true; {156876#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:45,216 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {156876#(<= ~counter~0 1)} {156876#(<= ~counter~0 1)} #94#return; {156876#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:45,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {156876#(<= ~counter~0 1)} assume !!(0 != ~r~0); {156876#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:45,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {156876#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {156901#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:45,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {156901#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {156901#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:45,218 INFO L272 TraceCheckUtils]: 27: Hoare triple {156901#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156901#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:45,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {156901#(<= ~counter~0 2)} ~cond := #in~cond; {156901#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:45,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {156901#(<= ~counter~0 2)} assume !(0 == ~cond); {156901#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:45,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {156901#(<= ~counter~0 2)} assume true; {156901#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:45,219 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {156901#(<= ~counter~0 2)} {156901#(<= ~counter~0 2)} #96#return; {156901#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:45,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {156901#(<= ~counter~0 2)} assume !(~r~0 > 0); {156901#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:45,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {156901#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156926#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:45,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {156926#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {156926#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:45,222 INFO L272 TraceCheckUtils]: 35: Hoare triple {156926#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156926#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:45,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {156926#(<= ~counter~0 3)} ~cond := #in~cond; {156926#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:45,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {156926#(<= ~counter~0 3)} assume !(0 == ~cond); {156926#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:45,222 INFO L290 TraceCheckUtils]: 38: Hoare triple {156926#(<= ~counter~0 3)} assume true; {156926#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:45,223 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {156926#(<= ~counter~0 3)} {156926#(<= ~counter~0 3)} #98#return; {156926#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:45,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {156926#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {156926#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:45,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {156926#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156951#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:45,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {156951#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {156951#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:45,225 INFO L272 TraceCheckUtils]: 43: Hoare triple {156951#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156951#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:45,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {156951#(<= ~counter~0 4)} ~cond := #in~cond; {156951#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:45,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {156951#(<= ~counter~0 4)} assume !(0 == ~cond); {156951#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:45,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {156951#(<= ~counter~0 4)} assume true; {156951#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:45,226 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {156951#(<= ~counter~0 4)} {156951#(<= ~counter~0 4)} #98#return; {156951#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:45,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {156951#(<= ~counter~0 4)} assume !(~r~0 < 0); {156951#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:45,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {156951#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156976#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:45,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {156976#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {156976#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:45,229 INFO L272 TraceCheckUtils]: 51: Hoare triple {156976#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156976#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:45,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {156976#(<= ~counter~0 5)} ~cond := #in~cond; {156976#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:45,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {156976#(<= ~counter~0 5)} assume !(0 == ~cond); {156976#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:45,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {156976#(<= ~counter~0 5)} assume true; {156976#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:45,230 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {156976#(<= ~counter~0 5)} {156976#(<= ~counter~0 5)} #94#return; {156976#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:45,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {156976#(<= ~counter~0 5)} assume !!(0 != ~r~0); {156976#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:45,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {156976#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157001#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:45,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {157001#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {157001#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:45,232 INFO L272 TraceCheckUtils]: 59: Hoare triple {157001#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157001#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:45,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {157001#(<= ~counter~0 6)} ~cond := #in~cond; {157001#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:45,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {157001#(<= ~counter~0 6)} assume !(0 == ~cond); {157001#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:45,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {157001#(<= ~counter~0 6)} assume true; {157001#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:45,233 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {157001#(<= ~counter~0 6)} {157001#(<= ~counter~0 6)} #96#return; {157001#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:45,234 INFO L290 TraceCheckUtils]: 64: Hoare triple {157001#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157001#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:45,235 INFO L290 TraceCheckUtils]: 65: Hoare triple {157001#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157026#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:45,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {157026#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {157026#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:45,236 INFO L272 TraceCheckUtils]: 67: Hoare triple {157026#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157026#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:45,236 INFO L290 TraceCheckUtils]: 68: Hoare triple {157026#(<= ~counter~0 7)} ~cond := #in~cond; {157026#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:45,236 INFO L290 TraceCheckUtils]: 69: Hoare triple {157026#(<= ~counter~0 7)} assume !(0 == ~cond); {157026#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:45,236 INFO L290 TraceCheckUtils]: 70: Hoare triple {157026#(<= ~counter~0 7)} assume true; {157026#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:45,237 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {157026#(<= ~counter~0 7)} {157026#(<= ~counter~0 7)} #96#return; {157026#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:45,237 INFO L290 TraceCheckUtils]: 72: Hoare triple {157026#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157026#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:45,238 INFO L290 TraceCheckUtils]: 73: Hoare triple {157026#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157051#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:45,239 INFO L290 TraceCheckUtils]: 74: Hoare triple {157051#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {157051#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:45,239 INFO L272 TraceCheckUtils]: 75: Hoare triple {157051#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157051#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:45,240 INFO L290 TraceCheckUtils]: 76: Hoare triple {157051#(<= ~counter~0 8)} ~cond := #in~cond; {157051#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:45,240 INFO L290 TraceCheckUtils]: 77: Hoare triple {157051#(<= ~counter~0 8)} assume !(0 == ~cond); {157051#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:45,240 INFO L290 TraceCheckUtils]: 78: Hoare triple {157051#(<= ~counter~0 8)} assume true; {157051#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:45,240 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {157051#(<= ~counter~0 8)} {157051#(<= ~counter~0 8)} #96#return; {157051#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:45,241 INFO L290 TraceCheckUtils]: 80: Hoare triple {157051#(<= ~counter~0 8)} assume !(~r~0 > 0); {157051#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:45,242 INFO L290 TraceCheckUtils]: 81: Hoare triple {157051#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157076#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:45,242 INFO L290 TraceCheckUtils]: 82: Hoare triple {157076#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {157076#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:45,243 INFO L272 TraceCheckUtils]: 83: Hoare triple {157076#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157076#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:45,243 INFO L290 TraceCheckUtils]: 84: Hoare triple {157076#(<= ~counter~0 9)} ~cond := #in~cond; {157076#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:45,243 INFO L290 TraceCheckUtils]: 85: Hoare triple {157076#(<= ~counter~0 9)} assume !(0 == ~cond); {157076#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:45,244 INFO L290 TraceCheckUtils]: 86: Hoare triple {157076#(<= ~counter~0 9)} assume true; {157076#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:45,244 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {157076#(<= ~counter~0 9)} {157076#(<= ~counter~0 9)} #98#return; {157076#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:45,244 INFO L290 TraceCheckUtils]: 88: Hoare triple {157076#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157076#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:45,246 INFO L290 TraceCheckUtils]: 89: Hoare triple {157076#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157101#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:45,246 INFO L290 TraceCheckUtils]: 90: Hoare triple {157101#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {157101#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:45,246 INFO L272 TraceCheckUtils]: 91: Hoare triple {157101#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157101#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:45,247 INFO L290 TraceCheckUtils]: 92: Hoare triple {157101#(<= ~counter~0 10)} ~cond := #in~cond; {157101#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:45,247 INFO L290 TraceCheckUtils]: 93: Hoare triple {157101#(<= ~counter~0 10)} assume !(0 == ~cond); {157101#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:45,247 INFO L290 TraceCheckUtils]: 94: Hoare triple {157101#(<= ~counter~0 10)} assume true; {157101#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:45,248 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {157101#(<= ~counter~0 10)} {157101#(<= ~counter~0 10)} #98#return; {157101#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:45,248 INFO L290 TraceCheckUtils]: 96: Hoare triple {157101#(<= ~counter~0 10)} assume !(~r~0 < 0); {157101#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:45,249 INFO L290 TraceCheckUtils]: 97: Hoare triple {157101#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157126#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:45,249 INFO L290 TraceCheckUtils]: 98: Hoare triple {157126#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {157126#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:45,250 INFO L272 TraceCheckUtils]: 99: Hoare triple {157126#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157126#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:45,250 INFO L290 TraceCheckUtils]: 100: Hoare triple {157126#(<= ~counter~0 11)} ~cond := #in~cond; {157126#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:45,250 INFO L290 TraceCheckUtils]: 101: Hoare triple {157126#(<= ~counter~0 11)} assume !(0 == ~cond); {157126#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:45,251 INFO L290 TraceCheckUtils]: 102: Hoare triple {157126#(<= ~counter~0 11)} assume true; {157126#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:45,251 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {157126#(<= ~counter~0 11)} {157126#(<= ~counter~0 11)} #94#return; {157126#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:45,251 INFO L290 TraceCheckUtils]: 104: Hoare triple {157126#(<= ~counter~0 11)} assume !!(0 != ~r~0); {157126#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:45,253 INFO L290 TraceCheckUtils]: 105: Hoare triple {157126#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157151#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:45,253 INFO L290 TraceCheckUtils]: 106: Hoare triple {157151#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {157151#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:45,253 INFO L272 TraceCheckUtils]: 107: Hoare triple {157151#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157151#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:45,254 INFO L290 TraceCheckUtils]: 108: Hoare triple {157151#(<= ~counter~0 12)} ~cond := #in~cond; {157151#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:45,254 INFO L290 TraceCheckUtils]: 109: Hoare triple {157151#(<= ~counter~0 12)} assume !(0 == ~cond); {157151#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:45,254 INFO L290 TraceCheckUtils]: 110: Hoare triple {157151#(<= ~counter~0 12)} assume true; {157151#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:45,255 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {157151#(<= ~counter~0 12)} {157151#(<= ~counter~0 12)} #96#return; {157151#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:45,255 INFO L290 TraceCheckUtils]: 112: Hoare triple {157151#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157151#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:45,256 INFO L290 TraceCheckUtils]: 113: Hoare triple {157151#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157176#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:45,257 INFO L290 TraceCheckUtils]: 114: Hoare triple {157176#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {157176#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:45,257 INFO L272 TraceCheckUtils]: 115: Hoare triple {157176#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157176#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:45,257 INFO L290 TraceCheckUtils]: 116: Hoare triple {157176#(<= ~counter~0 13)} ~cond := #in~cond; {157176#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:45,258 INFO L290 TraceCheckUtils]: 117: Hoare triple {157176#(<= ~counter~0 13)} assume !(0 == ~cond); {157176#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:45,258 INFO L290 TraceCheckUtils]: 118: Hoare triple {157176#(<= ~counter~0 13)} assume true; {157176#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:45,258 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {157176#(<= ~counter~0 13)} {157176#(<= ~counter~0 13)} #96#return; {157176#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:45,258 INFO L290 TraceCheckUtils]: 120: Hoare triple {157176#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157176#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:45,260 INFO L290 TraceCheckUtils]: 121: Hoare triple {157176#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157201#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:45,260 INFO L290 TraceCheckUtils]: 122: Hoare triple {157201#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {157201#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:45,260 INFO L272 TraceCheckUtils]: 123: Hoare triple {157201#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157201#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:45,261 INFO L290 TraceCheckUtils]: 124: Hoare triple {157201#(<= ~counter~0 14)} ~cond := #in~cond; {157201#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:45,261 INFO L290 TraceCheckUtils]: 125: Hoare triple {157201#(<= ~counter~0 14)} assume !(0 == ~cond); {157201#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:45,261 INFO L290 TraceCheckUtils]: 126: Hoare triple {157201#(<= ~counter~0 14)} assume true; {157201#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:45,262 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {157201#(<= ~counter~0 14)} {157201#(<= ~counter~0 14)} #96#return; {157201#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:45,262 INFO L290 TraceCheckUtils]: 128: Hoare triple {157201#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157201#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:45,263 INFO L290 TraceCheckUtils]: 129: Hoare triple {157201#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157226#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:45,263 INFO L290 TraceCheckUtils]: 130: Hoare triple {157226#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {157226#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:45,264 INFO L272 TraceCheckUtils]: 131: Hoare triple {157226#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157226#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:45,264 INFO L290 TraceCheckUtils]: 132: Hoare triple {157226#(<= ~counter~0 15)} ~cond := #in~cond; {157226#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:45,264 INFO L290 TraceCheckUtils]: 133: Hoare triple {157226#(<= ~counter~0 15)} assume !(0 == ~cond); {157226#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:45,265 INFO L290 TraceCheckUtils]: 134: Hoare triple {157226#(<= ~counter~0 15)} assume true; {157226#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:45,265 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {157226#(<= ~counter~0 15)} {157226#(<= ~counter~0 15)} #96#return; {157226#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:45,265 INFO L290 TraceCheckUtils]: 136: Hoare triple {157226#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157226#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:45,267 INFO L290 TraceCheckUtils]: 137: Hoare triple {157226#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157251#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:45,267 INFO L290 TraceCheckUtils]: 138: Hoare triple {157251#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {157251#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:45,267 INFO L272 TraceCheckUtils]: 139: Hoare triple {157251#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157251#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:45,268 INFO L290 TraceCheckUtils]: 140: Hoare triple {157251#(<= ~counter~0 16)} ~cond := #in~cond; {157251#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:45,268 INFO L290 TraceCheckUtils]: 141: Hoare triple {157251#(<= ~counter~0 16)} assume !(0 == ~cond); {157251#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:45,268 INFO L290 TraceCheckUtils]: 142: Hoare triple {157251#(<= ~counter~0 16)} assume true; {157251#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:45,269 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {157251#(<= ~counter~0 16)} {157251#(<= ~counter~0 16)} #96#return; {157251#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:45,269 INFO L290 TraceCheckUtils]: 144: Hoare triple {157251#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157251#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:45,269 INFO L290 TraceCheckUtils]: 145: Hoare triple {157251#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157276#(<= |main_#t~post7| 16)} is VALID [2022-04-08 12:45:45,270 INFO L290 TraceCheckUtils]: 146: Hoare triple {157276#(<= |main_#t~post7| 16)} assume !(#t~post7 < 100);havoc #t~post7; {156820#false} is VALID [2022-04-08 12:45:45,270 INFO L290 TraceCheckUtils]: 147: Hoare triple {156820#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156820#false} is VALID [2022-04-08 12:45:45,270 INFO L290 TraceCheckUtils]: 148: Hoare triple {156820#false} assume !(#t~post8 < 100);havoc #t~post8; {156820#false} is VALID [2022-04-08 12:45:45,270 INFO L290 TraceCheckUtils]: 149: Hoare triple {156820#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156820#false} is VALID [2022-04-08 12:45:45,270 INFO L290 TraceCheckUtils]: 150: Hoare triple {156820#false} assume !(#t~post6 < 100);havoc #t~post6; {156820#false} is VALID [2022-04-08 12:45:45,270 INFO L272 TraceCheckUtils]: 151: Hoare triple {156820#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156820#false} is VALID [2022-04-08 12:45:45,270 INFO L290 TraceCheckUtils]: 152: Hoare triple {156820#false} ~cond := #in~cond; {156820#false} is VALID [2022-04-08 12:45:45,270 INFO L290 TraceCheckUtils]: 153: Hoare triple {156820#false} assume 0 == ~cond; {156820#false} is VALID [2022-04-08 12:45:45,270 INFO L290 TraceCheckUtils]: 154: Hoare triple {156820#false} assume !false; {156820#false} is VALID [2022-04-08 12:45:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 46 proven. 678 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:45:45,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:45:46,250 INFO L290 TraceCheckUtils]: 154: Hoare triple {156820#false} assume !false; {156820#false} is VALID [2022-04-08 12:45:46,250 INFO L290 TraceCheckUtils]: 153: Hoare triple {156820#false} assume 0 == ~cond; {156820#false} is VALID [2022-04-08 12:45:46,250 INFO L290 TraceCheckUtils]: 152: Hoare triple {156820#false} ~cond := #in~cond; {156820#false} is VALID [2022-04-08 12:45:46,250 INFO L272 TraceCheckUtils]: 151: Hoare triple {156820#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156820#false} is VALID [2022-04-08 12:45:46,250 INFO L290 TraceCheckUtils]: 150: Hoare triple {156820#false} assume !(#t~post6 < 100);havoc #t~post6; {156820#false} is VALID [2022-04-08 12:45:46,250 INFO L290 TraceCheckUtils]: 149: Hoare triple {156820#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156820#false} is VALID [2022-04-08 12:45:46,250 INFO L290 TraceCheckUtils]: 148: Hoare triple {156820#false} assume !(#t~post8 < 100);havoc #t~post8; {156820#false} is VALID [2022-04-08 12:45:46,250 INFO L290 TraceCheckUtils]: 147: Hoare triple {156820#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156820#false} is VALID [2022-04-08 12:45:46,250 INFO L290 TraceCheckUtils]: 146: Hoare triple {157328#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {156820#false} is VALID [2022-04-08 12:45:46,251 INFO L290 TraceCheckUtils]: 145: Hoare triple {157332#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157328#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:45:46,251 INFO L290 TraceCheckUtils]: 144: Hoare triple {157332#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157332#(< ~counter~0 100)} is VALID [2022-04-08 12:45:46,252 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {156819#true} {157332#(< ~counter~0 100)} #96#return; {157332#(< ~counter~0 100)} is VALID [2022-04-08 12:45:46,252 INFO L290 TraceCheckUtils]: 142: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,252 INFO L290 TraceCheckUtils]: 141: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,252 INFO L290 TraceCheckUtils]: 140: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,252 INFO L272 TraceCheckUtils]: 139: Hoare triple {157332#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,252 INFO L290 TraceCheckUtils]: 138: Hoare triple {157332#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {157332#(< ~counter~0 100)} is VALID [2022-04-08 12:45:46,255 INFO L290 TraceCheckUtils]: 137: Hoare triple {157357#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157332#(< ~counter~0 100)} is VALID [2022-04-08 12:45:46,255 INFO L290 TraceCheckUtils]: 136: Hoare triple {157357#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157357#(< ~counter~0 99)} is VALID [2022-04-08 12:45:46,256 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {156819#true} {157357#(< ~counter~0 99)} #96#return; {157357#(< ~counter~0 99)} is VALID [2022-04-08 12:45:46,256 INFO L290 TraceCheckUtils]: 134: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,256 INFO L290 TraceCheckUtils]: 133: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,256 INFO L290 TraceCheckUtils]: 132: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,256 INFO L272 TraceCheckUtils]: 131: Hoare triple {157357#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,256 INFO L290 TraceCheckUtils]: 130: Hoare triple {157357#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {157357#(< ~counter~0 99)} is VALID [2022-04-08 12:45:46,258 INFO L290 TraceCheckUtils]: 129: Hoare triple {157382#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157357#(< ~counter~0 99)} is VALID [2022-04-08 12:45:46,258 INFO L290 TraceCheckUtils]: 128: Hoare triple {157382#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157382#(< ~counter~0 98)} is VALID [2022-04-08 12:45:46,259 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {156819#true} {157382#(< ~counter~0 98)} #96#return; {157382#(< ~counter~0 98)} is VALID [2022-04-08 12:45:46,259 INFO L290 TraceCheckUtils]: 126: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,259 INFO L290 TraceCheckUtils]: 125: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,259 INFO L290 TraceCheckUtils]: 124: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,259 INFO L272 TraceCheckUtils]: 123: Hoare triple {157382#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,259 INFO L290 TraceCheckUtils]: 122: Hoare triple {157382#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {157382#(< ~counter~0 98)} is VALID [2022-04-08 12:45:46,260 INFO L290 TraceCheckUtils]: 121: Hoare triple {157407#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157382#(< ~counter~0 98)} is VALID [2022-04-08 12:45:46,261 INFO L290 TraceCheckUtils]: 120: Hoare triple {157407#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157407#(< ~counter~0 97)} is VALID [2022-04-08 12:45:46,261 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {156819#true} {157407#(< ~counter~0 97)} #96#return; {157407#(< ~counter~0 97)} is VALID [2022-04-08 12:45:46,261 INFO L290 TraceCheckUtils]: 118: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,261 INFO L290 TraceCheckUtils]: 117: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,261 INFO L290 TraceCheckUtils]: 116: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,261 INFO L272 TraceCheckUtils]: 115: Hoare triple {157407#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,261 INFO L290 TraceCheckUtils]: 114: Hoare triple {157407#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {157407#(< ~counter~0 97)} is VALID [2022-04-08 12:45:46,263 INFO L290 TraceCheckUtils]: 113: Hoare triple {157432#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157407#(< ~counter~0 97)} is VALID [2022-04-08 12:45:46,263 INFO L290 TraceCheckUtils]: 112: Hoare triple {157432#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157432#(< ~counter~0 96)} is VALID [2022-04-08 12:45:46,263 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {156819#true} {157432#(< ~counter~0 96)} #96#return; {157432#(< ~counter~0 96)} is VALID [2022-04-08 12:45:46,263 INFO L290 TraceCheckUtils]: 110: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,264 INFO L290 TraceCheckUtils]: 109: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,264 INFO L290 TraceCheckUtils]: 108: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,264 INFO L272 TraceCheckUtils]: 107: Hoare triple {157432#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,264 INFO L290 TraceCheckUtils]: 106: Hoare triple {157432#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {157432#(< ~counter~0 96)} is VALID [2022-04-08 12:45:46,265 INFO L290 TraceCheckUtils]: 105: Hoare triple {157457#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157432#(< ~counter~0 96)} is VALID [2022-04-08 12:45:46,265 INFO L290 TraceCheckUtils]: 104: Hoare triple {157457#(< ~counter~0 95)} assume !!(0 != ~r~0); {157457#(< ~counter~0 95)} is VALID [2022-04-08 12:45:46,266 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {156819#true} {157457#(< ~counter~0 95)} #94#return; {157457#(< ~counter~0 95)} is VALID [2022-04-08 12:45:46,266 INFO L290 TraceCheckUtils]: 102: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,266 INFO L290 TraceCheckUtils]: 101: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,266 INFO L290 TraceCheckUtils]: 100: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,266 INFO L272 TraceCheckUtils]: 99: Hoare triple {157457#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,266 INFO L290 TraceCheckUtils]: 98: Hoare triple {157457#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {157457#(< ~counter~0 95)} is VALID [2022-04-08 12:45:46,268 INFO L290 TraceCheckUtils]: 97: Hoare triple {157482#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157457#(< ~counter~0 95)} is VALID [2022-04-08 12:45:46,268 INFO L290 TraceCheckUtils]: 96: Hoare triple {157482#(< ~counter~0 94)} assume !(~r~0 < 0); {157482#(< ~counter~0 94)} is VALID [2022-04-08 12:45:46,268 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {156819#true} {157482#(< ~counter~0 94)} #98#return; {157482#(< ~counter~0 94)} is VALID [2022-04-08 12:45:46,268 INFO L290 TraceCheckUtils]: 94: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,268 INFO L290 TraceCheckUtils]: 93: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,268 INFO L290 TraceCheckUtils]: 92: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,269 INFO L272 TraceCheckUtils]: 91: Hoare triple {157482#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,269 INFO L290 TraceCheckUtils]: 90: Hoare triple {157482#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {157482#(< ~counter~0 94)} is VALID [2022-04-08 12:45:46,270 INFO L290 TraceCheckUtils]: 89: Hoare triple {157507#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157482#(< ~counter~0 94)} is VALID [2022-04-08 12:45:46,270 INFO L290 TraceCheckUtils]: 88: Hoare triple {157507#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157507#(< ~counter~0 93)} is VALID [2022-04-08 12:45:46,271 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {156819#true} {157507#(< ~counter~0 93)} #98#return; {157507#(< ~counter~0 93)} is VALID [2022-04-08 12:45:46,271 INFO L290 TraceCheckUtils]: 86: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,271 INFO L290 TraceCheckUtils]: 85: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,271 INFO L290 TraceCheckUtils]: 84: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,271 INFO L272 TraceCheckUtils]: 83: Hoare triple {157507#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,271 INFO L290 TraceCheckUtils]: 82: Hoare triple {157507#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {157507#(< ~counter~0 93)} is VALID [2022-04-08 12:45:46,273 INFO L290 TraceCheckUtils]: 81: Hoare triple {157532#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157507#(< ~counter~0 93)} is VALID [2022-04-08 12:45:46,273 INFO L290 TraceCheckUtils]: 80: Hoare triple {157532#(< ~counter~0 92)} assume !(~r~0 > 0); {157532#(< ~counter~0 92)} is VALID [2022-04-08 12:45:46,273 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {156819#true} {157532#(< ~counter~0 92)} #96#return; {157532#(< ~counter~0 92)} is VALID [2022-04-08 12:45:46,273 INFO L290 TraceCheckUtils]: 78: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,273 INFO L290 TraceCheckUtils]: 77: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,274 INFO L290 TraceCheckUtils]: 76: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,274 INFO L272 TraceCheckUtils]: 75: Hoare triple {157532#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,274 INFO L290 TraceCheckUtils]: 74: Hoare triple {157532#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {157532#(< ~counter~0 92)} is VALID [2022-04-08 12:45:46,275 INFO L290 TraceCheckUtils]: 73: Hoare triple {157557#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157532#(< ~counter~0 92)} is VALID [2022-04-08 12:45:46,275 INFO L290 TraceCheckUtils]: 72: Hoare triple {157557#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157557#(< ~counter~0 91)} is VALID [2022-04-08 12:45:46,276 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {156819#true} {157557#(< ~counter~0 91)} #96#return; {157557#(< ~counter~0 91)} is VALID [2022-04-08 12:45:46,276 INFO L290 TraceCheckUtils]: 70: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,276 INFO L290 TraceCheckUtils]: 69: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,276 INFO L290 TraceCheckUtils]: 68: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,276 INFO L272 TraceCheckUtils]: 67: Hoare triple {157557#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,276 INFO L290 TraceCheckUtils]: 66: Hoare triple {157557#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {157557#(< ~counter~0 91)} is VALID [2022-04-08 12:45:46,278 INFO L290 TraceCheckUtils]: 65: Hoare triple {157582#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157557#(< ~counter~0 91)} is VALID [2022-04-08 12:45:46,278 INFO L290 TraceCheckUtils]: 64: Hoare triple {157582#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157582#(< ~counter~0 90)} is VALID [2022-04-08 12:45:46,278 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {156819#true} {157582#(< ~counter~0 90)} #96#return; {157582#(< ~counter~0 90)} is VALID [2022-04-08 12:45:46,278 INFO L290 TraceCheckUtils]: 62: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,278 INFO L290 TraceCheckUtils]: 60: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,279 INFO L272 TraceCheckUtils]: 59: Hoare triple {157582#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,279 INFO L290 TraceCheckUtils]: 58: Hoare triple {157582#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {157582#(< ~counter~0 90)} is VALID [2022-04-08 12:45:46,280 INFO L290 TraceCheckUtils]: 57: Hoare triple {157607#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157582#(< ~counter~0 90)} is VALID [2022-04-08 12:45:46,280 INFO L290 TraceCheckUtils]: 56: Hoare triple {157607#(< ~counter~0 89)} assume !!(0 != ~r~0); {157607#(< ~counter~0 89)} is VALID [2022-04-08 12:45:46,281 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {156819#true} {157607#(< ~counter~0 89)} #94#return; {157607#(< ~counter~0 89)} is VALID [2022-04-08 12:45:46,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,281 INFO L272 TraceCheckUtils]: 51: Hoare triple {157607#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {157607#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {157607#(< ~counter~0 89)} is VALID [2022-04-08 12:45:46,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {157632#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157607#(< ~counter~0 89)} is VALID [2022-04-08 12:45:46,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {157632#(< ~counter~0 88)} assume !(~r~0 < 0); {157632#(< ~counter~0 88)} is VALID [2022-04-08 12:45:46,283 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {156819#true} {157632#(< ~counter~0 88)} #98#return; {157632#(< ~counter~0 88)} is VALID [2022-04-08 12:45:46,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,283 INFO L272 TraceCheckUtils]: 43: Hoare triple {157632#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {157632#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {157632#(< ~counter~0 88)} is VALID [2022-04-08 12:45:46,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {157657#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157632#(< ~counter~0 88)} is VALID [2022-04-08 12:45:46,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {157657#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157657#(< ~counter~0 87)} is VALID [2022-04-08 12:45:46,286 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {156819#true} {157657#(< ~counter~0 87)} #98#return; {157657#(< ~counter~0 87)} is VALID [2022-04-08 12:45:46,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,286 INFO L290 TraceCheckUtils]: 37: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,286 INFO L290 TraceCheckUtils]: 36: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,286 INFO L272 TraceCheckUtils]: 35: Hoare triple {157657#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {157657#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {157657#(< ~counter~0 87)} is VALID [2022-04-08 12:45:46,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {157682#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157657#(< ~counter~0 87)} is VALID [2022-04-08 12:45:46,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {157682#(< ~counter~0 86)} assume !(~r~0 > 0); {157682#(< ~counter~0 86)} is VALID [2022-04-08 12:45:46,288 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {156819#true} {157682#(< ~counter~0 86)} #96#return; {157682#(< ~counter~0 86)} is VALID [2022-04-08 12:45:46,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,288 INFO L272 TraceCheckUtils]: 27: Hoare triple {157682#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {157682#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {157682#(< ~counter~0 86)} is VALID [2022-04-08 12:45:46,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {157707#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157682#(< ~counter~0 86)} is VALID [2022-04-08 12:45:46,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {157707#(< ~counter~0 85)} assume !!(0 != ~r~0); {157707#(< ~counter~0 85)} is VALID [2022-04-08 12:45:46,291 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {156819#true} {157707#(< ~counter~0 85)} #94#return; {157707#(< ~counter~0 85)} is VALID [2022-04-08 12:45:46,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,291 INFO L272 TraceCheckUtils]: 19: Hoare triple {157707#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {157707#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {157707#(< ~counter~0 85)} is VALID [2022-04-08 12:45:46,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {157732#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157707#(< ~counter~0 85)} is VALID [2022-04-08 12:45:46,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {157732#(< ~counter~0 84)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {157732#(< ~counter~0 84)} is VALID [2022-04-08 12:45:46,293 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {156819#true} {157732#(< ~counter~0 84)} #92#return; {157732#(< ~counter~0 84)} is VALID [2022-04-08 12:45:46,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,293 INFO L272 TraceCheckUtils]: 11: Hoare triple {157732#(< ~counter~0 84)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {156819#true} {157732#(< ~counter~0 84)} #90#return; {157732#(< ~counter~0 84)} is VALID [2022-04-08 12:45:46,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 12:45:46,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 12:45:46,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 12:45:46,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {157732#(< ~counter~0 84)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 12:45:46,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {157732#(< ~counter~0 84)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {157732#(< ~counter~0 84)} is VALID [2022-04-08 12:45:46,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {157732#(< ~counter~0 84)} call #t~ret9 := main(); {157732#(< ~counter~0 84)} is VALID [2022-04-08 12:45:46,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157732#(< ~counter~0 84)} {156819#true} #102#return; {157732#(< ~counter~0 84)} is VALID [2022-04-08 12:45:46,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {157732#(< ~counter~0 84)} assume true; {157732#(< ~counter~0 84)} is VALID [2022-04-08 12:45:46,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {156819#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {157732#(< ~counter~0 84)} is VALID [2022-04-08 12:45:46,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {156819#true} call ULTIMATE.init(); {156819#true} is VALID [2022-04-08 12:45:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 46 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-08 12:45:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:45:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004892480] [2022-04-08 12:45:46,296 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:45:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785088932] [2022-04-08 12:45:46,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785088932] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:45:46,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:45:46,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-08 12:45:46,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:45:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [528199612] [2022-04-08 12:45:46,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [528199612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:45:46,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:45:46,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 12:45:46,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915467538] [2022-04-08 12:45:46,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:45:46,297 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 155 [2022-04-08 12:45:46,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:45:46,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:46,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:46,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 12:45:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:45:46,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 12:45:46,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 12:45:46,477 INFO L87 Difference]: Start difference. First operand 834 states and 1114 transitions. Second operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:51,826 INFO L93 Difference]: Finished difference Result 1021 states and 1392 transitions. [2022-04-08 12:45:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 12:45:51,826 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 155 [2022-04-08 12:45:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:45:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-08 12:45:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-08 12:45:51,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 356 transitions. [2022-04-08 12:45:52,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:52,321 INFO L225 Difference]: With dead ends: 1021 [2022-04-08 12:45:52,321 INFO L226 Difference]: Without dead ends: 851 [2022-04-08 12:45:52,322 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1175, Invalid=1581, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 12:45:52,322 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 243 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 12:45:52,322 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 357 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 12:45:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-08 12:45:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2022-04-08 12:45:55,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:45:55,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 12:45:55,639 INFO L74 IsIncluded]: Start isIncluded. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 12:45:55,640 INFO L87 Difference]: Start difference. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 12:45:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:55,662 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-08 12:45:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-08 12:45:55,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:45:55,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:45:55,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) Second operand 851 states. [2022-04-08 12:45:55,664 INFO L87 Difference]: Start difference. First operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) Second operand 851 states. [2022-04-08 12:45:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:55,687 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-08 12:45:55,687 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-08 12:45:55,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:45:55,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:45:55,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:45:55,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:45:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 12:45:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1131 transitions. [2022-04-08 12:45:55,726 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1131 transitions. Word has length 155 [2022-04-08 12:45:55,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:45:55,726 INFO L478 AbstractCegarLoop]: Abstraction has 851 states and 1131 transitions. [2022-04-08 12:45:55,726 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 12:45:55,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 851 states and 1131 transitions. [2022-04-08 12:46:03,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1131 edges. 1131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:46:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-08 12:46:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-08 12:46:03,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:46:03,512 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 8, 8, 8, 8, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:46:03,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-08 12:46:03,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:46:03,718 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:46:03,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:46:03,718 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 17 times [2022-04-08 12:46:03,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:46:03,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961233784] [2022-04-08 12:46:03,718 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:46:03,718 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 18 times [2022-04-08 12:46:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:46:03,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920368794] [2022-04-08 12:46:03,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:46:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:46:03,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:46:03,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110969075] [2022-04-08 12:46:03,733 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:46:03,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:46:03,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:46:03,734 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:46:03,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-08 12:46:04,386 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 12:46:04,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:46:04,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 12:46:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:46:04,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:46:05,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {163262#true} call ULTIMATE.init(); {163262#true} is VALID [2022-04-08 12:46:05,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {163262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {163270#(<= ~counter~0 0)} assume true; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163270#(<= ~counter~0 0)} {163262#true} #102#return; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {163270#(<= ~counter~0 0)} call #t~ret9 := main(); {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {163270#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,256 INFO L272 TraceCheckUtils]: 6: Hoare triple {163270#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {163270#(<= ~counter~0 0)} ~cond := #in~cond; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {163270#(<= ~counter~0 0)} assume !(0 == ~cond); {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {163270#(<= ~counter~0 0)} assume true; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,257 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163270#(<= ~counter~0 0)} {163270#(<= ~counter~0 0)} #90#return; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,258 INFO L272 TraceCheckUtils]: 11: Hoare triple {163270#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {163270#(<= ~counter~0 0)} ~cond := #in~cond; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {163270#(<= ~counter~0 0)} assume !(0 == ~cond); {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {163270#(<= ~counter~0 0)} assume true; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,259 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163270#(<= ~counter~0 0)} {163270#(<= ~counter~0 0)} #92#return; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {163270#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:05,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {163270#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163319#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:05,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {163319#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {163319#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:05,263 INFO L272 TraceCheckUtils]: 19: Hoare triple {163319#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163319#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:05,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {163319#(<= ~counter~0 1)} ~cond := #in~cond; {163319#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:05,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {163319#(<= ~counter~0 1)} assume !(0 == ~cond); {163319#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:05,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {163319#(<= ~counter~0 1)} assume true; {163319#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:05,265 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163319#(<= ~counter~0 1)} {163319#(<= ~counter~0 1)} #94#return; {163319#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:05,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {163319#(<= ~counter~0 1)} assume !!(0 != ~r~0); {163319#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:05,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {163319#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163344#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:05,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {163344#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {163344#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:05,267 INFO L272 TraceCheckUtils]: 27: Hoare triple {163344#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163344#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:05,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {163344#(<= ~counter~0 2)} ~cond := #in~cond; {163344#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:05,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {163344#(<= ~counter~0 2)} assume !(0 == ~cond); {163344#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:05,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {163344#(<= ~counter~0 2)} assume true; {163344#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:05,268 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163344#(<= ~counter~0 2)} {163344#(<= ~counter~0 2)} #96#return; {163344#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:05,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {163344#(<= ~counter~0 2)} assume !(~r~0 > 0); {163344#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:05,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {163344#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163369#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:05,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {163369#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {163369#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:05,270 INFO L272 TraceCheckUtils]: 35: Hoare triple {163369#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163369#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:05,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {163369#(<= ~counter~0 3)} ~cond := #in~cond; {163369#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:05,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {163369#(<= ~counter~0 3)} assume !(0 == ~cond); {163369#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:05,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {163369#(<= ~counter~0 3)} assume true; {163369#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:05,272 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163369#(<= ~counter~0 3)} {163369#(<= ~counter~0 3)} #98#return; {163369#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:05,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {163369#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163369#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:05,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {163369#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163394#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:05,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {163394#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {163394#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:05,274 INFO L272 TraceCheckUtils]: 43: Hoare triple {163394#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163394#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:05,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {163394#(<= ~counter~0 4)} ~cond := #in~cond; {163394#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:05,275 INFO L290 TraceCheckUtils]: 45: Hoare triple {163394#(<= ~counter~0 4)} assume !(0 == ~cond); {163394#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:05,275 INFO L290 TraceCheckUtils]: 46: Hoare triple {163394#(<= ~counter~0 4)} assume true; {163394#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:05,275 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163394#(<= ~counter~0 4)} {163394#(<= ~counter~0 4)} #98#return; {163394#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:05,276 INFO L290 TraceCheckUtils]: 48: Hoare triple {163394#(<= ~counter~0 4)} assume !(~r~0 < 0); {163394#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:05,277 INFO L290 TraceCheckUtils]: 49: Hoare triple {163394#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163419#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:05,277 INFO L290 TraceCheckUtils]: 50: Hoare triple {163419#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {163419#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:05,278 INFO L272 TraceCheckUtils]: 51: Hoare triple {163419#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163419#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:05,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {163419#(<= ~counter~0 5)} ~cond := #in~cond; {163419#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:05,278 INFO L290 TraceCheckUtils]: 53: Hoare triple {163419#(<= ~counter~0 5)} assume !(0 == ~cond); {163419#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:05,278 INFO L290 TraceCheckUtils]: 54: Hoare triple {163419#(<= ~counter~0 5)} assume true; {163419#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:05,279 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163419#(<= ~counter~0 5)} {163419#(<= ~counter~0 5)} #94#return; {163419#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:05,279 INFO L290 TraceCheckUtils]: 56: Hoare triple {163419#(<= ~counter~0 5)} assume !!(0 != ~r~0); {163419#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:05,280 INFO L290 TraceCheckUtils]: 57: Hoare triple {163419#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163444#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:05,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {163444#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {163444#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:05,281 INFO L272 TraceCheckUtils]: 59: Hoare triple {163444#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163444#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:05,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {163444#(<= ~counter~0 6)} ~cond := #in~cond; {163444#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:05,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {163444#(<= ~counter~0 6)} assume !(0 == ~cond); {163444#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:05,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {163444#(<= ~counter~0 6)} assume true; {163444#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:05,282 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163444#(<= ~counter~0 6)} {163444#(<= ~counter~0 6)} #96#return; {163444#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:05,283 INFO L290 TraceCheckUtils]: 64: Hoare triple {163444#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163444#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:05,284 INFO L290 TraceCheckUtils]: 65: Hoare triple {163444#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163469#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:05,284 INFO L290 TraceCheckUtils]: 66: Hoare triple {163469#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {163469#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:05,285 INFO L272 TraceCheckUtils]: 67: Hoare triple {163469#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163469#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:05,285 INFO L290 TraceCheckUtils]: 68: Hoare triple {163469#(<= ~counter~0 7)} ~cond := #in~cond; {163469#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:05,285 INFO L290 TraceCheckUtils]: 69: Hoare triple {163469#(<= ~counter~0 7)} assume !(0 == ~cond); {163469#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:05,285 INFO L290 TraceCheckUtils]: 70: Hoare triple {163469#(<= ~counter~0 7)} assume true; {163469#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:05,286 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163469#(<= ~counter~0 7)} {163469#(<= ~counter~0 7)} #96#return; {163469#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:05,286 INFO L290 TraceCheckUtils]: 72: Hoare triple {163469#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163469#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:05,287 INFO L290 TraceCheckUtils]: 73: Hoare triple {163469#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163494#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:05,288 INFO L290 TraceCheckUtils]: 74: Hoare triple {163494#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {163494#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:05,288 INFO L272 TraceCheckUtils]: 75: Hoare triple {163494#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163494#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:05,288 INFO L290 TraceCheckUtils]: 76: Hoare triple {163494#(<= ~counter~0 8)} ~cond := #in~cond; {163494#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:05,289 INFO L290 TraceCheckUtils]: 77: Hoare triple {163494#(<= ~counter~0 8)} assume !(0 == ~cond); {163494#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:05,289 INFO L290 TraceCheckUtils]: 78: Hoare triple {163494#(<= ~counter~0 8)} assume true; {163494#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:05,289 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163494#(<= ~counter~0 8)} {163494#(<= ~counter~0 8)} #96#return; {163494#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:05,290 INFO L290 TraceCheckUtils]: 80: Hoare triple {163494#(<= ~counter~0 8)} assume !(~r~0 > 0); {163494#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:05,291 INFO L290 TraceCheckUtils]: 81: Hoare triple {163494#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163519#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:05,291 INFO L290 TraceCheckUtils]: 82: Hoare triple {163519#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {163519#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:05,292 INFO L272 TraceCheckUtils]: 83: Hoare triple {163519#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163519#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:05,292 INFO L290 TraceCheckUtils]: 84: Hoare triple {163519#(<= ~counter~0 9)} ~cond := #in~cond; {163519#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:05,292 INFO L290 TraceCheckUtils]: 85: Hoare triple {163519#(<= ~counter~0 9)} assume !(0 == ~cond); {163519#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:05,292 INFO L290 TraceCheckUtils]: 86: Hoare triple {163519#(<= ~counter~0 9)} assume true; {163519#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:05,293 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163519#(<= ~counter~0 9)} {163519#(<= ~counter~0 9)} #98#return; {163519#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:05,293 INFO L290 TraceCheckUtils]: 88: Hoare triple {163519#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163519#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:05,295 INFO L290 TraceCheckUtils]: 89: Hoare triple {163519#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163544#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:05,295 INFO L290 TraceCheckUtils]: 90: Hoare triple {163544#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {163544#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:05,295 INFO L272 TraceCheckUtils]: 91: Hoare triple {163544#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163544#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:05,296 INFO L290 TraceCheckUtils]: 92: Hoare triple {163544#(<= ~counter~0 10)} ~cond := #in~cond; {163544#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:05,296 INFO L290 TraceCheckUtils]: 93: Hoare triple {163544#(<= ~counter~0 10)} assume !(0 == ~cond); {163544#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:05,296 INFO L290 TraceCheckUtils]: 94: Hoare triple {163544#(<= ~counter~0 10)} assume true; {163544#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:05,297 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163544#(<= ~counter~0 10)} {163544#(<= ~counter~0 10)} #98#return; {163544#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:05,297 INFO L290 TraceCheckUtils]: 96: Hoare triple {163544#(<= ~counter~0 10)} assume !(~r~0 < 0); {163544#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:05,299 INFO L290 TraceCheckUtils]: 97: Hoare triple {163544#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163569#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:05,300 INFO L290 TraceCheckUtils]: 98: Hoare triple {163569#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {163569#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:05,300 INFO L272 TraceCheckUtils]: 99: Hoare triple {163569#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163569#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:05,301 INFO L290 TraceCheckUtils]: 100: Hoare triple {163569#(<= ~counter~0 11)} ~cond := #in~cond; {163569#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:05,301 INFO L290 TraceCheckUtils]: 101: Hoare triple {163569#(<= ~counter~0 11)} assume !(0 == ~cond); {163569#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:05,301 INFO L290 TraceCheckUtils]: 102: Hoare triple {163569#(<= ~counter~0 11)} assume true; {163569#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:05,302 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163569#(<= ~counter~0 11)} {163569#(<= ~counter~0 11)} #94#return; {163569#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:05,302 INFO L290 TraceCheckUtils]: 104: Hoare triple {163569#(<= ~counter~0 11)} assume !!(0 != ~r~0); {163569#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:05,304 INFO L290 TraceCheckUtils]: 105: Hoare triple {163569#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163594#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:05,304 INFO L290 TraceCheckUtils]: 106: Hoare triple {163594#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {163594#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:05,304 INFO L272 TraceCheckUtils]: 107: Hoare triple {163594#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163594#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:05,305 INFO L290 TraceCheckUtils]: 108: Hoare triple {163594#(<= ~counter~0 12)} ~cond := #in~cond; {163594#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:05,305 INFO L290 TraceCheckUtils]: 109: Hoare triple {163594#(<= ~counter~0 12)} assume !(0 == ~cond); {163594#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:05,305 INFO L290 TraceCheckUtils]: 110: Hoare triple {163594#(<= ~counter~0 12)} assume true; {163594#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:05,306 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {163594#(<= ~counter~0 12)} {163594#(<= ~counter~0 12)} #96#return; {163594#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:05,306 INFO L290 TraceCheckUtils]: 112: Hoare triple {163594#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163594#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:05,307 INFO L290 TraceCheckUtils]: 113: Hoare triple {163594#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163619#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:05,307 INFO L290 TraceCheckUtils]: 114: Hoare triple {163619#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {163619#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:05,308 INFO L272 TraceCheckUtils]: 115: Hoare triple {163619#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163619#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:05,308 INFO L290 TraceCheckUtils]: 116: Hoare triple {163619#(<= ~counter~0 13)} ~cond := #in~cond; {163619#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:05,308 INFO L290 TraceCheckUtils]: 117: Hoare triple {163619#(<= ~counter~0 13)} assume !(0 == ~cond); {163619#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:05,309 INFO L290 TraceCheckUtils]: 118: Hoare triple {163619#(<= ~counter~0 13)} assume true; {163619#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:05,309 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {163619#(<= ~counter~0 13)} {163619#(<= ~counter~0 13)} #96#return; {163619#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:05,309 INFO L290 TraceCheckUtils]: 120: Hoare triple {163619#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163619#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:05,311 INFO L290 TraceCheckUtils]: 121: Hoare triple {163619#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163644#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:05,311 INFO L290 TraceCheckUtils]: 122: Hoare triple {163644#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {163644#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:05,311 INFO L272 TraceCheckUtils]: 123: Hoare triple {163644#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163644#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:05,312 INFO L290 TraceCheckUtils]: 124: Hoare triple {163644#(<= ~counter~0 14)} ~cond := #in~cond; {163644#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:05,312 INFO L290 TraceCheckUtils]: 125: Hoare triple {163644#(<= ~counter~0 14)} assume !(0 == ~cond); {163644#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:05,312 INFO L290 TraceCheckUtils]: 126: Hoare triple {163644#(<= ~counter~0 14)} assume true; {163644#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:05,313 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {163644#(<= ~counter~0 14)} {163644#(<= ~counter~0 14)} #96#return; {163644#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:05,313 INFO L290 TraceCheckUtils]: 128: Hoare triple {163644#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163644#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:05,314 INFO L290 TraceCheckUtils]: 129: Hoare triple {163644#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163669#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:05,314 INFO L290 TraceCheckUtils]: 130: Hoare triple {163669#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {163669#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:05,315 INFO L272 TraceCheckUtils]: 131: Hoare triple {163669#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163669#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:05,315 INFO L290 TraceCheckUtils]: 132: Hoare triple {163669#(<= ~counter~0 15)} ~cond := #in~cond; {163669#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:05,316 INFO L290 TraceCheckUtils]: 133: Hoare triple {163669#(<= ~counter~0 15)} assume !(0 == ~cond); {163669#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:05,316 INFO L290 TraceCheckUtils]: 134: Hoare triple {163669#(<= ~counter~0 15)} assume true; {163669#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:05,316 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {163669#(<= ~counter~0 15)} {163669#(<= ~counter~0 15)} #96#return; {163669#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:05,316 INFO L290 TraceCheckUtils]: 136: Hoare triple {163669#(<= ~counter~0 15)} assume !(~r~0 > 0); {163669#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:05,318 INFO L290 TraceCheckUtils]: 137: Hoare triple {163669#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163694#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:05,318 INFO L290 TraceCheckUtils]: 138: Hoare triple {163694#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {163694#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:05,319 INFO L272 TraceCheckUtils]: 139: Hoare triple {163694#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163694#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:05,319 INFO L290 TraceCheckUtils]: 140: Hoare triple {163694#(<= ~counter~0 16)} ~cond := #in~cond; {163694#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:05,319 INFO L290 TraceCheckUtils]: 141: Hoare triple {163694#(<= ~counter~0 16)} assume !(0 == ~cond); {163694#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:05,319 INFO L290 TraceCheckUtils]: 142: Hoare triple {163694#(<= ~counter~0 16)} assume true; {163694#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:05,320 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {163694#(<= ~counter~0 16)} {163694#(<= ~counter~0 16)} #98#return; {163694#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:05,320 INFO L290 TraceCheckUtils]: 144: Hoare triple {163694#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163694#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:05,322 INFO L290 TraceCheckUtils]: 145: Hoare triple {163694#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163719#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:05,322 INFO L290 TraceCheckUtils]: 146: Hoare triple {163719#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {163719#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:05,322 INFO L272 TraceCheckUtils]: 147: Hoare triple {163719#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163719#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:05,323 INFO L290 TraceCheckUtils]: 148: Hoare triple {163719#(<= ~counter~0 17)} ~cond := #in~cond; {163719#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:05,323 INFO L290 TraceCheckUtils]: 149: Hoare triple {163719#(<= ~counter~0 17)} assume !(0 == ~cond); {163719#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:05,323 INFO L290 TraceCheckUtils]: 150: Hoare triple {163719#(<= ~counter~0 17)} assume true; {163719#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:05,324 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {163719#(<= ~counter~0 17)} {163719#(<= ~counter~0 17)} #98#return; {163719#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:05,324 INFO L290 TraceCheckUtils]: 152: Hoare triple {163719#(<= ~counter~0 17)} assume !(~r~0 < 0); {163719#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:05,324 INFO L290 TraceCheckUtils]: 153: Hoare triple {163719#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163744#(<= |main_#t~post6| 17)} is VALID [2022-04-08 12:46:05,324 INFO L290 TraceCheckUtils]: 154: Hoare triple {163744#(<= |main_#t~post6| 17)} assume !(#t~post6 < 100);havoc #t~post6; {163263#false} is VALID [2022-04-08 12:46:05,324 INFO L272 TraceCheckUtils]: 155: Hoare triple {163263#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163263#false} is VALID [2022-04-08 12:46:05,325 INFO L290 TraceCheckUtils]: 156: Hoare triple {163263#false} ~cond := #in~cond; {163263#false} is VALID [2022-04-08 12:46:05,325 INFO L290 TraceCheckUtils]: 157: Hoare triple {163263#false} assume 0 == ~cond; {163263#false} is VALID [2022-04-08 12:46:05,325 INFO L290 TraceCheckUtils]: 158: Hoare triple {163263#false} assume !false; {163263#false} is VALID [2022-04-08 12:46:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 34 proven. 734 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:46:05,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:46:06,355 INFO L290 TraceCheckUtils]: 158: Hoare triple {163263#false} assume !false; {163263#false} is VALID [2022-04-08 12:46:06,355 INFO L290 TraceCheckUtils]: 157: Hoare triple {163263#false} assume 0 == ~cond; {163263#false} is VALID [2022-04-08 12:46:06,355 INFO L290 TraceCheckUtils]: 156: Hoare triple {163263#false} ~cond := #in~cond; {163263#false} is VALID [2022-04-08 12:46:06,355 INFO L272 TraceCheckUtils]: 155: Hoare triple {163263#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163263#false} is VALID [2022-04-08 12:46:06,355 INFO L290 TraceCheckUtils]: 154: Hoare triple {163772#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {163263#false} is VALID [2022-04-08 12:46:06,356 INFO L290 TraceCheckUtils]: 153: Hoare triple {163776#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163772#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:46:06,356 INFO L290 TraceCheckUtils]: 152: Hoare triple {163776#(< ~counter~0 100)} assume !(~r~0 < 0); {163776#(< ~counter~0 100)} is VALID [2022-04-08 12:46:06,356 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {163262#true} {163776#(< ~counter~0 100)} #98#return; {163776#(< ~counter~0 100)} is VALID [2022-04-08 12:46:06,357 INFO L290 TraceCheckUtils]: 150: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,357 INFO L290 TraceCheckUtils]: 149: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,357 INFO L290 TraceCheckUtils]: 148: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,357 INFO L272 TraceCheckUtils]: 147: Hoare triple {163776#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,357 INFO L290 TraceCheckUtils]: 146: Hoare triple {163776#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {163776#(< ~counter~0 100)} is VALID [2022-04-08 12:46:06,360 INFO L290 TraceCheckUtils]: 145: Hoare triple {163801#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163776#(< ~counter~0 100)} is VALID [2022-04-08 12:46:06,360 INFO L290 TraceCheckUtils]: 144: Hoare triple {163801#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163801#(< ~counter~0 99)} is VALID [2022-04-08 12:46:06,361 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {163262#true} {163801#(< ~counter~0 99)} #98#return; {163801#(< ~counter~0 99)} is VALID [2022-04-08 12:46:06,361 INFO L290 TraceCheckUtils]: 142: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,361 INFO L290 TraceCheckUtils]: 141: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,361 INFO L290 TraceCheckUtils]: 140: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,361 INFO L272 TraceCheckUtils]: 139: Hoare triple {163801#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,361 INFO L290 TraceCheckUtils]: 138: Hoare triple {163801#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {163801#(< ~counter~0 99)} is VALID [2022-04-08 12:46:06,363 INFO L290 TraceCheckUtils]: 137: Hoare triple {163826#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163801#(< ~counter~0 99)} is VALID [2022-04-08 12:46:06,363 INFO L290 TraceCheckUtils]: 136: Hoare triple {163826#(< ~counter~0 98)} assume !(~r~0 > 0); {163826#(< ~counter~0 98)} is VALID [2022-04-08 12:46:06,363 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {163262#true} {163826#(< ~counter~0 98)} #96#return; {163826#(< ~counter~0 98)} is VALID [2022-04-08 12:46:06,363 INFO L290 TraceCheckUtils]: 134: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,364 INFO L290 TraceCheckUtils]: 133: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,364 INFO L290 TraceCheckUtils]: 132: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,364 INFO L272 TraceCheckUtils]: 131: Hoare triple {163826#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,364 INFO L290 TraceCheckUtils]: 130: Hoare triple {163826#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {163826#(< ~counter~0 98)} is VALID [2022-04-08 12:46:06,365 INFO L290 TraceCheckUtils]: 129: Hoare triple {163851#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163826#(< ~counter~0 98)} is VALID [2022-04-08 12:46:06,365 INFO L290 TraceCheckUtils]: 128: Hoare triple {163851#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163851#(< ~counter~0 97)} is VALID [2022-04-08 12:46:06,366 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {163262#true} {163851#(< ~counter~0 97)} #96#return; {163851#(< ~counter~0 97)} is VALID [2022-04-08 12:46:06,366 INFO L290 TraceCheckUtils]: 126: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,366 INFO L290 TraceCheckUtils]: 125: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,366 INFO L290 TraceCheckUtils]: 124: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,366 INFO L272 TraceCheckUtils]: 123: Hoare triple {163851#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,366 INFO L290 TraceCheckUtils]: 122: Hoare triple {163851#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {163851#(< ~counter~0 97)} is VALID [2022-04-08 12:46:06,368 INFO L290 TraceCheckUtils]: 121: Hoare triple {163876#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163851#(< ~counter~0 97)} is VALID [2022-04-08 12:46:06,368 INFO L290 TraceCheckUtils]: 120: Hoare triple {163876#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163876#(< ~counter~0 96)} is VALID [2022-04-08 12:46:06,368 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {163262#true} {163876#(< ~counter~0 96)} #96#return; {163876#(< ~counter~0 96)} is VALID [2022-04-08 12:46:06,368 INFO L290 TraceCheckUtils]: 118: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,369 INFO L290 TraceCheckUtils]: 117: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,369 INFO L290 TraceCheckUtils]: 116: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,369 INFO L272 TraceCheckUtils]: 115: Hoare triple {163876#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,369 INFO L290 TraceCheckUtils]: 114: Hoare triple {163876#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {163876#(< ~counter~0 96)} is VALID [2022-04-08 12:46:06,370 INFO L290 TraceCheckUtils]: 113: Hoare triple {163901#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163876#(< ~counter~0 96)} is VALID [2022-04-08 12:46:06,370 INFO L290 TraceCheckUtils]: 112: Hoare triple {163901#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163901#(< ~counter~0 95)} is VALID [2022-04-08 12:46:06,371 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {163262#true} {163901#(< ~counter~0 95)} #96#return; {163901#(< ~counter~0 95)} is VALID [2022-04-08 12:46:06,371 INFO L290 TraceCheckUtils]: 110: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,371 INFO L290 TraceCheckUtils]: 109: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,371 INFO L290 TraceCheckUtils]: 108: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,371 INFO L272 TraceCheckUtils]: 107: Hoare triple {163901#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,371 INFO L290 TraceCheckUtils]: 106: Hoare triple {163901#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {163901#(< ~counter~0 95)} is VALID [2022-04-08 12:46:06,373 INFO L290 TraceCheckUtils]: 105: Hoare triple {163926#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163901#(< ~counter~0 95)} is VALID [2022-04-08 12:46:06,373 INFO L290 TraceCheckUtils]: 104: Hoare triple {163926#(< ~counter~0 94)} assume !!(0 != ~r~0); {163926#(< ~counter~0 94)} is VALID [2022-04-08 12:46:06,373 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163262#true} {163926#(< ~counter~0 94)} #94#return; {163926#(< ~counter~0 94)} is VALID [2022-04-08 12:46:06,373 INFO L290 TraceCheckUtils]: 102: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,373 INFO L290 TraceCheckUtils]: 101: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,373 INFO L290 TraceCheckUtils]: 100: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,374 INFO L272 TraceCheckUtils]: 99: Hoare triple {163926#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,374 INFO L290 TraceCheckUtils]: 98: Hoare triple {163926#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {163926#(< ~counter~0 94)} is VALID [2022-04-08 12:46:06,375 INFO L290 TraceCheckUtils]: 97: Hoare triple {163951#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163926#(< ~counter~0 94)} is VALID [2022-04-08 12:46:06,375 INFO L290 TraceCheckUtils]: 96: Hoare triple {163951#(< ~counter~0 93)} assume !(~r~0 < 0); {163951#(< ~counter~0 93)} is VALID [2022-04-08 12:46:06,376 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163262#true} {163951#(< ~counter~0 93)} #98#return; {163951#(< ~counter~0 93)} is VALID [2022-04-08 12:46:06,376 INFO L290 TraceCheckUtils]: 94: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,376 INFO L290 TraceCheckUtils]: 93: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,376 INFO L290 TraceCheckUtils]: 92: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,376 INFO L272 TraceCheckUtils]: 91: Hoare triple {163951#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,376 INFO L290 TraceCheckUtils]: 90: Hoare triple {163951#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {163951#(< ~counter~0 93)} is VALID [2022-04-08 12:46:06,378 INFO L290 TraceCheckUtils]: 89: Hoare triple {163976#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163951#(< ~counter~0 93)} is VALID [2022-04-08 12:46:06,378 INFO L290 TraceCheckUtils]: 88: Hoare triple {163976#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163976#(< ~counter~0 92)} is VALID [2022-04-08 12:46:06,378 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163262#true} {163976#(< ~counter~0 92)} #98#return; {163976#(< ~counter~0 92)} is VALID [2022-04-08 12:46:06,378 INFO L290 TraceCheckUtils]: 86: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,378 INFO L290 TraceCheckUtils]: 85: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,378 INFO L290 TraceCheckUtils]: 84: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,379 INFO L272 TraceCheckUtils]: 83: Hoare triple {163976#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,379 INFO L290 TraceCheckUtils]: 82: Hoare triple {163976#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {163976#(< ~counter~0 92)} is VALID [2022-04-08 12:46:06,380 INFO L290 TraceCheckUtils]: 81: Hoare triple {164001#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163976#(< ~counter~0 92)} is VALID [2022-04-08 12:46:06,380 INFO L290 TraceCheckUtils]: 80: Hoare triple {164001#(< ~counter~0 91)} assume !(~r~0 > 0); {164001#(< ~counter~0 91)} is VALID [2022-04-08 12:46:06,381 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163262#true} {164001#(< ~counter~0 91)} #96#return; {164001#(< ~counter~0 91)} is VALID [2022-04-08 12:46:06,381 INFO L290 TraceCheckUtils]: 78: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,381 INFO L290 TraceCheckUtils]: 77: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,381 INFO L290 TraceCheckUtils]: 76: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,381 INFO L272 TraceCheckUtils]: 75: Hoare triple {164001#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,381 INFO L290 TraceCheckUtils]: 74: Hoare triple {164001#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {164001#(< ~counter~0 91)} is VALID [2022-04-08 12:46:06,382 INFO L290 TraceCheckUtils]: 73: Hoare triple {164026#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164001#(< ~counter~0 91)} is VALID [2022-04-08 12:46:06,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {164026#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164026#(< ~counter~0 90)} is VALID [2022-04-08 12:46:06,383 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163262#true} {164026#(< ~counter~0 90)} #96#return; {164026#(< ~counter~0 90)} is VALID [2022-04-08 12:46:06,383 INFO L290 TraceCheckUtils]: 70: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,383 INFO L290 TraceCheckUtils]: 69: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,383 INFO L290 TraceCheckUtils]: 68: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,383 INFO L272 TraceCheckUtils]: 67: Hoare triple {164026#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {164026#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {164026#(< ~counter~0 90)} is VALID [2022-04-08 12:46:06,385 INFO L290 TraceCheckUtils]: 65: Hoare triple {164051#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164026#(< ~counter~0 90)} is VALID [2022-04-08 12:46:06,385 INFO L290 TraceCheckUtils]: 64: Hoare triple {164051#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164051#(< ~counter~0 89)} is VALID [2022-04-08 12:46:06,386 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163262#true} {164051#(< ~counter~0 89)} #96#return; {164051#(< ~counter~0 89)} is VALID [2022-04-08 12:46:06,386 INFO L290 TraceCheckUtils]: 62: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,386 INFO L290 TraceCheckUtils]: 61: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,386 INFO L290 TraceCheckUtils]: 60: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,386 INFO L272 TraceCheckUtils]: 59: Hoare triple {164051#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,386 INFO L290 TraceCheckUtils]: 58: Hoare triple {164051#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {164051#(< ~counter~0 89)} is VALID [2022-04-08 12:46:06,387 INFO L290 TraceCheckUtils]: 57: Hoare triple {164076#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164051#(< ~counter~0 89)} is VALID [2022-04-08 12:46:06,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {164076#(< ~counter~0 88)} assume !!(0 != ~r~0); {164076#(< ~counter~0 88)} is VALID [2022-04-08 12:46:06,388 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163262#true} {164076#(< ~counter~0 88)} #94#return; {164076#(< ~counter~0 88)} is VALID [2022-04-08 12:46:06,388 INFO L290 TraceCheckUtils]: 54: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,388 INFO L290 TraceCheckUtils]: 53: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,388 INFO L290 TraceCheckUtils]: 52: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,388 INFO L272 TraceCheckUtils]: 51: Hoare triple {164076#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,389 INFO L290 TraceCheckUtils]: 50: Hoare triple {164076#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {164076#(< ~counter~0 88)} is VALID [2022-04-08 12:46:06,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {164101#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164076#(< ~counter~0 88)} is VALID [2022-04-08 12:46:06,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {164101#(< ~counter~0 87)} assume !(~r~0 < 0); {164101#(< ~counter~0 87)} is VALID [2022-04-08 12:46:06,391 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163262#true} {164101#(< ~counter~0 87)} #98#return; {164101#(< ~counter~0 87)} is VALID [2022-04-08 12:46:06,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,391 INFO L272 TraceCheckUtils]: 43: Hoare triple {164101#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {164101#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {164101#(< ~counter~0 87)} is VALID [2022-04-08 12:46:06,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {164126#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164101#(< ~counter~0 87)} is VALID [2022-04-08 12:46:06,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {164126#(< ~counter~0 86)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {164126#(< ~counter~0 86)} is VALID [2022-04-08 12:46:06,393 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163262#true} {164126#(< ~counter~0 86)} #98#return; {164126#(< ~counter~0 86)} is VALID [2022-04-08 12:46:06,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,393 INFO L272 TraceCheckUtils]: 35: Hoare triple {164126#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {164126#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {164126#(< ~counter~0 86)} is VALID [2022-04-08 12:46:06,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {164151#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164126#(< ~counter~0 86)} is VALID [2022-04-08 12:46:06,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {164151#(< ~counter~0 85)} assume !(~r~0 > 0); {164151#(< ~counter~0 85)} is VALID [2022-04-08 12:46:06,396 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163262#true} {164151#(< ~counter~0 85)} #96#return; {164151#(< ~counter~0 85)} is VALID [2022-04-08 12:46:06,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,396 INFO L272 TraceCheckUtils]: 27: Hoare triple {164151#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {164151#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {164151#(< ~counter~0 85)} is VALID [2022-04-08 12:46:06,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {164176#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164151#(< ~counter~0 85)} is VALID [2022-04-08 12:46:06,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {164176#(< ~counter~0 84)} assume !!(0 != ~r~0); {164176#(< ~counter~0 84)} is VALID [2022-04-08 12:46:06,398 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163262#true} {164176#(< ~counter~0 84)} #94#return; {164176#(< ~counter~0 84)} is VALID [2022-04-08 12:46:06,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,398 INFO L272 TraceCheckUtils]: 19: Hoare triple {164176#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {164176#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {164176#(< ~counter~0 84)} is VALID [2022-04-08 12:46:06,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {164201#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164176#(< ~counter~0 84)} is VALID [2022-04-08 12:46:06,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {164201#(< ~counter~0 83)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {164201#(< ~counter~0 83)} is VALID [2022-04-08 12:46:06,401 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163262#true} {164201#(< ~counter~0 83)} #92#return; {164201#(< ~counter~0 83)} is VALID [2022-04-08 12:46:06,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,401 INFO L272 TraceCheckUtils]: 11: Hoare triple {164201#(< ~counter~0 83)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,401 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163262#true} {164201#(< ~counter~0 83)} #90#return; {164201#(< ~counter~0 83)} is VALID [2022-04-08 12:46:06,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 12:46:06,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 12:46:06,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 12:46:06,401 INFO L272 TraceCheckUtils]: 6: Hoare triple {164201#(< ~counter~0 83)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 12:46:06,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {164201#(< ~counter~0 83)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {164201#(< ~counter~0 83)} is VALID [2022-04-08 12:46:06,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {164201#(< ~counter~0 83)} call #t~ret9 := main(); {164201#(< ~counter~0 83)} is VALID [2022-04-08 12:46:06,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164201#(< ~counter~0 83)} {163262#true} #102#return; {164201#(< ~counter~0 83)} is VALID [2022-04-08 12:46:06,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {164201#(< ~counter~0 83)} assume true; {164201#(< ~counter~0 83)} is VALID [2022-04-08 12:46:06,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {163262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {164201#(< ~counter~0 83)} is VALID [2022-04-08 12:46:06,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {163262#true} call ULTIMATE.init(); {163262#true} is VALID [2022-04-08 12:46:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 34 proven. 190 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-08 12:46:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:46:06,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920368794] [2022-04-08 12:46:06,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:46:06,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110969075] [2022-04-08 12:46:06,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110969075] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:46:06,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:46:06,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-08 12:46:06,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:46:06,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961233784] [2022-04-08 12:46:06,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961233784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:46:06,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:46:06,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 12:46:06,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002365858] [2022-04-08 12:46:06,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:46:06,405 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 159 [2022-04-08 12:46:06,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:46:06,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:46:06,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:46:06,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 12:46:06,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:46:06,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 12:46:06,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 12:46:06,592 INFO L87 Difference]: Start difference. First operand 851 states and 1131 transitions. Second operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:46:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:12,268 INFO L93 Difference]: Finished difference Result 902 states and 1201 transitions. [2022-04-08 12:46:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 12:46:12,268 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 159 [2022-04-08 12:46:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:46:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:46:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-08 12:46:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:46:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-08 12:46:12,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 354 transitions. [2022-04-08 12:46:12,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 354 edges. 354 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:46:12,766 INFO L225 Difference]: With dead ends: 902 [2022-04-08 12:46:12,766 INFO L226 Difference]: Without dead ends: 897 [2022-04-08 12:46:12,767 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1215, Invalid=1647, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 12:46:12,767 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 272 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 12:46:12,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 385 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 12:46:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-04-08 12:46:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 875. [2022-04-08 12:46:16,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:46:16,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 12:46:16,123 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 12:46:16,124 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 12:46:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:16,148 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-08 12:46:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-08 12:46:16,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:46:16,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:46:16,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) Second operand 897 states. [2022-04-08 12:46:16,150 INFO L87 Difference]: Start difference. First operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) Second operand 897 states. [2022-04-08 12:46:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:16,175 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-08 12:46:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-08 12:46:16,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:46:16,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:46:16,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:46:16,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:46:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 12:46:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1169 transitions. [2022-04-08 12:46:16,210 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1169 transitions. Word has length 159 [2022-04-08 12:46:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:46:16,210 INFO L478 AbstractCegarLoop]: Abstraction has 875 states and 1169 transitions. [2022-04-08 12:46:16,210 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:46:16,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 875 states and 1169 transitions. [2022-04-08 12:46:31,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1169 edges. 1165 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-08 12:46:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1169 transitions. [2022-04-08 12:46:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-08 12:46:31,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:46:31,069 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 9, 9, 9, 9, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:46:31,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-08 12:46:31,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:46:31,269 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:46:31,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:46:31,269 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 29 times [2022-04-08 12:46:31,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:46:31,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1876725582] [2022-04-08 12:46:31,270 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:46:31,270 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 30 times [2022-04-08 12:46:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:46:31,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116878538] [2022-04-08 12:46:31,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:46:31,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:46:31,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:46:31,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767069344] [2022-04-08 12:46:31,284 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:46:31,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:46:31,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:46:31,285 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:46:31,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-08 12:46:32,285 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 12:46:32,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:46:32,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 12:46:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:46:32,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:46:33,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {169631#true} call ULTIMATE.init(); {169631#true} is VALID [2022-04-08 12:46:33,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {169631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {169639#(<= ~counter~0 0)} assume true; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169639#(<= ~counter~0 0)} {169631#true} #102#return; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {169639#(<= ~counter~0 0)} call #t~ret9 := main(); {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {169639#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,250 INFO L272 TraceCheckUtils]: 6: Hoare triple {169639#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {169639#(<= ~counter~0 0)} ~cond := #in~cond; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {169639#(<= ~counter~0 0)} assume !(0 == ~cond); {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {169639#(<= ~counter~0 0)} assume true; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {169639#(<= ~counter~0 0)} {169639#(<= ~counter~0 0)} #90#return; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,251 INFO L272 TraceCheckUtils]: 11: Hoare triple {169639#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {169639#(<= ~counter~0 0)} ~cond := #in~cond; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {169639#(<= ~counter~0 0)} assume !(0 == ~cond); {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {169639#(<= ~counter~0 0)} assume true; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,252 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {169639#(<= ~counter~0 0)} {169639#(<= ~counter~0 0)} #92#return; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {169639#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:33,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {169639#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169688#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:33,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {169688#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {169688#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:33,258 INFO L272 TraceCheckUtils]: 19: Hoare triple {169688#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169688#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:33,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {169688#(<= ~counter~0 1)} ~cond := #in~cond; {169688#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:33,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {169688#(<= ~counter~0 1)} assume !(0 == ~cond); {169688#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:33,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {169688#(<= ~counter~0 1)} assume true; {169688#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:33,260 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {169688#(<= ~counter~0 1)} {169688#(<= ~counter~0 1)} #94#return; {169688#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:33,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {169688#(<= ~counter~0 1)} assume !!(0 != ~r~0); {169688#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:33,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {169688#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169713#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:33,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {169713#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {169713#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:33,264 INFO L272 TraceCheckUtils]: 27: Hoare triple {169713#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169713#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:33,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {169713#(<= ~counter~0 2)} ~cond := #in~cond; {169713#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:33,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {169713#(<= ~counter~0 2)} assume !(0 == ~cond); {169713#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:33,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {169713#(<= ~counter~0 2)} assume true; {169713#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:33,266 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {169713#(<= ~counter~0 2)} {169713#(<= ~counter~0 2)} #96#return; {169713#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:33,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {169713#(<= ~counter~0 2)} assume !(~r~0 > 0); {169713#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:33,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {169713#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169738#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:33,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {169738#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {169738#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:33,270 INFO L272 TraceCheckUtils]: 35: Hoare triple {169738#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169738#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:33,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {169738#(<= ~counter~0 3)} ~cond := #in~cond; {169738#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:33,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {169738#(<= ~counter~0 3)} assume !(0 == ~cond); {169738#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:33,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {169738#(<= ~counter~0 3)} assume true; {169738#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:33,271 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {169738#(<= ~counter~0 3)} {169738#(<= ~counter~0 3)} #98#return; {169738#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:33,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {169738#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {169738#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:33,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {169738#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169763#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:33,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {169763#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {169763#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:33,276 INFO L272 TraceCheckUtils]: 43: Hoare triple {169763#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169763#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:33,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {169763#(<= ~counter~0 4)} ~cond := #in~cond; {169763#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:33,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {169763#(<= ~counter~0 4)} assume !(0 == ~cond); {169763#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:33,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {169763#(<= ~counter~0 4)} assume true; {169763#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:33,277 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {169763#(<= ~counter~0 4)} {169763#(<= ~counter~0 4)} #98#return; {169763#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:33,277 INFO L290 TraceCheckUtils]: 48: Hoare triple {169763#(<= ~counter~0 4)} assume !(~r~0 < 0); {169763#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:33,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {169763#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169788#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:33,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {169788#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {169788#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:33,281 INFO L272 TraceCheckUtils]: 51: Hoare triple {169788#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169788#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:33,282 INFO L290 TraceCheckUtils]: 52: Hoare triple {169788#(<= ~counter~0 5)} ~cond := #in~cond; {169788#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:33,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {169788#(<= ~counter~0 5)} assume !(0 == ~cond); {169788#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:33,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {169788#(<= ~counter~0 5)} assume true; {169788#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:33,283 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {169788#(<= ~counter~0 5)} {169788#(<= ~counter~0 5)} #94#return; {169788#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:33,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {169788#(<= ~counter~0 5)} assume !!(0 != ~r~0); {169788#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:33,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {169788#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169813#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:33,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {169813#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {169813#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:33,287 INFO L272 TraceCheckUtils]: 59: Hoare triple {169813#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169813#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:33,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {169813#(<= ~counter~0 6)} ~cond := #in~cond; {169813#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:33,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {169813#(<= ~counter~0 6)} assume !(0 == ~cond); {169813#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:33,288 INFO L290 TraceCheckUtils]: 62: Hoare triple {169813#(<= ~counter~0 6)} assume true; {169813#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:33,288 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {169813#(<= ~counter~0 6)} {169813#(<= ~counter~0 6)} #96#return; {169813#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:33,288 INFO L290 TraceCheckUtils]: 64: Hoare triple {169813#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169813#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:33,291 INFO L290 TraceCheckUtils]: 65: Hoare triple {169813#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169838#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:33,292 INFO L290 TraceCheckUtils]: 66: Hoare triple {169838#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {169838#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:33,292 INFO L272 TraceCheckUtils]: 67: Hoare triple {169838#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169838#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:33,293 INFO L290 TraceCheckUtils]: 68: Hoare triple {169838#(<= ~counter~0 7)} ~cond := #in~cond; {169838#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:33,293 INFO L290 TraceCheckUtils]: 69: Hoare triple {169838#(<= ~counter~0 7)} assume !(0 == ~cond); {169838#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:33,293 INFO L290 TraceCheckUtils]: 70: Hoare triple {169838#(<= ~counter~0 7)} assume true; {169838#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:33,294 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {169838#(<= ~counter~0 7)} {169838#(<= ~counter~0 7)} #96#return; {169838#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:33,294 INFO L290 TraceCheckUtils]: 72: Hoare triple {169838#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169838#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:33,297 INFO L290 TraceCheckUtils]: 73: Hoare triple {169838#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169863#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:33,297 INFO L290 TraceCheckUtils]: 74: Hoare triple {169863#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {169863#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:33,298 INFO L272 TraceCheckUtils]: 75: Hoare triple {169863#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169863#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:33,298 INFO L290 TraceCheckUtils]: 76: Hoare triple {169863#(<= ~counter~0 8)} ~cond := #in~cond; {169863#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:33,298 INFO L290 TraceCheckUtils]: 77: Hoare triple {169863#(<= ~counter~0 8)} assume !(0 == ~cond); {169863#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:33,298 INFO L290 TraceCheckUtils]: 78: Hoare triple {169863#(<= ~counter~0 8)} assume true; {169863#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:33,299 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {169863#(<= ~counter~0 8)} {169863#(<= ~counter~0 8)} #96#return; {169863#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:33,299 INFO L290 TraceCheckUtils]: 80: Hoare triple {169863#(<= ~counter~0 8)} assume !(~r~0 > 0); {169863#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:33,303 INFO L290 TraceCheckUtils]: 81: Hoare triple {169863#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169888#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:33,303 INFO L290 TraceCheckUtils]: 82: Hoare triple {169888#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {169888#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:33,304 INFO L272 TraceCheckUtils]: 83: Hoare triple {169888#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169888#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:33,304 INFO L290 TraceCheckUtils]: 84: Hoare triple {169888#(<= ~counter~0 9)} ~cond := #in~cond; {169888#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:33,304 INFO L290 TraceCheckUtils]: 85: Hoare triple {169888#(<= ~counter~0 9)} assume !(0 == ~cond); {169888#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:33,304 INFO L290 TraceCheckUtils]: 86: Hoare triple {169888#(<= ~counter~0 9)} assume true; {169888#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:33,305 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {169888#(<= ~counter~0 9)} {169888#(<= ~counter~0 9)} #98#return; {169888#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:33,305 INFO L290 TraceCheckUtils]: 88: Hoare triple {169888#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {169888#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:33,308 INFO L290 TraceCheckUtils]: 89: Hoare triple {169888#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169913#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:33,309 INFO L290 TraceCheckUtils]: 90: Hoare triple {169913#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {169913#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:33,309 INFO L272 TraceCheckUtils]: 91: Hoare triple {169913#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169913#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:33,309 INFO L290 TraceCheckUtils]: 92: Hoare triple {169913#(<= ~counter~0 10)} ~cond := #in~cond; {169913#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:33,310 INFO L290 TraceCheckUtils]: 93: Hoare triple {169913#(<= ~counter~0 10)} assume !(0 == ~cond); {169913#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:33,310 INFO L290 TraceCheckUtils]: 94: Hoare triple {169913#(<= ~counter~0 10)} assume true; {169913#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:33,310 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {169913#(<= ~counter~0 10)} {169913#(<= ~counter~0 10)} #98#return; {169913#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:33,311 INFO L290 TraceCheckUtils]: 96: Hoare triple {169913#(<= ~counter~0 10)} assume !(~r~0 < 0); {169913#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:33,313 INFO L290 TraceCheckUtils]: 97: Hoare triple {169913#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169938#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:33,314 INFO L290 TraceCheckUtils]: 98: Hoare triple {169938#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {169938#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:33,314 INFO L272 TraceCheckUtils]: 99: Hoare triple {169938#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169938#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:33,315 INFO L290 TraceCheckUtils]: 100: Hoare triple {169938#(<= ~counter~0 11)} ~cond := #in~cond; {169938#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:33,315 INFO L290 TraceCheckUtils]: 101: Hoare triple {169938#(<= ~counter~0 11)} assume !(0 == ~cond); {169938#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:33,315 INFO L290 TraceCheckUtils]: 102: Hoare triple {169938#(<= ~counter~0 11)} assume true; {169938#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:33,316 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {169938#(<= ~counter~0 11)} {169938#(<= ~counter~0 11)} #94#return; {169938#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:33,316 INFO L290 TraceCheckUtils]: 104: Hoare triple {169938#(<= ~counter~0 11)} assume !!(0 != ~r~0); {169938#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:33,318 INFO L290 TraceCheckUtils]: 105: Hoare triple {169938#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169963#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:33,319 INFO L290 TraceCheckUtils]: 106: Hoare triple {169963#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {169963#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:33,319 INFO L272 TraceCheckUtils]: 107: Hoare triple {169963#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169963#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:33,320 INFO L290 TraceCheckUtils]: 108: Hoare triple {169963#(<= ~counter~0 12)} ~cond := #in~cond; {169963#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:33,320 INFO L290 TraceCheckUtils]: 109: Hoare triple {169963#(<= ~counter~0 12)} assume !(0 == ~cond); {169963#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:33,320 INFO L290 TraceCheckUtils]: 110: Hoare triple {169963#(<= ~counter~0 12)} assume true; {169963#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:33,321 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {169963#(<= ~counter~0 12)} {169963#(<= ~counter~0 12)} #96#return; {169963#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:33,321 INFO L290 TraceCheckUtils]: 112: Hoare triple {169963#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169963#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:33,323 INFO L290 TraceCheckUtils]: 113: Hoare triple {169963#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169988#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:33,323 INFO L290 TraceCheckUtils]: 114: Hoare triple {169988#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {169988#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:33,324 INFO L272 TraceCheckUtils]: 115: Hoare triple {169988#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169988#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:33,324 INFO L290 TraceCheckUtils]: 116: Hoare triple {169988#(<= ~counter~0 13)} ~cond := #in~cond; {169988#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:33,324 INFO L290 TraceCheckUtils]: 117: Hoare triple {169988#(<= ~counter~0 13)} assume !(0 == ~cond); {169988#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:33,324 INFO L290 TraceCheckUtils]: 118: Hoare triple {169988#(<= ~counter~0 13)} assume true; {169988#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:33,325 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {169988#(<= ~counter~0 13)} {169988#(<= ~counter~0 13)} #96#return; {169988#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:33,325 INFO L290 TraceCheckUtils]: 120: Hoare triple {169988#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169988#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:33,327 INFO L290 TraceCheckUtils]: 121: Hoare triple {169988#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170013#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:33,328 INFO L290 TraceCheckUtils]: 122: Hoare triple {170013#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {170013#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:33,328 INFO L272 TraceCheckUtils]: 123: Hoare triple {170013#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {170013#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:33,328 INFO L290 TraceCheckUtils]: 124: Hoare triple {170013#(<= ~counter~0 14)} ~cond := #in~cond; {170013#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:33,329 INFO L290 TraceCheckUtils]: 125: Hoare triple {170013#(<= ~counter~0 14)} assume !(0 == ~cond); {170013#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:33,329 INFO L290 TraceCheckUtils]: 126: Hoare triple {170013#(<= ~counter~0 14)} assume true; {170013#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:33,329 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {170013#(<= ~counter~0 14)} {170013#(<= ~counter~0 14)} #96#return; {170013#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:33,330 INFO L290 TraceCheckUtils]: 128: Hoare triple {170013#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170013#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:33,332 INFO L290 TraceCheckUtils]: 129: Hoare triple {170013#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170038#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:33,332 INFO L290 TraceCheckUtils]: 130: Hoare triple {170038#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {170038#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:33,333 INFO L272 TraceCheckUtils]: 131: Hoare triple {170038#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {170038#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:33,333 INFO L290 TraceCheckUtils]: 132: Hoare triple {170038#(<= ~counter~0 15)} ~cond := #in~cond; {170038#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:33,333 INFO L290 TraceCheckUtils]: 133: Hoare triple {170038#(<= ~counter~0 15)} assume !(0 == ~cond); {170038#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:33,334 INFO L290 TraceCheckUtils]: 134: Hoare triple {170038#(<= ~counter~0 15)} assume true; {170038#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:33,334 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {170038#(<= ~counter~0 15)} {170038#(<= ~counter~0 15)} #96#return; {170038#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:33,334 INFO L290 TraceCheckUtils]: 136: Hoare triple {170038#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170038#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:33,336 INFO L290 TraceCheckUtils]: 137: Hoare triple {170038#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170063#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:33,337 INFO L290 TraceCheckUtils]: 138: Hoare triple {170063#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {170063#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:33,337 INFO L272 TraceCheckUtils]: 139: Hoare triple {170063#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {170063#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:33,338 INFO L290 TraceCheckUtils]: 140: Hoare triple {170063#(<= ~counter~0 16)} ~cond := #in~cond; {170063#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:33,338 INFO L290 TraceCheckUtils]: 141: Hoare triple {170063#(<= ~counter~0 16)} assume !(0 == ~cond); {170063#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:33,338 INFO L290 TraceCheckUtils]: 142: Hoare triple {170063#(<= ~counter~0 16)} assume true; {170063#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:33,339 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {170063#(<= ~counter~0 16)} {170063#(<= ~counter~0 16)} #96#return; {170063#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:33,339 INFO L290 TraceCheckUtils]: 144: Hoare triple {170063#(<= ~counter~0 16)} assume !(~r~0 > 0); {170063#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:33,341 INFO L290 TraceCheckUtils]: 145: Hoare triple {170063#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170088#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:33,342 INFO L290 TraceCheckUtils]: 146: Hoare triple {170088#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {170088#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:33,342 INFO L272 TraceCheckUtils]: 147: Hoare triple {170088#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {170088#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:33,343 INFO L290 TraceCheckUtils]: 148: Hoare triple {170088#(<= ~counter~0 17)} ~cond := #in~cond; {170088#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:33,343 INFO L290 TraceCheckUtils]: 149: Hoare triple {170088#(<= ~counter~0 17)} assume !(0 == ~cond); {170088#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:33,343 INFO L290 TraceCheckUtils]: 150: Hoare triple {170088#(<= ~counter~0 17)} assume true; {170088#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:33,344 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {170088#(<= ~counter~0 17)} {170088#(<= ~counter~0 17)} #98#return; {170088#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:33,344 INFO L290 TraceCheckUtils]: 152: Hoare triple {170088#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170088#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:33,344 INFO L290 TraceCheckUtils]: 153: Hoare triple {170088#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170113#(<= |main_#t~post8| 17)} is VALID [2022-04-08 12:46:33,344 INFO L290 TraceCheckUtils]: 154: Hoare triple {170113#(<= |main_#t~post8| 17)} assume !(#t~post8 < 100);havoc #t~post8; {169632#false} is VALID [2022-04-08 12:46:33,345 INFO L290 TraceCheckUtils]: 155: Hoare triple {169632#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169632#false} is VALID [2022-04-08 12:46:33,345 INFO L290 TraceCheckUtils]: 156: Hoare triple {169632#false} assume !(#t~post6 < 100);havoc #t~post6; {169632#false} is VALID [2022-04-08 12:46:33,345 INFO L272 TraceCheckUtils]: 157: Hoare triple {169632#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169632#false} is VALID [2022-04-08 12:46:33,345 INFO L290 TraceCheckUtils]: 158: Hoare triple {169632#false} ~cond := #in~cond; {169632#false} is VALID [2022-04-08 12:46:33,345 INFO L290 TraceCheckUtils]: 159: Hoare triple {169632#false} assume 0 == ~cond; {169632#false} is VALID [2022-04-08 12:46:33,345 INFO L290 TraceCheckUtils]: 160: Hoare triple {169632#false} assume !false; {169632#false} is VALID [2022-04-08 12:46:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 40 proven. 750 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:46:33,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:46:34,370 INFO L290 TraceCheckUtils]: 160: Hoare triple {169632#false} assume !false; {169632#false} is VALID [2022-04-08 12:46:34,370 INFO L290 TraceCheckUtils]: 159: Hoare triple {169632#false} assume 0 == ~cond; {169632#false} is VALID [2022-04-08 12:46:34,370 INFO L290 TraceCheckUtils]: 158: Hoare triple {169632#false} ~cond := #in~cond; {169632#false} is VALID [2022-04-08 12:46:34,371 INFO L272 TraceCheckUtils]: 157: Hoare triple {169632#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169632#false} is VALID [2022-04-08 12:46:34,371 INFO L290 TraceCheckUtils]: 156: Hoare triple {169632#false} assume !(#t~post6 < 100);havoc #t~post6; {169632#false} is VALID [2022-04-08 12:46:34,371 INFO L290 TraceCheckUtils]: 155: Hoare triple {169632#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169632#false} is VALID [2022-04-08 12:46:34,371 INFO L290 TraceCheckUtils]: 154: Hoare triple {170153#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {169632#false} is VALID [2022-04-08 12:46:34,371 INFO L290 TraceCheckUtils]: 153: Hoare triple {170157#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170153#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:46:34,371 INFO L290 TraceCheckUtils]: 152: Hoare triple {170157#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170157#(< ~counter~0 100)} is VALID [2022-04-08 12:46:34,372 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {169631#true} {170157#(< ~counter~0 100)} #98#return; {170157#(< ~counter~0 100)} is VALID [2022-04-08 12:46:34,372 INFO L290 TraceCheckUtils]: 150: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,372 INFO L290 TraceCheckUtils]: 149: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,372 INFO L290 TraceCheckUtils]: 148: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,372 INFO L272 TraceCheckUtils]: 147: Hoare triple {170157#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,372 INFO L290 TraceCheckUtils]: 146: Hoare triple {170157#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {170157#(< ~counter~0 100)} is VALID [2022-04-08 12:46:34,376 INFO L290 TraceCheckUtils]: 145: Hoare triple {170182#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170157#(< ~counter~0 100)} is VALID [2022-04-08 12:46:34,376 INFO L290 TraceCheckUtils]: 144: Hoare triple {170182#(< ~counter~0 99)} assume !(~r~0 > 0); {170182#(< ~counter~0 99)} is VALID [2022-04-08 12:46:34,377 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {169631#true} {170182#(< ~counter~0 99)} #96#return; {170182#(< ~counter~0 99)} is VALID [2022-04-08 12:46:34,377 INFO L290 TraceCheckUtils]: 142: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,377 INFO L290 TraceCheckUtils]: 141: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,377 INFO L290 TraceCheckUtils]: 140: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,377 INFO L272 TraceCheckUtils]: 139: Hoare triple {170182#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,377 INFO L290 TraceCheckUtils]: 138: Hoare triple {170182#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {170182#(< ~counter~0 99)} is VALID [2022-04-08 12:46:34,379 INFO L290 TraceCheckUtils]: 137: Hoare triple {170207#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170182#(< ~counter~0 99)} is VALID [2022-04-08 12:46:34,379 INFO L290 TraceCheckUtils]: 136: Hoare triple {170207#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170207#(< ~counter~0 98)} is VALID [2022-04-08 12:46:34,380 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {169631#true} {170207#(< ~counter~0 98)} #96#return; {170207#(< ~counter~0 98)} is VALID [2022-04-08 12:46:34,380 INFO L290 TraceCheckUtils]: 134: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,380 INFO L290 TraceCheckUtils]: 133: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,380 INFO L290 TraceCheckUtils]: 132: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,380 INFO L272 TraceCheckUtils]: 131: Hoare triple {170207#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,380 INFO L290 TraceCheckUtils]: 130: Hoare triple {170207#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {170207#(< ~counter~0 98)} is VALID [2022-04-08 12:46:34,382 INFO L290 TraceCheckUtils]: 129: Hoare triple {170232#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170207#(< ~counter~0 98)} is VALID [2022-04-08 12:46:34,383 INFO L290 TraceCheckUtils]: 128: Hoare triple {170232#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170232#(< ~counter~0 97)} is VALID [2022-04-08 12:46:34,383 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {169631#true} {170232#(< ~counter~0 97)} #96#return; {170232#(< ~counter~0 97)} is VALID [2022-04-08 12:46:34,383 INFO L290 TraceCheckUtils]: 126: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,383 INFO L290 TraceCheckUtils]: 125: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,383 INFO L290 TraceCheckUtils]: 124: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,383 INFO L272 TraceCheckUtils]: 123: Hoare triple {170232#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,384 INFO L290 TraceCheckUtils]: 122: Hoare triple {170232#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {170232#(< ~counter~0 97)} is VALID [2022-04-08 12:46:34,385 INFO L290 TraceCheckUtils]: 121: Hoare triple {170257#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170232#(< ~counter~0 97)} is VALID [2022-04-08 12:46:34,386 INFO L290 TraceCheckUtils]: 120: Hoare triple {170257#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170257#(< ~counter~0 96)} is VALID [2022-04-08 12:46:34,386 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {169631#true} {170257#(< ~counter~0 96)} #96#return; {170257#(< ~counter~0 96)} is VALID [2022-04-08 12:46:34,386 INFO L290 TraceCheckUtils]: 118: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,386 INFO L290 TraceCheckUtils]: 117: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,386 INFO L290 TraceCheckUtils]: 116: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,386 INFO L272 TraceCheckUtils]: 115: Hoare triple {170257#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,387 INFO L290 TraceCheckUtils]: 114: Hoare triple {170257#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {170257#(< ~counter~0 96)} is VALID [2022-04-08 12:46:34,388 INFO L290 TraceCheckUtils]: 113: Hoare triple {170282#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170257#(< ~counter~0 96)} is VALID [2022-04-08 12:46:34,388 INFO L290 TraceCheckUtils]: 112: Hoare triple {170282#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170282#(< ~counter~0 95)} is VALID [2022-04-08 12:46:34,389 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {169631#true} {170282#(< ~counter~0 95)} #96#return; {170282#(< ~counter~0 95)} is VALID [2022-04-08 12:46:34,389 INFO L290 TraceCheckUtils]: 110: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,389 INFO L290 TraceCheckUtils]: 109: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,389 INFO L290 TraceCheckUtils]: 108: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,389 INFO L272 TraceCheckUtils]: 107: Hoare triple {170282#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,389 INFO L290 TraceCheckUtils]: 106: Hoare triple {170282#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {170282#(< ~counter~0 95)} is VALID [2022-04-08 12:46:34,391 INFO L290 TraceCheckUtils]: 105: Hoare triple {170307#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170282#(< ~counter~0 95)} is VALID [2022-04-08 12:46:34,391 INFO L290 TraceCheckUtils]: 104: Hoare triple {170307#(< ~counter~0 94)} assume !!(0 != ~r~0); {170307#(< ~counter~0 94)} is VALID [2022-04-08 12:46:34,391 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {169631#true} {170307#(< ~counter~0 94)} #94#return; {170307#(< ~counter~0 94)} is VALID [2022-04-08 12:46:34,391 INFO L290 TraceCheckUtils]: 102: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,391 INFO L290 TraceCheckUtils]: 101: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,392 INFO L290 TraceCheckUtils]: 100: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,392 INFO L272 TraceCheckUtils]: 99: Hoare triple {170307#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,392 INFO L290 TraceCheckUtils]: 98: Hoare triple {170307#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {170307#(< ~counter~0 94)} is VALID [2022-04-08 12:46:34,393 INFO L290 TraceCheckUtils]: 97: Hoare triple {170332#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170307#(< ~counter~0 94)} is VALID [2022-04-08 12:46:34,393 INFO L290 TraceCheckUtils]: 96: Hoare triple {170332#(< ~counter~0 93)} assume !(~r~0 < 0); {170332#(< ~counter~0 93)} is VALID [2022-04-08 12:46:34,394 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {169631#true} {170332#(< ~counter~0 93)} #98#return; {170332#(< ~counter~0 93)} is VALID [2022-04-08 12:46:34,394 INFO L290 TraceCheckUtils]: 94: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,394 INFO L290 TraceCheckUtils]: 93: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,394 INFO L290 TraceCheckUtils]: 92: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,394 INFO L272 TraceCheckUtils]: 91: Hoare triple {170332#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,394 INFO L290 TraceCheckUtils]: 90: Hoare triple {170332#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {170332#(< ~counter~0 93)} is VALID [2022-04-08 12:46:34,396 INFO L290 TraceCheckUtils]: 89: Hoare triple {170357#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170332#(< ~counter~0 93)} is VALID [2022-04-08 12:46:34,396 INFO L290 TraceCheckUtils]: 88: Hoare triple {170357#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170357#(< ~counter~0 92)} is VALID [2022-04-08 12:46:34,397 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {169631#true} {170357#(< ~counter~0 92)} #98#return; {170357#(< ~counter~0 92)} is VALID [2022-04-08 12:46:34,397 INFO L290 TraceCheckUtils]: 86: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,397 INFO L290 TraceCheckUtils]: 85: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,397 INFO L290 TraceCheckUtils]: 84: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,397 INFO L272 TraceCheckUtils]: 83: Hoare triple {170357#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,397 INFO L290 TraceCheckUtils]: 82: Hoare triple {170357#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {170357#(< ~counter~0 92)} is VALID [2022-04-08 12:46:34,399 INFO L290 TraceCheckUtils]: 81: Hoare triple {170382#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170357#(< ~counter~0 92)} is VALID [2022-04-08 12:46:34,399 INFO L290 TraceCheckUtils]: 80: Hoare triple {170382#(< ~counter~0 91)} assume !(~r~0 > 0); {170382#(< ~counter~0 91)} is VALID [2022-04-08 12:46:34,399 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {169631#true} {170382#(< ~counter~0 91)} #96#return; {170382#(< ~counter~0 91)} is VALID [2022-04-08 12:46:34,400 INFO L290 TraceCheckUtils]: 78: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,400 INFO L290 TraceCheckUtils]: 77: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,400 INFO L290 TraceCheckUtils]: 76: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,400 INFO L272 TraceCheckUtils]: 75: Hoare triple {170382#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,400 INFO L290 TraceCheckUtils]: 74: Hoare triple {170382#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {170382#(< ~counter~0 91)} is VALID [2022-04-08 12:46:34,401 INFO L290 TraceCheckUtils]: 73: Hoare triple {170407#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170382#(< ~counter~0 91)} is VALID [2022-04-08 12:46:34,402 INFO L290 TraceCheckUtils]: 72: Hoare triple {170407#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170407#(< ~counter~0 90)} is VALID [2022-04-08 12:46:34,402 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {169631#true} {170407#(< ~counter~0 90)} #96#return; {170407#(< ~counter~0 90)} is VALID [2022-04-08 12:46:34,402 INFO L290 TraceCheckUtils]: 70: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,402 INFO L290 TraceCheckUtils]: 69: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,402 INFO L290 TraceCheckUtils]: 68: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,402 INFO L272 TraceCheckUtils]: 67: Hoare triple {170407#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,403 INFO L290 TraceCheckUtils]: 66: Hoare triple {170407#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {170407#(< ~counter~0 90)} is VALID [2022-04-08 12:46:34,405 INFO L290 TraceCheckUtils]: 65: Hoare triple {170432#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170407#(< ~counter~0 90)} is VALID [2022-04-08 12:46:34,405 INFO L290 TraceCheckUtils]: 64: Hoare triple {170432#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170432#(< ~counter~0 89)} is VALID [2022-04-08 12:46:34,406 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {169631#true} {170432#(< ~counter~0 89)} #96#return; {170432#(< ~counter~0 89)} is VALID [2022-04-08 12:46:34,406 INFO L290 TraceCheckUtils]: 62: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,406 INFO L272 TraceCheckUtils]: 59: Hoare triple {170432#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {170432#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {170432#(< ~counter~0 89)} is VALID [2022-04-08 12:46:34,408 INFO L290 TraceCheckUtils]: 57: Hoare triple {170457#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170432#(< ~counter~0 89)} is VALID [2022-04-08 12:46:34,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {170457#(< ~counter~0 88)} assume !!(0 != ~r~0); {170457#(< ~counter~0 88)} is VALID [2022-04-08 12:46:34,409 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {169631#true} {170457#(< ~counter~0 88)} #94#return; {170457#(< ~counter~0 88)} is VALID [2022-04-08 12:46:34,409 INFO L290 TraceCheckUtils]: 54: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,409 INFO L290 TraceCheckUtils]: 53: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,409 INFO L290 TraceCheckUtils]: 52: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,409 INFO L272 TraceCheckUtils]: 51: Hoare triple {170457#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,409 INFO L290 TraceCheckUtils]: 50: Hoare triple {170457#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {170457#(< ~counter~0 88)} is VALID [2022-04-08 12:46:34,410 INFO L290 TraceCheckUtils]: 49: Hoare triple {170482#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170457#(< ~counter~0 88)} is VALID [2022-04-08 12:46:34,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {170482#(< ~counter~0 87)} assume !(~r~0 < 0); {170482#(< ~counter~0 87)} is VALID [2022-04-08 12:46:34,411 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {169631#true} {170482#(< ~counter~0 87)} #98#return; {170482#(< ~counter~0 87)} is VALID [2022-04-08 12:46:34,411 INFO L290 TraceCheckUtils]: 46: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,411 INFO L272 TraceCheckUtils]: 43: Hoare triple {170482#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {170482#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {170482#(< ~counter~0 87)} is VALID [2022-04-08 12:46:34,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {170507#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170482#(< ~counter~0 87)} is VALID [2022-04-08 12:46:34,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {170507#(< ~counter~0 86)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170507#(< ~counter~0 86)} is VALID [2022-04-08 12:46:34,414 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {169631#true} {170507#(< ~counter~0 86)} #98#return; {170507#(< ~counter~0 86)} is VALID [2022-04-08 12:46:34,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,414 INFO L272 TraceCheckUtils]: 35: Hoare triple {170507#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {170507#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {170507#(< ~counter~0 86)} is VALID [2022-04-08 12:46:34,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {170532#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170507#(< ~counter~0 86)} is VALID [2022-04-08 12:46:34,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {170532#(< ~counter~0 85)} assume !(~r~0 > 0); {170532#(< ~counter~0 85)} is VALID [2022-04-08 12:46:34,417 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {169631#true} {170532#(< ~counter~0 85)} #96#return; {170532#(< ~counter~0 85)} is VALID [2022-04-08 12:46:34,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,417 INFO L272 TraceCheckUtils]: 27: Hoare triple {170532#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {170532#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {170532#(< ~counter~0 85)} is VALID [2022-04-08 12:46:34,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {170557#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170532#(< ~counter~0 85)} is VALID [2022-04-08 12:46:34,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {170557#(< ~counter~0 84)} assume !!(0 != ~r~0); {170557#(< ~counter~0 84)} is VALID [2022-04-08 12:46:34,419 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {169631#true} {170557#(< ~counter~0 84)} #94#return; {170557#(< ~counter~0 84)} is VALID [2022-04-08 12:46:34,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,420 INFO L272 TraceCheckUtils]: 19: Hoare triple {170557#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {170557#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {170557#(< ~counter~0 84)} is VALID [2022-04-08 12:46:34,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {170582#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170557#(< ~counter~0 84)} is VALID [2022-04-08 12:46:34,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {170582#(< ~counter~0 83)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {170582#(< ~counter~0 83)} is VALID [2022-04-08 12:46:34,422 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {169631#true} {170582#(< ~counter~0 83)} #92#return; {170582#(< ~counter~0 83)} is VALID [2022-04-08 12:46:34,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,422 INFO L272 TraceCheckUtils]: 11: Hoare triple {170582#(< ~counter~0 83)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,423 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {169631#true} {170582#(< ~counter~0 83)} #90#return; {170582#(< ~counter~0 83)} is VALID [2022-04-08 12:46:34,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 12:46:34,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 12:46:34,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 12:46:34,423 INFO L272 TraceCheckUtils]: 6: Hoare triple {170582#(< ~counter~0 83)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 12:46:34,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {170582#(< ~counter~0 83)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {170582#(< ~counter~0 83)} is VALID [2022-04-08 12:46:34,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {170582#(< ~counter~0 83)} call #t~ret9 := main(); {170582#(< ~counter~0 83)} is VALID [2022-04-08 12:46:34,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170582#(< ~counter~0 83)} {169631#true} #102#return; {170582#(< ~counter~0 83)} is VALID [2022-04-08 12:46:34,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {170582#(< ~counter~0 83)} assume true; {170582#(< ~counter~0 83)} is VALID [2022-04-08 12:46:34,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {169631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {170582#(< ~counter~0 83)} is VALID [2022-04-08 12:46:34,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {169631#true} call ULTIMATE.init(); {169631#true} is VALID [2022-04-08 12:46:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 40 proven. 206 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-08 12:46:34,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:46:34,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116878538] [2022-04-08 12:46:34,425 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:46:34,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767069344] [2022-04-08 12:46:34,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767069344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:46:34,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:46:34,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-08 12:46:34,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:46:34,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1876725582] [2022-04-08 12:46:34,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1876725582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:46:34,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:46:34,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 12:46:34,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201852764] [2022-04-08 12:46:34,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:46:34,426 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 161 [2022-04-08 12:46:34,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:46:34,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:46:34,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:46:34,661 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 12:46:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:46:34,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 12:46:34,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 12:46:34,661 INFO L87 Difference]: Start difference. First operand 875 states and 1169 transitions. Second operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:46:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:40,701 INFO L93 Difference]: Finished difference Result 1079 states and 1471 transitions. [2022-04-08 12:46:40,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 12:46:40,701 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 161 [2022-04-08 12:46:40,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:46:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:46:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-08 12:46:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:46:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-08 12:46:40,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 376 transitions. [2022-04-08 12:46:41,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:46:41,236 INFO L225 Difference]: With dead ends: 1079 [2022-04-08 12:46:41,237 INFO L226 Difference]: Without dead ends: 901 [2022-04-08 12:46:41,237 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-08 12:46:41,237 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 274 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 12:46:41,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 365 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 12:46:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-04-08 12:46:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 890. [2022-04-08 12:46:44,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:46:44,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 12:46:44,796 INFO L74 IsIncluded]: Start isIncluded. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 12:46:44,797 INFO L87 Difference]: Start difference. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 12:46:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:44,822 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-08 12:46:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-08 12:46:44,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:46:44,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:46:44,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) Second operand 901 states. [2022-04-08 12:46:44,824 INFO L87 Difference]: Start difference. First operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) Second operand 901 states. [2022-04-08 12:46:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:44,848 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-08 12:46:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-08 12:46:44,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:46:44,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:46:44,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:46:44,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:46:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 12:46:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1187 transitions. [2022-04-08 12:46:44,883 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1187 transitions. Word has length 161 [2022-04-08 12:46:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:46:44,883 INFO L478 AbstractCegarLoop]: Abstraction has 890 states and 1187 transitions. [2022-04-08 12:46:44,883 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:46:44,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 890 states and 1187 transitions. [2022-04-08 12:46:56,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1187 edges. 1185 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 12:46:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1187 transitions. [2022-04-08 12:46:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-08 12:46:56,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:46:56,348 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 8, 7, 7, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:46:56,355 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-08 12:46:56,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:46:56,555 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:46:56,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:46:56,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 25 times [2022-04-08 12:46:56,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:46:56,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1014869966] [2022-04-08 12:46:56,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:46:56,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 26 times [2022-04-08 12:46:56,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:46:56,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974053975] [2022-04-08 12:46:56,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:46:56,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:46:56,569 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:46:56,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001193547] [2022-04-08 12:46:56,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:46:56,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:46:56,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:46:56,570 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:46:56,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-08 12:46:56,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:46:56,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:46:56,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 12:46:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:46:56,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:46:57,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {176406#true} call ULTIMATE.init(); {176406#true} is VALID [2022-04-08 12:46:57,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {176406#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {176414#(<= ~counter~0 0)} assume true; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176414#(<= ~counter~0 0)} {176406#true} #102#return; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {176414#(<= ~counter~0 0)} call #t~ret9 := main(); {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {176414#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,631 INFO L272 TraceCheckUtils]: 6: Hoare triple {176414#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {176414#(<= ~counter~0 0)} ~cond := #in~cond; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {176414#(<= ~counter~0 0)} assume !(0 == ~cond); {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {176414#(<= ~counter~0 0)} assume true; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,632 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176414#(<= ~counter~0 0)} {176414#(<= ~counter~0 0)} #90#return; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,633 INFO L272 TraceCheckUtils]: 11: Hoare triple {176414#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {176414#(<= ~counter~0 0)} ~cond := #in~cond; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {176414#(<= ~counter~0 0)} assume !(0 == ~cond); {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {176414#(<= ~counter~0 0)} assume true; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,634 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176414#(<= ~counter~0 0)} {176414#(<= ~counter~0 0)} #92#return; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {176414#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:57,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {176414#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176463#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:57,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {176463#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {176463#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:57,638 INFO L272 TraceCheckUtils]: 19: Hoare triple {176463#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176463#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:57,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {176463#(<= ~counter~0 1)} ~cond := #in~cond; {176463#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:57,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {176463#(<= ~counter~0 1)} assume !(0 == ~cond); {176463#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:57,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {176463#(<= ~counter~0 1)} assume true; {176463#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:57,640 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176463#(<= ~counter~0 1)} {176463#(<= ~counter~0 1)} #94#return; {176463#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:57,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {176463#(<= ~counter~0 1)} assume !!(0 != ~r~0); {176463#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:57,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {176463#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176488#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:57,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {176488#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {176488#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:57,642 INFO L272 TraceCheckUtils]: 27: Hoare triple {176488#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176488#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:57,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {176488#(<= ~counter~0 2)} ~cond := #in~cond; {176488#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:57,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {176488#(<= ~counter~0 2)} assume !(0 == ~cond); {176488#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:57,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {176488#(<= ~counter~0 2)} assume true; {176488#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:57,643 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176488#(<= ~counter~0 2)} {176488#(<= ~counter~0 2)} #96#return; {176488#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:57,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {176488#(<= ~counter~0 2)} assume !(~r~0 > 0); {176488#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:57,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {176488#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176513#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:57,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {176513#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {176513#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:57,646 INFO L272 TraceCheckUtils]: 35: Hoare triple {176513#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176513#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:57,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {176513#(<= ~counter~0 3)} ~cond := #in~cond; {176513#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:57,646 INFO L290 TraceCheckUtils]: 37: Hoare triple {176513#(<= ~counter~0 3)} assume !(0 == ~cond); {176513#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:57,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {176513#(<= ~counter~0 3)} assume true; {176513#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:57,647 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176513#(<= ~counter~0 3)} {176513#(<= ~counter~0 3)} #98#return; {176513#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:57,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {176513#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176513#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:57,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {176513#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176538#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:57,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {176538#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {176538#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:57,651 INFO L272 TraceCheckUtils]: 43: Hoare triple {176538#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176538#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:57,651 INFO L290 TraceCheckUtils]: 44: Hoare triple {176538#(<= ~counter~0 4)} ~cond := #in~cond; {176538#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:57,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {176538#(<= ~counter~0 4)} assume !(0 == ~cond); {176538#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:57,651 INFO L290 TraceCheckUtils]: 46: Hoare triple {176538#(<= ~counter~0 4)} assume true; {176538#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:57,652 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176538#(<= ~counter~0 4)} {176538#(<= ~counter~0 4)} #98#return; {176538#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:57,652 INFO L290 TraceCheckUtils]: 48: Hoare triple {176538#(<= ~counter~0 4)} assume !(~r~0 < 0); {176538#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:57,655 INFO L290 TraceCheckUtils]: 49: Hoare triple {176538#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176563#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:57,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {176563#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {176563#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:57,656 INFO L272 TraceCheckUtils]: 51: Hoare triple {176563#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176563#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:57,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {176563#(<= ~counter~0 5)} ~cond := #in~cond; {176563#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:57,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {176563#(<= ~counter~0 5)} assume !(0 == ~cond); {176563#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:57,657 INFO L290 TraceCheckUtils]: 54: Hoare triple {176563#(<= ~counter~0 5)} assume true; {176563#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:57,657 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176563#(<= ~counter~0 5)} {176563#(<= ~counter~0 5)} #94#return; {176563#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:57,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {176563#(<= ~counter~0 5)} assume !!(0 != ~r~0); {176563#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:57,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {176563#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176588#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:57,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {176588#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {176588#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:57,660 INFO L272 TraceCheckUtils]: 59: Hoare triple {176588#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176588#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:57,661 INFO L290 TraceCheckUtils]: 60: Hoare triple {176588#(<= ~counter~0 6)} ~cond := #in~cond; {176588#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:57,661 INFO L290 TraceCheckUtils]: 61: Hoare triple {176588#(<= ~counter~0 6)} assume !(0 == ~cond); {176588#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:57,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {176588#(<= ~counter~0 6)} assume true; {176588#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:57,662 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176588#(<= ~counter~0 6)} {176588#(<= ~counter~0 6)} #96#return; {176588#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:57,662 INFO L290 TraceCheckUtils]: 64: Hoare triple {176588#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176588#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:57,664 INFO L290 TraceCheckUtils]: 65: Hoare triple {176588#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176613#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:57,664 INFO L290 TraceCheckUtils]: 66: Hoare triple {176613#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {176613#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:57,664 INFO L272 TraceCheckUtils]: 67: Hoare triple {176613#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176613#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:57,665 INFO L290 TraceCheckUtils]: 68: Hoare triple {176613#(<= ~counter~0 7)} ~cond := #in~cond; {176613#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:57,665 INFO L290 TraceCheckUtils]: 69: Hoare triple {176613#(<= ~counter~0 7)} assume !(0 == ~cond); {176613#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:57,665 INFO L290 TraceCheckUtils]: 70: Hoare triple {176613#(<= ~counter~0 7)} assume true; {176613#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:57,666 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176613#(<= ~counter~0 7)} {176613#(<= ~counter~0 7)} #96#return; {176613#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:57,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {176613#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176613#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:57,667 INFO L290 TraceCheckUtils]: 73: Hoare triple {176613#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176638#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:57,668 INFO L290 TraceCheckUtils]: 74: Hoare triple {176638#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {176638#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:57,668 INFO L272 TraceCheckUtils]: 75: Hoare triple {176638#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176638#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:57,668 INFO L290 TraceCheckUtils]: 76: Hoare triple {176638#(<= ~counter~0 8)} ~cond := #in~cond; {176638#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:57,669 INFO L290 TraceCheckUtils]: 77: Hoare triple {176638#(<= ~counter~0 8)} assume !(0 == ~cond); {176638#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:57,669 INFO L290 TraceCheckUtils]: 78: Hoare triple {176638#(<= ~counter~0 8)} assume true; {176638#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:57,669 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176638#(<= ~counter~0 8)} {176638#(<= ~counter~0 8)} #96#return; {176638#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:57,670 INFO L290 TraceCheckUtils]: 80: Hoare triple {176638#(<= ~counter~0 8)} assume !(~r~0 > 0); {176638#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:57,671 INFO L290 TraceCheckUtils]: 81: Hoare triple {176638#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176663#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:57,671 INFO L290 TraceCheckUtils]: 82: Hoare triple {176663#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {176663#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:57,672 INFO L272 TraceCheckUtils]: 83: Hoare triple {176663#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176663#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:57,672 INFO L290 TraceCheckUtils]: 84: Hoare triple {176663#(<= ~counter~0 9)} ~cond := #in~cond; {176663#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:57,672 INFO L290 TraceCheckUtils]: 85: Hoare triple {176663#(<= ~counter~0 9)} assume !(0 == ~cond); {176663#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:57,672 INFO L290 TraceCheckUtils]: 86: Hoare triple {176663#(<= ~counter~0 9)} assume true; {176663#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:57,673 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176663#(<= ~counter~0 9)} {176663#(<= ~counter~0 9)} #98#return; {176663#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:57,673 INFO L290 TraceCheckUtils]: 88: Hoare triple {176663#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176663#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:57,674 INFO L290 TraceCheckUtils]: 89: Hoare triple {176663#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176688#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:57,675 INFO L290 TraceCheckUtils]: 90: Hoare triple {176688#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {176688#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:57,675 INFO L272 TraceCheckUtils]: 91: Hoare triple {176688#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176688#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:57,675 INFO L290 TraceCheckUtils]: 92: Hoare triple {176688#(<= ~counter~0 10)} ~cond := #in~cond; {176688#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:57,676 INFO L290 TraceCheckUtils]: 93: Hoare triple {176688#(<= ~counter~0 10)} assume !(0 == ~cond); {176688#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:57,676 INFO L290 TraceCheckUtils]: 94: Hoare triple {176688#(<= ~counter~0 10)} assume true; {176688#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:57,676 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176688#(<= ~counter~0 10)} {176688#(<= ~counter~0 10)} #98#return; {176688#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:57,677 INFO L290 TraceCheckUtils]: 96: Hoare triple {176688#(<= ~counter~0 10)} assume !(~r~0 < 0); {176688#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:57,678 INFO L290 TraceCheckUtils]: 97: Hoare triple {176688#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176713#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:57,678 INFO L290 TraceCheckUtils]: 98: Hoare triple {176713#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {176713#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:57,679 INFO L272 TraceCheckUtils]: 99: Hoare triple {176713#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176713#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:57,679 INFO L290 TraceCheckUtils]: 100: Hoare triple {176713#(<= ~counter~0 11)} ~cond := #in~cond; {176713#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:57,679 INFO L290 TraceCheckUtils]: 101: Hoare triple {176713#(<= ~counter~0 11)} assume !(0 == ~cond); {176713#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:57,680 INFO L290 TraceCheckUtils]: 102: Hoare triple {176713#(<= ~counter~0 11)} assume true; {176713#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:57,680 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176713#(<= ~counter~0 11)} {176713#(<= ~counter~0 11)} #94#return; {176713#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:57,680 INFO L290 TraceCheckUtils]: 104: Hoare triple {176713#(<= ~counter~0 11)} assume !!(0 != ~r~0); {176713#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:57,682 INFO L290 TraceCheckUtils]: 105: Hoare triple {176713#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176738#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:57,682 INFO L290 TraceCheckUtils]: 106: Hoare triple {176738#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {176738#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:57,682 INFO L272 TraceCheckUtils]: 107: Hoare triple {176738#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176738#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:57,683 INFO L290 TraceCheckUtils]: 108: Hoare triple {176738#(<= ~counter~0 12)} ~cond := #in~cond; {176738#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:57,683 INFO L290 TraceCheckUtils]: 109: Hoare triple {176738#(<= ~counter~0 12)} assume !(0 == ~cond); {176738#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:57,683 INFO L290 TraceCheckUtils]: 110: Hoare triple {176738#(<= ~counter~0 12)} assume true; {176738#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:57,684 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176738#(<= ~counter~0 12)} {176738#(<= ~counter~0 12)} #96#return; {176738#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:57,684 INFO L290 TraceCheckUtils]: 112: Hoare triple {176738#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176738#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:57,685 INFO L290 TraceCheckUtils]: 113: Hoare triple {176738#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176763#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:57,686 INFO L290 TraceCheckUtils]: 114: Hoare triple {176763#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {176763#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:57,686 INFO L272 TraceCheckUtils]: 115: Hoare triple {176763#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176763#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:57,686 INFO L290 TraceCheckUtils]: 116: Hoare triple {176763#(<= ~counter~0 13)} ~cond := #in~cond; {176763#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:57,687 INFO L290 TraceCheckUtils]: 117: Hoare triple {176763#(<= ~counter~0 13)} assume !(0 == ~cond); {176763#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:57,687 INFO L290 TraceCheckUtils]: 118: Hoare triple {176763#(<= ~counter~0 13)} assume true; {176763#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:57,687 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176763#(<= ~counter~0 13)} {176763#(<= ~counter~0 13)} #96#return; {176763#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:57,688 INFO L290 TraceCheckUtils]: 120: Hoare triple {176763#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176763#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:57,689 INFO L290 TraceCheckUtils]: 121: Hoare triple {176763#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176788#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:57,689 INFO L290 TraceCheckUtils]: 122: Hoare triple {176788#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {176788#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:57,690 INFO L272 TraceCheckUtils]: 123: Hoare triple {176788#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176788#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:57,690 INFO L290 TraceCheckUtils]: 124: Hoare triple {176788#(<= ~counter~0 14)} ~cond := #in~cond; {176788#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:57,690 INFO L290 TraceCheckUtils]: 125: Hoare triple {176788#(<= ~counter~0 14)} assume !(0 == ~cond); {176788#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:57,691 INFO L290 TraceCheckUtils]: 126: Hoare triple {176788#(<= ~counter~0 14)} assume true; {176788#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:57,691 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176788#(<= ~counter~0 14)} {176788#(<= ~counter~0 14)} #96#return; {176788#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:57,691 INFO L290 TraceCheckUtils]: 128: Hoare triple {176788#(<= ~counter~0 14)} assume !(~r~0 > 0); {176788#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:57,693 INFO L290 TraceCheckUtils]: 129: Hoare triple {176788#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176813#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:57,693 INFO L290 TraceCheckUtils]: 130: Hoare triple {176813#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {176813#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:57,694 INFO L272 TraceCheckUtils]: 131: Hoare triple {176813#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176813#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:57,694 INFO L290 TraceCheckUtils]: 132: Hoare triple {176813#(<= ~counter~0 15)} ~cond := #in~cond; {176813#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:57,694 INFO L290 TraceCheckUtils]: 133: Hoare triple {176813#(<= ~counter~0 15)} assume !(0 == ~cond); {176813#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:57,694 INFO L290 TraceCheckUtils]: 134: Hoare triple {176813#(<= ~counter~0 15)} assume true; {176813#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:57,695 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176813#(<= ~counter~0 15)} {176813#(<= ~counter~0 15)} #98#return; {176813#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:57,695 INFO L290 TraceCheckUtils]: 136: Hoare triple {176813#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176813#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:57,696 INFO L290 TraceCheckUtils]: 137: Hoare triple {176813#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176838#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:57,697 INFO L290 TraceCheckUtils]: 138: Hoare triple {176838#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {176838#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:57,697 INFO L272 TraceCheckUtils]: 139: Hoare triple {176838#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176838#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:57,697 INFO L290 TraceCheckUtils]: 140: Hoare triple {176838#(<= ~counter~0 16)} ~cond := #in~cond; {176838#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:57,698 INFO L290 TraceCheckUtils]: 141: Hoare triple {176838#(<= ~counter~0 16)} assume !(0 == ~cond); {176838#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:57,698 INFO L290 TraceCheckUtils]: 142: Hoare triple {176838#(<= ~counter~0 16)} assume true; {176838#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:57,698 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176838#(<= ~counter~0 16)} {176838#(<= ~counter~0 16)} #98#return; {176838#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:57,699 INFO L290 TraceCheckUtils]: 144: Hoare triple {176838#(<= ~counter~0 16)} assume !(~r~0 < 0); {176838#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:57,700 INFO L290 TraceCheckUtils]: 145: Hoare triple {176838#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176863#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:57,700 INFO L290 TraceCheckUtils]: 146: Hoare triple {176863#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {176863#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:57,701 INFO L272 TraceCheckUtils]: 147: Hoare triple {176863#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176863#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:57,701 INFO L290 TraceCheckUtils]: 148: Hoare triple {176863#(<= ~counter~0 17)} ~cond := #in~cond; {176863#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:57,701 INFO L290 TraceCheckUtils]: 149: Hoare triple {176863#(<= ~counter~0 17)} assume !(0 == ~cond); {176863#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:57,701 INFO L290 TraceCheckUtils]: 150: Hoare triple {176863#(<= ~counter~0 17)} assume true; {176863#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:57,702 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176863#(<= ~counter~0 17)} {176863#(<= ~counter~0 17)} #94#return; {176863#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:57,702 INFO L290 TraceCheckUtils]: 152: Hoare triple {176863#(<= ~counter~0 17)} assume !!(0 != ~r~0); {176863#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:57,703 INFO L290 TraceCheckUtils]: 153: Hoare triple {176863#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176888#(<= |main_#t~post7| 17)} is VALID [2022-04-08 12:46:57,703 INFO L290 TraceCheckUtils]: 154: Hoare triple {176888#(<= |main_#t~post7| 17)} assume !(#t~post7 < 100);havoc #t~post7; {176407#false} is VALID [2022-04-08 12:46:57,703 INFO L290 TraceCheckUtils]: 155: Hoare triple {176407#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176407#false} is VALID [2022-04-08 12:46:57,703 INFO L290 TraceCheckUtils]: 156: Hoare triple {176407#false} assume !(#t~post8 < 100);havoc #t~post8; {176407#false} is VALID [2022-04-08 12:46:57,703 INFO L290 TraceCheckUtils]: 157: Hoare triple {176407#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176407#false} is VALID [2022-04-08 12:46:57,703 INFO L290 TraceCheckUtils]: 158: Hoare triple {176407#false} assume !(#t~post6 < 100);havoc #t~post6; {176407#false} is VALID [2022-04-08 12:46:57,703 INFO L272 TraceCheckUtils]: 159: Hoare triple {176407#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176407#false} is VALID [2022-04-08 12:46:57,703 INFO L290 TraceCheckUtils]: 160: Hoare triple {176407#false} ~cond := #in~cond; {176407#false} is VALID [2022-04-08 12:46:57,703 INFO L290 TraceCheckUtils]: 161: Hoare triple {176407#false} assume 0 == ~cond; {176407#false} is VALID [2022-04-08 12:46:57,703 INFO L290 TraceCheckUtils]: 162: Hoare triple {176407#false} assume !false; {176407#false} is VALID [2022-04-08 12:46:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 54 proven. 726 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:46:57,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:46:58,720 INFO L290 TraceCheckUtils]: 162: Hoare triple {176407#false} assume !false; {176407#false} is VALID [2022-04-08 12:46:58,720 INFO L290 TraceCheckUtils]: 161: Hoare triple {176407#false} assume 0 == ~cond; {176407#false} is VALID [2022-04-08 12:46:58,720 INFO L290 TraceCheckUtils]: 160: Hoare triple {176407#false} ~cond := #in~cond; {176407#false} is VALID [2022-04-08 12:46:58,720 INFO L272 TraceCheckUtils]: 159: Hoare triple {176407#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176407#false} is VALID [2022-04-08 12:46:58,720 INFO L290 TraceCheckUtils]: 158: Hoare triple {176407#false} assume !(#t~post6 < 100);havoc #t~post6; {176407#false} is VALID [2022-04-08 12:46:58,720 INFO L290 TraceCheckUtils]: 157: Hoare triple {176407#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176407#false} is VALID [2022-04-08 12:46:58,720 INFO L290 TraceCheckUtils]: 156: Hoare triple {176407#false} assume !(#t~post8 < 100);havoc #t~post8; {176407#false} is VALID [2022-04-08 12:46:58,720 INFO L290 TraceCheckUtils]: 155: Hoare triple {176407#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176407#false} is VALID [2022-04-08 12:46:58,721 INFO L290 TraceCheckUtils]: 154: Hoare triple {176940#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {176407#false} is VALID [2022-04-08 12:46:58,721 INFO L290 TraceCheckUtils]: 153: Hoare triple {176944#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176940#(< |main_#t~post7| 100)} is VALID [2022-04-08 12:46:58,721 INFO L290 TraceCheckUtils]: 152: Hoare triple {176944#(< ~counter~0 100)} assume !!(0 != ~r~0); {176944#(< ~counter~0 100)} is VALID [2022-04-08 12:46:58,722 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176406#true} {176944#(< ~counter~0 100)} #94#return; {176944#(< ~counter~0 100)} is VALID [2022-04-08 12:46:58,722 INFO L290 TraceCheckUtils]: 150: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,722 INFO L290 TraceCheckUtils]: 149: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,722 INFO L290 TraceCheckUtils]: 148: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,722 INFO L272 TraceCheckUtils]: 147: Hoare triple {176944#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,722 INFO L290 TraceCheckUtils]: 146: Hoare triple {176944#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {176944#(< ~counter~0 100)} is VALID [2022-04-08 12:46:58,726 INFO L290 TraceCheckUtils]: 145: Hoare triple {176969#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176944#(< ~counter~0 100)} is VALID [2022-04-08 12:46:58,726 INFO L290 TraceCheckUtils]: 144: Hoare triple {176969#(< ~counter~0 99)} assume !(~r~0 < 0); {176969#(< ~counter~0 99)} is VALID [2022-04-08 12:46:58,726 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176406#true} {176969#(< ~counter~0 99)} #98#return; {176969#(< ~counter~0 99)} is VALID [2022-04-08 12:46:58,726 INFO L290 TraceCheckUtils]: 142: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,727 INFO L290 TraceCheckUtils]: 141: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,727 INFO L290 TraceCheckUtils]: 140: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,727 INFO L272 TraceCheckUtils]: 139: Hoare triple {176969#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,727 INFO L290 TraceCheckUtils]: 138: Hoare triple {176969#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {176969#(< ~counter~0 99)} is VALID [2022-04-08 12:46:58,728 INFO L290 TraceCheckUtils]: 137: Hoare triple {176994#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176969#(< ~counter~0 99)} is VALID [2022-04-08 12:46:58,729 INFO L290 TraceCheckUtils]: 136: Hoare triple {176994#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176994#(< ~counter~0 98)} is VALID [2022-04-08 12:46:58,729 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176406#true} {176994#(< ~counter~0 98)} #98#return; {176994#(< ~counter~0 98)} is VALID [2022-04-08 12:46:58,729 INFO L290 TraceCheckUtils]: 134: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,729 INFO L290 TraceCheckUtils]: 133: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,729 INFO L290 TraceCheckUtils]: 132: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,729 INFO L272 TraceCheckUtils]: 131: Hoare triple {176994#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,729 INFO L290 TraceCheckUtils]: 130: Hoare triple {176994#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {176994#(< ~counter~0 98)} is VALID [2022-04-08 12:46:58,731 INFO L290 TraceCheckUtils]: 129: Hoare triple {177019#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176994#(< ~counter~0 98)} is VALID [2022-04-08 12:46:58,731 INFO L290 TraceCheckUtils]: 128: Hoare triple {177019#(< ~counter~0 97)} assume !(~r~0 > 0); {177019#(< ~counter~0 97)} is VALID [2022-04-08 12:46:58,732 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176406#true} {177019#(< ~counter~0 97)} #96#return; {177019#(< ~counter~0 97)} is VALID [2022-04-08 12:46:58,732 INFO L290 TraceCheckUtils]: 126: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,732 INFO L290 TraceCheckUtils]: 125: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,732 INFO L290 TraceCheckUtils]: 124: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,732 INFO L272 TraceCheckUtils]: 123: Hoare triple {177019#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,732 INFO L290 TraceCheckUtils]: 122: Hoare triple {177019#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {177019#(< ~counter~0 97)} is VALID [2022-04-08 12:46:58,733 INFO L290 TraceCheckUtils]: 121: Hoare triple {177044#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177019#(< ~counter~0 97)} is VALID [2022-04-08 12:46:58,734 INFO L290 TraceCheckUtils]: 120: Hoare triple {177044#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177044#(< ~counter~0 96)} is VALID [2022-04-08 12:46:58,734 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176406#true} {177044#(< ~counter~0 96)} #96#return; {177044#(< ~counter~0 96)} is VALID [2022-04-08 12:46:58,734 INFO L290 TraceCheckUtils]: 118: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,734 INFO L290 TraceCheckUtils]: 117: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,734 INFO L290 TraceCheckUtils]: 116: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,734 INFO L272 TraceCheckUtils]: 115: Hoare triple {177044#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,735 INFO L290 TraceCheckUtils]: 114: Hoare triple {177044#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {177044#(< ~counter~0 96)} is VALID [2022-04-08 12:46:58,736 INFO L290 TraceCheckUtils]: 113: Hoare triple {177069#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177044#(< ~counter~0 96)} is VALID [2022-04-08 12:46:58,736 INFO L290 TraceCheckUtils]: 112: Hoare triple {177069#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177069#(< ~counter~0 95)} is VALID [2022-04-08 12:46:58,737 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176406#true} {177069#(< ~counter~0 95)} #96#return; {177069#(< ~counter~0 95)} is VALID [2022-04-08 12:46:58,737 INFO L290 TraceCheckUtils]: 110: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,737 INFO L290 TraceCheckUtils]: 109: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,737 INFO L290 TraceCheckUtils]: 108: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,737 INFO L272 TraceCheckUtils]: 107: Hoare triple {177069#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,737 INFO L290 TraceCheckUtils]: 106: Hoare triple {177069#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {177069#(< ~counter~0 95)} is VALID [2022-04-08 12:46:58,739 INFO L290 TraceCheckUtils]: 105: Hoare triple {177094#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177069#(< ~counter~0 95)} is VALID [2022-04-08 12:46:58,739 INFO L290 TraceCheckUtils]: 104: Hoare triple {177094#(< ~counter~0 94)} assume !!(0 != ~r~0); {177094#(< ~counter~0 94)} is VALID [2022-04-08 12:46:58,739 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176406#true} {177094#(< ~counter~0 94)} #94#return; {177094#(< ~counter~0 94)} is VALID [2022-04-08 12:46:58,739 INFO L290 TraceCheckUtils]: 102: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,740 INFO L290 TraceCheckUtils]: 101: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,740 INFO L290 TraceCheckUtils]: 100: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,740 INFO L272 TraceCheckUtils]: 99: Hoare triple {177094#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,740 INFO L290 TraceCheckUtils]: 98: Hoare triple {177094#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {177094#(< ~counter~0 94)} is VALID [2022-04-08 12:46:58,741 INFO L290 TraceCheckUtils]: 97: Hoare triple {177119#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177094#(< ~counter~0 94)} is VALID [2022-04-08 12:46:58,742 INFO L290 TraceCheckUtils]: 96: Hoare triple {177119#(< ~counter~0 93)} assume !(~r~0 < 0); {177119#(< ~counter~0 93)} is VALID [2022-04-08 12:46:58,742 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176406#true} {177119#(< ~counter~0 93)} #98#return; {177119#(< ~counter~0 93)} is VALID [2022-04-08 12:46:58,742 INFO L290 TraceCheckUtils]: 94: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,742 INFO L290 TraceCheckUtils]: 93: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,742 INFO L290 TraceCheckUtils]: 92: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,742 INFO L272 TraceCheckUtils]: 91: Hoare triple {177119#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,742 INFO L290 TraceCheckUtils]: 90: Hoare triple {177119#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {177119#(< ~counter~0 93)} is VALID [2022-04-08 12:46:58,744 INFO L290 TraceCheckUtils]: 89: Hoare triple {177144#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177119#(< ~counter~0 93)} is VALID [2022-04-08 12:46:58,744 INFO L290 TraceCheckUtils]: 88: Hoare triple {177144#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177144#(< ~counter~0 92)} is VALID [2022-04-08 12:46:58,745 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176406#true} {177144#(< ~counter~0 92)} #98#return; {177144#(< ~counter~0 92)} is VALID [2022-04-08 12:46:58,745 INFO L290 TraceCheckUtils]: 86: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,745 INFO L290 TraceCheckUtils]: 85: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,745 INFO L290 TraceCheckUtils]: 84: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,745 INFO L272 TraceCheckUtils]: 83: Hoare triple {177144#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,745 INFO L290 TraceCheckUtils]: 82: Hoare triple {177144#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {177144#(< ~counter~0 92)} is VALID [2022-04-08 12:46:58,746 INFO L290 TraceCheckUtils]: 81: Hoare triple {177169#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177144#(< ~counter~0 92)} is VALID [2022-04-08 12:46:58,747 INFO L290 TraceCheckUtils]: 80: Hoare triple {177169#(< ~counter~0 91)} assume !(~r~0 > 0); {177169#(< ~counter~0 91)} is VALID [2022-04-08 12:46:58,747 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176406#true} {177169#(< ~counter~0 91)} #96#return; {177169#(< ~counter~0 91)} is VALID [2022-04-08 12:46:58,747 INFO L290 TraceCheckUtils]: 78: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,747 INFO L290 TraceCheckUtils]: 77: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,747 INFO L290 TraceCheckUtils]: 76: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,747 INFO L272 TraceCheckUtils]: 75: Hoare triple {177169#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,748 INFO L290 TraceCheckUtils]: 74: Hoare triple {177169#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {177169#(< ~counter~0 91)} is VALID [2022-04-08 12:46:58,749 INFO L290 TraceCheckUtils]: 73: Hoare triple {177194#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177169#(< ~counter~0 91)} is VALID [2022-04-08 12:46:58,749 INFO L290 TraceCheckUtils]: 72: Hoare triple {177194#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177194#(< ~counter~0 90)} is VALID [2022-04-08 12:46:58,750 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176406#true} {177194#(< ~counter~0 90)} #96#return; {177194#(< ~counter~0 90)} is VALID [2022-04-08 12:46:58,750 INFO L290 TraceCheckUtils]: 70: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,750 INFO L290 TraceCheckUtils]: 69: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,750 INFO L290 TraceCheckUtils]: 68: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,750 INFO L272 TraceCheckUtils]: 67: Hoare triple {177194#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {177194#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {177194#(< ~counter~0 90)} is VALID [2022-04-08 12:46:58,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {177219#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177194#(< ~counter~0 90)} is VALID [2022-04-08 12:46:58,752 INFO L290 TraceCheckUtils]: 64: Hoare triple {177219#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177219#(< ~counter~0 89)} is VALID [2022-04-08 12:46:58,753 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176406#true} {177219#(< ~counter~0 89)} #96#return; {177219#(< ~counter~0 89)} is VALID [2022-04-08 12:46:58,753 INFO L290 TraceCheckUtils]: 62: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,753 INFO L272 TraceCheckUtils]: 59: Hoare triple {177219#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {177219#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {177219#(< ~counter~0 89)} is VALID [2022-04-08 12:46:58,754 INFO L290 TraceCheckUtils]: 57: Hoare triple {177244#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177219#(< ~counter~0 89)} is VALID [2022-04-08 12:46:58,755 INFO L290 TraceCheckUtils]: 56: Hoare triple {177244#(< ~counter~0 88)} assume !!(0 != ~r~0); {177244#(< ~counter~0 88)} is VALID [2022-04-08 12:46:58,755 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176406#true} {177244#(< ~counter~0 88)} #94#return; {177244#(< ~counter~0 88)} is VALID [2022-04-08 12:46:58,755 INFO L290 TraceCheckUtils]: 54: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,755 INFO L290 TraceCheckUtils]: 53: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,755 INFO L290 TraceCheckUtils]: 52: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,755 INFO L272 TraceCheckUtils]: 51: Hoare triple {177244#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,756 INFO L290 TraceCheckUtils]: 50: Hoare triple {177244#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {177244#(< ~counter~0 88)} is VALID [2022-04-08 12:46:58,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {177269#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177244#(< ~counter~0 88)} is VALID [2022-04-08 12:46:58,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {177269#(< ~counter~0 87)} assume !(~r~0 < 0); {177269#(< ~counter~0 87)} is VALID [2022-04-08 12:46:58,758 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176406#true} {177269#(< ~counter~0 87)} #98#return; {177269#(< ~counter~0 87)} is VALID [2022-04-08 12:46:58,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,758 INFO L272 TraceCheckUtils]: 43: Hoare triple {177269#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {177269#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {177269#(< ~counter~0 87)} is VALID [2022-04-08 12:46:58,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {177294#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177269#(< ~counter~0 87)} is VALID [2022-04-08 12:46:58,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {177294#(< ~counter~0 86)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177294#(< ~counter~0 86)} is VALID [2022-04-08 12:46:58,760 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176406#true} {177294#(< ~counter~0 86)} #98#return; {177294#(< ~counter~0 86)} is VALID [2022-04-08 12:46:58,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,767 INFO L272 TraceCheckUtils]: 35: Hoare triple {177294#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {177294#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {177294#(< ~counter~0 86)} is VALID [2022-04-08 12:46:58,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {177319#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177294#(< ~counter~0 86)} is VALID [2022-04-08 12:46:58,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {177319#(< ~counter~0 85)} assume !(~r~0 > 0); {177319#(< ~counter~0 85)} is VALID [2022-04-08 12:46:58,772 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176406#true} {177319#(< ~counter~0 85)} #96#return; {177319#(< ~counter~0 85)} is VALID [2022-04-08 12:46:58,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,772 INFO L272 TraceCheckUtils]: 27: Hoare triple {177319#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {177319#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {177319#(< ~counter~0 85)} is VALID [2022-04-08 12:46:58,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {177344#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177319#(< ~counter~0 85)} is VALID [2022-04-08 12:46:58,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {177344#(< ~counter~0 84)} assume !!(0 != ~r~0); {177344#(< ~counter~0 84)} is VALID [2022-04-08 12:46:58,775 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176406#true} {177344#(< ~counter~0 84)} #94#return; {177344#(< ~counter~0 84)} is VALID [2022-04-08 12:46:58,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,775 INFO L272 TraceCheckUtils]: 19: Hoare triple {177344#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {177344#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {177344#(< ~counter~0 84)} is VALID [2022-04-08 12:46:58,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {177369#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177344#(< ~counter~0 84)} is VALID [2022-04-08 12:46:58,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {177369#(< ~counter~0 83)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {177369#(< ~counter~0 83)} is VALID [2022-04-08 12:46:58,777 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176406#true} {177369#(< ~counter~0 83)} #92#return; {177369#(< ~counter~0 83)} is VALID [2022-04-08 12:46:58,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,777 INFO L272 TraceCheckUtils]: 11: Hoare triple {177369#(< ~counter~0 83)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,778 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176406#true} {177369#(< ~counter~0 83)} #90#return; {177369#(< ~counter~0 83)} is VALID [2022-04-08 12:46:58,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 12:46:58,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 12:46:58,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 12:46:58,778 INFO L272 TraceCheckUtils]: 6: Hoare triple {177369#(< ~counter~0 83)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 12:46:58,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {177369#(< ~counter~0 83)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {177369#(< ~counter~0 83)} is VALID [2022-04-08 12:46:58,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {177369#(< ~counter~0 83)} call #t~ret9 := main(); {177369#(< ~counter~0 83)} is VALID [2022-04-08 12:46:58,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177369#(< ~counter~0 83)} {176406#true} #102#return; {177369#(< ~counter~0 83)} is VALID [2022-04-08 12:46:58,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {177369#(< ~counter~0 83)} assume true; {177369#(< ~counter~0 83)} is VALID [2022-04-08 12:46:58,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {176406#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {177369#(< ~counter~0 83)} is VALID [2022-04-08 12:46:58,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {176406#true} call ULTIMATE.init(); {176406#true} is VALID [2022-04-08 12:46:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 54 proven. 182 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-08 12:46:58,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:46:58,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974053975] [2022-04-08 12:46:58,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:46:58,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001193547] [2022-04-08 12:46:58,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001193547] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:46:58,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:46:58,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-08 12:46:58,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:46:58,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1014869966] [2022-04-08 12:46:58,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1014869966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:46:58,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:46:58,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 12:46:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521926925] [2022-04-08 12:46:58,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:46:58,782 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 163 [2022-04-08 12:46:58,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:46:58,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:46:58,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:46:58,993 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 12:46:58,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:46:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 12:46:58,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 12:46:58,994 INFO L87 Difference]: Start difference. First operand 890 states and 1187 transitions. Second operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:47:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:04,914 INFO L93 Difference]: Finished difference Result 1077 states and 1465 transitions. [2022-04-08 12:47:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 12:47:04,915 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 163 [2022-04-08 12:47:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:47:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:47:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-08 12:47:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:47:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-08 12:47:04,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 376 transitions. [2022-04-08 12:47:05,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:05,473 INFO L225 Difference]: With dead ends: 1077 [2022-04-08 12:47:05,473 INFO L226 Difference]: Without dead ends: 907 [2022-04-08 12:47:05,474 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1316, Invalid=1764, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 12:47:05,474 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 277 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 12:47:05,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 385 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 12:47:05,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-08 12:47:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2022-04-08 12:47:09,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:47:09,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 12:47:09,183 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 12:47:09,183 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 12:47:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:09,209 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-08 12:47:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-08 12:47:09,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:47:09,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:47:09,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) Second operand 907 states. [2022-04-08 12:47:09,211 INFO L87 Difference]: Start difference. First operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) Second operand 907 states. [2022-04-08 12:47:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:09,236 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-08 12:47:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-08 12:47:09,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:47:09,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:47:09,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:47:09,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:47:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 12:47:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1204 transitions. [2022-04-08 12:47:09,272 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1204 transitions. Word has length 163 [2022-04-08 12:47:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:47:09,272 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1204 transitions. [2022-04-08 12:47:09,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 12:47:09,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1204 transitions. [2022-04-08 12:47:23,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1204 edges. 1201 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:23,690 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-08 12:47:23,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-08 12:47:23,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:47:23,692 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 9, 9, 9, 9, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:47:23,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-08 12:47:23,892 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-04-08 12:47:23,892 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:47:23,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:47:23,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 19 times [2022-04-08 12:47:23,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:47:23,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2031781233] [2022-04-08 12:47:23,893 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:47:23,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 20 times [2022-04-08 12:47:23,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:47:23,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763930283] [2022-04-08 12:47:23,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:47:23,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:47:23,907 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:47:23,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210946910] [2022-04-08 12:47:23,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:47:23,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:47:23,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:47:23,908 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:47:23,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-08 12:47:23,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:47:23,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:47:23,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 12:47:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:47:24,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:47:24,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {183237#true} call ULTIMATE.init(); {183237#true} is VALID [2022-04-08 12:47:24,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {183237#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {183245#(<= ~counter~0 0)} assume true; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183245#(<= ~counter~0 0)} {183237#true} #102#return; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {183245#(<= ~counter~0 0)} call #t~ret9 := main(); {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {183245#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,935 INFO L272 TraceCheckUtils]: 6: Hoare triple {183245#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {183245#(<= ~counter~0 0)} ~cond := #in~cond; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {183245#(<= ~counter~0 0)} assume !(0 == ~cond); {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {183245#(<= ~counter~0 0)} assume true; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,936 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183245#(<= ~counter~0 0)} {183245#(<= ~counter~0 0)} #90#return; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,936 INFO L272 TraceCheckUtils]: 11: Hoare triple {183245#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {183245#(<= ~counter~0 0)} ~cond := #in~cond; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {183245#(<= ~counter~0 0)} assume !(0 == ~cond); {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {183245#(<= ~counter~0 0)} assume true; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,937 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183245#(<= ~counter~0 0)} {183245#(<= ~counter~0 0)} #92#return; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {183245#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:24,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {183245#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183294#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:24,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {183294#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {183294#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:24,942 INFO L272 TraceCheckUtils]: 19: Hoare triple {183294#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183294#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:24,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {183294#(<= ~counter~0 1)} ~cond := #in~cond; {183294#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:24,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {183294#(<= ~counter~0 1)} assume !(0 == ~cond); {183294#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:24,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {183294#(<= ~counter~0 1)} assume true; {183294#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:24,943 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183294#(<= ~counter~0 1)} {183294#(<= ~counter~0 1)} #94#return; {183294#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:24,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {183294#(<= ~counter~0 1)} assume !!(0 != ~r~0); {183294#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:24,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {183294#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183319#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:24,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {183319#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {183319#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:24,946 INFO L272 TraceCheckUtils]: 27: Hoare triple {183319#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183319#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:24,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {183319#(<= ~counter~0 2)} ~cond := #in~cond; {183319#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:24,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {183319#(<= ~counter~0 2)} assume !(0 == ~cond); {183319#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:24,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {183319#(<= ~counter~0 2)} assume true; {183319#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:24,947 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183319#(<= ~counter~0 2)} {183319#(<= ~counter~0 2)} #96#return; {183319#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:24,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {183319#(<= ~counter~0 2)} assume !(~r~0 > 0); {183319#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:24,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {183319#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183344#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:24,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {183344#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {183344#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:24,950 INFO L272 TraceCheckUtils]: 35: Hoare triple {183344#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183344#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:24,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {183344#(<= ~counter~0 3)} ~cond := #in~cond; {183344#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:24,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {183344#(<= ~counter~0 3)} assume !(0 == ~cond); {183344#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:24,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {183344#(<= ~counter~0 3)} assume true; {183344#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:24,951 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183344#(<= ~counter~0 3)} {183344#(<= ~counter~0 3)} #98#return; {183344#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:24,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {183344#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183344#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:24,953 INFO L290 TraceCheckUtils]: 41: Hoare triple {183344#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183369#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:24,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {183369#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {183369#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:24,953 INFO L272 TraceCheckUtils]: 43: Hoare triple {183369#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183369#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:24,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {183369#(<= ~counter~0 4)} ~cond := #in~cond; {183369#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:24,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {183369#(<= ~counter~0 4)} assume !(0 == ~cond); {183369#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:24,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {183369#(<= ~counter~0 4)} assume true; {183369#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:24,954 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183369#(<= ~counter~0 4)} {183369#(<= ~counter~0 4)} #98#return; {183369#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:24,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {183369#(<= ~counter~0 4)} assume !(~r~0 < 0); {183369#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:24,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {183369#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183394#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:24,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {183394#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {183394#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:24,957 INFO L272 TraceCheckUtils]: 51: Hoare triple {183394#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183394#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:24,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {183394#(<= ~counter~0 5)} ~cond := #in~cond; {183394#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:24,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {183394#(<= ~counter~0 5)} assume !(0 == ~cond); {183394#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:24,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {183394#(<= ~counter~0 5)} assume true; {183394#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:24,958 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183394#(<= ~counter~0 5)} {183394#(<= ~counter~0 5)} #94#return; {183394#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:24,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {183394#(<= ~counter~0 5)} assume !!(0 != ~r~0); {183394#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:24,960 INFO L290 TraceCheckUtils]: 57: Hoare triple {183394#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183419#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:24,960 INFO L290 TraceCheckUtils]: 58: Hoare triple {183419#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {183419#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:24,961 INFO L272 TraceCheckUtils]: 59: Hoare triple {183419#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183419#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:24,961 INFO L290 TraceCheckUtils]: 60: Hoare triple {183419#(<= ~counter~0 6)} ~cond := #in~cond; {183419#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:24,961 INFO L290 TraceCheckUtils]: 61: Hoare triple {183419#(<= ~counter~0 6)} assume !(0 == ~cond); {183419#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:24,962 INFO L290 TraceCheckUtils]: 62: Hoare triple {183419#(<= ~counter~0 6)} assume true; {183419#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:24,962 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183419#(<= ~counter~0 6)} {183419#(<= ~counter~0 6)} #96#return; {183419#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:24,962 INFO L290 TraceCheckUtils]: 64: Hoare triple {183419#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183419#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:24,964 INFO L290 TraceCheckUtils]: 65: Hoare triple {183419#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183444#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:24,964 INFO L290 TraceCheckUtils]: 66: Hoare triple {183444#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {183444#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:24,964 INFO L272 TraceCheckUtils]: 67: Hoare triple {183444#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183444#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:24,965 INFO L290 TraceCheckUtils]: 68: Hoare triple {183444#(<= ~counter~0 7)} ~cond := #in~cond; {183444#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:24,965 INFO L290 TraceCheckUtils]: 69: Hoare triple {183444#(<= ~counter~0 7)} assume !(0 == ~cond); {183444#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:24,965 INFO L290 TraceCheckUtils]: 70: Hoare triple {183444#(<= ~counter~0 7)} assume true; {183444#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:24,966 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183444#(<= ~counter~0 7)} {183444#(<= ~counter~0 7)} #96#return; {183444#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:24,966 INFO L290 TraceCheckUtils]: 72: Hoare triple {183444#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183444#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:24,967 INFO L290 TraceCheckUtils]: 73: Hoare triple {183444#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183469#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:24,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {183469#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {183469#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:24,968 INFO L272 TraceCheckUtils]: 75: Hoare triple {183469#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183469#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:24,968 INFO L290 TraceCheckUtils]: 76: Hoare triple {183469#(<= ~counter~0 8)} ~cond := #in~cond; {183469#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:24,969 INFO L290 TraceCheckUtils]: 77: Hoare triple {183469#(<= ~counter~0 8)} assume !(0 == ~cond); {183469#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:24,969 INFO L290 TraceCheckUtils]: 78: Hoare triple {183469#(<= ~counter~0 8)} assume true; {183469#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:24,969 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183469#(<= ~counter~0 8)} {183469#(<= ~counter~0 8)} #96#return; {183469#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:24,970 INFO L290 TraceCheckUtils]: 80: Hoare triple {183469#(<= ~counter~0 8)} assume !(~r~0 > 0); {183469#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:24,971 INFO L290 TraceCheckUtils]: 81: Hoare triple {183469#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183494#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:24,971 INFO L290 TraceCheckUtils]: 82: Hoare triple {183494#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {183494#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:24,972 INFO L272 TraceCheckUtils]: 83: Hoare triple {183494#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183494#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:24,972 INFO L290 TraceCheckUtils]: 84: Hoare triple {183494#(<= ~counter~0 9)} ~cond := #in~cond; {183494#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:24,972 INFO L290 TraceCheckUtils]: 85: Hoare triple {183494#(<= ~counter~0 9)} assume !(0 == ~cond); {183494#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:24,973 INFO L290 TraceCheckUtils]: 86: Hoare triple {183494#(<= ~counter~0 9)} assume true; {183494#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:24,973 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183494#(<= ~counter~0 9)} {183494#(<= ~counter~0 9)} #98#return; {183494#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:24,973 INFO L290 TraceCheckUtils]: 88: Hoare triple {183494#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183494#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:24,975 INFO L290 TraceCheckUtils]: 89: Hoare triple {183494#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183519#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:24,975 INFO L290 TraceCheckUtils]: 90: Hoare triple {183519#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {183519#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:24,976 INFO L272 TraceCheckUtils]: 91: Hoare triple {183519#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183519#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:24,976 INFO L290 TraceCheckUtils]: 92: Hoare triple {183519#(<= ~counter~0 10)} ~cond := #in~cond; {183519#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:24,976 INFO L290 TraceCheckUtils]: 93: Hoare triple {183519#(<= ~counter~0 10)} assume !(0 == ~cond); {183519#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:24,976 INFO L290 TraceCheckUtils]: 94: Hoare triple {183519#(<= ~counter~0 10)} assume true; {183519#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:24,977 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183519#(<= ~counter~0 10)} {183519#(<= ~counter~0 10)} #98#return; {183519#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:24,977 INFO L290 TraceCheckUtils]: 96: Hoare triple {183519#(<= ~counter~0 10)} assume !(~r~0 < 0); {183519#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:24,979 INFO L290 TraceCheckUtils]: 97: Hoare triple {183519#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183544#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:24,979 INFO L290 TraceCheckUtils]: 98: Hoare triple {183544#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {183544#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:24,979 INFO L272 TraceCheckUtils]: 99: Hoare triple {183544#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183544#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:24,980 INFO L290 TraceCheckUtils]: 100: Hoare triple {183544#(<= ~counter~0 11)} ~cond := #in~cond; {183544#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:24,980 INFO L290 TraceCheckUtils]: 101: Hoare triple {183544#(<= ~counter~0 11)} assume !(0 == ~cond); {183544#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:24,980 INFO L290 TraceCheckUtils]: 102: Hoare triple {183544#(<= ~counter~0 11)} assume true; {183544#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:24,981 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183544#(<= ~counter~0 11)} {183544#(<= ~counter~0 11)} #94#return; {183544#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:24,981 INFO L290 TraceCheckUtils]: 104: Hoare triple {183544#(<= ~counter~0 11)} assume !!(0 != ~r~0); {183544#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:24,982 INFO L290 TraceCheckUtils]: 105: Hoare triple {183544#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183569#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:24,983 INFO L290 TraceCheckUtils]: 106: Hoare triple {183569#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {183569#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:24,983 INFO L272 TraceCheckUtils]: 107: Hoare triple {183569#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183569#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:24,983 INFO L290 TraceCheckUtils]: 108: Hoare triple {183569#(<= ~counter~0 12)} ~cond := #in~cond; {183569#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:24,984 INFO L290 TraceCheckUtils]: 109: Hoare triple {183569#(<= ~counter~0 12)} assume !(0 == ~cond); {183569#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:24,984 INFO L290 TraceCheckUtils]: 110: Hoare triple {183569#(<= ~counter~0 12)} assume true; {183569#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:24,984 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183569#(<= ~counter~0 12)} {183569#(<= ~counter~0 12)} #96#return; {183569#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:24,985 INFO L290 TraceCheckUtils]: 112: Hoare triple {183569#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183569#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:24,986 INFO L290 TraceCheckUtils]: 113: Hoare triple {183569#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183594#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:24,986 INFO L290 TraceCheckUtils]: 114: Hoare triple {183594#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {183594#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:24,987 INFO L272 TraceCheckUtils]: 115: Hoare triple {183594#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183594#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:24,987 INFO L290 TraceCheckUtils]: 116: Hoare triple {183594#(<= ~counter~0 13)} ~cond := #in~cond; {183594#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:24,987 INFO L290 TraceCheckUtils]: 117: Hoare triple {183594#(<= ~counter~0 13)} assume !(0 == ~cond); {183594#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:24,988 INFO L290 TraceCheckUtils]: 118: Hoare triple {183594#(<= ~counter~0 13)} assume true; {183594#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:24,988 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {183594#(<= ~counter~0 13)} {183594#(<= ~counter~0 13)} #96#return; {183594#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:24,988 INFO L290 TraceCheckUtils]: 120: Hoare triple {183594#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183594#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:24,990 INFO L290 TraceCheckUtils]: 121: Hoare triple {183594#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183619#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:24,990 INFO L290 TraceCheckUtils]: 122: Hoare triple {183619#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {183619#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:24,991 INFO L272 TraceCheckUtils]: 123: Hoare triple {183619#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183619#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:24,991 INFO L290 TraceCheckUtils]: 124: Hoare triple {183619#(<= ~counter~0 14)} ~cond := #in~cond; {183619#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:24,991 INFO L290 TraceCheckUtils]: 125: Hoare triple {183619#(<= ~counter~0 14)} assume !(0 == ~cond); {183619#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:24,991 INFO L290 TraceCheckUtils]: 126: Hoare triple {183619#(<= ~counter~0 14)} assume true; {183619#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:24,992 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {183619#(<= ~counter~0 14)} {183619#(<= ~counter~0 14)} #96#return; {183619#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:24,992 INFO L290 TraceCheckUtils]: 128: Hoare triple {183619#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183619#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:24,993 INFO L290 TraceCheckUtils]: 129: Hoare triple {183619#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183644#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:24,994 INFO L290 TraceCheckUtils]: 130: Hoare triple {183644#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {183644#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:24,994 INFO L272 TraceCheckUtils]: 131: Hoare triple {183644#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183644#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:24,994 INFO L290 TraceCheckUtils]: 132: Hoare triple {183644#(<= ~counter~0 15)} ~cond := #in~cond; {183644#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:24,995 INFO L290 TraceCheckUtils]: 133: Hoare triple {183644#(<= ~counter~0 15)} assume !(0 == ~cond); {183644#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:24,995 INFO L290 TraceCheckUtils]: 134: Hoare triple {183644#(<= ~counter~0 15)} assume true; {183644#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:24,995 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {183644#(<= ~counter~0 15)} {183644#(<= ~counter~0 15)} #96#return; {183644#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:24,996 INFO L290 TraceCheckUtils]: 136: Hoare triple {183644#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183644#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:24,997 INFO L290 TraceCheckUtils]: 137: Hoare triple {183644#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183669#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:24,998 INFO L290 TraceCheckUtils]: 138: Hoare triple {183669#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {183669#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:24,998 INFO L272 TraceCheckUtils]: 139: Hoare triple {183669#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183669#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:24,998 INFO L290 TraceCheckUtils]: 140: Hoare triple {183669#(<= ~counter~0 16)} ~cond := #in~cond; {183669#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:24,999 INFO L290 TraceCheckUtils]: 141: Hoare triple {183669#(<= ~counter~0 16)} assume !(0 == ~cond); {183669#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:24,999 INFO L290 TraceCheckUtils]: 142: Hoare triple {183669#(<= ~counter~0 16)} assume true; {183669#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:24,999 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {183669#(<= ~counter~0 16)} {183669#(<= ~counter~0 16)} #96#return; {183669#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:25,000 INFO L290 TraceCheckUtils]: 144: Hoare triple {183669#(<= ~counter~0 16)} assume !(~r~0 > 0); {183669#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:25,001 INFO L290 TraceCheckUtils]: 145: Hoare triple {183669#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183694#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:25,001 INFO L290 TraceCheckUtils]: 146: Hoare triple {183694#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {183694#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:25,002 INFO L272 TraceCheckUtils]: 147: Hoare triple {183694#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183694#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:25,002 INFO L290 TraceCheckUtils]: 148: Hoare triple {183694#(<= ~counter~0 17)} ~cond := #in~cond; {183694#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:25,002 INFO L290 TraceCheckUtils]: 149: Hoare triple {183694#(<= ~counter~0 17)} assume !(0 == ~cond); {183694#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:25,003 INFO L290 TraceCheckUtils]: 150: Hoare triple {183694#(<= ~counter~0 17)} assume true; {183694#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:25,003 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {183694#(<= ~counter~0 17)} {183694#(<= ~counter~0 17)} #98#return; {183694#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:25,003 INFO L290 TraceCheckUtils]: 152: Hoare triple {183694#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183694#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:25,005 INFO L290 TraceCheckUtils]: 153: Hoare triple {183694#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183719#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:25,005 INFO L290 TraceCheckUtils]: 154: Hoare triple {183719#(<= ~counter~0 18)} assume !!(#t~post8 < 100);havoc #t~post8; {183719#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:25,006 INFO L272 TraceCheckUtils]: 155: Hoare triple {183719#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183719#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:25,006 INFO L290 TraceCheckUtils]: 156: Hoare triple {183719#(<= ~counter~0 18)} ~cond := #in~cond; {183719#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:25,006 INFO L290 TraceCheckUtils]: 157: Hoare triple {183719#(<= ~counter~0 18)} assume !(0 == ~cond); {183719#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:25,006 INFO L290 TraceCheckUtils]: 158: Hoare triple {183719#(<= ~counter~0 18)} assume true; {183719#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:25,007 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {183719#(<= ~counter~0 18)} {183719#(<= ~counter~0 18)} #98#return; {183719#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:25,007 INFO L290 TraceCheckUtils]: 160: Hoare triple {183719#(<= ~counter~0 18)} assume !(~r~0 < 0); {183719#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:25,007 INFO L290 TraceCheckUtils]: 161: Hoare triple {183719#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183744#(<= |main_#t~post6| 18)} is VALID [2022-04-08 12:47:25,008 INFO L290 TraceCheckUtils]: 162: Hoare triple {183744#(<= |main_#t~post6| 18)} assume !(#t~post6 < 100);havoc #t~post6; {183238#false} is VALID [2022-04-08 12:47:25,008 INFO L272 TraceCheckUtils]: 163: Hoare triple {183238#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183238#false} is VALID [2022-04-08 12:47:25,008 INFO L290 TraceCheckUtils]: 164: Hoare triple {183238#false} ~cond := #in~cond; {183238#false} is VALID [2022-04-08 12:47:25,008 INFO L290 TraceCheckUtils]: 165: Hoare triple {183238#false} assume 0 == ~cond; {183238#false} is VALID [2022-04-08 12:47:25,008 INFO L290 TraceCheckUtils]: 166: Hoare triple {183238#false} assume !false; {183238#false} is VALID [2022-04-08 12:47:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 36 proven. 834 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:47:25,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:47:26,078 INFO L290 TraceCheckUtils]: 166: Hoare triple {183238#false} assume !false; {183238#false} is VALID [2022-04-08 12:47:26,078 INFO L290 TraceCheckUtils]: 165: Hoare triple {183238#false} assume 0 == ~cond; {183238#false} is VALID [2022-04-08 12:47:26,078 INFO L290 TraceCheckUtils]: 164: Hoare triple {183238#false} ~cond := #in~cond; {183238#false} is VALID [2022-04-08 12:47:26,079 INFO L272 TraceCheckUtils]: 163: Hoare triple {183238#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183238#false} is VALID [2022-04-08 12:47:26,079 INFO L290 TraceCheckUtils]: 162: Hoare triple {183772#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {183238#false} is VALID [2022-04-08 12:47:26,079 INFO L290 TraceCheckUtils]: 161: Hoare triple {183776#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183772#(< |main_#t~post6| 100)} is VALID [2022-04-08 12:47:26,079 INFO L290 TraceCheckUtils]: 160: Hoare triple {183776#(< ~counter~0 100)} assume !(~r~0 < 0); {183776#(< ~counter~0 100)} is VALID [2022-04-08 12:47:26,080 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {183237#true} {183776#(< ~counter~0 100)} #98#return; {183776#(< ~counter~0 100)} is VALID [2022-04-08 12:47:26,080 INFO L290 TraceCheckUtils]: 158: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,080 INFO L290 TraceCheckUtils]: 157: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,080 INFO L290 TraceCheckUtils]: 156: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,080 INFO L272 TraceCheckUtils]: 155: Hoare triple {183776#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,080 INFO L290 TraceCheckUtils]: 154: Hoare triple {183776#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {183776#(< ~counter~0 100)} is VALID [2022-04-08 12:47:26,084 INFO L290 TraceCheckUtils]: 153: Hoare triple {183801#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183776#(< ~counter~0 100)} is VALID [2022-04-08 12:47:26,084 INFO L290 TraceCheckUtils]: 152: Hoare triple {183801#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183801#(< ~counter~0 99)} is VALID [2022-04-08 12:47:26,085 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {183237#true} {183801#(< ~counter~0 99)} #98#return; {183801#(< ~counter~0 99)} is VALID [2022-04-08 12:47:26,085 INFO L290 TraceCheckUtils]: 150: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,085 INFO L290 TraceCheckUtils]: 149: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,085 INFO L290 TraceCheckUtils]: 148: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,085 INFO L272 TraceCheckUtils]: 147: Hoare triple {183801#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,085 INFO L290 TraceCheckUtils]: 146: Hoare triple {183801#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {183801#(< ~counter~0 99)} is VALID [2022-04-08 12:47:26,087 INFO L290 TraceCheckUtils]: 145: Hoare triple {183826#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183801#(< ~counter~0 99)} is VALID [2022-04-08 12:47:26,087 INFO L290 TraceCheckUtils]: 144: Hoare triple {183826#(< ~counter~0 98)} assume !(~r~0 > 0); {183826#(< ~counter~0 98)} is VALID [2022-04-08 12:47:26,087 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {183237#true} {183826#(< ~counter~0 98)} #96#return; {183826#(< ~counter~0 98)} is VALID [2022-04-08 12:47:26,087 INFO L290 TraceCheckUtils]: 142: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,087 INFO L290 TraceCheckUtils]: 141: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,088 INFO L290 TraceCheckUtils]: 140: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,088 INFO L272 TraceCheckUtils]: 139: Hoare triple {183826#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,088 INFO L290 TraceCheckUtils]: 138: Hoare triple {183826#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {183826#(< ~counter~0 98)} is VALID [2022-04-08 12:47:26,089 INFO L290 TraceCheckUtils]: 137: Hoare triple {183851#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183826#(< ~counter~0 98)} is VALID [2022-04-08 12:47:26,089 INFO L290 TraceCheckUtils]: 136: Hoare triple {183851#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183851#(< ~counter~0 97)} is VALID [2022-04-08 12:47:26,090 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {183237#true} {183851#(< ~counter~0 97)} #96#return; {183851#(< ~counter~0 97)} is VALID [2022-04-08 12:47:26,090 INFO L290 TraceCheckUtils]: 134: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,090 INFO L290 TraceCheckUtils]: 133: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,090 INFO L290 TraceCheckUtils]: 132: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,090 INFO L272 TraceCheckUtils]: 131: Hoare triple {183851#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,090 INFO L290 TraceCheckUtils]: 130: Hoare triple {183851#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {183851#(< ~counter~0 97)} is VALID [2022-04-08 12:47:26,092 INFO L290 TraceCheckUtils]: 129: Hoare triple {183876#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183851#(< ~counter~0 97)} is VALID [2022-04-08 12:47:26,092 INFO L290 TraceCheckUtils]: 128: Hoare triple {183876#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183876#(< ~counter~0 96)} is VALID [2022-04-08 12:47:26,093 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {183237#true} {183876#(< ~counter~0 96)} #96#return; {183876#(< ~counter~0 96)} is VALID [2022-04-08 12:47:26,093 INFO L290 TraceCheckUtils]: 126: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,093 INFO L290 TraceCheckUtils]: 125: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,093 INFO L290 TraceCheckUtils]: 124: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,093 INFO L272 TraceCheckUtils]: 123: Hoare triple {183876#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,093 INFO L290 TraceCheckUtils]: 122: Hoare triple {183876#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {183876#(< ~counter~0 96)} is VALID [2022-04-08 12:47:26,094 INFO L290 TraceCheckUtils]: 121: Hoare triple {183901#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183876#(< ~counter~0 96)} is VALID [2022-04-08 12:47:26,095 INFO L290 TraceCheckUtils]: 120: Hoare triple {183901#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183901#(< ~counter~0 95)} is VALID [2022-04-08 12:47:26,095 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {183237#true} {183901#(< ~counter~0 95)} #96#return; {183901#(< ~counter~0 95)} is VALID [2022-04-08 12:47:26,095 INFO L290 TraceCheckUtils]: 118: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,095 INFO L290 TraceCheckUtils]: 117: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,095 INFO L290 TraceCheckUtils]: 116: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,095 INFO L272 TraceCheckUtils]: 115: Hoare triple {183901#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,096 INFO L290 TraceCheckUtils]: 114: Hoare triple {183901#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {183901#(< ~counter~0 95)} is VALID [2022-04-08 12:47:26,097 INFO L290 TraceCheckUtils]: 113: Hoare triple {183926#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183901#(< ~counter~0 95)} is VALID [2022-04-08 12:47:26,098 INFO L290 TraceCheckUtils]: 112: Hoare triple {183926#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183926#(< ~counter~0 94)} is VALID [2022-04-08 12:47:26,098 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183237#true} {183926#(< ~counter~0 94)} #96#return; {183926#(< ~counter~0 94)} is VALID [2022-04-08 12:47:26,098 INFO L290 TraceCheckUtils]: 110: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,098 INFO L290 TraceCheckUtils]: 109: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,098 INFO L290 TraceCheckUtils]: 108: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,098 INFO L272 TraceCheckUtils]: 107: Hoare triple {183926#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,099 INFO L290 TraceCheckUtils]: 106: Hoare triple {183926#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {183926#(< ~counter~0 94)} is VALID [2022-04-08 12:47:26,100 INFO L290 TraceCheckUtils]: 105: Hoare triple {183951#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183926#(< ~counter~0 94)} is VALID [2022-04-08 12:47:26,101 INFO L290 TraceCheckUtils]: 104: Hoare triple {183951#(< ~counter~0 93)} assume !!(0 != ~r~0); {183951#(< ~counter~0 93)} is VALID [2022-04-08 12:47:26,101 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183237#true} {183951#(< ~counter~0 93)} #94#return; {183951#(< ~counter~0 93)} is VALID [2022-04-08 12:47:26,101 INFO L290 TraceCheckUtils]: 102: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,101 INFO L290 TraceCheckUtils]: 101: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,101 INFO L290 TraceCheckUtils]: 100: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,101 INFO L272 TraceCheckUtils]: 99: Hoare triple {183951#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,101 INFO L290 TraceCheckUtils]: 98: Hoare triple {183951#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {183951#(< ~counter~0 93)} is VALID [2022-04-08 12:47:26,103 INFO L290 TraceCheckUtils]: 97: Hoare triple {183976#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183951#(< ~counter~0 93)} is VALID [2022-04-08 12:47:26,103 INFO L290 TraceCheckUtils]: 96: Hoare triple {183976#(< ~counter~0 92)} assume !(~r~0 < 0); {183976#(< ~counter~0 92)} is VALID [2022-04-08 12:47:26,104 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183237#true} {183976#(< ~counter~0 92)} #98#return; {183976#(< ~counter~0 92)} is VALID [2022-04-08 12:47:26,104 INFO L290 TraceCheckUtils]: 94: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,104 INFO L290 TraceCheckUtils]: 93: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,104 INFO L290 TraceCheckUtils]: 92: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,104 INFO L272 TraceCheckUtils]: 91: Hoare triple {183976#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,104 INFO L290 TraceCheckUtils]: 90: Hoare triple {183976#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {183976#(< ~counter~0 92)} is VALID [2022-04-08 12:47:26,106 INFO L290 TraceCheckUtils]: 89: Hoare triple {184001#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183976#(< ~counter~0 92)} is VALID [2022-04-08 12:47:26,106 INFO L290 TraceCheckUtils]: 88: Hoare triple {184001#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184001#(< ~counter~0 91)} is VALID [2022-04-08 12:47:26,106 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183237#true} {184001#(< ~counter~0 91)} #98#return; {184001#(< ~counter~0 91)} is VALID [2022-04-08 12:47:26,106 INFO L290 TraceCheckUtils]: 86: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,106 INFO L290 TraceCheckUtils]: 85: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,106 INFO L290 TraceCheckUtils]: 84: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,106 INFO L272 TraceCheckUtils]: 83: Hoare triple {184001#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,107 INFO L290 TraceCheckUtils]: 82: Hoare triple {184001#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {184001#(< ~counter~0 91)} is VALID [2022-04-08 12:47:26,108 INFO L290 TraceCheckUtils]: 81: Hoare triple {184026#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184001#(< ~counter~0 91)} is VALID [2022-04-08 12:47:26,108 INFO L290 TraceCheckUtils]: 80: Hoare triple {184026#(< ~counter~0 90)} assume !(~r~0 > 0); {184026#(< ~counter~0 90)} is VALID [2022-04-08 12:47:26,109 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183237#true} {184026#(< ~counter~0 90)} #96#return; {184026#(< ~counter~0 90)} is VALID [2022-04-08 12:47:26,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,109 INFO L290 TraceCheckUtils]: 77: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,109 INFO L290 TraceCheckUtils]: 76: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,109 INFO L272 TraceCheckUtils]: 75: Hoare triple {184026#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {184026#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {184026#(< ~counter~0 90)} is VALID [2022-04-08 12:47:26,111 INFO L290 TraceCheckUtils]: 73: Hoare triple {184051#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184026#(< ~counter~0 90)} is VALID [2022-04-08 12:47:26,111 INFO L290 TraceCheckUtils]: 72: Hoare triple {184051#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184051#(< ~counter~0 89)} is VALID [2022-04-08 12:47:26,111 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183237#true} {184051#(< ~counter~0 89)} #96#return; {184051#(< ~counter~0 89)} is VALID [2022-04-08 12:47:26,112 INFO L290 TraceCheckUtils]: 70: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,112 INFO L290 TraceCheckUtils]: 69: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,112 INFO L272 TraceCheckUtils]: 67: Hoare triple {184051#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {184051#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {184051#(< ~counter~0 89)} is VALID [2022-04-08 12:47:26,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {184076#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184051#(< ~counter~0 89)} is VALID [2022-04-08 12:47:26,114 INFO L290 TraceCheckUtils]: 64: Hoare triple {184076#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184076#(< ~counter~0 88)} is VALID [2022-04-08 12:47:26,114 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183237#true} {184076#(< ~counter~0 88)} #96#return; {184076#(< ~counter~0 88)} is VALID [2022-04-08 12:47:26,114 INFO L290 TraceCheckUtils]: 62: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,114 INFO L290 TraceCheckUtils]: 60: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,114 INFO L272 TraceCheckUtils]: 59: Hoare triple {184076#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {184076#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {184076#(< ~counter~0 88)} is VALID [2022-04-08 12:47:26,116 INFO L290 TraceCheckUtils]: 57: Hoare triple {184101#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184076#(< ~counter~0 88)} is VALID [2022-04-08 12:47:26,116 INFO L290 TraceCheckUtils]: 56: Hoare triple {184101#(< ~counter~0 87)} assume !!(0 != ~r~0); {184101#(< ~counter~0 87)} is VALID [2022-04-08 12:47:26,117 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183237#true} {184101#(< ~counter~0 87)} #94#return; {184101#(< ~counter~0 87)} is VALID [2022-04-08 12:47:26,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,117 INFO L290 TraceCheckUtils]: 53: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,117 INFO L290 TraceCheckUtils]: 52: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,117 INFO L272 TraceCheckUtils]: 51: Hoare triple {184101#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {184101#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {184101#(< ~counter~0 87)} is VALID [2022-04-08 12:47:26,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {184126#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184101#(< ~counter~0 87)} is VALID [2022-04-08 12:47:26,119 INFO L290 TraceCheckUtils]: 48: Hoare triple {184126#(< ~counter~0 86)} assume !(~r~0 < 0); {184126#(< ~counter~0 86)} is VALID [2022-04-08 12:47:26,120 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183237#true} {184126#(< ~counter~0 86)} #98#return; {184126#(< ~counter~0 86)} is VALID [2022-04-08 12:47:26,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,120 INFO L272 TraceCheckUtils]: 43: Hoare triple {184126#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {184126#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {184126#(< ~counter~0 86)} is VALID [2022-04-08 12:47:26,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {184151#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184126#(< ~counter~0 86)} is VALID [2022-04-08 12:47:26,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {184151#(< ~counter~0 85)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184151#(< ~counter~0 85)} is VALID [2022-04-08 12:47:26,122 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183237#true} {184151#(< ~counter~0 85)} #98#return; {184151#(< ~counter~0 85)} is VALID [2022-04-08 12:47:26,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,123 INFO L272 TraceCheckUtils]: 35: Hoare triple {184151#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {184151#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {184151#(< ~counter~0 85)} is VALID [2022-04-08 12:47:26,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {184176#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184151#(< ~counter~0 85)} is VALID [2022-04-08 12:47:26,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {184176#(< ~counter~0 84)} assume !(~r~0 > 0); {184176#(< ~counter~0 84)} is VALID [2022-04-08 12:47:26,125 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183237#true} {184176#(< ~counter~0 84)} #96#return; {184176#(< ~counter~0 84)} is VALID [2022-04-08 12:47:26,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,125 INFO L272 TraceCheckUtils]: 27: Hoare triple {184176#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {184176#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {184176#(< ~counter~0 84)} is VALID [2022-04-08 12:47:26,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {184201#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184176#(< ~counter~0 84)} is VALID [2022-04-08 12:47:26,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {184201#(< ~counter~0 83)} assume !!(0 != ~r~0); {184201#(< ~counter~0 83)} is VALID [2022-04-08 12:47:26,128 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183237#true} {184201#(< ~counter~0 83)} #94#return; {184201#(< ~counter~0 83)} is VALID [2022-04-08 12:47:26,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,128 INFO L272 TraceCheckUtils]: 19: Hoare triple {184201#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {184201#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {184201#(< ~counter~0 83)} is VALID [2022-04-08 12:47:26,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {184226#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184201#(< ~counter~0 83)} is VALID [2022-04-08 12:47:26,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {184226#(< ~counter~0 82)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {184226#(< ~counter~0 82)} is VALID [2022-04-08 12:47:26,130 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183237#true} {184226#(< ~counter~0 82)} #92#return; {184226#(< ~counter~0 82)} is VALID [2022-04-08 12:47:26,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,130 INFO L272 TraceCheckUtils]: 11: Hoare triple {184226#(< ~counter~0 82)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183237#true} {184226#(< ~counter~0 82)} #90#return; {184226#(< ~counter~0 82)} is VALID [2022-04-08 12:47:26,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 12:47:26,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 12:47:26,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 12:47:26,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {184226#(< ~counter~0 82)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 12:47:26,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {184226#(< ~counter~0 82)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {184226#(< ~counter~0 82)} is VALID [2022-04-08 12:47:26,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {184226#(< ~counter~0 82)} call #t~ret9 := main(); {184226#(< ~counter~0 82)} is VALID [2022-04-08 12:47:26,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {184226#(< ~counter~0 82)} {183237#true} #102#return; {184226#(< ~counter~0 82)} is VALID [2022-04-08 12:47:26,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {184226#(< ~counter~0 82)} assume true; {184226#(< ~counter~0 82)} is VALID [2022-04-08 12:47:26,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {183237#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {184226#(< ~counter~0 82)} is VALID [2022-04-08 12:47:26,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {183237#true} call ULTIMATE.init(); {183237#true} is VALID [2022-04-08 12:47:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 36 proven. 222 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-08 12:47:26,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:47:26,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763930283] [2022-04-08 12:47:26,133 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:47:26,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210946910] [2022-04-08 12:47:26,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210946910] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:47:26,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:47:26,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-08 12:47:26,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:47:26,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2031781233] [2022-04-08 12:47:26,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2031781233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:47:26,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:47:26,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 12:47:26,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090727288] [2022-04-08 12:47:26,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:47:26,135 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 167 [2022-04-08 12:47:26,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:47:26,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 12:47:26,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:26,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 12:47:26,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:47:26,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 12:47:26,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 12:47:26,442 INFO L87 Difference]: Start difference. First operand 907 states and 1204 transitions. Second operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 12:47:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:32,745 INFO L93 Difference]: Finished difference Result 958 states and 1274 transitions. [2022-04-08 12:47:32,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 12:47:32,745 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 167 [2022-04-08 12:47:32,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:47:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 12:47:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-08 12:47:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 12:47:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-08 12:47:32,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 374 transitions. [2022-04-08 12:47:33,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:33,312 INFO L225 Difference]: With dead ends: 958 [2022-04-08 12:47:33,312 INFO L226 Difference]: Without dead ends: 953 [2022-04-08 12:47:33,313 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1358, Invalid=1834, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 12:47:33,313 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 269 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 12:47:33,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 413 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 12:47:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-04-08 12:47:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 931. [2022-04-08 12:47:37,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:47:37,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 12:47:37,125 INFO L74 IsIncluded]: Start isIncluded. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 12:47:37,125 INFO L87 Difference]: Start difference. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 12:47:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:37,153 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-08 12:47:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-08 12:47:37,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:47:37,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:47:37,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) Second operand 953 states. [2022-04-08 12:47:37,156 INFO L87 Difference]: Start difference. First operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) Second operand 953 states. [2022-04-08 12:47:37,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:37,185 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-08 12:47:37,185 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-08 12:47:37,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:47:37,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:47:37,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:47:37,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:47:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 12:47:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1242 transitions. [2022-04-08 12:47:37,223 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1242 transitions. Word has length 167 [2022-04-08 12:47:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:47:37,223 INFO L478 AbstractCegarLoop]: Abstraction has 931 states and 1242 transitions. [2022-04-08 12:47:37,223 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 12:47:37,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 931 states and 1242 transitions. [2022-04-08 12:47:53,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1242 edges. 1239 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1242 transitions. [2022-04-08 12:47:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-08 12:47:53,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:47:53,747 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 10, 10, 10, 10, 7, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:47:53,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-08 12:47:53,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-04-08 12:47:53,947 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:47:53,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:47:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 31 times [2022-04-08 12:47:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:47:53,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [676777610] [2022-04-08 12:47:53,948 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:47:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 32 times [2022-04-08 12:47:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:47:53,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398658073] [2022-04-08 12:47:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:47:53,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:47:53,963 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:47:53,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1278066498] [2022-04-08 12:47:53,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:47:53,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:47:53,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:47:53,964 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:47:53,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-08 12:47:54,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:47:54,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:47:54,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 12:47:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:47:54,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:47:55,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {189994#true} call ULTIMATE.init(); {189994#true} is VALID [2022-04-08 12:47:55,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {189994#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {190002#(<= ~counter~0 0)} assume true; {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190002#(<= ~counter~0 0)} {189994#true} #102#return; {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {190002#(<= ~counter~0 0)} call #t~ret9 := main(); {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {190002#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,056 INFO L272 TraceCheckUtils]: 6: Hoare triple {190002#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {190002#(<= ~counter~0 0)} ~cond := #in~cond; {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {190002#(<= ~counter~0 0)} assume !(0 == ~cond); {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {190002#(<= ~counter~0 0)} assume true; {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,057 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {190002#(<= ~counter~0 0)} {190002#(<= ~counter~0 0)} #90#return; {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,058 INFO L272 TraceCheckUtils]: 11: Hoare triple {190002#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {190002#(<= ~counter~0 0)} ~cond := #in~cond; {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {190002#(<= ~counter~0 0)} assume !(0 == ~cond); {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {190002#(<= ~counter~0 0)} assume true; {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,059 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {190002#(<= ~counter~0 0)} {190002#(<= ~counter~0 0)} #92#return; {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {190002#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {190002#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {190002#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190051#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {190051#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {190051#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,065 INFO L272 TraceCheckUtils]: 19: Hoare triple {190051#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190051#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {190051#(<= ~counter~0 1)} ~cond := #in~cond; {190051#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {190051#(<= ~counter~0 1)} assume !(0 == ~cond); {190051#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {190051#(<= ~counter~0 1)} assume true; {190051#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,066 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {190051#(<= ~counter~0 1)} {190051#(<= ~counter~0 1)} #94#return; {190051#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {190051#(<= ~counter~0 1)} assume !!(0 != ~r~0); {190051#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {190051#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190076#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {190076#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {190076#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,071 INFO L272 TraceCheckUtils]: 27: Hoare triple {190076#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190076#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {190076#(<= ~counter~0 2)} ~cond := #in~cond; {190076#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {190076#(<= ~counter~0 2)} assume !(0 == ~cond); {190076#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {190076#(<= ~counter~0 2)} assume true; {190076#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,072 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {190076#(<= ~counter~0 2)} {190076#(<= ~counter~0 2)} #96#return; {190076#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {190076#(<= ~counter~0 2)} assume !(~r~0 > 0); {190076#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {190076#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190101#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:55,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {190101#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {190101#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:55,078 INFO L272 TraceCheckUtils]: 35: Hoare triple {190101#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190101#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:55,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {190101#(<= ~counter~0 3)} ~cond := #in~cond; {190101#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:55,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {190101#(<= ~counter~0 3)} assume !(0 == ~cond); {190101#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:55,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {190101#(<= ~counter~0 3)} assume true; {190101#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:55,079 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {190101#(<= ~counter~0 3)} {190101#(<= ~counter~0 3)} #98#return; {190101#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:55,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {190101#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190101#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:55,082 INFO L290 TraceCheckUtils]: 41: Hoare triple {190101#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190126#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,082 INFO L290 TraceCheckUtils]: 42: Hoare triple {190126#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {190126#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,083 INFO L272 TraceCheckUtils]: 43: Hoare triple {190126#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190126#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,083 INFO L290 TraceCheckUtils]: 44: Hoare triple {190126#(<= ~counter~0 4)} ~cond := #in~cond; {190126#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,083 INFO L290 TraceCheckUtils]: 45: Hoare triple {190126#(<= ~counter~0 4)} assume !(0 == ~cond); {190126#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,084 INFO L290 TraceCheckUtils]: 46: Hoare triple {190126#(<= ~counter~0 4)} assume true; {190126#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,084 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {190126#(<= ~counter~0 4)} {190126#(<= ~counter~0 4)} #98#return; {190126#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {190126#(<= ~counter~0 4)} assume !(~r~0 < 0); {190126#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,087 INFO L290 TraceCheckUtils]: 49: Hoare triple {190126#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190151#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,088 INFO L290 TraceCheckUtils]: 50: Hoare triple {190151#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {190151#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,088 INFO L272 TraceCheckUtils]: 51: Hoare triple {190151#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190151#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,089 INFO L290 TraceCheckUtils]: 52: Hoare triple {190151#(<= ~counter~0 5)} ~cond := #in~cond; {190151#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {190151#(<= ~counter~0 5)} assume !(0 == ~cond); {190151#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {190151#(<= ~counter~0 5)} assume true; {190151#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,090 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {190151#(<= ~counter~0 5)} {190151#(<= ~counter~0 5)} #94#return; {190151#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,090 INFO L290 TraceCheckUtils]: 56: Hoare triple {190151#(<= ~counter~0 5)} assume !!(0 != ~r~0); {190151#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {190151#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190176#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:55,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {190176#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {190176#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:55,095 INFO L272 TraceCheckUtils]: 59: Hoare triple {190176#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190176#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:55,095 INFO L290 TraceCheckUtils]: 60: Hoare triple {190176#(<= ~counter~0 6)} ~cond := #in~cond; {190176#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:55,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {190176#(<= ~counter~0 6)} assume !(0 == ~cond); {190176#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:55,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {190176#(<= ~counter~0 6)} assume true; {190176#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:55,096 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {190176#(<= ~counter~0 6)} {190176#(<= ~counter~0 6)} #96#return; {190176#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:55,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {190176#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190176#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:55,099 INFO L290 TraceCheckUtils]: 65: Hoare triple {190176#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190201#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:55,100 INFO L290 TraceCheckUtils]: 66: Hoare triple {190201#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {190201#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:55,100 INFO L272 TraceCheckUtils]: 67: Hoare triple {190201#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190201#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:55,101 INFO L290 TraceCheckUtils]: 68: Hoare triple {190201#(<= ~counter~0 7)} ~cond := #in~cond; {190201#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:55,101 INFO L290 TraceCheckUtils]: 69: Hoare triple {190201#(<= ~counter~0 7)} assume !(0 == ~cond); {190201#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:55,101 INFO L290 TraceCheckUtils]: 70: Hoare triple {190201#(<= ~counter~0 7)} assume true; {190201#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:55,102 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {190201#(<= ~counter~0 7)} {190201#(<= ~counter~0 7)} #96#return; {190201#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:55,102 INFO L290 TraceCheckUtils]: 72: Hoare triple {190201#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190201#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:55,106 INFO L290 TraceCheckUtils]: 73: Hoare triple {190201#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190226#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,106 INFO L290 TraceCheckUtils]: 74: Hoare triple {190226#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {190226#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,106 INFO L272 TraceCheckUtils]: 75: Hoare triple {190226#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190226#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,107 INFO L290 TraceCheckUtils]: 76: Hoare triple {190226#(<= ~counter~0 8)} ~cond := #in~cond; {190226#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,107 INFO L290 TraceCheckUtils]: 77: Hoare triple {190226#(<= ~counter~0 8)} assume !(0 == ~cond); {190226#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,107 INFO L290 TraceCheckUtils]: 78: Hoare triple {190226#(<= ~counter~0 8)} assume true; {190226#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,108 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {190226#(<= ~counter~0 8)} {190226#(<= ~counter~0 8)} #96#return; {190226#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,108 INFO L290 TraceCheckUtils]: 80: Hoare triple {190226#(<= ~counter~0 8)} assume !(~r~0 > 0); {190226#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,111 INFO L290 TraceCheckUtils]: 81: Hoare triple {190226#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190251#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:55,112 INFO L290 TraceCheckUtils]: 82: Hoare triple {190251#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {190251#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:55,112 INFO L272 TraceCheckUtils]: 83: Hoare triple {190251#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190251#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:55,113 INFO L290 TraceCheckUtils]: 84: Hoare triple {190251#(<= ~counter~0 9)} ~cond := #in~cond; {190251#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:55,113 INFO L290 TraceCheckUtils]: 85: Hoare triple {190251#(<= ~counter~0 9)} assume !(0 == ~cond); {190251#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:55,113 INFO L290 TraceCheckUtils]: 86: Hoare triple {190251#(<= ~counter~0 9)} assume true; {190251#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:55,114 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {190251#(<= ~counter~0 9)} {190251#(<= ~counter~0 9)} #98#return; {190251#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:55,114 INFO L290 TraceCheckUtils]: 88: Hoare triple {190251#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190251#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:55,116 INFO L290 TraceCheckUtils]: 89: Hoare triple {190251#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190276#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,117 INFO L290 TraceCheckUtils]: 90: Hoare triple {190276#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {190276#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,117 INFO L272 TraceCheckUtils]: 91: Hoare triple {190276#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190276#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {190276#(<= ~counter~0 10)} ~cond := #in~cond; {190276#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,118 INFO L290 TraceCheckUtils]: 93: Hoare triple {190276#(<= ~counter~0 10)} assume !(0 == ~cond); {190276#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,118 INFO L290 TraceCheckUtils]: 94: Hoare triple {190276#(<= ~counter~0 10)} assume true; {190276#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,118 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {190276#(<= ~counter~0 10)} {190276#(<= ~counter~0 10)} #98#return; {190276#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,119 INFO L290 TraceCheckUtils]: 96: Hoare triple {190276#(<= ~counter~0 10)} assume !(~r~0 < 0); {190276#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,122 INFO L290 TraceCheckUtils]: 97: Hoare triple {190276#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190301#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,122 INFO L290 TraceCheckUtils]: 98: Hoare triple {190301#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {190301#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,123 INFO L272 TraceCheckUtils]: 99: Hoare triple {190301#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190301#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,123 INFO L290 TraceCheckUtils]: 100: Hoare triple {190301#(<= ~counter~0 11)} ~cond := #in~cond; {190301#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,124 INFO L290 TraceCheckUtils]: 101: Hoare triple {190301#(<= ~counter~0 11)} assume !(0 == ~cond); {190301#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,124 INFO L290 TraceCheckUtils]: 102: Hoare triple {190301#(<= ~counter~0 11)} assume true; {190301#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,124 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {190301#(<= ~counter~0 11)} {190301#(<= ~counter~0 11)} #94#return; {190301#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,125 INFO L290 TraceCheckUtils]: 104: Hoare triple {190301#(<= ~counter~0 11)} assume !!(0 != ~r~0); {190301#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,128 INFO L290 TraceCheckUtils]: 105: Hoare triple {190301#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190326#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:55,129 INFO L290 TraceCheckUtils]: 106: Hoare triple {190326#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {190326#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:55,129 INFO L272 TraceCheckUtils]: 107: Hoare triple {190326#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190326#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:55,130 INFO L290 TraceCheckUtils]: 108: Hoare triple {190326#(<= ~counter~0 12)} ~cond := #in~cond; {190326#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:55,130 INFO L290 TraceCheckUtils]: 109: Hoare triple {190326#(<= ~counter~0 12)} assume !(0 == ~cond); {190326#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:55,130 INFO L290 TraceCheckUtils]: 110: Hoare triple {190326#(<= ~counter~0 12)} assume true; {190326#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:55,131 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {190326#(<= ~counter~0 12)} {190326#(<= ~counter~0 12)} #96#return; {190326#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:55,131 INFO L290 TraceCheckUtils]: 112: Hoare triple {190326#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190326#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:55,134 INFO L290 TraceCheckUtils]: 113: Hoare triple {190326#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190351#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:55,134 INFO L290 TraceCheckUtils]: 114: Hoare triple {190351#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {190351#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:55,135 INFO L272 TraceCheckUtils]: 115: Hoare triple {190351#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190351#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:55,135 INFO L290 TraceCheckUtils]: 116: Hoare triple {190351#(<= ~counter~0 13)} ~cond := #in~cond; {190351#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:55,135 INFO L290 TraceCheckUtils]: 117: Hoare triple {190351#(<= ~counter~0 13)} assume !(0 == ~cond); {190351#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:55,135 INFO L290 TraceCheckUtils]: 118: Hoare triple {190351#(<= ~counter~0 13)} assume true; {190351#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:55,136 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {190351#(<= ~counter~0 13)} {190351#(<= ~counter~0 13)} #96#return; {190351#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:55,136 INFO L290 TraceCheckUtils]: 120: Hoare triple {190351#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190351#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:55,140 INFO L290 TraceCheckUtils]: 121: Hoare triple {190351#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190376#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:55,140 INFO L290 TraceCheckUtils]: 122: Hoare triple {190376#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {190376#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:55,141 INFO L272 TraceCheckUtils]: 123: Hoare triple {190376#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190376#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:55,141 INFO L290 TraceCheckUtils]: 124: Hoare triple {190376#(<= ~counter~0 14)} ~cond := #in~cond; {190376#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:55,141 INFO L290 TraceCheckUtils]: 125: Hoare triple {190376#(<= ~counter~0 14)} assume !(0 == ~cond); {190376#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:55,142 INFO L290 TraceCheckUtils]: 126: Hoare triple {190376#(<= ~counter~0 14)} assume true; {190376#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:55,142 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {190376#(<= ~counter~0 14)} {190376#(<= ~counter~0 14)} #96#return; {190376#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:55,142 INFO L290 TraceCheckUtils]: 128: Hoare triple {190376#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190376#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:55,146 INFO L290 TraceCheckUtils]: 129: Hoare triple {190376#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190401#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:55,146 INFO L290 TraceCheckUtils]: 130: Hoare triple {190401#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {190401#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:55,147 INFO L272 TraceCheckUtils]: 131: Hoare triple {190401#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190401#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:55,147 INFO L290 TraceCheckUtils]: 132: Hoare triple {190401#(<= ~counter~0 15)} ~cond := #in~cond; {190401#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:55,147 INFO L290 TraceCheckUtils]: 133: Hoare triple {190401#(<= ~counter~0 15)} assume !(0 == ~cond); {190401#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:55,148 INFO L290 TraceCheckUtils]: 134: Hoare triple {190401#(<= ~counter~0 15)} assume true; {190401#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:55,148 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {190401#(<= ~counter~0 15)} {190401#(<= ~counter~0 15)} #96#return; {190401#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:55,148 INFO L290 TraceCheckUtils]: 136: Hoare triple {190401#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190401#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:55,152 INFO L290 TraceCheckUtils]: 137: Hoare triple {190401#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190426#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:55,152 INFO L290 TraceCheckUtils]: 138: Hoare triple {190426#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {190426#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:55,153 INFO L272 TraceCheckUtils]: 139: Hoare triple {190426#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190426#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:55,153 INFO L290 TraceCheckUtils]: 140: Hoare triple {190426#(<= ~counter~0 16)} ~cond := #in~cond; {190426#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:55,154 INFO L290 TraceCheckUtils]: 141: Hoare triple {190426#(<= ~counter~0 16)} assume !(0 == ~cond); {190426#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:55,154 INFO L290 TraceCheckUtils]: 142: Hoare triple {190426#(<= ~counter~0 16)} assume true; {190426#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:55,154 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {190426#(<= ~counter~0 16)} {190426#(<= ~counter~0 16)} #96#return; {190426#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:55,155 INFO L290 TraceCheckUtils]: 144: Hoare triple {190426#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190426#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:55,158 INFO L290 TraceCheckUtils]: 145: Hoare triple {190426#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190451#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,158 INFO L290 TraceCheckUtils]: 146: Hoare triple {190451#(<= ~counter~0 17)} assume !!(#t~post7 < 100);havoc #t~post7; {190451#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,159 INFO L272 TraceCheckUtils]: 147: Hoare triple {190451#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190451#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,159 INFO L290 TraceCheckUtils]: 148: Hoare triple {190451#(<= ~counter~0 17)} ~cond := #in~cond; {190451#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,159 INFO L290 TraceCheckUtils]: 149: Hoare triple {190451#(<= ~counter~0 17)} assume !(0 == ~cond); {190451#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,160 INFO L290 TraceCheckUtils]: 150: Hoare triple {190451#(<= ~counter~0 17)} assume true; {190451#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,160 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {190451#(<= ~counter~0 17)} {190451#(<= ~counter~0 17)} #96#return; {190451#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,161 INFO L290 TraceCheckUtils]: 152: Hoare triple {190451#(<= ~counter~0 17)} assume !(~r~0 > 0); {190451#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,164 INFO L290 TraceCheckUtils]: 153: Hoare triple {190451#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190476#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:55,164 INFO L290 TraceCheckUtils]: 154: Hoare triple {190476#(<= ~counter~0 18)} assume !!(#t~post8 < 100);havoc #t~post8; {190476#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:55,165 INFO L272 TraceCheckUtils]: 155: Hoare triple {190476#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190476#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:55,165 INFO L290 TraceCheckUtils]: 156: Hoare triple {190476#(<= ~counter~0 18)} ~cond := #in~cond; {190476#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:55,166 INFO L290 TraceCheckUtils]: 157: Hoare triple {190476#(<= ~counter~0 18)} assume !(0 == ~cond); {190476#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:55,166 INFO L290 TraceCheckUtils]: 158: Hoare triple {190476#(<= ~counter~0 18)} assume true; {190476#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:55,166 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {190476#(<= ~counter~0 18)} {190476#(<= ~counter~0 18)} #98#return; {190476#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:55,167 INFO L290 TraceCheckUtils]: 160: Hoare triple {190476#(<= ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190476#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:55,167 INFO L290 TraceCheckUtils]: 161: Hoare triple {190476#(<= ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190501#(<= |main_#t~post8| 18)} is VALID [2022-04-08 12:47:55,167 INFO L290 TraceCheckUtils]: 162: Hoare triple {190501#(<= |main_#t~post8| 18)} assume !(#t~post8 < 100);havoc #t~post8; {189995#false} is VALID [2022-04-08 12:47:55,167 INFO L290 TraceCheckUtils]: 163: Hoare triple {189995#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {189995#false} is VALID [2022-04-08 12:47:55,167 INFO L290 TraceCheckUtils]: 164: Hoare triple {189995#false} assume !(#t~post6 < 100);havoc #t~post6; {189995#false} is VALID [2022-04-08 12:47:55,167 INFO L272 TraceCheckUtils]: 165: Hoare triple {189995#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189995#false} is VALID [2022-04-08 12:47:55,168 INFO L290 TraceCheckUtils]: 166: Hoare triple {189995#false} ~cond := #in~cond; {189995#false} is VALID [2022-04-08 12:47:55,168 INFO L290 TraceCheckUtils]: 167: Hoare triple {189995#false} assume 0 == ~cond; {189995#false} is VALID [2022-04-08 12:47:55,168 INFO L290 TraceCheckUtils]: 168: Hoare triple {189995#false} assume !false; {189995#false} is VALID [2022-04-08 12:47:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 42 proven. 854 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:47:55,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:47:56,300 INFO L290 TraceCheckUtils]: 168: Hoare triple {189995#false} assume !false; {189995#false} is VALID [2022-04-08 12:47:56,300 INFO L290 TraceCheckUtils]: 167: Hoare triple {189995#false} assume 0 == ~cond; {189995#false} is VALID [2022-04-08 12:47:56,300 INFO L290 TraceCheckUtils]: 166: Hoare triple {189995#false} ~cond := #in~cond; {189995#false} is VALID [2022-04-08 12:47:56,300 INFO L272 TraceCheckUtils]: 165: Hoare triple {189995#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189995#false} is VALID [2022-04-08 12:47:56,301 INFO L290 TraceCheckUtils]: 164: Hoare triple {189995#false} assume !(#t~post6 < 100);havoc #t~post6; {189995#false} is VALID [2022-04-08 12:47:56,301 INFO L290 TraceCheckUtils]: 163: Hoare triple {189995#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {189995#false} is VALID [2022-04-08 12:47:56,301 INFO L290 TraceCheckUtils]: 162: Hoare triple {190541#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {189995#false} is VALID [2022-04-08 12:47:56,301 INFO L290 TraceCheckUtils]: 161: Hoare triple {190545#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190541#(< |main_#t~post8| 100)} is VALID [2022-04-08 12:47:56,301 INFO L290 TraceCheckUtils]: 160: Hoare triple {190545#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190545#(< ~counter~0 100)} is VALID [2022-04-08 12:47:56,302 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {189994#true} {190545#(< ~counter~0 100)} #98#return; {190545#(< ~counter~0 100)} is VALID [2022-04-08 12:47:56,302 INFO L290 TraceCheckUtils]: 158: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,302 INFO L290 TraceCheckUtils]: 157: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,302 INFO L290 TraceCheckUtils]: 156: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,302 INFO L272 TraceCheckUtils]: 155: Hoare triple {190545#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,302 INFO L290 TraceCheckUtils]: 154: Hoare triple {190545#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {190545#(< ~counter~0 100)} is VALID [2022-04-08 12:47:56,306 INFO L290 TraceCheckUtils]: 153: Hoare triple {190570#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190545#(< ~counter~0 100)} is VALID [2022-04-08 12:47:56,306 INFO L290 TraceCheckUtils]: 152: Hoare triple {190570#(< ~counter~0 99)} assume !(~r~0 > 0); {190570#(< ~counter~0 99)} is VALID [2022-04-08 12:47:56,307 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {189994#true} {190570#(< ~counter~0 99)} #96#return; {190570#(< ~counter~0 99)} is VALID [2022-04-08 12:47:56,307 INFO L290 TraceCheckUtils]: 150: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,307 INFO L290 TraceCheckUtils]: 149: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,307 INFO L290 TraceCheckUtils]: 148: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,307 INFO L272 TraceCheckUtils]: 147: Hoare triple {190570#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,307 INFO L290 TraceCheckUtils]: 146: Hoare triple {190570#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {190570#(< ~counter~0 99)} is VALID [2022-04-08 12:47:56,309 INFO L290 TraceCheckUtils]: 145: Hoare triple {190595#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190570#(< ~counter~0 99)} is VALID [2022-04-08 12:47:56,309 INFO L290 TraceCheckUtils]: 144: Hoare triple {190595#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190595#(< ~counter~0 98)} is VALID [2022-04-08 12:47:56,310 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {189994#true} {190595#(< ~counter~0 98)} #96#return; {190595#(< ~counter~0 98)} is VALID [2022-04-08 12:47:56,310 INFO L290 TraceCheckUtils]: 142: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,310 INFO L290 TraceCheckUtils]: 141: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,310 INFO L290 TraceCheckUtils]: 140: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,310 INFO L272 TraceCheckUtils]: 139: Hoare triple {190595#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,310 INFO L290 TraceCheckUtils]: 138: Hoare triple {190595#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {190595#(< ~counter~0 98)} is VALID [2022-04-08 12:47:56,312 INFO L290 TraceCheckUtils]: 137: Hoare triple {190620#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190595#(< ~counter~0 98)} is VALID [2022-04-08 12:47:56,312 INFO L290 TraceCheckUtils]: 136: Hoare triple {190620#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190620#(< ~counter~0 97)} is VALID [2022-04-08 12:47:56,313 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {189994#true} {190620#(< ~counter~0 97)} #96#return; {190620#(< ~counter~0 97)} is VALID [2022-04-08 12:47:56,313 INFO L290 TraceCheckUtils]: 134: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,313 INFO L290 TraceCheckUtils]: 133: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,313 INFO L290 TraceCheckUtils]: 132: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,313 INFO L272 TraceCheckUtils]: 131: Hoare triple {190620#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,313 INFO L290 TraceCheckUtils]: 130: Hoare triple {190620#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {190620#(< ~counter~0 97)} is VALID [2022-04-08 12:47:56,315 INFO L290 TraceCheckUtils]: 129: Hoare triple {190645#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190620#(< ~counter~0 97)} is VALID [2022-04-08 12:47:56,315 INFO L290 TraceCheckUtils]: 128: Hoare triple {190645#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190645#(< ~counter~0 96)} is VALID [2022-04-08 12:47:56,315 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {189994#true} {190645#(< ~counter~0 96)} #96#return; {190645#(< ~counter~0 96)} is VALID [2022-04-08 12:47:56,315 INFO L290 TraceCheckUtils]: 126: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,315 INFO L290 TraceCheckUtils]: 125: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,315 INFO L290 TraceCheckUtils]: 124: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,316 INFO L272 TraceCheckUtils]: 123: Hoare triple {190645#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,316 INFO L290 TraceCheckUtils]: 122: Hoare triple {190645#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {190645#(< ~counter~0 96)} is VALID [2022-04-08 12:47:56,317 INFO L290 TraceCheckUtils]: 121: Hoare triple {190670#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190645#(< ~counter~0 96)} is VALID [2022-04-08 12:47:56,318 INFO L290 TraceCheckUtils]: 120: Hoare triple {190670#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190670#(< ~counter~0 95)} is VALID [2022-04-08 12:47:56,318 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {189994#true} {190670#(< ~counter~0 95)} #96#return; {190670#(< ~counter~0 95)} is VALID [2022-04-08 12:47:56,318 INFO L290 TraceCheckUtils]: 118: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,318 INFO L290 TraceCheckUtils]: 117: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,318 INFO L290 TraceCheckUtils]: 116: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,319 INFO L272 TraceCheckUtils]: 115: Hoare triple {190670#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,319 INFO L290 TraceCheckUtils]: 114: Hoare triple {190670#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {190670#(< ~counter~0 95)} is VALID [2022-04-08 12:47:56,321 INFO L290 TraceCheckUtils]: 113: Hoare triple {190695#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190670#(< ~counter~0 95)} is VALID [2022-04-08 12:47:56,321 INFO L290 TraceCheckUtils]: 112: Hoare triple {190695#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190695#(< ~counter~0 94)} is VALID [2022-04-08 12:47:56,322 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {189994#true} {190695#(< ~counter~0 94)} #96#return; {190695#(< ~counter~0 94)} is VALID [2022-04-08 12:47:56,322 INFO L290 TraceCheckUtils]: 110: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,322 INFO L290 TraceCheckUtils]: 109: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,322 INFO L290 TraceCheckUtils]: 108: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,322 INFO L272 TraceCheckUtils]: 107: Hoare triple {190695#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,322 INFO L290 TraceCheckUtils]: 106: Hoare triple {190695#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {190695#(< ~counter~0 94)} is VALID [2022-04-08 12:47:56,325 INFO L290 TraceCheckUtils]: 105: Hoare triple {190720#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190695#(< ~counter~0 94)} is VALID [2022-04-08 12:47:56,326 INFO L290 TraceCheckUtils]: 104: Hoare triple {190720#(< ~counter~0 93)} assume !!(0 != ~r~0); {190720#(< ~counter~0 93)} is VALID [2022-04-08 12:47:56,326 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {189994#true} {190720#(< ~counter~0 93)} #94#return; {190720#(< ~counter~0 93)} is VALID [2022-04-08 12:47:56,326 INFO L290 TraceCheckUtils]: 102: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,326 INFO L290 TraceCheckUtils]: 101: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,326 INFO L290 TraceCheckUtils]: 100: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,326 INFO L272 TraceCheckUtils]: 99: Hoare triple {190720#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,327 INFO L290 TraceCheckUtils]: 98: Hoare triple {190720#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {190720#(< ~counter~0 93)} is VALID [2022-04-08 12:47:56,328 INFO L290 TraceCheckUtils]: 97: Hoare triple {190745#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190720#(< ~counter~0 93)} is VALID [2022-04-08 12:47:56,329 INFO L290 TraceCheckUtils]: 96: Hoare triple {190745#(< ~counter~0 92)} assume !(~r~0 < 0); {190745#(< ~counter~0 92)} is VALID [2022-04-08 12:47:56,329 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {189994#true} {190745#(< ~counter~0 92)} #98#return; {190745#(< ~counter~0 92)} is VALID [2022-04-08 12:47:56,329 INFO L290 TraceCheckUtils]: 94: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,329 INFO L290 TraceCheckUtils]: 93: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,329 INFO L290 TraceCheckUtils]: 92: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,329 INFO L272 TraceCheckUtils]: 91: Hoare triple {190745#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,329 INFO L290 TraceCheckUtils]: 90: Hoare triple {190745#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {190745#(< ~counter~0 92)} is VALID [2022-04-08 12:47:56,331 INFO L290 TraceCheckUtils]: 89: Hoare triple {190770#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190745#(< ~counter~0 92)} is VALID [2022-04-08 12:47:56,331 INFO L290 TraceCheckUtils]: 88: Hoare triple {190770#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190770#(< ~counter~0 91)} is VALID [2022-04-08 12:47:56,332 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {189994#true} {190770#(< ~counter~0 91)} #98#return; {190770#(< ~counter~0 91)} is VALID [2022-04-08 12:47:56,332 INFO L290 TraceCheckUtils]: 86: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,332 INFO L290 TraceCheckUtils]: 85: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,332 INFO L290 TraceCheckUtils]: 84: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,332 INFO L272 TraceCheckUtils]: 83: Hoare triple {190770#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,332 INFO L290 TraceCheckUtils]: 82: Hoare triple {190770#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {190770#(< ~counter~0 91)} is VALID [2022-04-08 12:47:56,334 INFO L290 TraceCheckUtils]: 81: Hoare triple {190795#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190770#(< ~counter~0 91)} is VALID [2022-04-08 12:47:56,334 INFO L290 TraceCheckUtils]: 80: Hoare triple {190795#(< ~counter~0 90)} assume !(~r~0 > 0); {190795#(< ~counter~0 90)} is VALID [2022-04-08 12:47:56,334 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {189994#true} {190795#(< ~counter~0 90)} #96#return; {190795#(< ~counter~0 90)} is VALID [2022-04-08 12:47:56,334 INFO L290 TraceCheckUtils]: 78: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,335 INFO L290 TraceCheckUtils]: 77: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,335 INFO L290 TraceCheckUtils]: 76: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,335 INFO L272 TraceCheckUtils]: 75: Hoare triple {190795#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,335 INFO L290 TraceCheckUtils]: 74: Hoare triple {190795#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {190795#(< ~counter~0 90)} is VALID [2022-04-08 12:47:56,336 INFO L290 TraceCheckUtils]: 73: Hoare triple {190820#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190795#(< ~counter~0 90)} is VALID [2022-04-08 12:47:56,337 INFO L290 TraceCheckUtils]: 72: Hoare triple {190820#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190820#(< ~counter~0 89)} is VALID [2022-04-08 12:47:56,337 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {189994#true} {190820#(< ~counter~0 89)} #96#return; {190820#(< ~counter~0 89)} is VALID [2022-04-08 12:47:56,337 INFO L290 TraceCheckUtils]: 70: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,337 INFO L290 TraceCheckUtils]: 69: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,337 INFO L290 TraceCheckUtils]: 68: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,337 INFO L272 TraceCheckUtils]: 67: Hoare triple {190820#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,337 INFO L290 TraceCheckUtils]: 66: Hoare triple {190820#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {190820#(< ~counter~0 89)} is VALID [2022-04-08 12:47:56,339 INFO L290 TraceCheckUtils]: 65: Hoare triple {190845#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190820#(< ~counter~0 89)} is VALID [2022-04-08 12:47:56,339 INFO L290 TraceCheckUtils]: 64: Hoare triple {190845#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190845#(< ~counter~0 88)} is VALID [2022-04-08 12:47:56,340 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {189994#true} {190845#(< ~counter~0 88)} #96#return; {190845#(< ~counter~0 88)} is VALID [2022-04-08 12:47:56,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,340 INFO L290 TraceCheckUtils]: 61: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,340 INFO L290 TraceCheckUtils]: 60: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,340 INFO L272 TraceCheckUtils]: 59: Hoare triple {190845#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,340 INFO L290 TraceCheckUtils]: 58: Hoare triple {190845#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {190845#(< ~counter~0 88)} is VALID [2022-04-08 12:47:56,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {190870#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190845#(< ~counter~0 88)} is VALID [2022-04-08 12:47:56,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {190870#(< ~counter~0 87)} assume !!(0 != ~r~0); {190870#(< ~counter~0 87)} is VALID [2022-04-08 12:47:56,343 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {189994#true} {190870#(< ~counter~0 87)} #94#return; {190870#(< ~counter~0 87)} is VALID [2022-04-08 12:47:56,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,343 INFO L272 TraceCheckUtils]: 51: Hoare triple {190870#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {190870#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {190870#(< ~counter~0 87)} is VALID [2022-04-08 12:47:56,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {190895#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190870#(< ~counter~0 87)} is VALID [2022-04-08 12:47:56,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {190895#(< ~counter~0 86)} assume !(~r~0 < 0); {190895#(< ~counter~0 86)} is VALID [2022-04-08 12:47:56,345 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {189994#true} {190895#(< ~counter~0 86)} #98#return; {190895#(< ~counter~0 86)} is VALID [2022-04-08 12:47:56,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,346 INFO L272 TraceCheckUtils]: 43: Hoare triple {190895#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,346 INFO L290 TraceCheckUtils]: 42: Hoare triple {190895#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {190895#(< ~counter~0 86)} is VALID [2022-04-08 12:47:56,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {190920#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190895#(< ~counter~0 86)} is VALID [2022-04-08 12:47:56,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {190920#(< ~counter~0 85)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190920#(< ~counter~0 85)} is VALID [2022-04-08 12:47:56,348 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {189994#true} {190920#(< ~counter~0 85)} #98#return; {190920#(< ~counter~0 85)} is VALID [2022-04-08 12:47:56,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,348 INFO L272 TraceCheckUtils]: 35: Hoare triple {190920#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {190920#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {190920#(< ~counter~0 85)} is VALID [2022-04-08 12:47:56,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {190945#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190920#(< ~counter~0 85)} is VALID [2022-04-08 12:47:56,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {190945#(< ~counter~0 84)} assume !(~r~0 > 0); {190945#(< ~counter~0 84)} is VALID [2022-04-08 12:47:56,351 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {189994#true} {190945#(< ~counter~0 84)} #96#return; {190945#(< ~counter~0 84)} is VALID [2022-04-08 12:47:56,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,351 INFO L272 TraceCheckUtils]: 27: Hoare triple {190945#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {190945#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {190945#(< ~counter~0 84)} is VALID [2022-04-08 12:47:56,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {190970#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190945#(< ~counter~0 84)} is VALID [2022-04-08 12:47:56,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {190970#(< ~counter~0 83)} assume !!(0 != ~r~0); {190970#(< ~counter~0 83)} is VALID [2022-04-08 12:47:56,353 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {189994#true} {190970#(< ~counter~0 83)} #94#return; {190970#(< ~counter~0 83)} is VALID [2022-04-08 12:47:56,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,354 INFO L272 TraceCheckUtils]: 19: Hoare triple {190970#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {190970#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {190970#(< ~counter~0 83)} is VALID [2022-04-08 12:47:56,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {190995#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190970#(< ~counter~0 83)} is VALID [2022-04-08 12:47:56,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {190995#(< ~counter~0 82)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {190995#(< ~counter~0 82)} is VALID [2022-04-08 12:47:56,356 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {189994#true} {190995#(< ~counter~0 82)} #92#return; {190995#(< ~counter~0 82)} is VALID [2022-04-08 12:47:56,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,356 INFO L272 TraceCheckUtils]: 11: Hoare triple {190995#(< ~counter~0 82)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,357 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {189994#true} {190995#(< ~counter~0 82)} #90#return; {190995#(< ~counter~0 82)} is VALID [2022-04-08 12:47:56,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-08 12:47:56,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-08 12:47:56,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-08 12:47:56,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {190995#(< ~counter~0 82)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {189994#true} is VALID [2022-04-08 12:47:56,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {190995#(< ~counter~0 82)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {190995#(< ~counter~0 82)} is VALID [2022-04-08 12:47:56,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {190995#(< ~counter~0 82)} call #t~ret9 := main(); {190995#(< ~counter~0 82)} is VALID [2022-04-08 12:47:56,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190995#(< ~counter~0 82)} {189994#true} #102#return; {190995#(< ~counter~0 82)} is VALID [2022-04-08 12:47:56,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {190995#(< ~counter~0 82)} assume true; {190995#(< ~counter~0 82)} is VALID [2022-04-08 12:47:56,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {189994#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {190995#(< ~counter~0 82)} is VALID [2022-04-08 12:47:56,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {189994#true} call ULTIMATE.init(); {189994#true} is VALID [2022-04-08 12:47:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 42 proven. 242 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-08 12:47:56,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:47:56,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398658073] [2022-04-08 12:47:56,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:47:56,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278066498] [2022-04-08 12:47:56,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278066498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:47:56,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:47:56,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-08 12:47:56,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:47:56,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [676777610] [2022-04-08 12:47:56,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [676777610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:47:56,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:47:56,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 12:47:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13716240] [2022-04-08 12:47:56,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:47:56,360 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 169 [2022-04-08 12:47:56,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:47:56,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 12:47:56,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:56,600 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 12:47:56,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:47:56,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 12:47:56,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 12:47:56,600 INFO L87 Difference]: Start difference. First operand 931 states and 1242 transitions. Second operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 12:48:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:48:03,337 INFO L93 Difference]: Finished difference Result 1135 states and 1544 transitions. [2022-04-08 12:48:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 12:48:03,337 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 169 [2022-04-08 12:48:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:48:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 12:48:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 396 transitions. [2022-04-08 12:48:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 12:48:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 396 transitions. [2022-04-08 12:48:03,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 396 transitions. [2022-04-08 12:48:03,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:48:04,019 INFO L225 Difference]: With dead ends: 1135 [2022-04-08 12:48:04,019 INFO L226 Difference]: Without dead ends: 957 [2022-04-08 12:48:04,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1409, Invalid=1897, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 12:48:04,020 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 303 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 12:48:04,020 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 391 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 12:48:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states.