/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 15:11:00,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 15:11:00,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 15:11:00,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 15:11:00,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 15:11:00,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 15:11:00,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 15:11:00,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 15:11:00,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 15:11:00,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 15:11:00,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 15:11:00,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 15:11:00,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 15:11:00,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 15:11:00,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 15:11:00,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 15:11:00,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 15:11:00,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 15:11:00,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 15:11:00,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 15:11:00,263 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 15:11:00,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 15:11:00,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 15:11:00,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 15:11:00,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 15:11:00,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 15:11:00,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 15:11:00,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 15:11:00,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 15:11:00,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 15:11:00,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 15:11:00,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 15:11:00,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 15:11:00,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 15:11:00,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 15:11:00,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 15:11:00,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 15:11:00,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 15:11:00,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 15:11:00,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 15:11:00,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 15:11:00,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 15:11:00,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 15:11:00,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 15:11:00,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 15:11:00,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 15:11:00,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 15:11:00,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 15:11:00,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 15:11:00,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 15:11:00,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 15:11:00,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 15:11:00,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 15:11:00,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 15:11:00,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 15:11:00,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 15:11:00,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 15:11:00,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 15:11:00,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:11:00,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 15:11:00,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 15:11:00,291 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 15:11:00,291 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 15:11:00,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 15:11:00,291 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 15:11:00,292 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 15:11:00,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 15:11:00,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 15:11:00,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 15:11:00,533 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 15:11:00,534 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 15:11:00,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2022-04-15 15:11:00,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a0cf976/6a08f342a4b1453ea99c9940f52d5dd9/FLAGb37a66a53 [2022-04-15 15:11:00,990 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 15:11:00,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2022-04-15 15:11:00,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a0cf976/6a08f342a4b1453ea99c9940f52d5dd9/FLAGb37a66a53 [2022-04-15 15:11:01,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a0cf976/6a08f342a4b1453ea99c9940f52d5dd9 [2022-04-15 15:11:01,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 15:11:01,008 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 15:11:01,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 15:11:01,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 15:11:01,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 15:11:01,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:11:01" (1/1) ... [2022-04-15 15:11:01,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ccb8733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:01, skipping insertion in model container [2022-04-15 15:11:01,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:11:01" (1/1) ... [2022-04-15 15:11:01,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 15:11:01,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 15:11:01,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2022-04-15 15:11:01,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:11:01,279 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 15:11:01,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2022-04-15 15:11:01,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:11:01,340 INFO L208 MainTranslator]: Completed translation [2022-04-15 15:11:01,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:01 WrapperNode [2022-04-15 15:11:01,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 15:11:01,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 15:11:01,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 15:11:01,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 15:11:01,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:01" (1/1) ... [2022-04-15 15:11:01,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:01" (1/1) ... [2022-04-15 15:11:01,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:01" (1/1) ... [2022-04-15 15:11:01,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:01" (1/1) ... [2022-04-15 15:11:01,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:01" (1/1) ... [2022-04-15 15:11:01,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:01" (1/1) ... [2022-04-15 15:11:01,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:01" (1/1) ... [2022-04-15 15:11:01,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 15:11:01,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 15:11:01,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 15:11:01,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 15:11:01,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:01" (1/1) ... [2022-04-15 15:11:01,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:11:01,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:01,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 15:11:01,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 15:11:01,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 15:11:01,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 15:11:01,458 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 15:11:01,458 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 15:11:01,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 15:11:01,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 15:11:01,459 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 15:11:01,459 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 15:11:01,459 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 15:11:01,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 15:11:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 15:11:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 15:11:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 15:11:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 15:11:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 15:11:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 15:11:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 15:11:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 15:11:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 15:11:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 15:11:01,517 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 15:11:01,518 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 15:11:01,717 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 15:11:01,722 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 15:11:01,723 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 15:11:01,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:11:01 BoogieIcfgContainer [2022-04-15 15:11:01,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 15:11:01,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 15:11:01,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 15:11:01,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 15:11:01,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:11:01" (1/3) ... [2022-04-15 15:11:01,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17afe39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:11:01, skipping insertion in model container [2022-04-15 15:11:01,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:01" (2/3) ... [2022-04-15 15:11:01,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17afe39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:11:01, skipping insertion in model container [2022-04-15 15:11:01,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:11:01" (3/3) ... [2022-04-15 15:11:01,730 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound20.c [2022-04-15 15:11:01,734 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 15:11:01,734 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 15:11:01,767 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 15:11:01,772 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 15:11:01,772 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 15:11:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:11:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 15:11:01,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:01,793 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:01,793 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:01,797 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-15 15:11:01,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:01,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1904505352] [2022-04-15 15:11:01,812 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:01,813 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-15 15:11:01,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:01,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676842660] [2022-04-15 15:11:01,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:01,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:01,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:01,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [520626403] [2022-04-15 15:11:01,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:01,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:01,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:01,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:01,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 15:11:01,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:11:01,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:01,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 15:11:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:02,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:02,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-15 15:11:02,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-15 15:11:02,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 15:11:02,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-15 15:11:02,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-15 15:11:02,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-15 15:11:02,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-15 15:11:02,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 15:11:02,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-15 15:11:02,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 15:11:02,129 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-15 15:11:02,129 INFO L272 TraceCheckUtils]: 11: Hoare triple {40#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40#true} is VALID [2022-04-15 15:11:02,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 15:11:02,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 15:11:02,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 15:11:02,130 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-15 15:11:02,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-15 15:11:02,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 15:11:02,131 INFO L272 TraceCheckUtils]: 18: Hoare triple {41#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41#false} is VALID [2022-04-15 15:11:02,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 15:11:02,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 15:11:02,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 15:11:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 15:11:02,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:02,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:02,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676842660] [2022-04-15 15:11:02,134 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:02,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520626403] [2022-04-15 15:11:02,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520626403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:02,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:02,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 15:11:02,137 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:02,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1904505352] [2022-04-15 15:11:02,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1904505352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:02,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:02,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 15:11:02,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892596728] [2022-04-15 15:11:02,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:02,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-15 15:11:02,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:02,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:02,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:02,176 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 15:11:02,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:02,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 15:11:02,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 15:11:02,206 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:02,300 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-15 15:11:02,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 15:11:02,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-15 15:11:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 15:11:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 15:11:02,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-15 15:11:02,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:02,449 INFO L225 Difference]: With dead ends: 67 [2022-04-15 15:11:02,449 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 15:11:02,453 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 15:11:02,457 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:02,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 15:11:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 15:11:02,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:02,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:02,490 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:02,491 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:02,497 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 15:11:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 15:11:02,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:02,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:02,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-15 15:11:02,507 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-15 15:11:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:02,511 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 15:11:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 15:11:02,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:02,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:02,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:02,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-15 15:11:02,520 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-15 15:11:02,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:02,520 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-15 15:11:02,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:02,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-15 15:11:02,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 15:11:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 15:11:02,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:02,556 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:02,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 15:11:02,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 15:11:02,776 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-15 15:11:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:02,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1989598626] [2022-04-15 15:11:02,778 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:02,778 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-15 15:11:02,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:02,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997742111] [2022-04-15 15:11:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:02,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:02,799 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:02,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2032698286] [2022-04-15 15:11:02,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:02,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:02,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:02,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:02,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 15:11:02,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:11:02,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:02,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 15:11:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:02,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:03,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-15 15:11:03,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,055 INFO L272 TraceCheckUtils]: 6: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,057 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,057 INFO L272 TraceCheckUtils]: 11: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,059 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {377#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:03,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {426#(<= |main_#t~post6| 0)} is VALID [2022-04-15 15:11:03,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {370#false} is VALID [2022-04-15 15:11:03,061 INFO L272 TraceCheckUtils]: 19: Hoare triple {370#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {370#false} is VALID [2022-04-15 15:11:03,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-15 15:11:03,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-15 15:11:03,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-15 15:11:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:03,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:03,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:03,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997742111] [2022-04-15 15:11:03,063 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:03,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032698286] [2022-04-15 15:11:03,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032698286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:03,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:03,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:03,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:03,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1989598626] [2022-04-15 15:11:03,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1989598626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:03,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:03,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52600884] [2022-04-15 15:11:03,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 15:11:03,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:03,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:11:03,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:03,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:11:03,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:03,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:11:03,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:03,084 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:11:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:03,176 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 15:11:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:11:03,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 15:11:03,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:11:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 15:11:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:11:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 15:11:03,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-15 15:11:03,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:03,222 INFO L225 Difference]: With dead ends: 41 [2022-04-15 15:11:03,222 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 15:11:03,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:03,224 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:03,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 15:11:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 15:11:03,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:03,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:03,237 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:03,237 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:03,240 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 15:11:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 15:11:03,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:03,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:03,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-15 15:11:03,241 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-15 15:11:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:03,244 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 15:11:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 15:11:03,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:03,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:03,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:03,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-15 15:11:03,247 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-15 15:11:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:03,247 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-15 15:11:03,247 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:11:03,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-15 15:11:03,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:03,290 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 15:11:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 15:11:03,292 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:03,292 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:03,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 15:11:03,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-15 15:11:03,512 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:03,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:03,512 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-15 15:11:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:03,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [551104303] [2022-04-15 15:11:03,513 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-15 15:11:03,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:03,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658346053] [2022-04-15 15:11:03,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:03,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:03,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:03,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1657812396] [2022-04-15 15:11:03,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:03,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:03,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:03,536 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:03,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 15:11:03,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:11:03,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:03,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:11:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:03,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:03,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-15 15:11:03,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {659#true} is VALID [2022-04-15 15:11:03,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 15:11:03,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-15 15:11:03,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-15 15:11:03,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {659#true} is VALID [2022-04-15 15:11:03,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {659#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {659#true} is VALID [2022-04-15 15:11:03,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 15:11:03,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 15:11:03,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 15:11:03,932 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-15 15:11:03,932 INFO L272 TraceCheckUtils]: 11: Hoare triple {659#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {659#true} is VALID [2022-04-15 15:11:03,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 15:11:03,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 15:11:03,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 15:11:03,933 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-15 15:11:05,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {659#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-15 15:11:05,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-15 15:11:05,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-15 15:11:05,930 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:11:05,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:11:05,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-15 15:11:05,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-15 15:11:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:05,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:05,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658346053] [2022-04-15 15:11:05,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:05,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657812396] [2022-04-15 15:11:05,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657812396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:05,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:05,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:11:05,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:05,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [551104303] [2022-04-15 15:11:05,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [551104303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:05,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:05,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:11:05,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582846576] [2022-04-15 15:11:05,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:05,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 15:11:05,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:05,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:08,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:08,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:11:08,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:08,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:11:08,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:11:08,750 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:11,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:11:14,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:11:15,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:11:17,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:11:29,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:11:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:29,171 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 15:11:29,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:11:29,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 15:11:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 15:11:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 15:11:29,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-15 15:11:36,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 66 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:36,654 INFO L225 Difference]: With dead ends: 53 [2022-04-15 15:11:36,654 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 15:11:36,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 15:11:36,655 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:36,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2022-04-15 15:11:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 15:11:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 15:11:36,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:36,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:36,688 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:36,688 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:36,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:36,696 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 15:11:36,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 15:11:36,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:36,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:36,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-15 15:11:36,701 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-15 15:11:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:36,703 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 15:11:36,703 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 15:11:36,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:36,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:36,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:36,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-15 15:11:36,707 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-15 15:11:36,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:36,723 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-15 15:11:36,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:36,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-15 15:11:44,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 63 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-15 15:11:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 15:11:44,810 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:44,810 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:44,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 15:11:45,011 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:45,011 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:45,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:45,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-15 15:11:45,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:45,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1717096756] [2022-04-15 15:11:45,012 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:45,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-15 15:11:45,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:45,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718656955] [2022-04-15 15:11:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:45,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:45,026 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:45,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400941557] [2022-04-15 15:11:45,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:45,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:45,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:45,027 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:45,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 15:11:45,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:45,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:45,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 15:11:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:45,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:45,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 15:11:45,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1042#true} is VALID [2022-04-15 15:11:45,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:45,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 15:11:45,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 15:11:45,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1042#true} is VALID [2022-04-15 15:11:45,295 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:45,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:11:45,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:11:45,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:45,295 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 15:11:45,296 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:45,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:11:45,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:11:45,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:45,296 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 15:11:45,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-15 15:11:45,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 15:11:45,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 20);havoc #t~post6; {1042#true} is VALID [2022-04-15 15:11:45,297 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:45,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:11:45,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:11:45,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:11:45,299 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1118#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-15 15:11:45,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {1118#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-15 15:11:45,301 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:11:45,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:11:45,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 15:11:45,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 15:11:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:45,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:45,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 15:11:45,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 15:11:45,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:11:45,753 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:11:45,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-15 15:11:45,757 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1149#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-15 15:11:45,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:11:45,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:11:45,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:11:45,763 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:45,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 20);havoc #t~post6; {1042#true} is VALID [2022-04-15 15:11:45,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 15:11:45,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-15 15:11:45,764 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 15:11:45,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:45,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:11:45,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:11:45,764 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:45,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 15:11:45,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:45,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:11:45,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:11:45,765 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:45,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1042#true} is VALID [2022-04-15 15:11:45,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 15:11:45,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 15:11:45,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:45,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1042#true} is VALID [2022-04-15 15:11:45,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 15:11:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:45,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:45,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718656955] [2022-04-15 15:11:45,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:45,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400941557] [2022-04-15 15:11:45,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400941557] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:45,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:45,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 15:11:45,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:45,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1717096756] [2022-04-15 15:11:45,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1717096756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:45,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:45,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:11:45,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506715443] [2022-04-15 15:11:45,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:45,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-15 15:11:45,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:45,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:11:45,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:45,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:11:45,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:45,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:11:45,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:11:45,792 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:11:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:46,228 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 15:11:46,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 15:11:46,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-15 15:11:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:11:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 15:11:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:11:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 15:11:46,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 15:11:46,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:46,283 INFO L225 Difference]: With dead ends: 57 [2022-04-15 15:11:46,284 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 15:11:46,284 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 15:11:46,285 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:46,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:11:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 15:11:46,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 15:11:46,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:46,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:46,312 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:46,314 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:46,320 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 15:11:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 15:11:46,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:46,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:46,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-15 15:11:46,323 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-15 15:11:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:46,329 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 15:11:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 15:11:46,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:46,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:46,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:46,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 15:11:46,333 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 29 [2022-04-15 15:11:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:46,334 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-15 15:11:46,334 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:11:46,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-15 15:11:49,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 65 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 15:11:49,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 15:11:49,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:49,355 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:49,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 15:11:49,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:49,573 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-15 15:11:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:49,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [446476762] [2022-04-15 15:11:49,574 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-15 15:11:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:49,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580833088] [2022-04-15 15:11:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:49,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:49,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:49,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1510590163] [2022-04-15 15:11:49,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:49,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:49,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:49,598 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:49,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 15:11:49,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:49,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:49,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 15:11:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:49,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:49,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {1553#true} call ULTIMATE.init(); {1553#true} is VALID [2022-04-15 15:11:49,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {1553#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1561#(<= ~counter~0 0)} {1553#true} #102#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {1561#(<= ~counter~0 0)} call #t~ret9 := main(); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {1561#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,947 INFO L272 TraceCheckUtils]: 6: Hoare triple {1561#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {1561#(<= ~counter~0 0)} ~cond := #in~cond; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {1561#(<= ~counter~0 0)} assume !(0 == ~cond); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,948 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1561#(<= ~counter~0 0)} {1561#(<= ~counter~0 0)} #90#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,949 INFO L272 TraceCheckUtils]: 11: Hoare triple {1561#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {1561#(<= ~counter~0 0)} ~cond := #in~cond; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1561#(<= ~counter~0 0)} assume !(0 == ~cond); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,950 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1561#(<= ~counter~0 0)} {1561#(<= ~counter~0 0)} #92#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:49,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:49,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {1610#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:49,952 INFO L272 TraceCheckUtils]: 19: Hoare triple {1610#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:49,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {1610#(<= ~counter~0 1)} ~cond := #in~cond; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:49,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {1610#(<= ~counter~0 1)} assume !(0 == ~cond); {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:49,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {1610#(<= ~counter~0 1)} assume true; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:49,953 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1610#(<= ~counter~0 1)} {1610#(<= ~counter~0 1)} #94#return; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:49,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {1610#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:49,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {1610#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1635#(<= |main_#t~post7| 1)} is VALID [2022-04-15 15:11:49,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {1635#(<= |main_#t~post7| 1)} assume !(#t~post7 < 20);havoc #t~post7; {1554#false} is VALID [2022-04-15 15:11:49,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {1554#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1554#false} is VALID [2022-04-15 15:11:49,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {1554#false} assume !(#t~post8 < 20);havoc #t~post8; {1554#false} is VALID [2022-04-15 15:11:49,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {1554#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1554#false} is VALID [2022-04-15 15:11:49,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {1554#false} assume !(#t~post6 < 20);havoc #t~post6; {1554#false} is VALID [2022-04-15 15:11:49,955 INFO L272 TraceCheckUtils]: 31: Hoare triple {1554#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1554#false} is VALID [2022-04-15 15:11:49,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {1554#false} ~cond := #in~cond; {1554#false} is VALID [2022-04-15 15:11:49,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {1554#false} assume 0 == ~cond; {1554#false} is VALID [2022-04-15 15:11:49,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {1554#false} assume !false; {1554#false} is VALID [2022-04-15 15:11:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:49,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:49,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:49,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580833088] [2022-04-15 15:11:49,957 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:49,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510590163] [2022-04-15 15:11:49,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510590163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:49,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:49,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:11:49,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:49,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [446476762] [2022-04-15 15:11:49,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [446476762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:49,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:49,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:11:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891159405] [2022-04-15 15:11:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 15:11:49,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:49,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 15:11:49,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:49,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:11:49,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:49,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:11:49,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:11:49,985 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 15:11:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:50,118 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-15 15:11:50,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:11:50,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 15:11:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 15:11:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 15:11:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 15:11:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 15:11:50,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-15 15:11:50,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:50,184 INFO L225 Difference]: With dead ends: 97 [2022-04-15 15:11:50,184 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 15:11:50,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:11:50,185 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:50,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 15:11:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 15:11:50,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:50,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 15:11:50,222 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 15:11:50,222 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 15:11:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:50,224 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-15 15:11:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 15:11:50,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:50,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:50,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-15 15:11:50,225 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-15 15:11:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:50,227 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-15 15:11:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 15:11:50,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:50,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:50,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:50,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 15:11:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-15 15:11:50,230 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 35 [2022-04-15 15:11:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:50,230 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-15 15:11:50,231 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 15:11:50,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-15 15:11:50,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 15:11:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 15:11:50,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:50,944 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:50,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 15:11:51,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:51,147 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:51,148 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-15 15:11:51,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:51,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [187011500] [2022-04-15 15:11:51,148 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:51,149 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-15 15:11:51,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:51,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947791883] [2022-04-15 15:11:51,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:51,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:51,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:51,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625621040] [2022-04-15 15:11:51,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:51,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:51,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:51,182 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:51,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 15:11:51,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:51,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:51,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:11:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:51,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:51,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2022-04-15 15:11:51,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {2096#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2104#(<= ~counter~0 0)} {2096#true} #102#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {2104#(<= ~counter~0 0)} call #t~ret9 := main(); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {2104#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,475 INFO L272 TraceCheckUtils]: 6: Hoare triple {2104#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {2104#(<= ~counter~0 0)} ~cond := #in~cond; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {2104#(<= ~counter~0 0)} assume !(0 == ~cond); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,477 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2104#(<= ~counter~0 0)} {2104#(<= ~counter~0 0)} #90#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,477 INFO L272 TraceCheckUtils]: 11: Hoare triple {2104#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {2104#(<= ~counter~0 0)} ~cond := #in~cond; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(<= ~counter~0 0)} assume !(0 == ~cond); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,479 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2104#(<= ~counter~0 0)} {2104#(<= ~counter~0 0)} #92#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {2104#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {2104#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {2153#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,481 INFO L272 TraceCheckUtils]: 19: Hoare triple {2153#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {2153#(<= ~counter~0 1)} ~cond := #in~cond; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {2153#(<= ~counter~0 1)} assume !(0 == ~cond); {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {2153#(<= ~counter~0 1)} assume true; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,484 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2153#(<= ~counter~0 1)} {2153#(<= ~counter~0 1)} #94#return; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {2153#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {2153#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {2178#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,486 INFO L272 TraceCheckUtils]: 27: Hoare triple {2178#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {2178#(<= ~counter~0 2)} ~cond := #in~cond; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {2178#(<= ~counter~0 2)} assume !(0 == ~cond); {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {2178#(<= ~counter~0 2)} assume true; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,488 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2178#(<= ~counter~0 2)} {2178#(<= ~counter~0 2)} #96#return; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {2178#(<= ~counter~0 2)} assume !(~r~0 > 0); {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {2178#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2203#(<= |main_#t~post8| 2)} is VALID [2022-04-15 15:11:51,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {2203#(<= |main_#t~post8| 2)} assume !(#t~post8 < 20);havoc #t~post8; {2097#false} is VALID [2022-04-15 15:11:51,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2097#false} is VALID [2022-04-15 15:11:51,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {2097#false} assume !(#t~post6 < 20);havoc #t~post6; {2097#false} is VALID [2022-04-15 15:11:51,490 INFO L272 TraceCheckUtils]: 37: Hoare triple {2097#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2097#false} is VALID [2022-04-15 15:11:51,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {2097#false} ~cond := #in~cond; {2097#false} is VALID [2022-04-15 15:11:51,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {2097#false} assume 0 == ~cond; {2097#false} is VALID [2022-04-15 15:11:51,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2022-04-15 15:11:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:51,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:51,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2022-04-15 15:11:51,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {2097#false} assume 0 == ~cond; {2097#false} is VALID [2022-04-15 15:11:51,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {2097#false} ~cond := #in~cond; {2097#false} is VALID [2022-04-15 15:11:51,726 INFO L272 TraceCheckUtils]: 37: Hoare triple {2097#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2097#false} is VALID [2022-04-15 15:11:51,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {2097#false} assume !(#t~post6 < 20);havoc #t~post6; {2097#false} is VALID [2022-04-15 15:11:51,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2097#false} is VALID [2022-04-15 15:11:51,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {2243#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {2097#false} is VALID [2022-04-15 15:11:51,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {2247#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2243#(< |main_#t~post8| 20)} is VALID [2022-04-15 15:11:51,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {2247#(< ~counter~0 20)} assume !(~r~0 > 0); {2247#(< ~counter~0 20)} is VALID [2022-04-15 15:11:51,729 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2096#true} {2247#(< ~counter~0 20)} #96#return; {2247#(< ~counter~0 20)} is VALID [2022-04-15 15:11:51,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 15:11:51,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 15:11:51,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 15:11:51,729 INFO L272 TraceCheckUtils]: 27: Hoare triple {2247#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2096#true} is VALID [2022-04-15 15:11:51,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {2247#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {2247#(< ~counter~0 20)} is VALID [2022-04-15 15:11:51,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {2272#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2247#(< ~counter~0 20)} is VALID [2022-04-15 15:11:51,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {2272#(< ~counter~0 19)} assume !!(0 != ~r~0); {2272#(< ~counter~0 19)} is VALID [2022-04-15 15:11:51,732 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2096#true} {2272#(< ~counter~0 19)} #94#return; {2272#(< ~counter~0 19)} is VALID [2022-04-15 15:11:51,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 15:11:51,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 15:11:51,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 15:11:51,732 INFO L272 TraceCheckUtils]: 19: Hoare triple {2272#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2096#true} is VALID [2022-04-15 15:11:51,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {2272#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {2272#(< ~counter~0 19)} is VALID [2022-04-15 15:11:51,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {2297#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2272#(< ~counter~0 19)} is VALID [2022-04-15 15:11:51,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {2297#(< ~counter~0 18)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2297#(< ~counter~0 18)} is VALID [2022-04-15 15:11:51,734 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2096#true} {2297#(< ~counter~0 18)} #92#return; {2297#(< ~counter~0 18)} is VALID [2022-04-15 15:11:51,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 15:11:51,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 15:11:51,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 15:11:51,735 INFO L272 TraceCheckUtils]: 11: Hoare triple {2297#(< ~counter~0 18)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2096#true} is VALID [2022-04-15 15:11:51,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2096#true} {2297#(< ~counter~0 18)} #90#return; {2297#(< ~counter~0 18)} is VALID [2022-04-15 15:11:51,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 15:11:51,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 15:11:51,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 15:11:51,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {2297#(< ~counter~0 18)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2096#true} is VALID [2022-04-15 15:11:51,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {2297#(< ~counter~0 18)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2297#(< ~counter~0 18)} is VALID [2022-04-15 15:11:51,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {2297#(< ~counter~0 18)} call #t~ret9 := main(); {2297#(< ~counter~0 18)} is VALID [2022-04-15 15:11:51,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2297#(< ~counter~0 18)} {2096#true} #102#return; {2297#(< ~counter~0 18)} is VALID [2022-04-15 15:11:51,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {2297#(< ~counter~0 18)} assume true; {2297#(< ~counter~0 18)} is VALID [2022-04-15 15:11:51,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {2096#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2297#(< ~counter~0 18)} is VALID [2022-04-15 15:11:51,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2022-04-15 15:11:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 15:11:51,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:51,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947791883] [2022-04-15 15:11:51,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:51,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625621040] [2022-04-15 15:11:51,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625621040] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 15:11:51,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 15:11:51,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-15 15:11:51,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:51,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [187011500] [2022-04-15 15:11:51,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [187011500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:51,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:51,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:11:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588217184] [2022-04-15 15:11:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:51,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 15:11:51,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:51,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:51,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:51,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:11:51,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:51,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:11:51,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:11:51,771 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:51,966 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2022-04-15 15:11:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 15:11:51,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 15:11:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 15:11:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 15:11:51,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-15 15:11:52,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:52,058 INFO L225 Difference]: With dead ends: 106 [2022-04-15 15:11:52,058 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 15:11:52,058 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:11:52,059 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:52,059 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 15:11:52,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-15 15:11:52,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:52,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:52,113 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:52,113 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:52,116 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-15 15:11:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-15 15:11:52,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:52,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:52,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-15 15:11:52,117 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-15 15:11:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:52,119 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-15 15:11:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-15 15:11:52,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:52,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:52,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:52,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-15 15:11:52,122 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 41 [2022-04-15 15:11:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:52,122 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-15 15:11:52,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:52,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-15 15:11:56,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-15 15:11:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 15:11:56,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:56,042 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:56,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 15:11:56,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:56,243 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-15 15:11:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:56,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1927847037] [2022-04-15 15:11:56,244 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-15 15:11:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:56,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826423953] [2022-04-15 15:11:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:56,256 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:56,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594423180] [2022-04-15 15:11:56,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:56,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:56,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:56,257 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:56,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 15:11:56,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:56,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:56,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:11:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:56,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:56,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {2837#true} call ULTIMATE.init(); {2837#true} is VALID [2022-04-15 15:11:56,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {2837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2845#(<= ~counter~0 0)} {2837#true} #102#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {2845#(<= ~counter~0 0)} call #t~ret9 := main(); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {2845#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {2845#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {2845#(<= ~counter~0 0)} ~cond := #in~cond; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {2845#(<= ~counter~0 0)} assume !(0 == ~cond); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2845#(<= ~counter~0 0)} {2845#(<= ~counter~0 0)} #90#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,583 INFO L272 TraceCheckUtils]: 11: Hoare triple {2845#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {2845#(<= ~counter~0 0)} ~cond := #in~cond; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {2845#(<= ~counter~0 0)} assume !(0 == ~cond); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,588 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2845#(<= ~counter~0 0)} {2845#(<= ~counter~0 0)} #92#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {2845#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {2845#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {2894#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,590 INFO L272 TraceCheckUtils]: 19: Hoare triple {2894#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {2894#(<= ~counter~0 1)} ~cond := #in~cond; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {2894#(<= ~counter~0 1)} assume !(0 == ~cond); {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {2894#(<= ~counter~0 1)} assume true; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,592 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2894#(<= ~counter~0 1)} {2894#(<= ~counter~0 1)} #94#return; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {2894#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {2894#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {2919#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,593 INFO L272 TraceCheckUtils]: 27: Hoare triple {2919#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {2919#(<= ~counter~0 2)} ~cond := #in~cond; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {2919#(<= ~counter~0 2)} assume !(0 == ~cond); {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {2919#(<= ~counter~0 2)} assume true; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,595 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2919#(<= ~counter~0 2)} {2919#(<= ~counter~0 2)} #96#return; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {2919#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {2919#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2944#(<= |main_#t~post7| 2)} is VALID [2022-04-15 15:11:56,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {2944#(<= |main_#t~post7| 2)} assume !(#t~post7 < 20);havoc #t~post7; {2838#false} is VALID [2022-04-15 15:11:56,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {2838#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2838#false} is VALID [2022-04-15 15:11:56,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {2838#false} assume !(#t~post8 < 20);havoc #t~post8; {2838#false} is VALID [2022-04-15 15:11:56,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {2838#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2838#false} is VALID [2022-04-15 15:11:56,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {2838#false} assume !(#t~post6 < 20);havoc #t~post6; {2838#false} is VALID [2022-04-15 15:11:56,597 INFO L272 TraceCheckUtils]: 39: Hoare triple {2838#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2838#false} is VALID [2022-04-15 15:11:56,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {2838#false} ~cond := #in~cond; {2838#false} is VALID [2022-04-15 15:11:56,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {2838#false} assume 0 == ~cond; {2838#false} is VALID [2022-04-15 15:11:56,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {2838#false} assume !false; {2838#false} is VALID [2022-04-15 15:11:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:56,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:56,821 INFO L290 TraceCheckUtils]: 42: Hoare triple {2838#false} assume !false; {2838#false} is VALID [2022-04-15 15:11:56,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {2838#false} assume 0 == ~cond; {2838#false} is VALID [2022-04-15 15:11:56,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {2838#false} ~cond := #in~cond; {2838#false} is VALID [2022-04-15 15:11:56,822 INFO L272 TraceCheckUtils]: 39: Hoare triple {2838#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2838#false} is VALID [2022-04-15 15:11:56,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {2838#false} assume !(#t~post6 < 20);havoc #t~post6; {2838#false} is VALID [2022-04-15 15:11:56,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {2838#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2838#false} is VALID [2022-04-15 15:11:56,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {2838#false} assume !(#t~post8 < 20);havoc #t~post8; {2838#false} is VALID [2022-04-15 15:11:56,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {2838#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2838#false} is VALID [2022-04-15 15:11:56,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {2996#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {2838#false} is VALID [2022-04-15 15:11:56,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {3000#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2996#(< |main_#t~post7| 20)} is VALID [2022-04-15 15:11:56,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {3000#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3000#(< ~counter~0 20)} is VALID [2022-04-15 15:11:56,824 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2837#true} {3000#(< ~counter~0 20)} #96#return; {3000#(< ~counter~0 20)} is VALID [2022-04-15 15:11:56,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 15:11:56,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 15:11:56,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 15:11:56,825 INFO L272 TraceCheckUtils]: 27: Hoare triple {3000#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2837#true} is VALID [2022-04-15 15:11:56,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {3000#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {3000#(< ~counter~0 20)} is VALID [2022-04-15 15:11:56,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {3025#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3000#(< ~counter~0 20)} is VALID [2022-04-15 15:11:56,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {3025#(< ~counter~0 19)} assume !!(0 != ~r~0); {3025#(< ~counter~0 19)} is VALID [2022-04-15 15:11:56,827 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2837#true} {3025#(< ~counter~0 19)} #94#return; {3025#(< ~counter~0 19)} is VALID [2022-04-15 15:11:56,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 15:11:56,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 15:11:56,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 15:11:56,828 INFO L272 TraceCheckUtils]: 19: Hoare triple {3025#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2837#true} is VALID [2022-04-15 15:11:56,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {3025#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {3025#(< ~counter~0 19)} is VALID [2022-04-15 15:11:56,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3025#(< ~counter~0 19)} is VALID [2022-04-15 15:11:56,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#(< ~counter~0 18)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3050#(< ~counter~0 18)} is VALID [2022-04-15 15:11:56,830 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2837#true} {3050#(< ~counter~0 18)} #92#return; {3050#(< ~counter~0 18)} is VALID [2022-04-15 15:11:56,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 15:11:56,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 15:11:56,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 15:11:56,830 INFO L272 TraceCheckUtils]: 11: Hoare triple {3050#(< ~counter~0 18)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2837#true} is VALID [2022-04-15 15:11:56,831 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2837#true} {3050#(< ~counter~0 18)} #90#return; {3050#(< ~counter~0 18)} is VALID [2022-04-15 15:11:56,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 15:11:56,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 15:11:56,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 15:11:56,831 INFO L272 TraceCheckUtils]: 6: Hoare triple {3050#(< ~counter~0 18)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2837#true} is VALID [2022-04-15 15:11:56,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#(< ~counter~0 18)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3050#(< ~counter~0 18)} is VALID [2022-04-15 15:11:56,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#(< ~counter~0 18)} call #t~ret9 := main(); {3050#(< ~counter~0 18)} is VALID [2022-04-15 15:11:56,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#(< ~counter~0 18)} {2837#true} #102#return; {3050#(< ~counter~0 18)} is VALID [2022-04-15 15:11:56,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#(< ~counter~0 18)} assume true; {3050#(< ~counter~0 18)} is VALID [2022-04-15 15:11:56,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {2837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3050#(< ~counter~0 18)} is VALID [2022-04-15 15:11:56,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {2837#true} call ULTIMATE.init(); {2837#true} is VALID [2022-04-15 15:11:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 15:11:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:56,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826423953] [2022-04-15 15:11:56,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:56,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594423180] [2022-04-15 15:11:56,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594423180] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:56,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:56,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 15:11:56,835 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:56,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1927847037] [2022-04-15 15:11:56,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1927847037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:56,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:56,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:11:56,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275503726] [2022-04-15 15:11:56,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:56,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-15 15:11:56,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:56,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:56,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:56,872 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:11:56,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:56,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:11:56,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:11:56,873 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:57,064 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-15 15:11:57,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 15:11:57,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-15 15:11:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 15:11:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 15:11:57,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-15 15:11:57,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:57,130 INFO L225 Difference]: With dead ends: 91 [2022-04-15 15:11:57,130 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 15:11:57,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 15:11:57,131 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:57,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 15:11:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 15:11:57,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:57,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:57,192 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:57,192 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:57,194 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-15 15:11:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-15 15:11:57,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:57,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:57,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 70 states. [2022-04-15 15:11:57,195 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 70 states. [2022-04-15 15:11:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:57,197 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-15 15:11:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-15 15:11:57,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:57,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:57,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:57,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-04-15 15:11:57,200 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 43 [2022-04-15 15:11:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:57,201 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-04-15 15:11:57,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:57,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 85 transitions. [2022-04-15 15:11:58,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-15 15:11:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 15:11:58,867 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:58,867 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:58,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 15:11:59,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:59,071 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-15 15:11:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:59,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [582700047] [2022-04-15 15:11:59,072 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-15 15:11:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:59,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551070089] [2022-04-15 15:11:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:59,092 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:59,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672758621] [2022-04-15 15:11:59,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:59,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:59,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:59,103 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:59,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 15:11:59,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:59,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:59,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 15:11:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:59,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:59,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {3568#true} call ULTIMATE.init(); {3568#true} is VALID [2022-04-15 15:11:59,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {3568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3568#true} is VALID [2022-04-15 15:11:59,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:11:59,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3568#true} {3568#true} #102#return; {3568#true} is VALID [2022-04-15 15:11:59,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {3568#true} call #t~ret9 := main(); {3568#true} is VALID [2022-04-15 15:11:59,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3568#true} is VALID [2022-04-15 15:11:59,359 INFO L272 TraceCheckUtils]: 6: Hoare triple {3568#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3568#true} is VALID [2022-04-15 15:11:59,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:11:59,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:11:59,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:11:59,359 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3568#true} {3568#true} #90#return; {3568#true} is VALID [2022-04-15 15:11:59,359 INFO L272 TraceCheckUtils]: 11: Hoare triple {3568#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3568#true} is VALID [2022-04-15 15:11:59,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:11:59,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:11:59,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:11:59,360 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3568#true} {3568#true} #92#return; {3568#true} is VALID [2022-04-15 15:11:59,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {3568#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3568#true} is VALID [2022-04-15 15:11:59,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {3568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3568#true} is VALID [2022-04-15 15:11:59,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {3568#true} assume !!(#t~post6 < 20);havoc #t~post6; {3568#true} is VALID [2022-04-15 15:11:59,360 INFO L272 TraceCheckUtils]: 19: Hoare triple {3568#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3568#true} is VALID [2022-04-15 15:11:59,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:11:59,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:11:59,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:11:59,361 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3568#true} {3568#true} #94#return; {3568#true} is VALID [2022-04-15 15:11:59,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {3568#true} assume !!(0 != ~r~0); {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 15:11:59,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {3645#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 15:11:59,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {3645#(not (= main_~r~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 15:11:59,362 INFO L272 TraceCheckUtils]: 27: Hoare triple {3645#(not (= main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3568#true} is VALID [2022-04-15 15:11:59,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:11:59,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:11:59,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:11:59,363 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3568#true} {3645#(not (= main_~r~0 0))} #96#return; {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 15:11:59,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {3645#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:11:59,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:11:59,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 20);havoc #t~post8; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:11:59,365 INFO L272 TraceCheckUtils]: 35: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3568#true} is VALID [2022-04-15 15:11:59,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:11:59,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:11:59,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:11:59,366 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3568#true} {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:11:59,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3569#false} is VALID [2022-04-15 15:11:59,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {3569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3569#false} is VALID [2022-04-15 15:11:59,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {3569#false} assume !(#t~post6 < 20);havoc #t~post6; {3569#false} is VALID [2022-04-15 15:11:59,367 INFO L272 TraceCheckUtils]: 43: Hoare triple {3569#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3569#false} is VALID [2022-04-15 15:11:59,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {3569#false} ~cond := #in~cond; {3569#false} is VALID [2022-04-15 15:11:59,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {3569#false} assume 0 == ~cond; {3569#false} is VALID [2022-04-15 15:11:59,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {3569#false} assume !false; {3569#false} is VALID [2022-04-15 15:11:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 15:11:59,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:59,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:59,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551070089] [2022-04-15 15:11:59,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:59,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672758621] [2022-04-15 15:11:59,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672758621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:59,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:59,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:59,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:59,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [582700047] [2022-04-15 15:11:59,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [582700047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:59,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:59,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:59,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065583528] [2022-04-15 15:11:59,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:59,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-15 15:11:59,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:59,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:59,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:59,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:11:59,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:59,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:11:59,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:59,400 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:59,580 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2022-04-15 15:11:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:11:59,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-15 15:11:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 15:11:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 15:11:59,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-15 15:11:59,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:59,675 INFO L225 Difference]: With dead ends: 153 [2022-04-15 15:11:59,675 INFO L226 Difference]: Without dead ends: 116 [2022-04-15 15:11:59,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:59,676 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:59,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:59,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-15 15:11:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-04-15 15:11:59,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:59,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 15:11:59,764 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 15:11:59,765 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 15:11:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:59,771 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2022-04-15 15:11:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 156 transitions. [2022-04-15 15:11:59,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:59,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:59,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 116 states. [2022-04-15 15:11:59,772 INFO L87 Difference]: Start difference. First operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 116 states. [2022-04-15 15:11:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:59,776 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2022-04-15 15:11:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 156 transitions. [2022-04-15 15:11:59,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:59,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:59,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:59,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 15:11:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2022-04-15 15:11:59,780 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 47 [2022-04-15 15:11:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:59,780 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2022-04-15 15:11:59,781 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:59,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 128 transitions. [2022-04-15 15:12:02,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2022-04-15 15:12:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 15:12:02,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:02,051 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:02,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:02,252 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-15 15:12:02,252 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:02,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-15 15:12:02,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:02,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [839749170] [2022-04-15 15:12:02,253 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-15 15:12:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:02,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336762731] [2022-04-15 15:12:02,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:02,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:02,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:02,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593027080] [2022-04-15 15:12:02,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:02,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:02,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:02,267 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:02,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 15:12:02,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:02,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:02,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 15:12:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:02,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:02,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {4446#true} call ULTIMATE.init(); {4446#true} is VALID [2022-04-15 15:12:02,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {4446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {4454#(<= ~counter~0 0)} assume true; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4454#(<= ~counter~0 0)} {4446#true} #102#return; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {4454#(<= ~counter~0 0)} call #t~ret9 := main(); {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {4454#(<= ~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; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,555 INFO L272 TraceCheckUtils]: 6: Hoare triple {4454#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {4454#(<= ~counter~0 0)} ~cond := #in~cond; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {4454#(<= ~counter~0 0)} assume !(0 == ~cond); {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {4454#(<= ~counter~0 0)} assume true; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4454#(<= ~counter~0 0)} {4454#(<= ~counter~0 0)} #90#return; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,557 INFO L272 TraceCheckUtils]: 11: Hoare triple {4454#(<= ~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)); {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {4454#(<= ~counter~0 0)} ~cond := #in~cond; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {4454#(<= ~counter~0 0)} assume !(0 == ~cond); {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {4454#(<= ~counter~0 0)} assume true; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,559 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4454#(<= ~counter~0 0)} {4454#(<= ~counter~0 0)} #92#return; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {4454#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {4454#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4503#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {4503#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {4503#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,561 INFO L272 TraceCheckUtils]: 19: Hoare triple {4503#(<= ~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)); {4503#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {4503#(<= ~counter~0 1)} ~cond := #in~cond; {4503#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {4503#(<= ~counter~0 1)} assume !(0 == ~cond); {4503#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {4503#(<= ~counter~0 1)} assume true; {4503#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,563 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4503#(<= ~counter~0 1)} {4503#(<= ~counter~0 1)} #94#return; {4503#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {4503#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4503#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {4503#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4528#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {4528#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {4528#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,564 INFO L272 TraceCheckUtils]: 27: Hoare triple {4528#(<= ~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)); {4528#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {4528#(<= ~counter~0 2)} ~cond := #in~cond; {4528#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {4528#(<= ~counter~0 2)} assume !(0 == ~cond); {4528#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {4528#(<= ~counter~0 2)} assume true; {4528#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,566 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4528#(<= ~counter~0 2)} {4528#(<= ~counter~0 2)} #96#return; {4528#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {4528#(<= ~counter~0 2)} assume !(~r~0 > 0); {4528#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {4528#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4553#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {4553#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {4553#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,568 INFO L272 TraceCheckUtils]: 35: Hoare triple {4553#(<= ~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)); {4553#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,568 INFO L290 TraceCheckUtils]: 36: Hoare triple {4553#(<= ~counter~0 3)} ~cond := #in~cond; {4553#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {4553#(<= ~counter~0 3)} assume !(0 == ~cond); {4553#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {4553#(<= ~counter~0 3)} assume true; {4553#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,570 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4553#(<= ~counter~0 3)} {4553#(<= ~counter~0 3)} #98#return; {4553#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {4553#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4553#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {4553#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4578#(<= |main_#t~post8| 3)} is VALID [2022-04-15 15:12:02,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {4578#(<= |main_#t~post8| 3)} assume !(#t~post8 < 20);havoc #t~post8; {4447#false} is VALID [2022-04-15 15:12:02,571 INFO L290 TraceCheckUtils]: 43: Hoare triple {4447#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4447#false} is VALID [2022-04-15 15:12:02,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {4447#false} assume !(#t~post6 < 20);havoc #t~post6; {4447#false} is VALID [2022-04-15 15:12:02,571 INFO L272 TraceCheckUtils]: 45: Hoare triple {4447#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4447#false} is VALID [2022-04-15 15:12:02,571 INFO L290 TraceCheckUtils]: 46: Hoare triple {4447#false} ~cond := #in~cond; {4447#false} is VALID [2022-04-15 15:12:02,571 INFO L290 TraceCheckUtils]: 47: Hoare triple {4447#false} assume 0 == ~cond; {4447#false} is VALID [2022-04-15 15:12:02,571 INFO L290 TraceCheckUtils]: 48: Hoare triple {4447#false} assume !false; {4447#false} is VALID [2022-04-15 15:12:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:02,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:02,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {4447#false} assume !false; {4447#false} is VALID [2022-04-15 15:12:02,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {4447#false} assume 0 == ~cond; {4447#false} is VALID [2022-04-15 15:12:02,832 INFO L290 TraceCheckUtils]: 46: Hoare triple {4447#false} ~cond := #in~cond; {4447#false} is VALID [2022-04-15 15:12:02,832 INFO L272 TraceCheckUtils]: 45: Hoare triple {4447#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4447#false} is VALID [2022-04-15 15:12:02,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {4447#false} assume !(#t~post6 < 20);havoc #t~post6; {4447#false} is VALID [2022-04-15 15:12:02,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {4447#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4447#false} is VALID [2022-04-15 15:12:02,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {4618#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {4447#false} is VALID [2022-04-15 15:12:02,836 INFO L290 TraceCheckUtils]: 41: Hoare triple {4622#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4618#(< |main_#t~post8| 20)} is VALID [2022-04-15 15:12:02,836 INFO L290 TraceCheckUtils]: 40: Hoare triple {4622#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4622#(< ~counter~0 20)} is VALID [2022-04-15 15:12:02,838 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4446#true} {4622#(< ~counter~0 20)} #98#return; {4622#(< ~counter~0 20)} is VALID [2022-04-15 15:12:02,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 15:12:02,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-15 15:12:02,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-15 15:12:02,838 INFO L272 TraceCheckUtils]: 35: Hoare triple {4622#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4446#true} is VALID [2022-04-15 15:12:02,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {4622#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {4622#(< ~counter~0 20)} is VALID [2022-04-15 15:12:02,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {4647#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4622#(< ~counter~0 20)} is VALID [2022-04-15 15:12:02,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {4647#(< ~counter~0 19)} assume !(~r~0 > 0); {4647#(< ~counter~0 19)} is VALID [2022-04-15 15:12:02,840 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4446#true} {4647#(< ~counter~0 19)} #96#return; {4647#(< ~counter~0 19)} is VALID [2022-04-15 15:12:02,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 15:12:02,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-15 15:12:02,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-15 15:12:02,840 INFO L272 TraceCheckUtils]: 27: Hoare triple {4647#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4446#true} is VALID [2022-04-15 15:12:02,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {4647#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {4647#(< ~counter~0 19)} is VALID [2022-04-15 15:12:02,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {4672#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4647#(< ~counter~0 19)} is VALID [2022-04-15 15:12:02,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {4672#(< ~counter~0 18)} assume !!(0 != ~r~0); {4672#(< ~counter~0 18)} is VALID [2022-04-15 15:12:02,845 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4446#true} {4672#(< ~counter~0 18)} #94#return; {4672#(< ~counter~0 18)} is VALID [2022-04-15 15:12:02,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 15:12:02,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-15 15:12:02,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-15 15:12:02,845 INFO L272 TraceCheckUtils]: 19: Hoare triple {4672#(< ~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)); {4446#true} is VALID [2022-04-15 15:12:02,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {4672#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {4672#(< ~counter~0 18)} is VALID [2022-04-15 15:12:02,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {4697#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4672#(< ~counter~0 18)} is VALID [2022-04-15 15:12:02,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {4697#(< ~counter~0 17)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4697#(< ~counter~0 17)} is VALID [2022-04-15 15:12:02,847 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4446#true} {4697#(< ~counter~0 17)} #92#return; {4697#(< ~counter~0 17)} is VALID [2022-04-15 15:12:02,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 15:12:02,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-15 15:12:02,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-15 15:12:02,847 INFO L272 TraceCheckUtils]: 11: Hoare triple {4697#(< ~counter~0 17)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4446#true} is VALID [2022-04-15 15:12:02,848 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4446#true} {4697#(< ~counter~0 17)} #90#return; {4697#(< ~counter~0 17)} is VALID [2022-04-15 15:12:02,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 15:12:02,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-15 15:12:02,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-15 15:12:02,848 INFO L272 TraceCheckUtils]: 6: Hoare triple {4697#(< ~counter~0 17)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4446#true} is VALID [2022-04-15 15:12:02,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {4697#(< ~counter~0 17)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4697#(< ~counter~0 17)} is VALID [2022-04-15 15:12:02,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {4697#(< ~counter~0 17)} call #t~ret9 := main(); {4697#(< ~counter~0 17)} is VALID [2022-04-15 15:12:02,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4697#(< ~counter~0 17)} {4446#true} #102#return; {4697#(< ~counter~0 17)} is VALID [2022-04-15 15:12:02,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {4697#(< ~counter~0 17)} assume true; {4697#(< ~counter~0 17)} is VALID [2022-04-15 15:12:02,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {4446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4697#(< ~counter~0 17)} is VALID [2022-04-15 15:12:02,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {4446#true} call ULTIMATE.init(); {4446#true} is VALID [2022-04-15 15:12:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 15:12:02,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:02,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336762731] [2022-04-15 15:12:02,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:02,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593027080] [2022-04-15 15:12:02,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593027080] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:02,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:02,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 15:12:02,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:02,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [839749170] [2022-04-15 15:12:02,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [839749170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:02,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:02,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 15:12:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594010041] [2022-04-15 15:12:02,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:02,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-15 15:12:02,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:02,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:12:02,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:02,895 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 15:12:02,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:02,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 15:12:02,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 15:12:02,896 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:12:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:03,149 INFO L93 Difference]: Finished difference Result 180 states and 241 transitions. [2022-04-15 15:12:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 15:12:03,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-15 15:12:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:12:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 15:12:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:12:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 15:12:03,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-15 15:12:03,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:03,224 INFO L225 Difference]: With dead ends: 180 [2022-04-15 15:12:03,225 INFO L226 Difference]: Without dead ends: 115 [2022-04-15 15:12:03,225 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-15 15:12:03,226 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:03,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 137 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:12:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-15 15:12:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2022-04-15 15:12:03,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:03,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 114 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 15:12:03,337 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 114 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 15:12:03,337 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 114 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 15:12:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:03,341 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2022-04-15 15:12:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2022-04-15 15:12:03,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:03,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:03,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 115 states. [2022-04-15 15:12:03,342 INFO L87 Difference]: Start difference. First operand has 114 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 115 states. [2022-04-15 15:12:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:03,346 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2022-04-15 15:12:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2022-04-15 15:12:03,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:03,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:03,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:03,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 15:12:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 145 transitions. [2022-04-15 15:12:03,350 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 145 transitions. Word has length 49 [2022-04-15 15:12:03,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:03,350 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 145 transitions. [2022-04-15 15:12:03,350 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:12:03,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 145 transitions. [2022-04-15 15:12:10,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 142 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2022-04-15 15:12:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 15:12:10,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:10,384 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:10,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:10,584 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:10,585 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:10,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:10,585 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-15 15:12:10,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:10,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42955890] [2022-04-15 15:12:10,586 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:10,586 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-15 15:12:10,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:10,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309363656] [2022-04-15 15:12:10,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:10,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:10,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:10,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560695354] [2022-04-15 15:12:10,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:12:10,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:10,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:10,606 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:10,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 15:12:10,670 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:12:10,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:10,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 15:12:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:10,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:10,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {5571#true} call ULTIMATE.init(); {5571#true} is VALID [2022-04-15 15:12:10,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {5579#(<= ~counter~0 0)} assume true; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5579#(<= ~counter~0 0)} {5571#true} #102#return; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {5579#(<= ~counter~0 0)} call #t~ret9 := main(); {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {5579#(<= ~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; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,940 INFO L272 TraceCheckUtils]: 6: Hoare triple {5579#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {5579#(<= ~counter~0 0)} ~cond := #in~cond; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {5579#(<= ~counter~0 0)} assume !(0 == ~cond); {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {5579#(<= ~counter~0 0)} assume true; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5579#(<= ~counter~0 0)} {5579#(<= ~counter~0 0)} #90#return; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,943 INFO L272 TraceCheckUtils]: 11: Hoare triple {5579#(<= ~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)); {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {5579#(<= ~counter~0 0)} ~cond := #in~cond; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {5579#(<= ~counter~0 0)} assume !(0 == ~cond); {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {5579#(<= ~counter~0 0)} assume true; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,944 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5579#(<= ~counter~0 0)} {5579#(<= ~counter~0 0)} #92#return; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {5579#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:10,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {5579#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5628#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:10,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {5628#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {5628#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:10,947 INFO L272 TraceCheckUtils]: 19: Hoare triple {5628#(<= ~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)); {5628#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:10,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {5628#(<= ~counter~0 1)} ~cond := #in~cond; {5628#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:10,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {5628#(<= ~counter~0 1)} assume !(0 == ~cond); {5628#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:10,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {5628#(<= ~counter~0 1)} assume true; {5628#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:10,949 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5628#(<= ~counter~0 1)} {5628#(<= ~counter~0 1)} #94#return; {5628#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:10,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {5628#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5628#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:10,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {5628#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5653#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:10,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {5653#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {5653#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:10,951 INFO L272 TraceCheckUtils]: 27: Hoare triple {5653#(<= ~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)); {5653#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:10,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {5653#(<= ~counter~0 2)} ~cond := #in~cond; {5653#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:10,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {5653#(<= ~counter~0 2)} assume !(0 == ~cond); {5653#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:10,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {5653#(<= ~counter~0 2)} assume true; {5653#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:10,952 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5653#(<= ~counter~0 2)} {5653#(<= ~counter~0 2)} #96#return; {5653#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:10,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {5653#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5653#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:10,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {5653#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5678#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:10,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {5678#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {5678#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:10,954 INFO L272 TraceCheckUtils]: 35: Hoare triple {5678#(<= ~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)); {5678#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:10,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {5678#(<= ~counter~0 3)} ~cond := #in~cond; {5678#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:10,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {5678#(<= ~counter~0 3)} assume !(0 == ~cond); {5678#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:10,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {5678#(<= ~counter~0 3)} assume true; {5678#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:10,956 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5678#(<= ~counter~0 3)} {5678#(<= ~counter~0 3)} #96#return; {5678#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:10,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {5678#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5678#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:10,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {5678#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5703#(<= |main_#t~post7| 3)} is VALID [2022-04-15 15:12:10,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {5703#(<= |main_#t~post7| 3)} assume !(#t~post7 < 20);havoc #t~post7; {5572#false} is VALID [2022-04-15 15:12:10,958 INFO L290 TraceCheckUtils]: 43: Hoare triple {5572#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5572#false} is VALID [2022-04-15 15:12:10,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {5572#false} assume !(#t~post8 < 20);havoc #t~post8; {5572#false} is VALID [2022-04-15 15:12:10,958 INFO L290 TraceCheckUtils]: 45: Hoare triple {5572#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5572#false} is VALID [2022-04-15 15:12:10,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {5572#false} assume !(#t~post6 < 20);havoc #t~post6; {5572#false} is VALID [2022-04-15 15:12:10,958 INFO L272 TraceCheckUtils]: 47: Hoare triple {5572#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5572#false} is VALID [2022-04-15 15:12:10,958 INFO L290 TraceCheckUtils]: 48: Hoare triple {5572#false} ~cond := #in~cond; {5572#false} is VALID [2022-04-15 15:12:10,958 INFO L290 TraceCheckUtils]: 49: Hoare triple {5572#false} assume 0 == ~cond; {5572#false} is VALID [2022-04-15 15:12:10,958 INFO L290 TraceCheckUtils]: 50: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-04-15 15:12:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:10,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:11,240 INFO L290 TraceCheckUtils]: 50: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-04-15 15:12:11,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {5572#false} assume 0 == ~cond; {5572#false} is VALID [2022-04-15 15:12:11,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {5572#false} ~cond := #in~cond; {5572#false} is VALID [2022-04-15 15:12:11,240 INFO L272 TraceCheckUtils]: 47: Hoare triple {5572#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5572#false} is VALID [2022-04-15 15:12:11,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {5572#false} assume !(#t~post6 < 20);havoc #t~post6; {5572#false} is VALID [2022-04-15 15:12:11,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {5572#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5572#false} is VALID [2022-04-15 15:12:11,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {5572#false} assume !(#t~post8 < 20);havoc #t~post8; {5572#false} is VALID [2022-04-15 15:12:11,241 INFO L290 TraceCheckUtils]: 43: Hoare triple {5572#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5572#false} is VALID [2022-04-15 15:12:11,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {5755#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {5572#false} is VALID [2022-04-15 15:12:11,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {5759#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5755#(< |main_#t~post7| 20)} is VALID [2022-04-15 15:12:11,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {5759#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5759#(< ~counter~0 20)} is VALID [2022-04-15 15:12:11,245 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5571#true} {5759#(< ~counter~0 20)} #96#return; {5759#(< ~counter~0 20)} is VALID [2022-04-15 15:12:11,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 15:12:11,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {5571#true} assume !(0 == ~cond); {5571#true} is VALID [2022-04-15 15:12:11,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {5571#true} ~cond := #in~cond; {5571#true} is VALID [2022-04-15 15:12:11,245 INFO L272 TraceCheckUtils]: 35: Hoare triple {5759#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5571#true} is VALID [2022-04-15 15:12:11,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {5759#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {5759#(< ~counter~0 20)} is VALID [2022-04-15 15:12:11,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {5784#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5759#(< ~counter~0 20)} is VALID [2022-04-15 15:12:11,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {5784#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5784#(< ~counter~0 19)} is VALID [2022-04-15 15:12:11,246 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5571#true} {5784#(< ~counter~0 19)} #96#return; {5784#(< ~counter~0 19)} is VALID [2022-04-15 15:12:11,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 15:12:11,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {5571#true} assume !(0 == ~cond); {5571#true} is VALID [2022-04-15 15:12:11,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {5571#true} ~cond := #in~cond; {5571#true} is VALID [2022-04-15 15:12:11,247 INFO L272 TraceCheckUtils]: 27: Hoare triple {5784#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5571#true} is VALID [2022-04-15 15:12:11,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {5784#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {5784#(< ~counter~0 19)} is VALID [2022-04-15 15:12:11,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {5809#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5784#(< ~counter~0 19)} is VALID [2022-04-15 15:12:11,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {5809#(< ~counter~0 18)} assume !!(0 != ~r~0); {5809#(< ~counter~0 18)} is VALID [2022-04-15 15:12:11,249 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5571#true} {5809#(< ~counter~0 18)} #94#return; {5809#(< ~counter~0 18)} is VALID [2022-04-15 15:12:11,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 15:12:11,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {5571#true} assume !(0 == ~cond); {5571#true} is VALID [2022-04-15 15:12:11,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {5571#true} ~cond := #in~cond; {5571#true} is VALID [2022-04-15 15:12:11,250 INFO L272 TraceCheckUtils]: 19: Hoare triple {5809#(< ~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)); {5571#true} is VALID [2022-04-15 15:12:11,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {5809#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {5809#(< ~counter~0 18)} is VALID [2022-04-15 15:12:11,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {5834#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5809#(< ~counter~0 18)} is VALID [2022-04-15 15:12:11,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {5834#(< ~counter~0 17)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5834#(< ~counter~0 17)} is VALID [2022-04-15 15:12:11,251 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5571#true} {5834#(< ~counter~0 17)} #92#return; {5834#(< ~counter~0 17)} is VALID [2022-04-15 15:12:11,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 15:12:11,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {5571#true} assume !(0 == ~cond); {5571#true} is VALID [2022-04-15 15:12:11,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {5571#true} ~cond := #in~cond; {5571#true} is VALID [2022-04-15 15:12:11,251 INFO L272 TraceCheckUtils]: 11: Hoare triple {5834#(< ~counter~0 17)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {5571#true} is VALID [2022-04-15 15:12:11,252 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5571#true} {5834#(< ~counter~0 17)} #90#return; {5834#(< ~counter~0 17)} is VALID [2022-04-15 15:12:11,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 15:12:11,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {5571#true} assume !(0 == ~cond); {5571#true} is VALID [2022-04-15 15:12:11,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {5571#true} ~cond := #in~cond; {5571#true} is VALID [2022-04-15 15:12:11,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {5834#(< ~counter~0 17)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5571#true} is VALID [2022-04-15 15:12:11,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {5834#(< ~counter~0 17)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5834#(< ~counter~0 17)} is VALID [2022-04-15 15:12:11,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {5834#(< ~counter~0 17)} call #t~ret9 := main(); {5834#(< ~counter~0 17)} is VALID [2022-04-15 15:12:11,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5834#(< ~counter~0 17)} {5571#true} #102#return; {5834#(< ~counter~0 17)} is VALID [2022-04-15 15:12:11,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {5834#(< ~counter~0 17)} assume true; {5834#(< ~counter~0 17)} is VALID [2022-04-15 15:12:11,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5834#(< ~counter~0 17)} is VALID [2022-04-15 15:12:11,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {5571#true} call ULTIMATE.init(); {5571#true} is VALID [2022-04-15 15:12:11,254 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 15:12:11,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:11,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309363656] [2022-04-15 15:12:11,254 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:11,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560695354] [2022-04-15 15:12:11,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560695354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:11,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:11,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 15:12:11,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:11,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42955890] [2022-04-15 15:12:11,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42955890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:11,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:11,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 15:12:11,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694767807] [2022-04-15 15:12:11,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-15 15:12:11,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:11,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:12:11,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:11,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 15:12:11,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:11,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 15:12:11,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 15:12:11,292 INFO L87 Difference]: Start difference. First operand 114 states and 145 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:12:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:11,539 INFO L93 Difference]: Finished difference Result 153 states and 200 transitions. [2022-04-15 15:12:11,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:12:11,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-15 15:12:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:12:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 15:12:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:12:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 15:12:11,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-15 15:12:11,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:11,626 INFO L225 Difference]: With dead ends: 153 [2022-04-15 15:12:11,626 INFO L226 Difference]: Without dead ends: 116 [2022-04-15 15:12:11,627 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-15 15:12:11,627 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:11,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 133 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:12:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-15 15:12:11,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-15 15:12:11,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:11,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 15:12:11,708 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 15:12:11,708 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 15:12:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:11,711 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-15 15:12:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-04-15 15:12:11,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:11,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:11,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 116 states. [2022-04-15 15:12:11,712 INFO L87 Difference]: Start difference. First operand has 116 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 116 states. [2022-04-15 15:12:11,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:11,714 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-15 15:12:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-04-15 15:12:11,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:11,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:11,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:11,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 15:12:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2022-04-15 15:12:11,718 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 51 [2022-04-15 15:12:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:11,718 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2022-04-15 15:12:11,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:12:11,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 147 transitions. [2022-04-15 15:12:16,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 146 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-04-15 15:12:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 15:12:16,288 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:16,288 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:16,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:16,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 15:12:16,492 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:16,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-15 15:12:16,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:16,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1921763998] [2022-04-15 15:12:16,493 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-15 15:12:16,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:16,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007019323] [2022-04-15 15:12:16,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:16,504 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:16,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834521598] [2022-04-15 15:12:16,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:16,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:16,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:16,505 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:16,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 15:12:16,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:16,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:16,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:12:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:16,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:16,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {6662#true} call ULTIMATE.init(); {6662#true} is VALID [2022-04-15 15:12:16,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {6662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {6670#(<= ~counter~0 0)} assume true; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6670#(<= ~counter~0 0)} {6662#true} #102#return; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {6670#(<= ~counter~0 0)} call #t~ret9 := main(); {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {6670#(<= ~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; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,869 INFO L272 TraceCheckUtils]: 6: Hoare triple {6670#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {6670#(<= ~counter~0 0)} ~cond := #in~cond; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {6670#(<= ~counter~0 0)} assume !(0 == ~cond); {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {6670#(<= ~counter~0 0)} assume true; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,871 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6670#(<= ~counter~0 0)} {6670#(<= ~counter~0 0)} #90#return; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,871 INFO L272 TraceCheckUtils]: 11: Hoare triple {6670#(<= ~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)); {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {6670#(<= ~counter~0 0)} ~cond := #in~cond; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {6670#(<= ~counter~0 0)} assume !(0 == ~cond); {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {6670#(<= ~counter~0 0)} assume true; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,872 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6670#(<= ~counter~0 0)} {6670#(<= ~counter~0 0)} #92#return; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {6670#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:16,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {6670#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:16,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {6719#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:16,874 INFO L272 TraceCheckUtils]: 19: Hoare triple {6719#(<= ~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)); {6719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:16,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {6719#(<= ~counter~0 1)} ~cond := #in~cond; {6719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:16,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {6719#(<= ~counter~0 1)} assume !(0 == ~cond); {6719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:16,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {6719#(<= ~counter~0 1)} assume true; {6719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:16,888 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6719#(<= ~counter~0 1)} {6719#(<= ~counter~0 1)} #94#return; {6719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:16,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {6719#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:16,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {6719#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:16,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {6744#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {6744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:16,890 INFO L272 TraceCheckUtils]: 27: Hoare triple {6744#(<= ~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)); {6744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:16,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {6744#(<= ~counter~0 2)} ~cond := #in~cond; {6744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:16,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {6744#(<= ~counter~0 2)} assume !(0 == ~cond); {6744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:16,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {6744#(<= ~counter~0 2)} assume true; {6744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:16,891 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6744#(<= ~counter~0 2)} {6744#(<= ~counter~0 2)} #96#return; {6744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:16,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {6744#(<= ~counter~0 2)} assume !(~r~0 > 0); {6744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:16,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {6744#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:16,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {6769#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {6769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:16,893 INFO L272 TraceCheckUtils]: 35: Hoare triple {6769#(<= ~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)); {6769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:16,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {6769#(<= ~counter~0 3)} ~cond := #in~cond; {6769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:16,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {6769#(<= ~counter~0 3)} assume !(0 == ~cond); {6769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:16,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {6769#(<= ~counter~0 3)} assume true; {6769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:16,894 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6769#(<= ~counter~0 3)} {6769#(<= ~counter~0 3)} #98#return; {6769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:16,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {6769#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:16,895 INFO L290 TraceCheckUtils]: 41: Hoare triple {6769#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:16,895 INFO L290 TraceCheckUtils]: 42: Hoare triple {6794#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {6794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:16,896 INFO L272 TraceCheckUtils]: 43: Hoare triple {6794#(<= ~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)); {6794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:16,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {6794#(<= ~counter~0 4)} ~cond := #in~cond; {6794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:16,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {6794#(<= ~counter~0 4)} assume !(0 == ~cond); {6794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:16,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {6794#(<= ~counter~0 4)} assume true; {6794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:16,897 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6794#(<= ~counter~0 4)} {6794#(<= ~counter~0 4)} #98#return; {6794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:16,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {6794#(<= ~counter~0 4)} assume !(~r~0 < 0); {6794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:16,898 INFO L290 TraceCheckUtils]: 49: Hoare triple {6794#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6819#(<= |main_#t~post6| 4)} is VALID [2022-04-15 15:12:16,898 INFO L290 TraceCheckUtils]: 50: Hoare triple {6819#(<= |main_#t~post6| 4)} assume !(#t~post6 < 20);havoc #t~post6; {6663#false} is VALID [2022-04-15 15:12:16,898 INFO L272 TraceCheckUtils]: 51: Hoare triple {6663#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6663#false} is VALID [2022-04-15 15:12:16,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {6663#false} ~cond := #in~cond; {6663#false} is VALID [2022-04-15 15:12:16,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {6663#false} assume 0 == ~cond; {6663#false} is VALID [2022-04-15 15:12:16,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {6663#false} assume !false; {6663#false} is VALID [2022-04-15 15:12:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:16,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:17,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {6663#false} assume !false; {6663#false} is VALID [2022-04-15 15:12:17,186 INFO L290 TraceCheckUtils]: 53: Hoare triple {6663#false} assume 0 == ~cond; {6663#false} is VALID [2022-04-15 15:12:17,186 INFO L290 TraceCheckUtils]: 52: Hoare triple {6663#false} ~cond := #in~cond; {6663#false} is VALID [2022-04-15 15:12:17,186 INFO L272 TraceCheckUtils]: 51: Hoare triple {6663#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6663#false} is VALID [2022-04-15 15:12:17,186 INFO L290 TraceCheckUtils]: 50: Hoare triple {6847#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {6663#false} is VALID [2022-04-15 15:12:17,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {6851#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6847#(< |main_#t~post6| 20)} is VALID [2022-04-15 15:12:17,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {6851#(< ~counter~0 20)} assume !(~r~0 < 0); {6851#(< ~counter~0 20)} is VALID [2022-04-15 15:12:17,188 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6662#true} {6851#(< ~counter~0 20)} #98#return; {6851#(< ~counter~0 20)} is VALID [2022-04-15 15:12:17,188 INFO L290 TraceCheckUtils]: 46: Hoare triple {6662#true} assume true; {6662#true} is VALID [2022-04-15 15:12:17,188 INFO L290 TraceCheckUtils]: 45: Hoare triple {6662#true} assume !(0 == ~cond); {6662#true} is VALID [2022-04-15 15:12:17,188 INFO L290 TraceCheckUtils]: 44: Hoare triple {6662#true} ~cond := #in~cond; {6662#true} is VALID [2022-04-15 15:12:17,188 INFO L272 TraceCheckUtils]: 43: Hoare triple {6851#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6662#true} is VALID [2022-04-15 15:12:17,189 INFO L290 TraceCheckUtils]: 42: Hoare triple {6851#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {6851#(< ~counter~0 20)} is VALID [2022-04-15 15:12:17,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {6876#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6851#(< ~counter~0 20)} is VALID [2022-04-15 15:12:17,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {6876#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6876#(< ~counter~0 19)} is VALID [2022-04-15 15:12:17,190 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6662#true} {6876#(< ~counter~0 19)} #98#return; {6876#(< ~counter~0 19)} is VALID [2022-04-15 15:12:17,190 INFO L290 TraceCheckUtils]: 38: Hoare triple {6662#true} assume true; {6662#true} is VALID [2022-04-15 15:12:17,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {6662#true} assume !(0 == ~cond); {6662#true} is VALID [2022-04-15 15:12:17,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {6662#true} ~cond := #in~cond; {6662#true} is VALID [2022-04-15 15:12:17,190 INFO L272 TraceCheckUtils]: 35: Hoare triple {6876#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6662#true} is VALID [2022-04-15 15:12:17,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {6876#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {6876#(< ~counter~0 19)} is VALID [2022-04-15 15:12:17,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {6901#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6876#(< ~counter~0 19)} is VALID [2022-04-15 15:12:17,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {6901#(< ~counter~0 18)} assume !(~r~0 > 0); {6901#(< ~counter~0 18)} is VALID [2022-04-15 15:12:17,193 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6662#true} {6901#(< ~counter~0 18)} #96#return; {6901#(< ~counter~0 18)} is VALID [2022-04-15 15:12:17,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {6662#true} assume true; {6662#true} is VALID [2022-04-15 15:12:17,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {6662#true} assume !(0 == ~cond); {6662#true} is VALID [2022-04-15 15:12:17,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {6662#true} ~cond := #in~cond; {6662#true} is VALID [2022-04-15 15:12:17,193 INFO L272 TraceCheckUtils]: 27: Hoare triple {6901#(< ~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)); {6662#true} is VALID [2022-04-15 15:12:17,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {6901#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {6901#(< ~counter~0 18)} is VALID [2022-04-15 15:12:17,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {6926#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6901#(< ~counter~0 18)} is VALID [2022-04-15 15:12:17,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {6926#(< ~counter~0 17)} assume !!(0 != ~r~0); {6926#(< ~counter~0 17)} is VALID [2022-04-15 15:12:17,195 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6662#true} {6926#(< ~counter~0 17)} #94#return; {6926#(< ~counter~0 17)} is VALID [2022-04-15 15:12:17,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {6662#true} assume true; {6662#true} is VALID [2022-04-15 15:12:17,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {6662#true} assume !(0 == ~cond); {6662#true} is VALID [2022-04-15 15:12:17,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {6662#true} ~cond := #in~cond; {6662#true} is VALID [2022-04-15 15:12:17,196 INFO L272 TraceCheckUtils]: 19: Hoare triple {6926#(< ~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)); {6662#true} is VALID [2022-04-15 15:12:17,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {6926#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {6926#(< ~counter~0 17)} is VALID [2022-04-15 15:12:17,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {6951#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6926#(< ~counter~0 17)} is VALID [2022-04-15 15:12:17,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {6951#(< ~counter~0 16)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6951#(< ~counter~0 16)} is VALID [2022-04-15 15:12:17,198 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6662#true} {6951#(< ~counter~0 16)} #92#return; {6951#(< ~counter~0 16)} is VALID [2022-04-15 15:12:17,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {6662#true} assume true; {6662#true} is VALID [2022-04-15 15:12:17,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {6662#true} assume !(0 == ~cond); {6662#true} is VALID [2022-04-15 15:12:17,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {6662#true} ~cond := #in~cond; {6662#true} is VALID [2022-04-15 15:12:17,198 INFO L272 TraceCheckUtils]: 11: Hoare triple {6951#(< ~counter~0 16)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {6662#true} is VALID [2022-04-15 15:12:17,199 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6662#true} {6951#(< ~counter~0 16)} #90#return; {6951#(< ~counter~0 16)} is VALID [2022-04-15 15:12:17,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {6662#true} assume true; {6662#true} is VALID [2022-04-15 15:12:17,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {6662#true} assume !(0 == ~cond); {6662#true} is VALID [2022-04-15 15:12:17,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {6662#true} ~cond := #in~cond; {6662#true} is VALID [2022-04-15 15:12:17,199 INFO L272 TraceCheckUtils]: 6: Hoare triple {6951#(< ~counter~0 16)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6662#true} is VALID [2022-04-15 15:12:17,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {6951#(< ~counter~0 16)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {6951#(< ~counter~0 16)} is VALID [2022-04-15 15:12:17,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {6951#(< ~counter~0 16)} call #t~ret9 := main(); {6951#(< ~counter~0 16)} is VALID [2022-04-15 15:12:17,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6951#(< ~counter~0 16)} {6662#true} #102#return; {6951#(< ~counter~0 16)} is VALID [2022-04-15 15:12:17,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {6951#(< ~counter~0 16)} assume true; {6951#(< ~counter~0 16)} is VALID [2022-04-15 15:12:17,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {6662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6951#(< ~counter~0 16)} is VALID [2022-04-15 15:12:17,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {6662#true} call ULTIMATE.init(); {6662#true} is VALID [2022-04-15 15:12:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 15:12:17,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:17,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007019323] [2022-04-15 15:12:17,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:17,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834521598] [2022-04-15 15:12:17,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834521598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:17,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:17,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 15:12:17,203 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:17,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1921763998] [2022-04-15 15:12:17,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1921763998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:17,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:17,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:12:17,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115644157] [2022-04-15 15:12:17,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:17,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-15 15:12:17,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:17,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:17,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:17,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:12:17,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:17,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:12:17,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:12:17,244 INFO L87 Difference]: Start difference. First operand 116 states and 147 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:17,558 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-04-15 15:12:17,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:12:17,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-15 15:12:17,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 15:12:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 15:12:17,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-15 15:12:17,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:17,641 INFO L225 Difference]: With dead ends: 142 [2022-04-15 15:12:17,641 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 15:12:17,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-15 15:12:17,642 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:17,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 160 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:12:17,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 15:12:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2022-04-15 15:12:17,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:17,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 133 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:12:17,746 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 133 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:12:17,746 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 133 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:12:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:17,749 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2022-04-15 15:12:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 172 transitions. [2022-04-15 15:12:17,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:17,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:17,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 137 states. [2022-04-15 15:12:17,750 INFO L87 Difference]: Start difference. First operand has 133 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 137 states. [2022-04-15 15:12:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:17,753 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2022-04-15 15:12:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 172 transitions. [2022-04-15 15:12:17,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:17,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:17,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:17,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:12:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 167 transitions. [2022-04-15 15:12:17,758 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 167 transitions. Word has length 55 [2022-04-15 15:12:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:17,758 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 167 transitions. [2022-04-15 15:12:17,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:17,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 167 transitions. [2022-04-15 15:12:25,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 164 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 167 transitions. [2022-04-15 15:12:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 15:12:25,774 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:25,774 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:25,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:25,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 15:12:25,979 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-15 15:12:25,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:25,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [493462573] [2022-04-15 15:12:25,980 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:25,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-15 15:12:25,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:25,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200388676] [2022-04-15 15:12:25,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:25,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:25,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:25,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406117006] [2022-04-15 15:12:25,994 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:12:25,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:25,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:25,995 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:26,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 15:12:26,076 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:12:26,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:26,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:12:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:26,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:26,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {7831#true} call ULTIMATE.init(); {7831#true} is VALID [2022-04-15 15:12:26,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {7831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {7839#(<= ~counter~0 0)} assume true; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7839#(<= ~counter~0 0)} {7831#true} #102#return; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {7839#(<= ~counter~0 0)} call #t~ret9 := main(); {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {7839#(<= ~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; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {7839#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {7839#(<= ~counter~0 0)} ~cond := #in~cond; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {7839#(<= ~counter~0 0)} assume !(0 == ~cond); {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {7839#(<= ~counter~0 0)} assume true; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7839#(<= ~counter~0 0)} {7839#(<= ~counter~0 0)} #90#return; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,412 INFO L272 TraceCheckUtils]: 11: Hoare triple {7839#(<= ~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)); {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {7839#(<= ~counter~0 0)} ~cond := #in~cond; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {7839#(<= ~counter~0 0)} assume !(0 == ~cond); {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {7839#(<= ~counter~0 0)} assume true; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,415 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7839#(<= ~counter~0 0)} {7839#(<= ~counter~0 0)} #92#return; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {7839#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:26,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {7839#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7888#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:26,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {7888#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {7888#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:26,416 INFO L272 TraceCheckUtils]: 19: Hoare triple {7888#(<= ~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)); {7888#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:26,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {7888#(<= ~counter~0 1)} ~cond := #in~cond; {7888#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:26,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {7888#(<= ~counter~0 1)} assume !(0 == ~cond); {7888#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:26,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {7888#(<= ~counter~0 1)} assume true; {7888#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:26,418 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7888#(<= ~counter~0 1)} {7888#(<= ~counter~0 1)} #94#return; {7888#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:26,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {7888#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7888#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:26,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {7888#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7913#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:26,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {7913#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {7913#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:26,419 INFO L272 TraceCheckUtils]: 27: Hoare triple {7913#(<= ~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)); {7913#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:26,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {7913#(<= ~counter~0 2)} ~cond := #in~cond; {7913#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:26,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {7913#(<= ~counter~0 2)} assume !(0 == ~cond); {7913#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:26,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {7913#(<= ~counter~0 2)} assume true; {7913#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:26,421 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7913#(<= ~counter~0 2)} {7913#(<= ~counter~0 2)} #96#return; {7913#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:26,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {7913#(<= ~counter~0 2)} assume !(~r~0 > 0); {7913#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:26,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {7913#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7938#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:26,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {7938#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {7938#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:26,422 INFO L272 TraceCheckUtils]: 35: Hoare triple {7938#(<= ~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)); {7938#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:26,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {7938#(<= ~counter~0 3)} ~cond := #in~cond; {7938#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:26,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {7938#(<= ~counter~0 3)} assume !(0 == ~cond); {7938#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:26,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {7938#(<= ~counter~0 3)} assume true; {7938#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:26,423 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7938#(<= ~counter~0 3)} {7938#(<= ~counter~0 3)} #98#return; {7938#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:26,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {7938#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7938#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:26,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {7938#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7963#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:26,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {7963#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {7963#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:26,425 INFO L272 TraceCheckUtils]: 43: Hoare triple {7963#(<= ~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)); {7963#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:26,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {7963#(<= ~counter~0 4)} ~cond := #in~cond; {7963#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:26,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {7963#(<= ~counter~0 4)} assume !(0 == ~cond); {7963#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:26,426 INFO L290 TraceCheckUtils]: 46: Hoare triple {7963#(<= ~counter~0 4)} assume true; {7963#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:26,426 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7963#(<= ~counter~0 4)} {7963#(<= ~counter~0 4)} #98#return; {7963#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:26,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {7963#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7963#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:26,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {7963#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7988#(<= |main_#t~post8| 4)} is VALID [2022-04-15 15:12:26,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {7988#(<= |main_#t~post8| 4)} assume !(#t~post8 < 20);havoc #t~post8; {7832#false} is VALID [2022-04-15 15:12:26,427 INFO L290 TraceCheckUtils]: 51: Hoare triple {7832#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7832#false} is VALID [2022-04-15 15:12:26,428 INFO L290 TraceCheckUtils]: 52: Hoare triple {7832#false} assume !(#t~post6 < 20);havoc #t~post6; {7832#false} is VALID [2022-04-15 15:12:26,428 INFO L272 TraceCheckUtils]: 53: Hoare triple {7832#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7832#false} is VALID [2022-04-15 15:12:26,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {7832#false} ~cond := #in~cond; {7832#false} is VALID [2022-04-15 15:12:26,428 INFO L290 TraceCheckUtils]: 55: Hoare triple {7832#false} assume 0 == ~cond; {7832#false} is VALID [2022-04-15 15:12:26,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {7832#false} assume !false; {7832#false} is VALID [2022-04-15 15:12:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:26,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:26,710 INFO L290 TraceCheckUtils]: 56: Hoare triple {7832#false} assume !false; {7832#false} is VALID [2022-04-15 15:12:26,710 INFO L290 TraceCheckUtils]: 55: Hoare triple {7832#false} assume 0 == ~cond; {7832#false} is VALID [2022-04-15 15:12:26,710 INFO L290 TraceCheckUtils]: 54: Hoare triple {7832#false} ~cond := #in~cond; {7832#false} is VALID [2022-04-15 15:12:26,710 INFO L272 TraceCheckUtils]: 53: Hoare triple {7832#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7832#false} is VALID [2022-04-15 15:12:26,710 INFO L290 TraceCheckUtils]: 52: Hoare triple {7832#false} assume !(#t~post6 < 20);havoc #t~post6; {7832#false} is VALID [2022-04-15 15:12:26,710 INFO L290 TraceCheckUtils]: 51: Hoare triple {7832#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7832#false} is VALID [2022-04-15 15:12:26,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {8028#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {7832#false} is VALID [2022-04-15 15:12:26,711 INFO L290 TraceCheckUtils]: 49: Hoare triple {8032#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8028#(< |main_#t~post8| 20)} is VALID [2022-04-15 15:12:26,711 INFO L290 TraceCheckUtils]: 48: Hoare triple {8032#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8032#(< ~counter~0 20)} is VALID [2022-04-15 15:12:26,712 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7831#true} {8032#(< ~counter~0 20)} #98#return; {8032#(< ~counter~0 20)} is VALID [2022-04-15 15:12:26,712 INFO L290 TraceCheckUtils]: 46: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-15 15:12:26,712 INFO L290 TraceCheckUtils]: 45: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-15 15:12:26,712 INFO L290 TraceCheckUtils]: 44: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-15 15:12:26,712 INFO L272 TraceCheckUtils]: 43: Hoare triple {8032#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7831#true} is VALID [2022-04-15 15:12:26,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {8032#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {8032#(< ~counter~0 20)} is VALID [2022-04-15 15:12:26,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {8057#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8032#(< ~counter~0 20)} is VALID [2022-04-15 15:12:26,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {8057#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8057#(< ~counter~0 19)} is VALID [2022-04-15 15:12:26,714 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7831#true} {8057#(< ~counter~0 19)} #98#return; {8057#(< ~counter~0 19)} is VALID [2022-04-15 15:12:26,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-15 15:12:26,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-15 15:12:26,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-15 15:12:26,714 INFO L272 TraceCheckUtils]: 35: Hoare triple {8057#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7831#true} is VALID [2022-04-15 15:12:26,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {8057#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {8057#(< ~counter~0 19)} is VALID [2022-04-15 15:12:26,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {8082#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8057#(< ~counter~0 19)} is VALID [2022-04-15 15:12:26,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {8082#(< ~counter~0 18)} assume !(~r~0 > 0); {8082#(< ~counter~0 18)} is VALID [2022-04-15 15:12:26,730 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7831#true} {8082#(< ~counter~0 18)} #96#return; {8082#(< ~counter~0 18)} is VALID [2022-04-15 15:12:26,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-15 15:12:26,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-15 15:12:26,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-15 15:12:26,730 INFO L272 TraceCheckUtils]: 27: Hoare triple {8082#(< ~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)); {7831#true} is VALID [2022-04-15 15:12:26,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {8082#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {8082#(< ~counter~0 18)} is VALID [2022-04-15 15:12:26,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {8107#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8082#(< ~counter~0 18)} is VALID [2022-04-15 15:12:26,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {8107#(< ~counter~0 17)} assume !!(0 != ~r~0); {8107#(< ~counter~0 17)} is VALID [2022-04-15 15:12:26,738 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7831#true} {8107#(< ~counter~0 17)} #94#return; {8107#(< ~counter~0 17)} is VALID [2022-04-15 15:12:26,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-15 15:12:26,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-15 15:12:26,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-15 15:12:26,739 INFO L272 TraceCheckUtils]: 19: Hoare triple {8107#(< ~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)); {7831#true} is VALID [2022-04-15 15:12:26,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {8107#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {8107#(< ~counter~0 17)} is VALID [2022-04-15 15:12:26,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {8132#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8107#(< ~counter~0 17)} is VALID [2022-04-15 15:12:26,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {8132#(< ~counter~0 16)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8132#(< ~counter~0 16)} is VALID [2022-04-15 15:12:26,741 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7831#true} {8132#(< ~counter~0 16)} #92#return; {8132#(< ~counter~0 16)} is VALID [2022-04-15 15:12:26,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-15 15:12:26,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-15 15:12:26,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-15 15:12:26,742 INFO L272 TraceCheckUtils]: 11: Hoare triple {8132#(< ~counter~0 16)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {7831#true} is VALID [2022-04-15 15:12:26,743 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7831#true} {8132#(< ~counter~0 16)} #90#return; {8132#(< ~counter~0 16)} is VALID [2022-04-15 15:12:26,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-15 15:12:26,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-15 15:12:26,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-15 15:12:26,743 INFO L272 TraceCheckUtils]: 6: Hoare triple {8132#(< ~counter~0 16)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7831#true} is VALID [2022-04-15 15:12:26,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {8132#(< ~counter~0 16)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {8132#(< ~counter~0 16)} is VALID [2022-04-15 15:12:26,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {8132#(< ~counter~0 16)} call #t~ret9 := main(); {8132#(< ~counter~0 16)} is VALID [2022-04-15 15:12:26,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8132#(< ~counter~0 16)} {7831#true} #102#return; {8132#(< ~counter~0 16)} is VALID [2022-04-15 15:12:26,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {8132#(< ~counter~0 16)} assume true; {8132#(< ~counter~0 16)} is VALID [2022-04-15 15:12:26,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {7831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8132#(< ~counter~0 16)} is VALID [2022-04-15 15:12:26,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {7831#true} call ULTIMATE.init(); {7831#true} is VALID [2022-04-15 15:12:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 15:12:26,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:26,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200388676] [2022-04-15 15:12:26,746 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:26,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406117006] [2022-04-15 15:12:26,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406117006] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:26,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:26,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 15:12:26,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:26,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [493462573] [2022-04-15 15:12:26,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [493462573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:26,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:26,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:12:26,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645951362] [2022-04-15 15:12:26,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:26,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-15 15:12:26,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:26,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:26,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:26,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:12:26,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:26,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:12:26,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:12:26,786 INFO L87 Difference]: Start difference. First operand 133 states and 167 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:27,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:27,088 INFO L93 Difference]: Finished difference Result 204 states and 269 transitions. [2022-04-15 15:12:27,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 15:12:27,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-15 15:12:27,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 15:12:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 15:12:27,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-15 15:12:27,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:27,175 INFO L225 Difference]: With dead ends: 204 [2022-04-15 15:12:27,175 INFO L226 Difference]: Without dead ends: 139 [2022-04-15 15:12:27,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:12:27,176 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 22 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:27,176 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 174 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:12:27,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-15 15:12:27,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2022-04-15 15:12:27,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:27,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 138 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:12:27,305 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 138 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:12:27,305 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 138 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:12:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:27,309 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2022-04-15 15:12:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2022-04-15 15:12:27,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:27,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:27,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 139 states. [2022-04-15 15:12:27,310 INFO L87 Difference]: Start difference. First operand has 138 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 139 states. [2022-04-15 15:12:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:27,313 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2022-04-15 15:12:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2022-04-15 15:12:27,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:27,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:27,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:27,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:12:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 173 transitions. [2022-04-15 15:12:27,333 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 173 transitions. Word has length 57 [2022-04-15 15:12:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:27,333 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 173 transitions. [2022-04-15 15:12:27,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:27,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 173 transitions. [2022-04-15 15:12:32,843 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-15 15:12:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 173 transitions. [2022-04-15 15:12:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 15:12:32,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:32,844 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:32,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:33,045 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 15:12:33,045 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:33,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:33,045 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-15 15:12:33,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:33,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888868534] [2022-04-15 15:12:33,046 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:33,046 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-15 15:12:33,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:33,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058552287] [2022-04-15 15:12:33,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:33,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:33,057 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:33,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014091055] [2022-04-15 15:12:33,057 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:12:33,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:33,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:33,058 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:33,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 15:12:33,134 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 15:12:33,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:33,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:12:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:33,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:33,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {9152#true} call ULTIMATE.init(); {9152#true} is VALID [2022-04-15 15:12:33,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {9152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {9160#(<= ~counter~0 0)} assume true; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9160#(<= ~counter~0 0)} {9152#true} #102#return; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {9160#(<= ~counter~0 0)} call #t~ret9 := main(); {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {9160#(<= ~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; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {9160#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {9160#(<= ~counter~0 0)} ~cond := #in~cond; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {9160#(<= ~counter~0 0)} assume !(0 == ~cond); {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {9160#(<= ~counter~0 0)} assume true; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,466 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9160#(<= ~counter~0 0)} {9160#(<= ~counter~0 0)} #90#return; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,469 INFO L272 TraceCheckUtils]: 11: Hoare triple {9160#(<= ~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)); {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {9160#(<= ~counter~0 0)} ~cond := #in~cond; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {9160#(<= ~counter~0 0)} assume !(0 == ~cond); {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {9160#(<= ~counter~0 0)} assume true; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,470 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9160#(<= ~counter~0 0)} {9160#(<= ~counter~0 0)} #92#return; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {9160#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {9160#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9209#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {9209#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {9209#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,472 INFO L272 TraceCheckUtils]: 19: Hoare triple {9209#(<= ~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)); {9209#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {9209#(<= ~counter~0 1)} ~cond := #in~cond; {9209#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {9209#(<= ~counter~0 1)} assume !(0 == ~cond); {9209#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {9209#(<= ~counter~0 1)} assume true; {9209#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,474 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9209#(<= ~counter~0 1)} {9209#(<= ~counter~0 1)} #94#return; {9209#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {9209#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9209#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {9209#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9234#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {9234#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {9234#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,476 INFO L272 TraceCheckUtils]: 27: Hoare triple {9234#(<= ~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)); {9234#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {9234#(<= ~counter~0 2)} ~cond := #in~cond; {9234#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {9234#(<= ~counter~0 2)} assume !(0 == ~cond); {9234#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {9234#(<= ~counter~0 2)} assume true; {9234#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,478 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9234#(<= ~counter~0 2)} {9234#(<= ~counter~0 2)} #96#return; {9234#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {9234#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9234#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {9234#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9259#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {9259#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {9259#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,480 INFO L272 TraceCheckUtils]: 35: Hoare triple {9259#(<= ~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)); {9259#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {9259#(<= ~counter~0 3)} ~cond := #in~cond; {9259#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {9259#(<= ~counter~0 3)} assume !(0 == ~cond); {9259#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {9259#(<= ~counter~0 3)} assume true; {9259#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,482 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9259#(<= ~counter~0 3)} {9259#(<= ~counter~0 3)} #96#return; {9259#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {9259#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9259#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,483 INFO L290 TraceCheckUtils]: 41: Hoare triple {9259#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9284#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:33,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {9284#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {9284#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:33,484 INFO L272 TraceCheckUtils]: 43: Hoare triple {9284#(<= ~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)); {9284#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:33,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {9284#(<= ~counter~0 4)} ~cond := #in~cond; {9284#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:33,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {9284#(<= ~counter~0 4)} assume !(0 == ~cond); {9284#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:33,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {9284#(<= ~counter~0 4)} assume true; {9284#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:33,485 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9284#(<= ~counter~0 4)} {9284#(<= ~counter~0 4)} #96#return; {9284#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:33,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {9284#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9284#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:33,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {9284#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9309#(<= |main_#t~post7| 4)} is VALID [2022-04-15 15:12:33,487 INFO L290 TraceCheckUtils]: 50: Hoare triple {9309#(<= |main_#t~post7| 4)} assume !(#t~post7 < 20);havoc #t~post7; {9153#false} is VALID [2022-04-15 15:12:33,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {9153#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9153#false} is VALID [2022-04-15 15:12:33,487 INFO L290 TraceCheckUtils]: 52: Hoare triple {9153#false} assume !(#t~post8 < 20);havoc #t~post8; {9153#false} is VALID [2022-04-15 15:12:33,487 INFO L290 TraceCheckUtils]: 53: Hoare triple {9153#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9153#false} is VALID [2022-04-15 15:12:33,487 INFO L290 TraceCheckUtils]: 54: Hoare triple {9153#false} assume !(#t~post6 < 20);havoc #t~post6; {9153#false} is VALID [2022-04-15 15:12:33,487 INFO L272 TraceCheckUtils]: 55: Hoare triple {9153#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9153#false} is VALID [2022-04-15 15:12:33,487 INFO L290 TraceCheckUtils]: 56: Hoare triple {9153#false} ~cond := #in~cond; {9153#false} is VALID [2022-04-15 15:12:33,487 INFO L290 TraceCheckUtils]: 57: Hoare triple {9153#false} assume 0 == ~cond; {9153#false} is VALID [2022-04-15 15:12:33,487 INFO L290 TraceCheckUtils]: 58: Hoare triple {9153#false} assume !false; {9153#false} is VALID [2022-04-15 15:12:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:33,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:33,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {9153#false} assume !false; {9153#false} is VALID [2022-04-15 15:12:33,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {9153#false} assume 0 == ~cond; {9153#false} is VALID [2022-04-15 15:12:33,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {9153#false} ~cond := #in~cond; {9153#false} is VALID [2022-04-15 15:12:33,798 INFO L272 TraceCheckUtils]: 55: Hoare triple {9153#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9153#false} is VALID [2022-04-15 15:12:33,798 INFO L290 TraceCheckUtils]: 54: Hoare triple {9153#false} assume !(#t~post6 < 20);havoc #t~post6; {9153#false} is VALID [2022-04-15 15:12:33,798 INFO L290 TraceCheckUtils]: 53: Hoare triple {9153#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9153#false} is VALID [2022-04-15 15:12:33,798 INFO L290 TraceCheckUtils]: 52: Hoare triple {9153#false} assume !(#t~post8 < 20);havoc #t~post8; {9153#false} is VALID [2022-04-15 15:12:33,798 INFO L290 TraceCheckUtils]: 51: Hoare triple {9153#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9153#false} is VALID [2022-04-15 15:12:33,798 INFO L290 TraceCheckUtils]: 50: Hoare triple {9361#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {9153#false} is VALID [2022-04-15 15:12:33,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {9365#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9361#(< |main_#t~post7| 20)} is VALID [2022-04-15 15:12:33,799 INFO L290 TraceCheckUtils]: 48: Hoare triple {9365#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9365#(< ~counter~0 20)} is VALID [2022-04-15 15:12:33,799 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9152#true} {9365#(< ~counter~0 20)} #96#return; {9365#(< ~counter~0 20)} is VALID [2022-04-15 15:12:33,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 15:12:33,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {9152#true} assume !(0 == ~cond); {9152#true} is VALID [2022-04-15 15:12:33,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {9152#true} ~cond := #in~cond; {9152#true} is VALID [2022-04-15 15:12:33,800 INFO L272 TraceCheckUtils]: 43: Hoare triple {9365#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9152#true} is VALID [2022-04-15 15:12:33,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {9365#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {9365#(< ~counter~0 20)} is VALID [2022-04-15 15:12:33,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {9390#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9365#(< ~counter~0 20)} is VALID [2022-04-15 15:12:33,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {9390#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9390#(< ~counter~0 19)} is VALID [2022-04-15 15:12:33,801 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9152#true} {9390#(< ~counter~0 19)} #96#return; {9390#(< ~counter~0 19)} is VALID [2022-04-15 15:12:33,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 15:12:33,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {9152#true} assume !(0 == ~cond); {9152#true} is VALID [2022-04-15 15:12:33,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {9152#true} ~cond := #in~cond; {9152#true} is VALID [2022-04-15 15:12:33,802 INFO L272 TraceCheckUtils]: 35: Hoare triple {9390#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9152#true} is VALID [2022-04-15 15:12:33,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {9390#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {9390#(< ~counter~0 19)} is VALID [2022-04-15 15:12:33,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {9415#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9390#(< ~counter~0 19)} is VALID [2022-04-15 15:12:33,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {9415#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9415#(< ~counter~0 18)} is VALID [2022-04-15 15:12:33,818 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9152#true} {9415#(< ~counter~0 18)} #96#return; {9415#(< ~counter~0 18)} is VALID [2022-04-15 15:12:33,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 15:12:33,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {9152#true} assume !(0 == ~cond); {9152#true} is VALID [2022-04-15 15:12:33,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {9152#true} ~cond := #in~cond; {9152#true} is VALID [2022-04-15 15:12:33,818 INFO L272 TraceCheckUtils]: 27: Hoare triple {9415#(< ~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)); {9152#true} is VALID [2022-04-15 15:12:33,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {9415#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {9415#(< ~counter~0 18)} is VALID [2022-04-15 15:12:33,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {9440#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9415#(< ~counter~0 18)} is VALID [2022-04-15 15:12:33,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {9440#(< ~counter~0 17)} assume !!(0 != ~r~0); {9440#(< ~counter~0 17)} is VALID [2022-04-15 15:12:33,821 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9152#true} {9440#(< ~counter~0 17)} #94#return; {9440#(< ~counter~0 17)} is VALID [2022-04-15 15:12:33,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 15:12:33,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {9152#true} assume !(0 == ~cond); {9152#true} is VALID [2022-04-15 15:12:33,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {9152#true} ~cond := #in~cond; {9152#true} is VALID [2022-04-15 15:12:33,822 INFO L272 TraceCheckUtils]: 19: Hoare triple {9440#(< ~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)); {9152#true} is VALID [2022-04-15 15:12:33,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {9440#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {9440#(< ~counter~0 17)} is VALID [2022-04-15 15:12:33,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {9465#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9440#(< ~counter~0 17)} is VALID [2022-04-15 15:12:33,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {9465#(< ~counter~0 16)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9465#(< ~counter~0 16)} is VALID [2022-04-15 15:12:33,824 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9152#true} {9465#(< ~counter~0 16)} #92#return; {9465#(< ~counter~0 16)} is VALID [2022-04-15 15:12:33,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 15:12:33,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {9152#true} assume !(0 == ~cond); {9152#true} is VALID [2022-04-15 15:12:33,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {9152#true} ~cond := #in~cond; {9152#true} is VALID [2022-04-15 15:12:33,825 INFO L272 TraceCheckUtils]: 11: Hoare triple {9465#(< ~counter~0 16)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {9152#true} is VALID [2022-04-15 15:12:33,825 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9152#true} {9465#(< ~counter~0 16)} #90#return; {9465#(< ~counter~0 16)} is VALID [2022-04-15 15:12:33,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 15:12:33,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {9152#true} assume !(0 == ~cond); {9152#true} is VALID [2022-04-15 15:12:33,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {9152#true} ~cond := #in~cond; {9152#true} is VALID [2022-04-15 15:12:33,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {9465#(< ~counter~0 16)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9152#true} is VALID [2022-04-15 15:12:33,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {9465#(< ~counter~0 16)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {9465#(< ~counter~0 16)} is VALID [2022-04-15 15:12:33,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {9465#(< ~counter~0 16)} call #t~ret9 := main(); {9465#(< ~counter~0 16)} is VALID [2022-04-15 15:12:33,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9465#(< ~counter~0 16)} {9152#true} #102#return; {9465#(< ~counter~0 16)} is VALID [2022-04-15 15:12:33,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {9465#(< ~counter~0 16)} assume true; {9465#(< ~counter~0 16)} is VALID [2022-04-15 15:12:33,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {9152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9465#(< ~counter~0 16)} is VALID [2022-04-15 15:12:33,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {9152#true} call ULTIMATE.init(); {9152#true} is VALID [2022-04-15 15:12:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 15:12:33,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:33,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058552287] [2022-04-15 15:12:33,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:33,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014091055] [2022-04-15 15:12:33,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014091055] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:33,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:33,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 15:12:33,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:33,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888868534] [2022-04-15 15:12:33,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888868534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:33,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:33,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:12:33,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658260843] [2022-04-15 15:12:33,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:33,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 15:12:33,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:33,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:33,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:33,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:12:33,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:33,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:12:33,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:12:33,879 INFO L87 Difference]: Start difference. First operand 138 states and 173 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:34,197 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-15 15:12:34,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 15:12:34,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 15:12:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 15:12:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 15:12:34,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-15 15:12:34,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:34,304 INFO L225 Difference]: With dead ends: 177 [2022-04-15 15:12:34,305 INFO L226 Difference]: Without dead ends: 140 [2022-04-15 15:12:34,305 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-15 15:12:34,306 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:34,306 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 160 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:12:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-15 15:12:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-04-15 15:12:34,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:34,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 140 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:12:34,445 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 140 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:12:34,446 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 140 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:12:34,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:34,449 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2022-04-15 15:12:34,449 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 175 transitions. [2022-04-15 15:12:34,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:34,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:34,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 140 states. [2022-04-15 15:12:34,450 INFO L87 Difference]: Start difference. First operand has 140 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 140 states. [2022-04-15 15:12:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:34,453 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2022-04-15 15:12:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 175 transitions. [2022-04-15 15:12:34,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:34,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:34,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:34,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:12:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 175 transitions. [2022-04-15 15:12:34,457 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 175 transitions. Word has length 59 [2022-04-15 15:12:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:34,457 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 175 transitions. [2022-04-15 15:12:34,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:34,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 175 transitions. [2022-04-15 15:12:42,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 172 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 175 transitions. [2022-04-15 15:12:42,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 15:12:42,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:42,618 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:42,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:42,819 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 15:12:42,819 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:42,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-15 15:12:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:42,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [672080238] [2022-04-15 15:12:42,820 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-15 15:12:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:42,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903762363] [2022-04-15 15:12:42,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:42,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:42,831 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:42,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [197136589] [2022-04-15 15:12:42,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:12:42,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:42,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:42,832 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:42,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 15:12:42,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:12:42,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:42,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 15:12:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:42,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:43,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {10439#true} call ULTIMATE.init(); {10439#true} is VALID [2022-04-15 15:12:43,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {10439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {10447#(<= ~counter~0 0)} assume true; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10447#(<= ~counter~0 0)} {10439#true} #102#return; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {10447#(<= ~counter~0 0)} call #t~ret9 := main(); {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {10447#(<= ~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; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,206 INFO L272 TraceCheckUtils]: 6: Hoare triple {10447#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {10447#(<= ~counter~0 0)} ~cond := #in~cond; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {10447#(<= ~counter~0 0)} assume !(0 == ~cond); {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {10447#(<= ~counter~0 0)} assume true; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,207 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10447#(<= ~counter~0 0)} {10447#(<= ~counter~0 0)} #90#return; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,208 INFO L272 TraceCheckUtils]: 11: Hoare triple {10447#(<= ~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)); {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {10447#(<= ~counter~0 0)} ~cond := #in~cond; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {10447#(<= ~counter~0 0)} assume !(0 == ~cond); {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {10447#(<= ~counter~0 0)} assume true; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,209 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10447#(<= ~counter~0 0)} {10447#(<= ~counter~0 0)} #92#return; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {10447#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:43,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {10447#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10496#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:43,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {10496#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {10496#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:43,211 INFO L272 TraceCheckUtils]: 19: Hoare triple {10496#(<= ~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)); {10496#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:43,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {10496#(<= ~counter~0 1)} ~cond := #in~cond; {10496#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:43,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {10496#(<= ~counter~0 1)} assume !(0 == ~cond); {10496#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:43,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {10496#(<= ~counter~0 1)} assume true; {10496#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:43,212 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10496#(<= ~counter~0 1)} {10496#(<= ~counter~0 1)} #94#return; {10496#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:43,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {10496#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10496#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:43,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {10496#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10521#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:43,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {10521#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {10521#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:43,214 INFO L272 TraceCheckUtils]: 27: Hoare triple {10521#(<= ~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)); {10521#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:43,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {10521#(<= ~counter~0 2)} ~cond := #in~cond; {10521#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:43,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {10521#(<= ~counter~0 2)} assume !(0 == ~cond); {10521#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:43,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {10521#(<= ~counter~0 2)} assume true; {10521#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:43,215 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10521#(<= ~counter~0 2)} {10521#(<= ~counter~0 2)} #96#return; {10521#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:43,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {10521#(<= ~counter~0 2)} assume !(~r~0 > 0); {10521#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:43,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {10521#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10546#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:43,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {10546#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {10546#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:43,217 INFO L272 TraceCheckUtils]: 35: Hoare triple {10546#(<= ~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)); {10546#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:43,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {10546#(<= ~counter~0 3)} ~cond := #in~cond; {10546#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:43,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {10546#(<= ~counter~0 3)} assume !(0 == ~cond); {10546#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:43,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {10546#(<= ~counter~0 3)} assume true; {10546#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:43,218 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10546#(<= ~counter~0 3)} {10546#(<= ~counter~0 3)} #98#return; {10546#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:43,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {10546#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10546#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:43,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {10546#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10571#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:43,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {10571#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {10571#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:43,220 INFO L272 TraceCheckUtils]: 43: Hoare triple {10571#(<= ~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)); {10571#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:43,220 INFO L290 TraceCheckUtils]: 44: Hoare triple {10571#(<= ~counter~0 4)} ~cond := #in~cond; {10571#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:43,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {10571#(<= ~counter~0 4)} assume !(0 == ~cond); {10571#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:43,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {10571#(<= ~counter~0 4)} assume true; {10571#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:43,221 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10571#(<= ~counter~0 4)} {10571#(<= ~counter~0 4)} #98#return; {10571#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:43,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {10571#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10571#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:43,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {10571#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10596#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:43,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {10596#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {10596#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:43,223 INFO L272 TraceCheckUtils]: 51: Hoare triple {10596#(<= ~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)); {10596#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:43,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {10596#(<= ~counter~0 5)} ~cond := #in~cond; {10596#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:43,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {10596#(<= ~counter~0 5)} assume !(0 == ~cond); {10596#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:43,224 INFO L290 TraceCheckUtils]: 54: Hoare triple {10596#(<= ~counter~0 5)} assume true; {10596#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:43,224 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10596#(<= ~counter~0 5)} {10596#(<= ~counter~0 5)} #98#return; {10596#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:43,224 INFO L290 TraceCheckUtils]: 56: Hoare triple {10596#(<= ~counter~0 5)} assume !(~r~0 < 0); {10596#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:43,225 INFO L290 TraceCheckUtils]: 57: Hoare triple {10596#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10621#(<= |main_#t~post6| 5)} is VALID [2022-04-15 15:12:43,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {10621#(<= |main_#t~post6| 5)} assume !(#t~post6 < 20);havoc #t~post6; {10440#false} is VALID [2022-04-15 15:12:43,225 INFO L272 TraceCheckUtils]: 59: Hoare triple {10440#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10440#false} is VALID [2022-04-15 15:12:43,225 INFO L290 TraceCheckUtils]: 60: Hoare triple {10440#false} ~cond := #in~cond; {10440#false} is VALID [2022-04-15 15:12:43,225 INFO L290 TraceCheckUtils]: 61: Hoare triple {10440#false} assume 0 == ~cond; {10440#false} is VALID [2022-04-15 15:12:43,225 INFO L290 TraceCheckUtils]: 62: Hoare triple {10440#false} assume !false; {10440#false} is VALID [2022-04-15 15:12:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:43,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:43,564 INFO L290 TraceCheckUtils]: 62: Hoare triple {10440#false} assume !false; {10440#false} is VALID [2022-04-15 15:12:43,564 INFO L290 TraceCheckUtils]: 61: Hoare triple {10440#false} assume 0 == ~cond; {10440#false} is VALID [2022-04-15 15:12:43,564 INFO L290 TraceCheckUtils]: 60: Hoare triple {10440#false} ~cond := #in~cond; {10440#false} is VALID [2022-04-15 15:12:43,564 INFO L272 TraceCheckUtils]: 59: Hoare triple {10440#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10440#false} is VALID [2022-04-15 15:12:43,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {10649#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {10440#false} is VALID [2022-04-15 15:12:43,565 INFO L290 TraceCheckUtils]: 57: Hoare triple {10653#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10649#(< |main_#t~post6| 20)} is VALID [2022-04-15 15:12:43,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {10653#(< ~counter~0 20)} assume !(~r~0 < 0); {10653#(< ~counter~0 20)} is VALID [2022-04-15 15:12:43,565 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10439#true} {10653#(< ~counter~0 20)} #98#return; {10653#(< ~counter~0 20)} is VALID [2022-04-15 15:12:43,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 15:12:43,566 INFO L290 TraceCheckUtils]: 53: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 15:12:43,566 INFO L290 TraceCheckUtils]: 52: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 15:12:43,566 INFO L272 TraceCheckUtils]: 51: Hoare triple {10653#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10439#true} is VALID [2022-04-15 15:12:43,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {10653#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {10653#(< ~counter~0 20)} is VALID [2022-04-15 15:12:43,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {10678#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10653#(< ~counter~0 20)} is VALID [2022-04-15 15:12:43,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {10678#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10678#(< ~counter~0 19)} is VALID [2022-04-15 15:12:43,567 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10439#true} {10678#(< ~counter~0 19)} #98#return; {10678#(< ~counter~0 19)} is VALID [2022-04-15 15:12:43,567 INFO L290 TraceCheckUtils]: 46: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 15:12:43,568 INFO L290 TraceCheckUtils]: 45: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 15:12:43,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 15:12:43,568 INFO L272 TraceCheckUtils]: 43: Hoare triple {10678#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10439#true} is VALID [2022-04-15 15:12:43,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {10678#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {10678#(< ~counter~0 19)} is VALID [2022-04-15 15:12:43,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {10703#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10678#(< ~counter~0 19)} is VALID [2022-04-15 15:12:43,569 INFO L290 TraceCheckUtils]: 40: Hoare triple {10703#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10703#(< ~counter~0 18)} is VALID [2022-04-15 15:12:43,569 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10439#true} {10703#(< ~counter~0 18)} #98#return; {10703#(< ~counter~0 18)} is VALID [2022-04-15 15:12:43,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 15:12:43,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 15:12:43,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 15:12:43,582 INFO L272 TraceCheckUtils]: 35: Hoare triple {10703#(< ~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)); {10439#true} is VALID [2022-04-15 15:12:43,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {10703#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {10703#(< ~counter~0 18)} is VALID [2022-04-15 15:12:43,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {10728#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10703#(< ~counter~0 18)} is VALID [2022-04-15 15:12:43,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {10728#(< ~counter~0 17)} assume !(~r~0 > 0); {10728#(< ~counter~0 17)} is VALID [2022-04-15 15:12:43,588 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10439#true} {10728#(< ~counter~0 17)} #96#return; {10728#(< ~counter~0 17)} is VALID [2022-04-15 15:12:43,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 15:12:43,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 15:12:43,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 15:12:43,589 INFO L272 TraceCheckUtils]: 27: Hoare triple {10728#(< ~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)); {10439#true} is VALID [2022-04-15 15:12:43,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {10728#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {10728#(< ~counter~0 17)} is VALID [2022-04-15 15:12:43,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {10753#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10728#(< ~counter~0 17)} is VALID [2022-04-15 15:12:43,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {10753#(< ~counter~0 16)} assume !!(0 != ~r~0); {10753#(< ~counter~0 16)} is VALID [2022-04-15 15:12:43,591 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10439#true} {10753#(< ~counter~0 16)} #94#return; {10753#(< ~counter~0 16)} is VALID [2022-04-15 15:12:43,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 15:12:43,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 15:12:43,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 15:12:43,591 INFO L272 TraceCheckUtils]: 19: Hoare triple {10753#(< ~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)); {10439#true} is VALID [2022-04-15 15:12:43,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {10753#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {10753#(< ~counter~0 16)} is VALID [2022-04-15 15:12:43,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {10778#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10753#(< ~counter~0 16)} is VALID [2022-04-15 15:12:43,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {10778#(< ~counter~0 15)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10778#(< ~counter~0 15)} is VALID [2022-04-15 15:12:43,593 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10439#true} {10778#(< ~counter~0 15)} #92#return; {10778#(< ~counter~0 15)} is VALID [2022-04-15 15:12:43,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 15:12:43,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 15:12:43,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 15:12:43,593 INFO L272 TraceCheckUtils]: 11: Hoare triple {10778#(< ~counter~0 15)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10439#true} is VALID [2022-04-15 15:12:43,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10439#true} {10778#(< ~counter~0 15)} #90#return; {10778#(< ~counter~0 15)} is VALID [2022-04-15 15:12:43,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 15:12:43,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 15:12:43,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 15:12:43,594 INFO L272 TraceCheckUtils]: 6: Hoare triple {10778#(< ~counter~0 15)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10439#true} is VALID [2022-04-15 15:12:43,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {10778#(< ~counter~0 15)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {10778#(< ~counter~0 15)} is VALID [2022-04-15 15:12:43,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {10778#(< ~counter~0 15)} call #t~ret9 := main(); {10778#(< ~counter~0 15)} is VALID [2022-04-15 15:12:43,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10778#(< ~counter~0 15)} {10439#true} #102#return; {10778#(< ~counter~0 15)} is VALID [2022-04-15 15:12:43,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {10778#(< ~counter~0 15)} assume true; {10778#(< ~counter~0 15)} is VALID [2022-04-15 15:12:43,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {10439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10778#(< ~counter~0 15)} is VALID [2022-04-15 15:12:43,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {10439#true} call ULTIMATE.init(); {10439#true} is VALID [2022-04-15 15:12:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 15:12:43,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:43,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903762363] [2022-04-15 15:12:43,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:43,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197136589] [2022-04-15 15:12:43,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197136589] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:43,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:43,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 15:12:43,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:43,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [672080238] [2022-04-15 15:12:43,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [672080238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:43,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:43,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 15:12:43,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56907089] [2022-04-15 15:12:43,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:43,597 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-15 15:12:43,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:43,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:12:43,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:43,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 15:12:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:43,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 15:12:43,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:12:43,641 INFO L87 Difference]: Start difference. First operand 140 states and 175 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:12:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:44,015 INFO L93 Difference]: Finished difference Result 172 states and 214 transitions. [2022-04-15 15:12:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 15:12:44,015 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-15 15:12:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:12:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-15 15:12:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:12:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-15 15:12:44,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-15 15:12:44,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:44,107 INFO L225 Difference]: With dead ends: 172 [2022-04-15 15:12:44,107 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 15:12:44,107 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:12:44,108 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 51 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:44,108 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 160 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:12:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 15:12:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2022-04-15 15:12:44,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:44,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 159 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 15:12:44,246 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 159 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 15:12:44,247 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 159 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 15:12:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:44,250 INFO L93 Difference]: Finished difference Result 167 states and 208 transitions. [2022-04-15 15:12:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 208 transitions. [2022-04-15 15:12:44,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:44,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:44,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) Second operand 167 states. [2022-04-15 15:12:44,252 INFO L87 Difference]: Start difference. First operand has 159 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) Second operand 167 states. [2022-04-15 15:12:44,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:44,256 INFO L93 Difference]: Finished difference Result 167 states and 208 transitions. [2022-04-15 15:12:44,256 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 208 transitions. [2022-04-15 15:12:44,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:44,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:44,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:44,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 15:12:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 199 transitions. [2022-04-15 15:12:44,261 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 199 transitions. Word has length 63 [2022-04-15 15:12:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:44,261 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 199 transitions. [2022-04-15 15:12:44,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:12:44,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 199 transitions. [2022-04-15 15:12:53,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 196 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 199 transitions. [2022-04-15 15:12:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 15:12:53,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:53,785 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:53,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:53,986 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:53,986 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:53,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:53,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-15 15:12:53,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:53,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1625781399] [2022-04-15 15:12:53,989 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-15 15:12:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:53,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835020784] [2022-04-15 15:12:53,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:54,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:54,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927230488] [2022-04-15 15:12:54,002 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:12:54,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:54,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:54,003 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:54,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 15:12:54,064 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 15:12:54,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:54,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 15:12:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:54,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:54,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {11832#true} call ULTIMATE.init(); {11832#true} is VALID [2022-04-15 15:12:54,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {11832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {11840#(<= ~counter~0 0)} assume true; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11840#(<= ~counter~0 0)} {11832#true} #102#return; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {11840#(<= ~counter~0 0)} call #t~ret9 := main(); {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {11840#(<= ~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; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,406 INFO L272 TraceCheckUtils]: 6: Hoare triple {11840#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {11840#(<= ~counter~0 0)} ~cond := #in~cond; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {11840#(<= ~counter~0 0)} assume !(0 == ~cond); {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {11840#(<= ~counter~0 0)} assume true; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,408 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11840#(<= ~counter~0 0)} {11840#(<= ~counter~0 0)} #90#return; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,408 INFO L272 TraceCheckUtils]: 11: Hoare triple {11840#(<= ~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)); {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {11840#(<= ~counter~0 0)} ~cond := #in~cond; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {11840#(<= ~counter~0 0)} assume !(0 == ~cond); {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {11840#(<= ~counter~0 0)} assume true; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,409 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11840#(<= ~counter~0 0)} {11840#(<= ~counter~0 0)} #92#return; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {11840#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:54,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {11840#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11889#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:54,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {11889#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {11889#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:54,411 INFO L272 TraceCheckUtils]: 19: Hoare triple {11889#(<= ~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)); {11889#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:54,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {11889#(<= ~counter~0 1)} ~cond := #in~cond; {11889#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:54,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {11889#(<= ~counter~0 1)} assume !(0 == ~cond); {11889#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:54,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {11889#(<= ~counter~0 1)} assume true; {11889#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:54,412 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11889#(<= ~counter~0 1)} {11889#(<= ~counter~0 1)} #94#return; {11889#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:54,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {11889#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11889#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:54,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {11889#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11914#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:54,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {11914#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {11914#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:54,414 INFO L272 TraceCheckUtils]: 27: Hoare triple {11914#(<= ~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)); {11914#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:54,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {11914#(<= ~counter~0 2)} ~cond := #in~cond; {11914#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:54,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {11914#(<= ~counter~0 2)} assume !(0 == ~cond); {11914#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:54,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {11914#(<= ~counter~0 2)} assume true; {11914#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:54,415 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11914#(<= ~counter~0 2)} {11914#(<= ~counter~0 2)} #96#return; {11914#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:54,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {11914#(<= ~counter~0 2)} assume !(~r~0 > 0); {11914#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:54,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {11914#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11939#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:54,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {11939#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {11939#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:54,417 INFO L272 TraceCheckUtils]: 35: Hoare triple {11939#(<= ~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)); {11939#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:54,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {11939#(<= ~counter~0 3)} ~cond := #in~cond; {11939#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:54,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {11939#(<= ~counter~0 3)} assume !(0 == ~cond); {11939#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:54,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {11939#(<= ~counter~0 3)} assume true; {11939#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:54,418 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11939#(<= ~counter~0 3)} {11939#(<= ~counter~0 3)} #98#return; {11939#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:54,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {11939#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11939#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:54,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {11939#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11964#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:54,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {11964#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {11964#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:54,420 INFO L272 TraceCheckUtils]: 43: Hoare triple {11964#(<= ~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)); {11964#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:54,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {11964#(<= ~counter~0 4)} ~cond := #in~cond; {11964#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:54,420 INFO L290 TraceCheckUtils]: 45: Hoare triple {11964#(<= ~counter~0 4)} assume !(0 == ~cond); {11964#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:54,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {11964#(<= ~counter~0 4)} assume true; {11964#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:54,421 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11964#(<= ~counter~0 4)} {11964#(<= ~counter~0 4)} #98#return; {11964#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:54,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {11964#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11964#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:54,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {11964#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11989#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:54,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {11989#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {11989#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:54,423 INFO L272 TraceCheckUtils]: 51: Hoare triple {11989#(<= ~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)); {11989#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:54,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {11989#(<= ~counter~0 5)} ~cond := #in~cond; {11989#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:54,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {11989#(<= ~counter~0 5)} assume !(0 == ~cond); {11989#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:54,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {11989#(<= ~counter~0 5)} assume true; {11989#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:54,424 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11989#(<= ~counter~0 5)} {11989#(<= ~counter~0 5)} #98#return; {11989#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:54,424 INFO L290 TraceCheckUtils]: 56: Hoare triple {11989#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11989#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:54,425 INFO L290 TraceCheckUtils]: 57: Hoare triple {11989#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12014#(<= |main_#t~post8| 5)} is VALID [2022-04-15 15:12:54,425 INFO L290 TraceCheckUtils]: 58: Hoare triple {12014#(<= |main_#t~post8| 5)} assume !(#t~post8 < 20);havoc #t~post8; {11833#false} is VALID [2022-04-15 15:12:54,425 INFO L290 TraceCheckUtils]: 59: Hoare triple {11833#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11833#false} is VALID [2022-04-15 15:12:54,425 INFO L290 TraceCheckUtils]: 60: Hoare triple {11833#false} assume !(#t~post6 < 20);havoc #t~post6; {11833#false} is VALID [2022-04-15 15:12:54,425 INFO L272 TraceCheckUtils]: 61: Hoare triple {11833#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11833#false} is VALID [2022-04-15 15:12:54,425 INFO L290 TraceCheckUtils]: 62: Hoare triple {11833#false} ~cond := #in~cond; {11833#false} is VALID [2022-04-15 15:12:54,425 INFO L290 TraceCheckUtils]: 63: Hoare triple {11833#false} assume 0 == ~cond; {11833#false} is VALID [2022-04-15 15:12:54,425 INFO L290 TraceCheckUtils]: 64: Hoare triple {11833#false} assume !false; {11833#false} is VALID [2022-04-15 15:12:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:54,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:54,748 INFO L290 TraceCheckUtils]: 64: Hoare triple {11833#false} assume !false; {11833#false} is VALID [2022-04-15 15:12:54,748 INFO L290 TraceCheckUtils]: 63: Hoare triple {11833#false} assume 0 == ~cond; {11833#false} is VALID [2022-04-15 15:12:54,748 INFO L290 TraceCheckUtils]: 62: Hoare triple {11833#false} ~cond := #in~cond; {11833#false} is VALID [2022-04-15 15:12:54,748 INFO L272 TraceCheckUtils]: 61: Hoare triple {11833#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11833#false} is VALID [2022-04-15 15:12:54,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {11833#false} assume !(#t~post6 < 20);havoc #t~post6; {11833#false} is VALID [2022-04-15 15:12:54,748 INFO L290 TraceCheckUtils]: 59: Hoare triple {11833#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11833#false} is VALID [2022-04-15 15:12:54,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {12054#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {11833#false} is VALID [2022-04-15 15:12:54,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {12058#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12054#(< |main_#t~post8| 20)} is VALID [2022-04-15 15:12:54,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {12058#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12058#(< ~counter~0 20)} is VALID [2022-04-15 15:12:54,750 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11832#true} {12058#(< ~counter~0 20)} #98#return; {12058#(< ~counter~0 20)} is VALID [2022-04-15 15:12:54,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 15:12:54,750 INFO L290 TraceCheckUtils]: 53: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 15:12:54,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 15:12:54,750 INFO L272 TraceCheckUtils]: 51: Hoare triple {12058#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11832#true} is VALID [2022-04-15 15:12:54,751 INFO L290 TraceCheckUtils]: 50: Hoare triple {12058#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {12058#(< ~counter~0 20)} is VALID [2022-04-15 15:12:54,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {12083#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12058#(< ~counter~0 20)} is VALID [2022-04-15 15:12:54,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {12083#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12083#(< ~counter~0 19)} is VALID [2022-04-15 15:12:54,752 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11832#true} {12083#(< ~counter~0 19)} #98#return; {12083#(< ~counter~0 19)} is VALID [2022-04-15 15:12:54,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 15:12:54,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 15:12:54,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 15:12:54,752 INFO L272 TraceCheckUtils]: 43: Hoare triple {12083#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11832#true} is VALID [2022-04-15 15:12:54,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {12083#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {12083#(< ~counter~0 19)} is VALID [2022-04-15 15:12:54,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {12108#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12083#(< ~counter~0 19)} is VALID [2022-04-15 15:12:54,753 INFO L290 TraceCheckUtils]: 40: Hoare triple {12108#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12108#(< ~counter~0 18)} is VALID [2022-04-15 15:12:54,754 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11832#true} {12108#(< ~counter~0 18)} #98#return; {12108#(< ~counter~0 18)} is VALID [2022-04-15 15:12:54,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 15:12:54,754 INFO L290 TraceCheckUtils]: 37: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 15:12:54,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 15:12:54,754 INFO L272 TraceCheckUtils]: 35: Hoare triple {12108#(< ~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)); {11832#true} is VALID [2022-04-15 15:12:54,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {12108#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {12108#(< ~counter~0 18)} is VALID [2022-04-15 15:12:54,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {12133#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12108#(< ~counter~0 18)} is VALID [2022-04-15 15:12:54,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {12133#(< ~counter~0 17)} assume !(~r~0 > 0); {12133#(< ~counter~0 17)} is VALID [2022-04-15 15:12:54,756 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11832#true} {12133#(< ~counter~0 17)} #96#return; {12133#(< ~counter~0 17)} is VALID [2022-04-15 15:12:54,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 15:12:54,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 15:12:54,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 15:12:54,756 INFO L272 TraceCheckUtils]: 27: Hoare triple {12133#(< ~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)); {11832#true} is VALID [2022-04-15 15:12:54,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {12133#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {12133#(< ~counter~0 17)} is VALID [2022-04-15 15:12:54,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {12158#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12133#(< ~counter~0 17)} is VALID [2022-04-15 15:12:54,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {12158#(< ~counter~0 16)} assume !!(0 != ~r~0); {12158#(< ~counter~0 16)} is VALID [2022-04-15 15:12:54,758 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11832#true} {12158#(< ~counter~0 16)} #94#return; {12158#(< ~counter~0 16)} is VALID [2022-04-15 15:12:54,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 15:12:54,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 15:12:54,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 15:12:54,758 INFO L272 TraceCheckUtils]: 19: Hoare triple {12158#(< ~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)); {11832#true} is VALID [2022-04-15 15:12:54,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {12158#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {12158#(< ~counter~0 16)} is VALID [2022-04-15 15:12:54,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {12183#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12158#(< ~counter~0 16)} is VALID [2022-04-15 15:12:54,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {12183#(< ~counter~0 15)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12183#(< ~counter~0 15)} is VALID [2022-04-15 15:12:54,759 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11832#true} {12183#(< ~counter~0 15)} #92#return; {12183#(< ~counter~0 15)} is VALID [2022-04-15 15:12:54,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 15:12:54,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 15:12:54,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 15:12:54,760 INFO L272 TraceCheckUtils]: 11: Hoare triple {12183#(< ~counter~0 15)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {11832#true} is VALID [2022-04-15 15:12:54,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11832#true} {12183#(< ~counter~0 15)} #90#return; {12183#(< ~counter~0 15)} is VALID [2022-04-15 15:12:54,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 15:12:54,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 15:12:54,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 15:12:54,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {12183#(< ~counter~0 15)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11832#true} is VALID [2022-04-15 15:12:54,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {12183#(< ~counter~0 15)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {12183#(< ~counter~0 15)} is VALID [2022-04-15 15:12:54,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {12183#(< ~counter~0 15)} call #t~ret9 := main(); {12183#(< ~counter~0 15)} is VALID [2022-04-15 15:12:54,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12183#(< ~counter~0 15)} {11832#true} #102#return; {12183#(< ~counter~0 15)} is VALID [2022-04-15 15:12:54,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {12183#(< ~counter~0 15)} assume true; {12183#(< ~counter~0 15)} is VALID [2022-04-15 15:12:54,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {11832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12183#(< ~counter~0 15)} is VALID [2022-04-15 15:12:54,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {11832#true} call ULTIMATE.init(); {11832#true} is VALID [2022-04-15 15:12:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 15:12:54,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:54,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835020784] [2022-04-15 15:12:54,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:54,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927230488] [2022-04-15 15:12:54,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927230488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:54,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:54,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 15:12:54,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:54,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1625781399] [2022-04-15 15:12:54,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1625781399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:54,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:54,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 15:12:54,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543985409] [2022-04-15 15:12:54,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:54,764 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-15 15:12:54,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:54,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:12:54,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:54,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 15:12:54,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:54,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 15:12:54,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:12:54,807 INFO L87 Difference]: Start difference. First operand 159 states and 199 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:12:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:55,231 INFO L93 Difference]: Finished difference Result 234 states and 305 transitions. [2022-04-15 15:12:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 15:12:55,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-15 15:12:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:12:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-15 15:12:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:12:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-15 15:12:55,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-15 15:12:55,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:55,336 INFO L225 Difference]: With dead ends: 234 [2022-04-15 15:12:55,336 INFO L226 Difference]: Without dead ends: 169 [2022-04-15 15:12:55,338 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-04-15 15:12:55,339 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 53 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:55,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 154 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:12:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-15 15:12:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2022-04-15 15:12:55,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:55,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 164 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 123 states have internal predecessors, (147), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 15:12:55,492 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 164 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 123 states have internal predecessors, (147), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 15:12:55,493 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 164 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 123 states have internal predecessors, (147), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 15:12:55,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:55,497 INFO L93 Difference]: Finished difference Result 169 states and 210 transitions. [2022-04-15 15:12:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 210 transitions. [2022-04-15 15:12:55,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:55,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:55,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 123 states have internal predecessors, (147), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 169 states. [2022-04-15 15:12:55,498 INFO L87 Difference]: Start difference. First operand has 164 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 123 states have internal predecessors, (147), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 169 states. [2022-04-15 15:12:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:55,502 INFO L93 Difference]: Finished difference Result 169 states and 210 transitions. [2022-04-15 15:12:55,502 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 210 transitions. [2022-04-15 15:12:55,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:55,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:55,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:55,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 123 states have internal predecessors, (147), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 15:12:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 205 transitions. [2022-04-15 15:12:55,507 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 205 transitions. Word has length 65 [2022-04-15 15:12:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:55,507 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 205 transitions. [2022-04-15 15:12:55,507 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:12:55,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 205 transitions. [2022-04-15 15:13:07,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 201 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 205 transitions. [2022-04-15 15:13:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 15:13:07,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:07,006 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:13:07,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 15:13:07,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 15:13:07,212 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:07,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-15 15:13:07,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:07,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1613002317] [2022-04-15 15:13:07,214 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:07,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-15 15:13:07,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:07,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518719169] [2022-04-15 15:13:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:07,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:07,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2106577333] [2022-04-15 15:13:07,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:07,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:07,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:07,241 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:13:07,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 15:13:07,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:07,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:07,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 15:13:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:07,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:07,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {13377#true} call ULTIMATE.init(); {13377#true} is VALID [2022-04-15 15:13:07,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {13377#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {13385#(<= ~counter~0 0)} assume true; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13385#(<= ~counter~0 0)} {13377#true} #102#return; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {13385#(<= ~counter~0 0)} call #t~ret9 := main(); {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {13385#(<= ~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; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,641 INFO L272 TraceCheckUtils]: 6: Hoare triple {13385#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {13385#(<= ~counter~0 0)} ~cond := #in~cond; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {13385#(<= ~counter~0 0)} assume !(0 == ~cond); {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {13385#(<= ~counter~0 0)} assume true; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,643 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13385#(<= ~counter~0 0)} {13385#(<= ~counter~0 0)} #90#return; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,643 INFO L272 TraceCheckUtils]: 11: Hoare triple {13385#(<= ~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)); {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {13385#(<= ~counter~0 0)} ~cond := #in~cond; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {13385#(<= ~counter~0 0)} assume !(0 == ~cond); {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {13385#(<= ~counter~0 0)} assume true; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,644 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13385#(<= ~counter~0 0)} {13385#(<= ~counter~0 0)} #92#return; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {13385#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:07,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {13385#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13434#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:07,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {13434#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {13434#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:07,646 INFO L272 TraceCheckUtils]: 19: Hoare triple {13434#(<= ~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)); {13434#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:07,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {13434#(<= ~counter~0 1)} ~cond := #in~cond; {13434#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:07,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {13434#(<= ~counter~0 1)} assume !(0 == ~cond); {13434#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:07,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {13434#(<= ~counter~0 1)} assume true; {13434#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:07,648 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13434#(<= ~counter~0 1)} {13434#(<= ~counter~0 1)} #94#return; {13434#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:07,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {13434#(<= ~counter~0 1)} assume !!(0 != ~r~0); {13434#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:07,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {13434#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13459#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:07,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {13459#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {13459#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:07,649 INFO L272 TraceCheckUtils]: 27: Hoare triple {13459#(<= ~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)); {13459#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:07,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {13459#(<= ~counter~0 2)} ~cond := #in~cond; {13459#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:07,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {13459#(<= ~counter~0 2)} assume !(0 == ~cond); {13459#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:07,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {13459#(<= ~counter~0 2)} assume true; {13459#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:07,650 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13459#(<= ~counter~0 2)} {13459#(<= ~counter~0 2)} #96#return; {13459#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:07,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {13459#(<= ~counter~0 2)} assume !(~r~0 > 0); {13459#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:07,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {13459#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13484#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:07,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {13484#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {13484#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:07,652 INFO L272 TraceCheckUtils]: 35: Hoare triple {13484#(<= ~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)); {13484#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:07,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {13484#(<= ~counter~0 3)} ~cond := #in~cond; {13484#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:07,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {13484#(<= ~counter~0 3)} assume !(0 == ~cond); {13484#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:07,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {13484#(<= ~counter~0 3)} assume true; {13484#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:07,653 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13484#(<= ~counter~0 3)} {13484#(<= ~counter~0 3)} #98#return; {13484#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:07,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {13484#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13484#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:07,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {13484#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13509#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:07,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {13509#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {13509#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:07,655 INFO L272 TraceCheckUtils]: 43: Hoare triple {13509#(<= ~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)); {13509#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:07,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {13509#(<= ~counter~0 4)} ~cond := #in~cond; {13509#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:07,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {13509#(<= ~counter~0 4)} assume !(0 == ~cond); {13509#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:07,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {13509#(<= ~counter~0 4)} assume true; {13509#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:07,656 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13509#(<= ~counter~0 4)} {13509#(<= ~counter~0 4)} #98#return; {13509#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:07,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {13509#(<= ~counter~0 4)} assume !(~r~0 < 0); {13509#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:07,657 INFO L290 TraceCheckUtils]: 49: Hoare triple {13509#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13534#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:07,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {13534#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {13534#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:07,658 INFO L272 TraceCheckUtils]: 51: Hoare triple {13534#(<= ~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)); {13534#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:07,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {13534#(<= ~counter~0 5)} ~cond := #in~cond; {13534#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:07,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {13534#(<= ~counter~0 5)} assume !(0 == ~cond); {13534#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:07,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {13534#(<= ~counter~0 5)} assume true; {13534#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:07,659 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13534#(<= ~counter~0 5)} {13534#(<= ~counter~0 5)} #94#return; {13534#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:07,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {13534#(<= ~counter~0 5)} assume !!(0 != ~r~0); {13534#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:07,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {13534#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13559#(<= |main_#t~post7| 5)} is VALID [2022-04-15 15:13:07,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {13559#(<= |main_#t~post7| 5)} assume !(#t~post7 < 20);havoc #t~post7; {13378#false} is VALID [2022-04-15 15:13:07,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {13378#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13378#false} is VALID [2022-04-15 15:13:07,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {13378#false} assume !(#t~post8 < 20);havoc #t~post8; {13378#false} is VALID [2022-04-15 15:13:07,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {13378#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13378#false} is VALID [2022-04-15 15:13:07,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {13378#false} assume !(#t~post6 < 20);havoc #t~post6; {13378#false} is VALID [2022-04-15 15:13:07,661 INFO L272 TraceCheckUtils]: 63: Hoare triple {13378#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13378#false} is VALID [2022-04-15 15:13:07,661 INFO L290 TraceCheckUtils]: 64: Hoare triple {13378#false} ~cond := #in~cond; {13378#false} is VALID [2022-04-15 15:13:07,661 INFO L290 TraceCheckUtils]: 65: Hoare triple {13378#false} assume 0 == ~cond; {13378#false} is VALID [2022-04-15 15:13:07,661 INFO L290 TraceCheckUtils]: 66: Hoare triple {13378#false} assume !false; {13378#false} is VALID [2022-04-15 15:13:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:13:07,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:07,979 INFO L290 TraceCheckUtils]: 66: Hoare triple {13378#false} assume !false; {13378#false} is VALID [2022-04-15 15:13:07,979 INFO L290 TraceCheckUtils]: 65: Hoare triple {13378#false} assume 0 == ~cond; {13378#false} is VALID [2022-04-15 15:13:07,979 INFO L290 TraceCheckUtils]: 64: Hoare triple {13378#false} ~cond := #in~cond; {13378#false} is VALID [2022-04-15 15:13:07,979 INFO L272 TraceCheckUtils]: 63: Hoare triple {13378#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13378#false} is VALID [2022-04-15 15:13:07,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {13378#false} assume !(#t~post6 < 20);havoc #t~post6; {13378#false} is VALID [2022-04-15 15:13:07,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {13378#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13378#false} is VALID [2022-04-15 15:13:07,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {13378#false} assume !(#t~post8 < 20);havoc #t~post8; {13378#false} is VALID [2022-04-15 15:13:07,979 INFO L290 TraceCheckUtils]: 59: Hoare triple {13378#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13378#false} is VALID [2022-04-15 15:13:07,979 INFO L290 TraceCheckUtils]: 58: Hoare triple {13611#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {13378#false} is VALID [2022-04-15 15:13:07,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {13615#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13611#(< |main_#t~post7| 20)} is VALID [2022-04-15 15:13:07,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {13615#(< ~counter~0 20)} assume !!(0 != ~r~0); {13615#(< ~counter~0 20)} is VALID [2022-04-15 15:13:07,981 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13377#true} {13615#(< ~counter~0 20)} #94#return; {13615#(< ~counter~0 20)} is VALID [2022-04-15 15:13:07,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 15:13:07,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 15:13:07,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 15:13:07,981 INFO L272 TraceCheckUtils]: 51: Hoare triple {13615#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13377#true} is VALID [2022-04-15 15:13:07,981 INFO L290 TraceCheckUtils]: 50: Hoare triple {13615#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {13615#(< ~counter~0 20)} is VALID [2022-04-15 15:13:07,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {13640#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13615#(< ~counter~0 20)} is VALID [2022-04-15 15:13:07,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {13640#(< ~counter~0 19)} assume !(~r~0 < 0); {13640#(< ~counter~0 19)} is VALID [2022-04-15 15:13:07,983 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13377#true} {13640#(< ~counter~0 19)} #98#return; {13640#(< ~counter~0 19)} is VALID [2022-04-15 15:13:07,983 INFO L290 TraceCheckUtils]: 46: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 15:13:07,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 15:13:07,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 15:13:07,983 INFO L272 TraceCheckUtils]: 43: Hoare triple {13640#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13377#true} is VALID [2022-04-15 15:13:07,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {13640#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {13640#(< ~counter~0 19)} is VALID [2022-04-15 15:13:07,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {13665#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13640#(< ~counter~0 19)} is VALID [2022-04-15 15:13:07,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {13665#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13665#(< ~counter~0 18)} is VALID [2022-04-15 15:13:07,985 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13377#true} {13665#(< ~counter~0 18)} #98#return; {13665#(< ~counter~0 18)} is VALID [2022-04-15 15:13:07,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 15:13:07,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 15:13:07,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 15:13:07,985 INFO L272 TraceCheckUtils]: 35: Hoare triple {13665#(< ~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)); {13377#true} is VALID [2022-04-15 15:13:07,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {13665#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {13665#(< ~counter~0 18)} is VALID [2022-04-15 15:13:07,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {13690#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13665#(< ~counter~0 18)} is VALID [2022-04-15 15:13:07,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {13690#(< ~counter~0 17)} assume !(~r~0 > 0); {13690#(< ~counter~0 17)} is VALID [2022-04-15 15:13:07,986 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13377#true} {13690#(< ~counter~0 17)} #96#return; {13690#(< ~counter~0 17)} is VALID [2022-04-15 15:13:07,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 15:13:07,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 15:13:07,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 15:13:07,987 INFO L272 TraceCheckUtils]: 27: Hoare triple {13690#(< ~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)); {13377#true} is VALID [2022-04-15 15:13:08,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {13690#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {13690#(< ~counter~0 17)} is VALID [2022-04-15 15:13:08,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {13715#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13690#(< ~counter~0 17)} is VALID [2022-04-15 15:13:08,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {13715#(< ~counter~0 16)} assume !!(0 != ~r~0); {13715#(< ~counter~0 16)} is VALID [2022-04-15 15:13:08,002 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13377#true} {13715#(< ~counter~0 16)} #94#return; {13715#(< ~counter~0 16)} is VALID [2022-04-15 15:13:08,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 15:13:08,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 15:13:08,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 15:13:08,002 INFO L272 TraceCheckUtils]: 19: Hoare triple {13715#(< ~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)); {13377#true} is VALID [2022-04-15 15:13:08,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {13715#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {13715#(< ~counter~0 16)} is VALID [2022-04-15 15:13:08,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {13740#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13715#(< ~counter~0 16)} is VALID [2022-04-15 15:13:08,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {13740#(< ~counter~0 15)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13740#(< ~counter~0 15)} is VALID [2022-04-15 15:13:08,004 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13377#true} {13740#(< ~counter~0 15)} #92#return; {13740#(< ~counter~0 15)} is VALID [2022-04-15 15:13:08,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 15:13:08,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 15:13:08,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 15:13:08,004 INFO L272 TraceCheckUtils]: 11: Hoare triple {13740#(< ~counter~0 15)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {13377#true} is VALID [2022-04-15 15:13:08,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13377#true} {13740#(< ~counter~0 15)} #90#return; {13740#(< ~counter~0 15)} is VALID [2022-04-15 15:13:08,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 15:13:08,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 15:13:08,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 15:13:08,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {13740#(< ~counter~0 15)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13377#true} is VALID [2022-04-15 15:13:08,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {13740#(< ~counter~0 15)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {13740#(< ~counter~0 15)} is VALID [2022-04-15 15:13:08,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {13740#(< ~counter~0 15)} call #t~ret9 := main(); {13740#(< ~counter~0 15)} is VALID [2022-04-15 15:13:08,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13740#(< ~counter~0 15)} {13377#true} #102#return; {13740#(< ~counter~0 15)} is VALID [2022-04-15 15:13:08,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {13740#(< ~counter~0 15)} assume true; {13740#(< ~counter~0 15)} is VALID [2022-04-15 15:13:08,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {13377#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13740#(< ~counter~0 15)} is VALID [2022-04-15 15:13:08,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {13377#true} call ULTIMATE.init(); {13377#true} is VALID [2022-04-15 15:13:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 15:13:08,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:08,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518719169] [2022-04-15 15:13:08,007 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:08,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106577333] [2022-04-15 15:13:08,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106577333] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:08,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:08,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 15:13:08,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:08,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1613002317] [2022-04-15 15:13:08,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1613002317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:08,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:08,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 15:13:08,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247544259] [2022-04-15 15:13:08,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:08,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-15 15:13:08,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:08,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:13:08,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:08,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 15:13:08,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:08,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 15:13:08,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:13:08,052 INFO L87 Difference]: Start difference. First operand 164 states and 205 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:13:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:08,527 INFO L93 Difference]: Finished difference Result 237 states and 309 transitions. [2022-04-15 15:13:08,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 15:13:08,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-15 15:13:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:13:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-15 15:13:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:13:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-15 15:13:08,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-15 15:13:08,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:08,649 INFO L225 Difference]: With dead ends: 237 [2022-04-15 15:13:08,649 INFO L226 Difference]: Without dead ends: 172 [2022-04-15 15:13:08,650 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=228, Unknown=0, NotChecked=0, Total=380 [2022-04-15 15:13:08,650 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:08,651 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 184 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:13:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-15 15:13:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-04-15 15:13:08,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:08,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 172 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 15:13:08,793 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 172 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 15:13:08,793 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 172 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 15:13:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:08,797 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-15 15:13:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-15 15:13:08,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:08,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:08,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-15 15:13:08,798 INFO L87 Difference]: Start difference. First operand has 172 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-15 15:13:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:08,802 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-15 15:13:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-15 15:13:08,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:08,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:08,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:08,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 15:13:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 213 transitions. [2022-04-15 15:13:08,806 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 213 transitions. Word has length 67 [2022-04-15 15:13:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:08,807 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 213 transitions. [2022-04-15 15:13:08,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 15:13:08,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 213 transitions. [2022-04-15 15:13:17,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 210 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-15 15:13:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 15:13:17,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:17,987 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:13:18,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 15:13:18,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 15:13:18,199 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:18,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-15 15:13:18,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:18,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1701168054] [2022-04-15 15:13:18,200 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-15 15:13:18,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:18,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590560937] [2022-04-15 15:13:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:18,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:18,211 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:18,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [792397412] [2022-04-15 15:13:18,212 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:13:18,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:18,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:18,213 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:13:18,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 15:13:18,288 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 15:13:18,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:18,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 15:13:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:18,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:18,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {14964#true} call ULTIMATE.init(); {14964#true} is VALID [2022-04-15 15:13:18,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {14964#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {14972#(<= ~counter~0 0)} assume true; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14972#(<= ~counter~0 0)} {14964#true} #102#return; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {14972#(<= ~counter~0 0)} call #t~ret9 := main(); {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {14972#(<= ~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; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,630 INFO L272 TraceCheckUtils]: 6: Hoare triple {14972#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {14972#(<= ~counter~0 0)} ~cond := #in~cond; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {14972#(<= ~counter~0 0)} assume !(0 == ~cond); {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {14972#(<= ~counter~0 0)} assume true; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,631 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14972#(<= ~counter~0 0)} {14972#(<= ~counter~0 0)} #90#return; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,631 INFO L272 TraceCheckUtils]: 11: Hoare triple {14972#(<= ~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)); {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {14972#(<= ~counter~0 0)} ~cond := #in~cond; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {14972#(<= ~counter~0 0)} assume !(0 == ~cond); {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {14972#(<= ~counter~0 0)} assume true; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,633 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14972#(<= ~counter~0 0)} {14972#(<= ~counter~0 0)} #92#return; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {14972#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {14972#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15021#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {15021#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {15021#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,634 INFO L272 TraceCheckUtils]: 19: Hoare triple {15021#(<= ~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)); {15021#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {15021#(<= ~counter~0 1)} ~cond := #in~cond; {15021#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {15021#(<= ~counter~0 1)} assume !(0 == ~cond); {15021#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {15021#(<= ~counter~0 1)} assume true; {15021#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,636 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15021#(<= ~counter~0 1)} {15021#(<= ~counter~0 1)} #94#return; {15021#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {15021#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15021#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {15021#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15046#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {15046#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {15046#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,638 INFO L272 TraceCheckUtils]: 27: Hoare triple {15046#(<= ~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)); {15046#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {15046#(<= ~counter~0 2)} ~cond := #in~cond; {15046#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {15046#(<= ~counter~0 2)} assume !(0 == ~cond); {15046#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {15046#(<= ~counter~0 2)} assume true; {15046#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,640 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15046#(<= ~counter~0 2)} {15046#(<= ~counter~0 2)} #96#return; {15046#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {15046#(<= ~counter~0 2)} assume !(~r~0 > 0); {15046#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {15046#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15071#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {15071#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {15071#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,641 INFO L272 TraceCheckUtils]: 35: Hoare triple {15071#(<= ~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)); {15071#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {15071#(<= ~counter~0 3)} ~cond := #in~cond; {15071#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {15071#(<= ~counter~0 3)} assume !(0 == ~cond); {15071#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {15071#(<= ~counter~0 3)} assume true; {15071#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,643 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15071#(<= ~counter~0 3)} {15071#(<= ~counter~0 3)} #98#return; {15071#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {15071#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15071#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {15071#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15096#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,644 INFO L290 TraceCheckUtils]: 42: Hoare triple {15096#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {15096#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,644 INFO L272 TraceCheckUtils]: 43: Hoare triple {15096#(<= ~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)); {15096#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,644 INFO L290 TraceCheckUtils]: 44: Hoare triple {15096#(<= ~counter~0 4)} ~cond := #in~cond; {15096#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,645 INFO L290 TraceCheckUtils]: 45: Hoare triple {15096#(<= ~counter~0 4)} assume !(0 == ~cond); {15096#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,645 INFO L290 TraceCheckUtils]: 46: Hoare triple {15096#(<= ~counter~0 4)} assume true; {15096#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,646 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15096#(<= ~counter~0 4)} {15096#(<= ~counter~0 4)} #98#return; {15096#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,646 INFO L290 TraceCheckUtils]: 48: Hoare triple {15096#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15096#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {15096#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15121#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,647 INFO L290 TraceCheckUtils]: 50: Hoare triple {15121#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {15121#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,647 INFO L272 TraceCheckUtils]: 51: Hoare triple {15121#(<= ~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)); {15121#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {15121#(<= ~counter~0 5)} ~cond := #in~cond; {15121#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {15121#(<= ~counter~0 5)} assume !(0 == ~cond); {15121#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,648 INFO L290 TraceCheckUtils]: 54: Hoare triple {15121#(<= ~counter~0 5)} assume true; {15121#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,648 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15121#(<= ~counter~0 5)} {15121#(<= ~counter~0 5)} #98#return; {15121#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,649 INFO L290 TraceCheckUtils]: 56: Hoare triple {15121#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15121#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,649 INFO L290 TraceCheckUtils]: 57: Hoare triple {15121#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15146#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,649 INFO L290 TraceCheckUtils]: 58: Hoare triple {15146#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {15146#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,650 INFO L272 TraceCheckUtils]: 59: Hoare triple {15146#(<= ~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)); {15146#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,650 INFO L290 TraceCheckUtils]: 60: Hoare triple {15146#(<= ~counter~0 6)} ~cond := #in~cond; {15146#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {15146#(<= ~counter~0 6)} assume !(0 == ~cond); {15146#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,651 INFO L290 TraceCheckUtils]: 62: Hoare triple {15146#(<= ~counter~0 6)} assume true; {15146#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,651 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15146#(<= ~counter~0 6)} {15146#(<= ~counter~0 6)} #98#return; {15146#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,651 INFO L290 TraceCheckUtils]: 64: Hoare triple {15146#(<= ~counter~0 6)} assume !(~r~0 < 0); {15146#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,652 INFO L290 TraceCheckUtils]: 65: Hoare triple {15146#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15171#(<= |main_#t~post6| 6)} is VALID [2022-04-15 15:13:18,652 INFO L290 TraceCheckUtils]: 66: Hoare triple {15171#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {14965#false} is VALID [2022-04-15 15:13:18,652 INFO L272 TraceCheckUtils]: 67: Hoare triple {14965#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14965#false} is VALID [2022-04-15 15:13:18,652 INFO L290 TraceCheckUtils]: 68: Hoare triple {14965#false} ~cond := #in~cond; {14965#false} is VALID [2022-04-15 15:13:18,652 INFO L290 TraceCheckUtils]: 69: Hoare triple {14965#false} assume 0 == ~cond; {14965#false} is VALID [2022-04-15 15:13:18,652 INFO L290 TraceCheckUtils]: 70: Hoare triple {14965#false} assume !false; {14965#false} is VALID [2022-04-15 15:13:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 86 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:13:18,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:19,013 INFO L290 TraceCheckUtils]: 70: Hoare triple {14965#false} assume !false; {14965#false} is VALID [2022-04-15 15:13:19,014 INFO L290 TraceCheckUtils]: 69: Hoare triple {14965#false} assume 0 == ~cond; {14965#false} is VALID [2022-04-15 15:13:19,014 INFO L290 TraceCheckUtils]: 68: Hoare triple {14965#false} ~cond := #in~cond; {14965#false} is VALID [2022-04-15 15:13:19,014 INFO L272 TraceCheckUtils]: 67: Hoare triple {14965#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14965#false} is VALID [2022-04-15 15:13:19,014 INFO L290 TraceCheckUtils]: 66: Hoare triple {15199#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {14965#false} is VALID [2022-04-15 15:13:19,015 INFO L290 TraceCheckUtils]: 65: Hoare triple {15203#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15199#(< |main_#t~post6| 20)} is VALID [2022-04-15 15:13:19,015 INFO L290 TraceCheckUtils]: 64: Hoare triple {15203#(< ~counter~0 20)} assume !(~r~0 < 0); {15203#(< ~counter~0 20)} is VALID [2022-04-15 15:13:19,015 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14964#true} {15203#(< ~counter~0 20)} #98#return; {15203#(< ~counter~0 20)} is VALID [2022-04-15 15:13:19,015 INFO L290 TraceCheckUtils]: 62: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 15:13:19,016 INFO L290 TraceCheckUtils]: 61: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 15:13:19,016 INFO L290 TraceCheckUtils]: 60: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 15:13:19,016 INFO L272 TraceCheckUtils]: 59: Hoare triple {15203#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14964#true} is VALID [2022-04-15 15:13:19,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {15203#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {15203#(< ~counter~0 20)} is VALID [2022-04-15 15:13:19,017 INFO L290 TraceCheckUtils]: 57: Hoare triple {15228#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15203#(< ~counter~0 20)} is VALID [2022-04-15 15:13:19,017 INFO L290 TraceCheckUtils]: 56: Hoare triple {15228#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15228#(< ~counter~0 19)} is VALID [2022-04-15 15:13:19,017 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14964#true} {15228#(< ~counter~0 19)} #98#return; {15228#(< ~counter~0 19)} is VALID [2022-04-15 15:13:19,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 15:13:19,018 INFO L290 TraceCheckUtils]: 53: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 15:13:19,018 INFO L290 TraceCheckUtils]: 52: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 15:13:19,018 INFO L272 TraceCheckUtils]: 51: Hoare triple {15228#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14964#true} is VALID [2022-04-15 15:13:19,018 INFO L290 TraceCheckUtils]: 50: Hoare triple {15228#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {15228#(< ~counter~0 19)} is VALID [2022-04-15 15:13:19,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {15253#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15228#(< ~counter~0 19)} is VALID [2022-04-15 15:13:19,019 INFO L290 TraceCheckUtils]: 48: Hoare triple {15253#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15253#(< ~counter~0 18)} is VALID [2022-04-15 15:13:19,019 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14964#true} {15253#(< ~counter~0 18)} #98#return; {15253#(< ~counter~0 18)} is VALID [2022-04-15 15:13:19,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 15:13:19,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 15:13:19,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 15:13:19,020 INFO L272 TraceCheckUtils]: 43: Hoare triple {15253#(< ~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)); {14964#true} is VALID [2022-04-15 15:13:19,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {15253#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {15253#(< ~counter~0 18)} is VALID [2022-04-15 15:13:19,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {15278#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15253#(< ~counter~0 18)} is VALID [2022-04-15 15:13:19,021 INFO L290 TraceCheckUtils]: 40: Hoare triple {15278#(< ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15278#(< ~counter~0 17)} is VALID [2022-04-15 15:13:19,021 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14964#true} {15278#(< ~counter~0 17)} #98#return; {15278#(< ~counter~0 17)} is VALID [2022-04-15 15:13:19,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 15:13:19,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 15:13:19,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 15:13:19,021 INFO L272 TraceCheckUtils]: 35: Hoare triple {15278#(< ~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)); {14964#true} is VALID [2022-04-15 15:13:19,022 INFO L290 TraceCheckUtils]: 34: Hoare triple {15278#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {15278#(< ~counter~0 17)} is VALID [2022-04-15 15:13:19,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {15303#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15278#(< ~counter~0 17)} is VALID [2022-04-15 15:13:19,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {15303#(< ~counter~0 16)} assume !(~r~0 > 0); {15303#(< ~counter~0 16)} is VALID [2022-04-15 15:13:19,023 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14964#true} {15303#(< ~counter~0 16)} #96#return; {15303#(< ~counter~0 16)} is VALID [2022-04-15 15:13:19,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 15:13:19,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 15:13:19,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 15:13:19,023 INFO L272 TraceCheckUtils]: 27: Hoare triple {15303#(< ~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)); {14964#true} is VALID [2022-04-15 15:13:19,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {15303#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {15303#(< ~counter~0 16)} is VALID [2022-04-15 15:13:19,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {15328#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15303#(< ~counter~0 16)} is VALID [2022-04-15 15:13:19,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {15328#(< ~counter~0 15)} assume !!(0 != ~r~0); {15328#(< ~counter~0 15)} is VALID [2022-04-15 15:13:19,025 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14964#true} {15328#(< ~counter~0 15)} #94#return; {15328#(< ~counter~0 15)} is VALID [2022-04-15 15:13:19,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 15:13:19,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 15:13:19,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 15:13:19,025 INFO L272 TraceCheckUtils]: 19: Hoare triple {15328#(< ~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)); {14964#true} is VALID [2022-04-15 15:13:19,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {15328#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {15328#(< ~counter~0 15)} is VALID [2022-04-15 15:13:19,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {15353#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15328#(< ~counter~0 15)} is VALID [2022-04-15 15:13:19,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {15353#(< ~counter~0 14)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15353#(< ~counter~0 14)} is VALID [2022-04-15 15:13:19,026 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14964#true} {15353#(< ~counter~0 14)} #92#return; {15353#(< ~counter~0 14)} is VALID [2022-04-15 15:13:19,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 15:13:19,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 15:13:19,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 15:13:19,027 INFO L272 TraceCheckUtils]: 11: Hoare triple {15353#(< ~counter~0 14)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {14964#true} is VALID [2022-04-15 15:13:19,027 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14964#true} {15353#(< ~counter~0 14)} #90#return; {15353#(< ~counter~0 14)} is VALID [2022-04-15 15:13:19,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 15:13:19,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 15:13:19,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 15:13:19,027 INFO L272 TraceCheckUtils]: 6: Hoare triple {15353#(< ~counter~0 14)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14964#true} is VALID [2022-04-15 15:13:19,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {15353#(< ~counter~0 14)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {15353#(< ~counter~0 14)} is VALID [2022-04-15 15:13:19,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {15353#(< ~counter~0 14)} call #t~ret9 := main(); {15353#(< ~counter~0 14)} is VALID [2022-04-15 15:13:19,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15353#(< ~counter~0 14)} {14964#true} #102#return; {15353#(< ~counter~0 14)} is VALID [2022-04-15 15:13:19,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {15353#(< ~counter~0 14)} assume true; {15353#(< ~counter~0 14)} is VALID [2022-04-15 15:13:19,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {14964#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15353#(< ~counter~0 14)} is VALID [2022-04-15 15:13:19,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {14964#true} call ULTIMATE.init(); {14964#true} is VALID [2022-04-15 15:13:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 15:13:19,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:19,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590560937] [2022-04-15 15:13:19,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:19,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792397412] [2022-04-15 15:13:19,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792397412] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:19,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:19,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 15:13:19,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:19,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1701168054] [2022-04-15 15:13:19,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1701168054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:19,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:19,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 15:13:19,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401307621] [2022-04-15 15:13:19,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:19,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-15 15:13:19,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:19,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:19,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:19,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 15:13:19,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:19,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 15:13:19,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:13:19,079 INFO L87 Difference]: Start difference. First operand 172 states and 213 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:19,610 INFO L93 Difference]: Finished difference Result 210 states and 262 transitions. [2022-04-15 15:13:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 15:13:19,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-15 15:13:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-15 15:13:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-15 15:13:19,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-15 15:13:19,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:19,732 INFO L225 Difference]: With dead ends: 210 [2022-04-15 15:13:19,732 INFO L226 Difference]: Without dead ends: 205 [2022-04-15 15:13:19,733 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=250, Unknown=0, NotChecked=0, Total=420 [2022-04-15 15:13:19,733 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 49 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:19,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 200 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:13:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-15 15:13:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2022-04-15 15:13:19,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:19,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 193 states, 141 states have (on average 1.198581560283688) internal successors, (169), 146 states have internal predecessors, (169), 37 states have call successors, (37), 16 states have call predecessors, (37), 14 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 15:13:19,901 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 193 states, 141 states have (on average 1.198581560283688) internal successors, (169), 146 states have internal predecessors, (169), 37 states have call successors, (37), 16 states have call predecessors, (37), 14 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 15:13:19,901 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 193 states, 141 states have (on average 1.198581560283688) internal successors, (169), 146 states have internal predecessors, (169), 37 states have call successors, (37), 16 states have call predecessors, (37), 14 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 15:13:19,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:19,906 INFO L93 Difference]: Finished difference Result 205 states and 256 transitions. [2022-04-15 15:13:19,906 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 256 transitions. [2022-04-15 15:13:19,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:19,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:19,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 141 states have (on average 1.198581560283688) internal successors, (169), 146 states have internal predecessors, (169), 37 states have call successors, (37), 16 states have call predecessors, (37), 14 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) Second operand 205 states. [2022-04-15 15:13:19,908 INFO L87 Difference]: Start difference. First operand has 193 states, 141 states have (on average 1.198581560283688) internal successors, (169), 146 states have internal predecessors, (169), 37 states have call successors, (37), 16 states have call predecessors, (37), 14 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) Second operand 205 states. [2022-04-15 15:13:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:19,915 INFO L93 Difference]: Finished difference Result 205 states and 256 transitions. [2022-04-15 15:13:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 256 transitions. [2022-04-15 15:13:19,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:19,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:19,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:19,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 141 states have (on average 1.198581560283688) internal successors, (169), 146 states have internal predecessors, (169), 37 states have call successors, (37), 16 states have call predecessors, (37), 14 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 15:13:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2022-04-15 15:13:19,922 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 71 [2022-04-15 15:13:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:19,924 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2022-04-15 15:13:19,924 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:19,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 241 transitions. [2022-04-15 15:13:25,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 240 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2022-04-15 15:13:25,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 15:13:25,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:25,728 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:13:25,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 15:13:25,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 15:13:25,936 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:25,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-15 15:13:25,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:25,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1529379276] [2022-04-15 15:13:25,937 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:25,937 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-15 15:13:25,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:25,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690728406] [2022-04-15 15:13:25,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:25,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:25,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:25,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107468318] [2022-04-15 15:13:25,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:25,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:25,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:25,953 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:13:25,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 15:13:26,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:26,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:26,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 15:13:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:26,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:26,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {16629#true} call ULTIMATE.init(); {16629#true} is VALID [2022-04-15 15:13:26,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {16629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16629#true} is VALID [2022-04-15 15:13:26,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 15:13:26,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16629#true} {16629#true} #102#return; {16629#true} is VALID [2022-04-15 15:13:26,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {16629#true} call #t~ret9 := main(); {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {16629#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; {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L272 TraceCheckUtils]: 6: Hoare triple {16629#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16629#true} {16629#true} #90#return; {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L272 TraceCheckUtils]: 11: Hoare triple {16629#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)); {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16629#true} {16629#true} #92#return; {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {16629#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {16629#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16629#true} is VALID [2022-04-15 15:13:26,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {16629#true} assume !!(#t~post6 < 20);havoc #t~post6; {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L272 TraceCheckUtils]: 19: Hoare triple {16629#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)); {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16629#true} {16629#true} #94#return; {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {16629#true} assume !!(0 != ~r~0); {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {16629#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {16629#true} assume !!(#t~post7 < 20);havoc #t~post7; {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L272 TraceCheckUtils]: 27: Hoare triple {16629#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)); {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16629#true} {16629#true} #96#return; {16629#true} is VALID [2022-04-15 15:13:26,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {16629#true} assume !(~r~0 > 0); {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {16629#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {16629#true} assume !!(#t~post8 < 20);havoc #t~post8; {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L272 TraceCheckUtils]: 35: Hoare triple {16629#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)); {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16629#true} {16629#true} #98#return; {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {16629#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {16629#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {16629#true} assume !!(#t~post8 < 20);havoc #t~post8; {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L272 TraceCheckUtils]: 43: Hoare triple {16629#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)); {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 15:13:26,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 15:13:26,228 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16629#true} {16629#true} #98#return; {16629#true} is VALID [2022-04-15 15:13:26,228 INFO L290 TraceCheckUtils]: 48: Hoare triple {16629#true} assume !(~r~0 < 0); {16778#(not (< main_~r~0 0))} is VALID [2022-04-15 15:13:26,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {16778#(not (< main_~r~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16778#(not (< main_~r~0 0))} is VALID [2022-04-15 15:13:26,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {16778#(not (< main_~r~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {16778#(not (< main_~r~0 0))} is VALID [2022-04-15 15:13:26,228 INFO L272 TraceCheckUtils]: 51: Hoare triple {16778#(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)); {16629#true} is VALID [2022-04-15 15:13:26,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 15:13:26,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 15:13:26,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 15:13:26,229 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16629#true} {16778#(not (< main_~r~0 0))} #94#return; {16778#(not (< main_~r~0 0))} is VALID [2022-04-15 15:13:26,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {16778#(not (< main_~r~0 0))} assume !!(0 != ~r~0); {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:13:26,230 INFO L290 TraceCheckUtils]: 57: Hoare triple {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:13:26,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 20);havoc #t~post7; {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:13:26,230 INFO L272 TraceCheckUtils]: 59: Hoare triple {16803#(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)); {16629#true} is VALID [2022-04-15 15:13:26,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 15:13:26,230 INFO L290 TraceCheckUtils]: 61: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 15:13:26,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 15:13:26,231 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16629#true} {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #96#return; {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:13:26,231 INFO L290 TraceCheckUtils]: 64: Hoare triple {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {16630#false} is VALID [2022-04-15 15:13:26,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {16630#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16630#false} is VALID [2022-04-15 15:13:26,232 INFO L290 TraceCheckUtils]: 66: Hoare triple {16630#false} assume !(#t~post8 < 20);havoc #t~post8; {16630#false} is VALID [2022-04-15 15:13:26,232 INFO L290 TraceCheckUtils]: 67: Hoare triple {16630#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16630#false} is VALID [2022-04-15 15:13:26,232 INFO L290 TraceCheckUtils]: 68: Hoare triple {16630#false} assume !(#t~post6 < 20);havoc #t~post6; {16630#false} is VALID [2022-04-15 15:13:26,232 INFO L272 TraceCheckUtils]: 69: Hoare triple {16630#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16630#false} is VALID [2022-04-15 15:13:26,232 INFO L290 TraceCheckUtils]: 70: Hoare triple {16630#false} ~cond := #in~cond; {16630#false} is VALID [2022-04-15 15:13:26,232 INFO L290 TraceCheckUtils]: 71: Hoare triple {16630#false} assume 0 == ~cond; {16630#false} is VALID [2022-04-15 15:13:26,232 INFO L290 TraceCheckUtils]: 72: Hoare triple {16630#false} assume !false; {16630#false} is VALID [2022-04-15 15:13:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-15 15:13:26,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:13:26,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:26,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690728406] [2022-04-15 15:13:26,233 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:26,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107468318] [2022-04-15 15:13:26,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107468318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:26,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:26,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:13:26,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:26,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1529379276] [2022-04-15 15:13:26,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1529379276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:26,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:26,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:13:26,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008579526] [2022-04-15 15:13:26,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:26,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-15 15:13:26,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:26,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:13:26,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:26,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:13:26,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:26,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:13:26,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:13:26,270 INFO L87 Difference]: Start difference. First operand 193 states and 241 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:13:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:26,617 INFO L93 Difference]: Finished difference Result 292 states and 388 transitions. [2022-04-15 15:13:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:13:26,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-15 15:13:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:13:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 15:13:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:13:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 15:13:26,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 15:13:26,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:26,708 INFO L225 Difference]: With dead ends: 292 [2022-04-15 15:13:26,708 INFO L226 Difference]: Without dead ends: 227 [2022-04-15 15:13:26,708 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:13:26,709 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:26,709 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:13:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-15 15:13:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 211. [2022-04-15 15:13:26,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:26,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 211 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 15:13:26,963 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 211 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 15:13:26,963 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 211 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 15:13:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:26,969 INFO L93 Difference]: Finished difference Result 227 states and 291 transitions. [2022-04-15 15:13:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 291 transitions. [2022-04-15 15:13:26,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:26,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:26,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) Second operand 227 states. [2022-04-15 15:13:26,970 INFO L87 Difference]: Start difference. First operand has 211 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) Second operand 227 states. [2022-04-15 15:13:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:26,975 INFO L93 Difference]: Finished difference Result 227 states and 291 transitions. [2022-04-15 15:13:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 291 transitions. [2022-04-15 15:13:26,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:26,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:26,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:26,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 15:13:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 269 transitions. [2022-04-15 15:13:26,982 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 269 transitions. Word has length 73 [2022-04-15 15:13:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:26,982 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 269 transitions. [2022-04-15 15:13:26,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:13:26,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 269 transitions. [2022-04-15 15:13:33,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 268 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 269 transitions. [2022-04-15 15:13:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 15:13:33,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:33,734 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:13:33,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 15:13:33,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 15:13:33,947 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:33,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-15 15:13:33,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:33,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [871706634] [2022-04-15 15:13:33,948 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-15 15:13:33,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:33,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222603252] [2022-04-15 15:13:33,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:33,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:33,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:33,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383980578] [2022-04-15 15:13:33,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:33,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:33,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:33,961 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:13:33,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 15:13:34,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:34,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:34,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 15:13:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:34,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:34,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {18311#true} call ULTIMATE.init(); {18311#true} is VALID [2022-04-15 15:13:34,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {18311#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {18319#(<= ~counter~0 0)} assume true; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18319#(<= ~counter~0 0)} {18311#true} #102#return; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {18319#(<= ~counter~0 0)} call #t~ret9 := main(); {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {18319#(<= ~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; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,399 INFO L272 TraceCheckUtils]: 6: Hoare triple {18319#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {18319#(<= ~counter~0 0)} ~cond := #in~cond; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {18319#(<= ~counter~0 0)} assume !(0 == ~cond); {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {18319#(<= ~counter~0 0)} assume true; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,400 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18319#(<= ~counter~0 0)} {18319#(<= ~counter~0 0)} #90#return; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,400 INFO L272 TraceCheckUtils]: 11: Hoare triple {18319#(<= ~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)); {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {18319#(<= ~counter~0 0)} ~cond := #in~cond; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {18319#(<= ~counter~0 0)} assume !(0 == ~cond); {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {18319#(<= ~counter~0 0)} assume true; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,402 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18319#(<= ~counter~0 0)} {18319#(<= ~counter~0 0)} #92#return; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {18319#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {18319#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18368#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {18368#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {18368#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,404 INFO L272 TraceCheckUtils]: 19: Hoare triple {18368#(<= ~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)); {18368#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {18368#(<= ~counter~0 1)} ~cond := #in~cond; {18368#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {18368#(<= ~counter~0 1)} assume !(0 == ~cond); {18368#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {18368#(<= ~counter~0 1)} assume true; {18368#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,405 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18368#(<= ~counter~0 1)} {18368#(<= ~counter~0 1)} #94#return; {18368#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {18368#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18368#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {18368#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18393#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {18393#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {18393#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,406 INFO L272 TraceCheckUtils]: 27: Hoare triple {18393#(<= ~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)); {18393#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {18393#(<= ~counter~0 2)} ~cond := #in~cond; {18393#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {18393#(<= ~counter~0 2)} assume !(0 == ~cond); {18393#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {18393#(<= ~counter~0 2)} assume true; {18393#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,408 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18393#(<= ~counter~0 2)} {18393#(<= ~counter~0 2)} #96#return; {18393#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {18393#(<= ~counter~0 2)} assume !(~r~0 > 0); {18393#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {18393#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18418#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {18418#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {18418#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,409 INFO L272 TraceCheckUtils]: 35: Hoare triple {18418#(<= ~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)); {18418#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {18418#(<= ~counter~0 3)} ~cond := #in~cond; {18418#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {18418#(<= ~counter~0 3)} assume !(0 == ~cond); {18418#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {18418#(<= ~counter~0 3)} assume true; {18418#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,411 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18418#(<= ~counter~0 3)} {18418#(<= ~counter~0 3)} #98#return; {18418#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,411 INFO L290 TraceCheckUtils]: 40: Hoare triple {18418#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18418#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {18418#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18443#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {18443#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {18443#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,412 INFO L272 TraceCheckUtils]: 43: Hoare triple {18443#(<= ~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)); {18443#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {18443#(<= ~counter~0 4)} ~cond := #in~cond; {18443#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {18443#(<= ~counter~0 4)} assume !(0 == ~cond); {18443#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,414 INFO L290 TraceCheckUtils]: 46: Hoare triple {18443#(<= ~counter~0 4)} assume true; {18443#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,414 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18443#(<= ~counter~0 4)} {18443#(<= ~counter~0 4)} #98#return; {18443#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,415 INFO L290 TraceCheckUtils]: 48: Hoare triple {18443#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18443#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {18443#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18468#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,416 INFO L290 TraceCheckUtils]: 50: Hoare triple {18468#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {18468#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,416 INFO L272 TraceCheckUtils]: 51: Hoare triple {18468#(<= ~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)); {18468#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,416 INFO L290 TraceCheckUtils]: 52: Hoare triple {18468#(<= ~counter~0 5)} ~cond := #in~cond; {18468#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {18468#(<= ~counter~0 5)} assume !(0 == ~cond); {18468#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {18468#(<= ~counter~0 5)} assume true; {18468#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,417 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18468#(<= ~counter~0 5)} {18468#(<= ~counter~0 5)} #98#return; {18468#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,418 INFO L290 TraceCheckUtils]: 56: Hoare triple {18468#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18468#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {18468#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18493#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,418 INFO L290 TraceCheckUtils]: 58: Hoare triple {18493#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {18493#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,419 INFO L272 TraceCheckUtils]: 59: Hoare triple {18493#(<= ~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)); {18493#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,419 INFO L290 TraceCheckUtils]: 60: Hoare triple {18493#(<= ~counter~0 6)} ~cond := #in~cond; {18493#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {18493#(<= ~counter~0 6)} assume !(0 == ~cond); {18493#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {18493#(<= ~counter~0 6)} assume true; {18493#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,423 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18493#(<= ~counter~0 6)} {18493#(<= ~counter~0 6)} #98#return; {18493#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,424 INFO L290 TraceCheckUtils]: 64: Hoare triple {18493#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18493#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,424 INFO L290 TraceCheckUtils]: 65: Hoare triple {18493#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18518#(<= |main_#t~post8| 6)} is VALID [2022-04-15 15:13:34,431 INFO L290 TraceCheckUtils]: 66: Hoare triple {18518#(<= |main_#t~post8| 6)} assume !(#t~post8 < 20);havoc #t~post8; {18312#false} is VALID [2022-04-15 15:13:34,431 INFO L290 TraceCheckUtils]: 67: Hoare triple {18312#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18312#false} is VALID [2022-04-15 15:13:34,431 INFO L290 TraceCheckUtils]: 68: Hoare triple {18312#false} assume !(#t~post6 < 20);havoc #t~post6; {18312#false} is VALID [2022-04-15 15:13:34,432 INFO L272 TraceCheckUtils]: 69: Hoare triple {18312#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18312#false} is VALID [2022-04-15 15:13:34,432 INFO L290 TraceCheckUtils]: 70: Hoare triple {18312#false} ~cond := #in~cond; {18312#false} is VALID [2022-04-15 15:13:34,432 INFO L290 TraceCheckUtils]: 71: Hoare triple {18312#false} assume 0 == ~cond; {18312#false} is VALID [2022-04-15 15:13:34,432 INFO L290 TraceCheckUtils]: 72: Hoare triple {18312#false} assume !false; {18312#false} is VALID [2022-04-15 15:13:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:13:34,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:34,829 INFO L290 TraceCheckUtils]: 72: Hoare triple {18312#false} assume !false; {18312#false} is VALID [2022-04-15 15:13:34,830 INFO L290 TraceCheckUtils]: 71: Hoare triple {18312#false} assume 0 == ~cond; {18312#false} is VALID [2022-04-15 15:13:34,830 INFO L290 TraceCheckUtils]: 70: Hoare triple {18312#false} ~cond := #in~cond; {18312#false} is VALID [2022-04-15 15:13:34,830 INFO L272 TraceCheckUtils]: 69: Hoare triple {18312#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18312#false} is VALID [2022-04-15 15:13:34,830 INFO L290 TraceCheckUtils]: 68: Hoare triple {18312#false} assume !(#t~post6 < 20);havoc #t~post6; {18312#false} is VALID [2022-04-15 15:13:34,830 INFO L290 TraceCheckUtils]: 67: Hoare triple {18312#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18312#false} is VALID [2022-04-15 15:13:34,830 INFO L290 TraceCheckUtils]: 66: Hoare triple {18558#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {18312#false} is VALID [2022-04-15 15:13:34,830 INFO L290 TraceCheckUtils]: 65: Hoare triple {18562#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18558#(< |main_#t~post8| 20)} is VALID [2022-04-15 15:13:34,831 INFO L290 TraceCheckUtils]: 64: Hoare triple {18562#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18562#(< ~counter~0 20)} is VALID [2022-04-15 15:13:34,831 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18311#true} {18562#(< ~counter~0 20)} #98#return; {18562#(< ~counter~0 20)} is VALID [2022-04-15 15:13:34,831 INFO L290 TraceCheckUtils]: 62: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 15:13:34,831 INFO L290 TraceCheckUtils]: 61: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 15:13:34,832 INFO L290 TraceCheckUtils]: 60: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 15:13:34,832 INFO L272 TraceCheckUtils]: 59: Hoare triple {18562#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18311#true} is VALID [2022-04-15 15:13:34,832 INFO L290 TraceCheckUtils]: 58: Hoare triple {18562#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {18562#(< ~counter~0 20)} is VALID [2022-04-15 15:13:34,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {18587#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18562#(< ~counter~0 20)} is VALID [2022-04-15 15:13:34,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {18587#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18587#(< ~counter~0 19)} is VALID [2022-04-15 15:13:34,833 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18311#true} {18587#(< ~counter~0 19)} #98#return; {18587#(< ~counter~0 19)} is VALID [2022-04-15 15:13:34,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 15:13:34,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 15:13:34,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 15:13:34,834 INFO L272 TraceCheckUtils]: 51: Hoare triple {18587#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18311#true} is VALID [2022-04-15 15:13:34,834 INFO L290 TraceCheckUtils]: 50: Hoare triple {18587#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {18587#(< ~counter~0 19)} is VALID [2022-04-15 15:13:34,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {18612#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18587#(< ~counter~0 19)} is VALID [2022-04-15 15:13:34,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {18612#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18612#(< ~counter~0 18)} is VALID [2022-04-15 15:13:34,836 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18311#true} {18612#(< ~counter~0 18)} #98#return; {18612#(< ~counter~0 18)} is VALID [2022-04-15 15:13:34,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 15:13:34,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 15:13:34,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 15:13:34,836 INFO L272 TraceCheckUtils]: 43: Hoare triple {18612#(< ~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)); {18311#true} is VALID [2022-04-15 15:13:34,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {18612#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {18612#(< ~counter~0 18)} is VALID [2022-04-15 15:13:34,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {18637#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18612#(< ~counter~0 18)} is VALID [2022-04-15 15:13:34,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {18637#(< ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18637#(< ~counter~0 17)} is VALID [2022-04-15 15:13:34,838 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18311#true} {18637#(< ~counter~0 17)} #98#return; {18637#(< ~counter~0 17)} is VALID [2022-04-15 15:13:34,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 15:13:34,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 15:13:34,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 15:13:34,838 INFO L272 TraceCheckUtils]: 35: Hoare triple {18637#(< ~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)); {18311#true} is VALID [2022-04-15 15:13:34,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {18637#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {18637#(< ~counter~0 17)} is VALID [2022-04-15 15:13:34,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {18662#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18637#(< ~counter~0 17)} is VALID [2022-04-15 15:13:34,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {18662#(< ~counter~0 16)} assume !(~r~0 > 0); {18662#(< ~counter~0 16)} is VALID [2022-04-15 15:13:34,840 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18311#true} {18662#(< ~counter~0 16)} #96#return; {18662#(< ~counter~0 16)} is VALID [2022-04-15 15:13:34,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 15:13:34,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 15:13:34,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 15:13:34,840 INFO L272 TraceCheckUtils]: 27: Hoare triple {18662#(< ~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)); {18311#true} is VALID [2022-04-15 15:13:34,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {18662#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {18662#(< ~counter~0 16)} is VALID [2022-04-15 15:13:34,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {18687#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18662#(< ~counter~0 16)} is VALID [2022-04-15 15:13:34,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {18687#(< ~counter~0 15)} assume !!(0 != ~r~0); {18687#(< ~counter~0 15)} is VALID [2022-04-15 15:13:34,842 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18311#true} {18687#(< ~counter~0 15)} #94#return; {18687#(< ~counter~0 15)} is VALID [2022-04-15 15:13:34,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 15:13:34,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 15:13:34,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 15:13:34,842 INFO L272 TraceCheckUtils]: 19: Hoare triple {18687#(< ~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)); {18311#true} is VALID [2022-04-15 15:13:34,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {18687#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {18687#(< ~counter~0 15)} is VALID [2022-04-15 15:13:34,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {18712#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18687#(< ~counter~0 15)} is VALID [2022-04-15 15:13:34,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {18712#(< ~counter~0 14)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18712#(< ~counter~0 14)} is VALID [2022-04-15 15:13:34,843 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18311#true} {18712#(< ~counter~0 14)} #92#return; {18712#(< ~counter~0 14)} is VALID [2022-04-15 15:13:34,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 15:13:34,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 15:13:34,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 15:13:34,844 INFO L272 TraceCheckUtils]: 11: Hoare triple {18712#(< ~counter~0 14)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {18311#true} is VALID [2022-04-15 15:13:34,844 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18311#true} {18712#(< ~counter~0 14)} #90#return; {18712#(< ~counter~0 14)} is VALID [2022-04-15 15:13:34,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 15:13:34,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 15:13:34,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 15:13:34,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {18712#(< ~counter~0 14)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18311#true} is VALID [2022-04-15 15:13:34,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {18712#(< ~counter~0 14)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {18712#(< ~counter~0 14)} is VALID [2022-04-15 15:13:34,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {18712#(< ~counter~0 14)} call #t~ret9 := main(); {18712#(< ~counter~0 14)} is VALID [2022-04-15 15:13:34,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18712#(< ~counter~0 14)} {18311#true} #102#return; {18712#(< ~counter~0 14)} is VALID [2022-04-15 15:13:34,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {18712#(< ~counter~0 14)} assume true; {18712#(< ~counter~0 14)} is VALID [2022-04-15 15:13:34,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {18311#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18712#(< ~counter~0 14)} is VALID [2022-04-15 15:13:34,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {18311#true} call ULTIMATE.init(); {18311#true} is VALID [2022-04-15 15:13:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 15:13:34,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:34,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222603252] [2022-04-15 15:13:34,847 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:34,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383980578] [2022-04-15 15:13:34,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383980578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:34,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:34,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 15:13:34,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:34,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [871706634] [2022-04-15 15:13:34,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [871706634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:34,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:34,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 15:13:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769914802] [2022-04-15 15:13:34,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:34,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-15 15:13:34,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:34,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:34,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:34,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 15:13:34,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:34,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 15:13:34,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:13:34,907 INFO L87 Difference]: Start difference. First operand 211 states and 269 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:35,569 INFO L93 Difference]: Finished difference Result 309 states and 409 transitions. [2022-04-15 15:13:35,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 15:13:35,570 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-15 15:13:35,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-15 15:13:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-15 15:13:35,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-15 15:13:35,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:35,707 INFO L225 Difference]: With dead ends: 309 [2022-04-15 15:13:35,707 INFO L226 Difference]: Without dead ends: 222 [2022-04-15 15:13:35,708 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=277, Unknown=0, NotChecked=0, Total=462 [2022-04-15 15:13:35,708 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 66 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:35,708 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 184 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:13:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-15 15:13:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 216. [2022-04-15 15:13:35,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:35,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 216 states, 160 states have (on average 1.21875) internal successors, (195), 164 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 15:13:35,910 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 216 states, 160 states have (on average 1.21875) internal successors, (195), 164 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 15:13:35,910 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 216 states, 160 states have (on average 1.21875) internal successors, (195), 164 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 15:13:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:35,915 INFO L93 Difference]: Finished difference Result 222 states and 281 transitions. [2022-04-15 15:13:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 281 transitions. [2022-04-15 15:13:35,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:35,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:35,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 160 states have (on average 1.21875) internal successors, (195), 164 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) Second operand 222 states. [2022-04-15 15:13:35,917 INFO L87 Difference]: Start difference. First operand has 216 states, 160 states have (on average 1.21875) internal successors, (195), 164 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) Second operand 222 states. [2022-04-15 15:13:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:35,921 INFO L93 Difference]: Finished difference Result 222 states and 281 transitions. [2022-04-15 15:13:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 281 transitions. [2022-04-15 15:13:35,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:35,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:35,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:35,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 160 states have (on average 1.21875) internal successors, (195), 164 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 15:13:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 275 transitions. [2022-04-15 15:13:35,928 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 275 transitions. Word has length 73 [2022-04-15 15:13:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:35,929 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 275 transitions. [2022-04-15 15:13:35,929 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:35,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 275 transitions. [2022-04-15 15:13:48,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 270 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 275 transitions. [2022-04-15 15:13:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 15:13:48,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:48,246 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:13:48,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 15:13:48,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:48,459 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:48,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-15 15:13:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:48,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1456971717] [2022-04-15 15:13:48,460 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-15 15:13:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:48,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310239776] [2022-04-15 15:13:48,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:48,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:48,475 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:48,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [798892118] [2022-04-15 15:13:48,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:48,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:48,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:48,476 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:13:48,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 15:13:48,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:48,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:48,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 15:13:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:48,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:48,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {20268#true} call ULTIMATE.init(); {20268#true} is VALID [2022-04-15 15:13:48,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {20268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {20276#(<= ~counter~0 0)} assume true; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20276#(<= ~counter~0 0)} {20268#true} #102#return; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {20276#(<= ~counter~0 0)} call #t~ret9 := main(); {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {20276#(<= ~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; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,890 INFO L272 TraceCheckUtils]: 6: Hoare triple {20276#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {20276#(<= ~counter~0 0)} ~cond := #in~cond; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {20276#(<= ~counter~0 0)} assume !(0 == ~cond); {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {20276#(<= ~counter~0 0)} assume true; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,891 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20276#(<= ~counter~0 0)} {20276#(<= ~counter~0 0)} #90#return; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,892 INFO L272 TraceCheckUtils]: 11: Hoare triple {20276#(<= ~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)); {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {20276#(<= ~counter~0 0)} ~cond := #in~cond; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {20276#(<= ~counter~0 0)} assume !(0 == ~cond); {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {20276#(<= ~counter~0 0)} assume true; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,893 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20276#(<= ~counter~0 0)} {20276#(<= ~counter~0 0)} #92#return; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {20276#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {20276#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20325#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {20325#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {20325#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,896 INFO L272 TraceCheckUtils]: 19: Hoare triple {20325#(<= ~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)); {20325#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {20325#(<= ~counter~0 1)} ~cond := #in~cond; {20325#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {20325#(<= ~counter~0 1)} assume !(0 == ~cond); {20325#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {20325#(<= ~counter~0 1)} assume true; {20325#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,897 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20325#(<= ~counter~0 1)} {20325#(<= ~counter~0 1)} #94#return; {20325#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {20325#(<= ~counter~0 1)} assume !!(0 != ~r~0); {20325#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {20325#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20350#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {20350#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {20350#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,900 INFO L272 TraceCheckUtils]: 27: Hoare triple {20350#(<= ~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)); {20350#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {20350#(<= ~counter~0 2)} ~cond := #in~cond; {20350#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {20350#(<= ~counter~0 2)} assume !(0 == ~cond); {20350#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {20350#(<= ~counter~0 2)} assume true; {20350#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,901 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20350#(<= ~counter~0 2)} {20350#(<= ~counter~0 2)} #96#return; {20350#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {20350#(<= ~counter~0 2)} assume !(~r~0 > 0); {20350#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {20350#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20375#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {20375#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {20375#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,904 INFO L272 TraceCheckUtils]: 35: Hoare triple {20375#(<= ~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)); {20375#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {20375#(<= ~counter~0 3)} ~cond := #in~cond; {20375#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {20375#(<= ~counter~0 3)} assume !(0 == ~cond); {20375#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {20375#(<= ~counter~0 3)} assume true; {20375#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,906 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20375#(<= ~counter~0 3)} {20375#(<= ~counter~0 3)} #98#return; {20375#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {20375#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20375#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {20375#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20400#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,907 INFO L290 TraceCheckUtils]: 42: Hoare triple {20400#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {20400#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,908 INFO L272 TraceCheckUtils]: 43: Hoare triple {20400#(<= ~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)); {20400#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {20400#(<= ~counter~0 4)} ~cond := #in~cond; {20400#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {20400#(<= ~counter~0 4)} assume !(0 == ~cond); {20400#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {20400#(<= ~counter~0 4)} assume true; {20400#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,910 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20400#(<= ~counter~0 4)} {20400#(<= ~counter~0 4)} #98#return; {20400#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {20400#(<= ~counter~0 4)} assume !(~r~0 < 0); {20400#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {20400#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20425#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {20425#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {20425#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,912 INFO L272 TraceCheckUtils]: 51: Hoare triple {20425#(<= ~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)); {20425#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {20425#(<= ~counter~0 5)} ~cond := #in~cond; {20425#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,913 INFO L290 TraceCheckUtils]: 53: Hoare triple {20425#(<= ~counter~0 5)} assume !(0 == ~cond); {20425#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,913 INFO L290 TraceCheckUtils]: 54: Hoare triple {20425#(<= ~counter~0 5)} assume true; {20425#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,914 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20425#(<= ~counter~0 5)} {20425#(<= ~counter~0 5)} #94#return; {20425#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,914 INFO L290 TraceCheckUtils]: 56: Hoare triple {20425#(<= ~counter~0 5)} assume !!(0 != ~r~0); {20425#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {20425#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20450#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,915 INFO L290 TraceCheckUtils]: 58: Hoare triple {20450#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {20450#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,916 INFO L272 TraceCheckUtils]: 59: Hoare triple {20450#(<= ~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)); {20450#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,917 INFO L290 TraceCheckUtils]: 60: Hoare triple {20450#(<= ~counter~0 6)} ~cond := #in~cond; {20450#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {20450#(<= ~counter~0 6)} assume !(0 == ~cond); {20450#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {20450#(<= ~counter~0 6)} assume true; {20450#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,918 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20450#(<= ~counter~0 6)} {20450#(<= ~counter~0 6)} #96#return; {20450#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,918 INFO L290 TraceCheckUtils]: 64: Hoare triple {20450#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20450#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,919 INFO L290 TraceCheckUtils]: 65: Hoare triple {20450#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20475#(<= |main_#t~post7| 6)} is VALID [2022-04-15 15:13:48,919 INFO L290 TraceCheckUtils]: 66: Hoare triple {20475#(<= |main_#t~post7| 6)} assume !(#t~post7 < 20);havoc #t~post7; {20269#false} is VALID [2022-04-15 15:13:48,919 INFO L290 TraceCheckUtils]: 67: Hoare triple {20269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20269#false} is VALID [2022-04-15 15:13:48,919 INFO L290 TraceCheckUtils]: 68: Hoare triple {20269#false} assume !(#t~post8 < 20);havoc #t~post8; {20269#false} is VALID [2022-04-15 15:13:48,920 INFO L290 TraceCheckUtils]: 69: Hoare triple {20269#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20269#false} is VALID [2022-04-15 15:13:48,920 INFO L290 TraceCheckUtils]: 70: Hoare triple {20269#false} assume !(#t~post6 < 20);havoc #t~post6; {20269#false} is VALID [2022-04-15 15:13:48,920 INFO L272 TraceCheckUtils]: 71: Hoare triple {20269#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20269#false} is VALID [2022-04-15 15:13:48,920 INFO L290 TraceCheckUtils]: 72: Hoare triple {20269#false} ~cond := #in~cond; {20269#false} is VALID [2022-04-15 15:13:48,920 INFO L290 TraceCheckUtils]: 73: Hoare triple {20269#false} assume 0 == ~cond; {20269#false} is VALID [2022-04-15 15:13:48,920 INFO L290 TraceCheckUtils]: 74: Hoare triple {20269#false} assume !false; {20269#false} is VALID [2022-04-15 15:13:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:13:48,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:49,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {20269#false} assume !false; {20269#false} is VALID [2022-04-15 15:13:49,331 INFO L290 TraceCheckUtils]: 73: Hoare triple {20269#false} assume 0 == ~cond; {20269#false} is VALID [2022-04-15 15:13:49,331 INFO L290 TraceCheckUtils]: 72: Hoare triple {20269#false} ~cond := #in~cond; {20269#false} is VALID [2022-04-15 15:13:49,331 INFO L272 TraceCheckUtils]: 71: Hoare triple {20269#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20269#false} is VALID [2022-04-15 15:13:49,331 INFO L290 TraceCheckUtils]: 70: Hoare triple {20269#false} assume !(#t~post6 < 20);havoc #t~post6; {20269#false} is VALID [2022-04-15 15:13:49,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {20269#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20269#false} is VALID [2022-04-15 15:13:49,331 INFO L290 TraceCheckUtils]: 68: Hoare triple {20269#false} assume !(#t~post8 < 20);havoc #t~post8; {20269#false} is VALID [2022-04-15 15:13:49,332 INFO L290 TraceCheckUtils]: 67: Hoare triple {20269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20269#false} is VALID [2022-04-15 15:13:49,332 INFO L290 TraceCheckUtils]: 66: Hoare triple {20527#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {20269#false} is VALID [2022-04-15 15:13:49,332 INFO L290 TraceCheckUtils]: 65: Hoare triple {20531#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20527#(< |main_#t~post7| 20)} is VALID [2022-04-15 15:13:49,332 INFO L290 TraceCheckUtils]: 64: Hoare triple {20531#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20531#(< ~counter~0 20)} is VALID [2022-04-15 15:13:49,333 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20268#true} {20531#(< ~counter~0 20)} #96#return; {20531#(< ~counter~0 20)} is VALID [2022-04-15 15:13:49,333 INFO L290 TraceCheckUtils]: 62: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 15:13:49,333 INFO L290 TraceCheckUtils]: 61: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 15:13:49,333 INFO L290 TraceCheckUtils]: 60: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 15:13:49,333 INFO L272 TraceCheckUtils]: 59: Hoare triple {20531#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20268#true} is VALID [2022-04-15 15:13:49,334 INFO L290 TraceCheckUtils]: 58: Hoare triple {20531#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {20531#(< ~counter~0 20)} is VALID [2022-04-15 15:13:49,334 INFO L290 TraceCheckUtils]: 57: Hoare triple {20556#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20531#(< ~counter~0 20)} is VALID [2022-04-15 15:13:49,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {20556#(< ~counter~0 19)} assume !!(0 != ~r~0); {20556#(< ~counter~0 19)} is VALID [2022-04-15 15:13:49,335 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20268#true} {20556#(< ~counter~0 19)} #94#return; {20556#(< ~counter~0 19)} is VALID [2022-04-15 15:13:49,335 INFO L290 TraceCheckUtils]: 54: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 15:13:49,335 INFO L290 TraceCheckUtils]: 53: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 15:13:49,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 15:13:49,335 INFO L272 TraceCheckUtils]: 51: Hoare triple {20556#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20268#true} is VALID [2022-04-15 15:13:49,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {20556#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {20556#(< ~counter~0 19)} is VALID [2022-04-15 15:13:49,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {20581#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20556#(< ~counter~0 19)} is VALID [2022-04-15 15:13:49,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {20581#(< ~counter~0 18)} assume !(~r~0 < 0); {20581#(< ~counter~0 18)} is VALID [2022-04-15 15:13:49,337 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20268#true} {20581#(< ~counter~0 18)} #98#return; {20581#(< ~counter~0 18)} is VALID [2022-04-15 15:13:49,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 15:13:49,337 INFO L290 TraceCheckUtils]: 45: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 15:13:49,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 15:13:49,337 INFO L272 TraceCheckUtils]: 43: Hoare triple {20581#(< ~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)); {20268#true} is VALID [2022-04-15 15:13:49,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {20581#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {20581#(< ~counter~0 18)} is VALID [2022-04-15 15:13:49,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {20606#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20581#(< ~counter~0 18)} is VALID [2022-04-15 15:13:49,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {20606#(< ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20606#(< ~counter~0 17)} is VALID [2022-04-15 15:13:49,339 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20268#true} {20606#(< ~counter~0 17)} #98#return; {20606#(< ~counter~0 17)} is VALID [2022-04-15 15:13:49,339 INFO L290 TraceCheckUtils]: 38: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 15:13:49,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 15:13:49,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 15:13:49,339 INFO L272 TraceCheckUtils]: 35: Hoare triple {20606#(< ~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)); {20268#true} is VALID [2022-04-15 15:13:49,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {20606#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {20606#(< ~counter~0 17)} is VALID [2022-04-15 15:13:49,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {20631#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20606#(< ~counter~0 17)} is VALID [2022-04-15 15:13:49,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {20631#(< ~counter~0 16)} assume !(~r~0 > 0); {20631#(< ~counter~0 16)} is VALID [2022-04-15 15:13:49,341 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20268#true} {20631#(< ~counter~0 16)} #96#return; {20631#(< ~counter~0 16)} is VALID [2022-04-15 15:13:49,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 15:13:49,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 15:13:49,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 15:13:49,341 INFO L272 TraceCheckUtils]: 27: Hoare triple {20631#(< ~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)); {20268#true} is VALID [2022-04-15 15:13:49,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {20631#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {20631#(< ~counter~0 16)} is VALID [2022-04-15 15:13:49,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {20656#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20631#(< ~counter~0 16)} is VALID [2022-04-15 15:13:49,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {20656#(< ~counter~0 15)} assume !!(0 != ~r~0); {20656#(< ~counter~0 15)} is VALID [2022-04-15 15:13:49,343 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20268#true} {20656#(< ~counter~0 15)} #94#return; {20656#(< ~counter~0 15)} is VALID [2022-04-15 15:13:49,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 15:13:49,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 15:13:49,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 15:13:49,343 INFO L272 TraceCheckUtils]: 19: Hoare triple {20656#(< ~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)); {20268#true} is VALID [2022-04-15 15:13:49,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {20656#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {20656#(< ~counter~0 15)} is VALID [2022-04-15 15:13:49,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {20681#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20656#(< ~counter~0 15)} is VALID [2022-04-15 15:13:49,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {20681#(< ~counter~0 14)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20681#(< ~counter~0 14)} is VALID [2022-04-15 15:13:49,344 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20268#true} {20681#(< ~counter~0 14)} #92#return; {20681#(< ~counter~0 14)} is VALID [2022-04-15 15:13:49,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 15:13:49,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 15:13:49,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 15:13:49,345 INFO L272 TraceCheckUtils]: 11: Hoare triple {20681#(< ~counter~0 14)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {20268#true} is VALID [2022-04-15 15:13:49,345 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20268#true} {20681#(< ~counter~0 14)} #90#return; {20681#(< ~counter~0 14)} is VALID [2022-04-15 15:13:49,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 15:13:49,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 15:13:49,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 15:13:49,345 INFO L272 TraceCheckUtils]: 6: Hoare triple {20681#(< ~counter~0 14)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20268#true} is VALID [2022-04-15 15:13:49,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {20681#(< ~counter~0 14)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {20681#(< ~counter~0 14)} is VALID [2022-04-15 15:13:49,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {20681#(< ~counter~0 14)} call #t~ret9 := main(); {20681#(< ~counter~0 14)} is VALID [2022-04-15 15:13:49,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20681#(< ~counter~0 14)} {20268#true} #102#return; {20681#(< ~counter~0 14)} is VALID [2022-04-15 15:13:49,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {20681#(< ~counter~0 14)} assume true; {20681#(< ~counter~0 14)} is VALID [2022-04-15 15:13:49,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {20268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20681#(< ~counter~0 14)} is VALID [2022-04-15 15:13:49,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {20268#true} call ULTIMATE.init(); {20268#true} is VALID [2022-04-15 15:13:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 15:13:49,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:49,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310239776] [2022-04-15 15:13:49,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:49,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798892118] [2022-04-15 15:13:49,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798892118] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:49,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:49,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 15:13:49,348 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:49,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1456971717] [2022-04-15 15:13:49,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1456971717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:49,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:49,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 15:13:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934178018] [2022-04-15 15:13:49,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:49,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-15 15:13:49,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:49,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:49,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:49,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 15:13:49,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:49,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 15:13:49,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:13:49,399 INFO L87 Difference]: Start difference. First operand 216 states and 275 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:50,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:50,012 INFO L93 Difference]: Finished difference Result 288 states and 375 transitions. [2022-04-15 15:13:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 15:13:50,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-15 15:13:50,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-15 15:13:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-15 15:13:50,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-15 15:13:50,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:50,162 INFO L225 Difference]: With dead ends: 288 [2022-04-15 15:13:50,162 INFO L226 Difference]: Without dead ends: 225 [2022-04-15 15:13:50,163 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=301, Unknown=0, NotChecked=0, Total=506 [2022-04-15 15:13:50,163 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 53 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:50,164 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 201 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:13:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-15 15:13:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2022-04-15 15:13:50,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:50,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 15:13:50,375 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 15:13:50,375 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 15:13:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:50,380 INFO L93 Difference]: Finished difference Result 225 states and 284 transitions. [2022-04-15 15:13:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 284 transitions. [2022-04-15 15:13:50,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:50,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:50,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) Second operand 225 states. [2022-04-15 15:13:50,382 INFO L87 Difference]: Start difference. First operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) Second operand 225 states. [2022-04-15 15:13:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:50,386 INFO L93 Difference]: Finished difference Result 225 states and 284 transitions. [2022-04-15 15:13:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 284 transitions. [2022-04-15 15:13:50,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:50,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:50,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:50,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 15:13:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 281 transitions. [2022-04-15 15:13:50,393 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 281 transitions. Word has length 75 [2022-04-15 15:13:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:50,393 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 281 transitions. [2022-04-15 15:13:50,394 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 15:13:50,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 281 transitions. [2022-04-15 15:14:01,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 277 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 281 transitions. [2022-04-15 15:14:01,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 15:14:01,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:01,939 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:14:01,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 15:14:02,161 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:02,162 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:02,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:02,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-15 15:14:02,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:02,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [444891336] [2022-04-15 15:14:02,162 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-15 15:14:02,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:02,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738941928] [2022-04-15 15:14:02,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:02,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:02,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:02,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571636755] [2022-04-15 15:14:02,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:14:02,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:02,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:02,176 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:14:02,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 15:14:02,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:14:02,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:02,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 15:14:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:02,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:02,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {22215#true} call ULTIMATE.init(); {22215#true} is VALID [2022-04-15 15:14:02,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {22215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {22223#(<= ~counter~0 0)} assume true; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22223#(<= ~counter~0 0)} {22215#true} #102#return; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {22223#(<= ~counter~0 0)} call #t~ret9 := main(); {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {22223#(<= ~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; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,607 INFO L272 TraceCheckUtils]: 6: Hoare triple {22223#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {22223#(<= ~counter~0 0)} ~cond := #in~cond; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {22223#(<= ~counter~0 0)} assume !(0 == ~cond); {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {22223#(<= ~counter~0 0)} assume true; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22223#(<= ~counter~0 0)} {22223#(<= ~counter~0 0)} #90#return; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,609 INFO L272 TraceCheckUtils]: 11: Hoare triple {22223#(<= ~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)); {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {22223#(<= ~counter~0 0)} ~cond := #in~cond; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {22223#(<= ~counter~0 0)} assume !(0 == ~cond); {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {22223#(<= ~counter~0 0)} assume true; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,610 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22223#(<= ~counter~0 0)} {22223#(<= ~counter~0 0)} #92#return; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {22223#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:02,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {22223#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22272#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:02,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {22272#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {22272#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:02,612 INFO L272 TraceCheckUtils]: 19: Hoare triple {22272#(<= ~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)); {22272#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:02,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {22272#(<= ~counter~0 1)} ~cond := #in~cond; {22272#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:02,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {22272#(<= ~counter~0 1)} assume !(0 == ~cond); {22272#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:02,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {22272#(<= ~counter~0 1)} assume true; {22272#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:02,613 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22272#(<= ~counter~0 1)} {22272#(<= ~counter~0 1)} #94#return; {22272#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:02,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {22272#(<= ~counter~0 1)} assume !!(0 != ~r~0); {22272#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:02,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {22272#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22297#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:02,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {22297#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {22297#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:02,615 INFO L272 TraceCheckUtils]: 27: Hoare triple {22297#(<= ~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)); {22297#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:02,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {22297#(<= ~counter~0 2)} ~cond := #in~cond; {22297#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:02,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {22297#(<= ~counter~0 2)} assume !(0 == ~cond); {22297#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:02,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {22297#(<= ~counter~0 2)} assume true; {22297#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:02,616 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22297#(<= ~counter~0 2)} {22297#(<= ~counter~0 2)} #96#return; {22297#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:02,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {22297#(<= ~counter~0 2)} assume !(~r~0 > 0); {22297#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:02,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {22297#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22322#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:02,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {22322#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {22322#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:02,617 INFO L272 TraceCheckUtils]: 35: Hoare triple {22322#(<= ~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)); {22322#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:02,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {22322#(<= ~counter~0 3)} ~cond := #in~cond; {22322#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:02,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {22322#(<= ~counter~0 3)} assume !(0 == ~cond); {22322#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:02,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {22322#(<= ~counter~0 3)} assume true; {22322#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:02,619 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22322#(<= ~counter~0 3)} {22322#(<= ~counter~0 3)} #98#return; {22322#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:02,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {22322#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22322#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:02,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {22322#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22347#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:02,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {22347#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {22347#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:02,620 INFO L272 TraceCheckUtils]: 43: Hoare triple {22347#(<= ~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)); {22347#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:02,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {22347#(<= ~counter~0 4)} ~cond := #in~cond; {22347#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:02,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {22347#(<= ~counter~0 4)} assume !(0 == ~cond); {22347#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:02,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {22347#(<= ~counter~0 4)} assume true; {22347#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:02,622 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22347#(<= ~counter~0 4)} {22347#(<= ~counter~0 4)} #98#return; {22347#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:02,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {22347#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22347#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:02,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {22347#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22372#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:02,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {22372#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {22372#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:02,623 INFO L272 TraceCheckUtils]: 51: Hoare triple {22372#(<= ~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)); {22372#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:02,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {22372#(<= ~counter~0 5)} ~cond := #in~cond; {22372#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:02,624 INFO L290 TraceCheckUtils]: 53: Hoare triple {22372#(<= ~counter~0 5)} assume !(0 == ~cond); {22372#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:02,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {22372#(<= ~counter~0 5)} assume true; {22372#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:02,625 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22372#(<= ~counter~0 5)} {22372#(<= ~counter~0 5)} #98#return; {22372#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:02,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {22372#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22372#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:02,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {22372#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22397#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:02,626 INFO L290 TraceCheckUtils]: 58: Hoare triple {22397#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {22397#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:02,626 INFO L272 TraceCheckUtils]: 59: Hoare triple {22397#(<= ~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)); {22397#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:02,626 INFO L290 TraceCheckUtils]: 60: Hoare triple {22397#(<= ~counter~0 6)} ~cond := #in~cond; {22397#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:02,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {22397#(<= ~counter~0 6)} assume !(0 == ~cond); {22397#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:02,627 INFO L290 TraceCheckUtils]: 62: Hoare triple {22397#(<= ~counter~0 6)} assume true; {22397#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:02,627 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22397#(<= ~counter~0 6)} {22397#(<= ~counter~0 6)} #98#return; {22397#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:02,628 INFO L290 TraceCheckUtils]: 64: Hoare triple {22397#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22397#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:02,628 INFO L290 TraceCheckUtils]: 65: Hoare triple {22397#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22422#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:02,628 INFO L290 TraceCheckUtils]: 66: Hoare triple {22422#(<= ~counter~0 7)} assume !!(#t~post8 < 20);havoc #t~post8; {22422#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:02,629 INFO L272 TraceCheckUtils]: 67: Hoare triple {22422#(<= ~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)); {22422#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:02,629 INFO L290 TraceCheckUtils]: 68: Hoare triple {22422#(<= ~counter~0 7)} ~cond := #in~cond; {22422#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:02,629 INFO L290 TraceCheckUtils]: 69: Hoare triple {22422#(<= ~counter~0 7)} assume !(0 == ~cond); {22422#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:02,630 INFO L290 TraceCheckUtils]: 70: Hoare triple {22422#(<= ~counter~0 7)} assume true; {22422#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:02,630 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22422#(<= ~counter~0 7)} {22422#(<= ~counter~0 7)} #98#return; {22422#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:02,631 INFO L290 TraceCheckUtils]: 72: Hoare triple {22422#(<= ~counter~0 7)} assume !(~r~0 < 0); {22422#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:02,631 INFO L290 TraceCheckUtils]: 73: Hoare triple {22422#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22447#(<= |main_#t~post6| 7)} is VALID [2022-04-15 15:14:02,631 INFO L290 TraceCheckUtils]: 74: Hoare triple {22447#(<= |main_#t~post6| 7)} assume !(#t~post6 < 20);havoc #t~post6; {22216#false} is VALID [2022-04-15 15:14:02,631 INFO L272 TraceCheckUtils]: 75: Hoare triple {22216#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22216#false} is VALID [2022-04-15 15:14:02,631 INFO L290 TraceCheckUtils]: 76: Hoare triple {22216#false} ~cond := #in~cond; {22216#false} is VALID [2022-04-15 15:14:02,631 INFO L290 TraceCheckUtils]: 77: Hoare triple {22216#false} assume 0 == ~cond; {22216#false} is VALID [2022-04-15 15:14:02,632 INFO L290 TraceCheckUtils]: 78: Hoare triple {22216#false} assume !false; {22216#false} is VALID [2022-04-15 15:14:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 126 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:14:02,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:03,071 INFO L290 TraceCheckUtils]: 78: Hoare triple {22216#false} assume !false; {22216#false} is VALID [2022-04-15 15:14:03,071 INFO L290 TraceCheckUtils]: 77: Hoare triple {22216#false} assume 0 == ~cond; {22216#false} is VALID [2022-04-15 15:14:03,071 INFO L290 TraceCheckUtils]: 76: Hoare triple {22216#false} ~cond := #in~cond; {22216#false} is VALID [2022-04-15 15:14:03,071 INFO L272 TraceCheckUtils]: 75: Hoare triple {22216#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22216#false} is VALID [2022-04-15 15:14:03,071 INFO L290 TraceCheckUtils]: 74: Hoare triple {22475#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {22216#false} is VALID [2022-04-15 15:14:03,072 INFO L290 TraceCheckUtils]: 73: Hoare triple {22479#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22475#(< |main_#t~post6| 20)} is VALID [2022-04-15 15:14:03,072 INFO L290 TraceCheckUtils]: 72: Hoare triple {22479#(< ~counter~0 20)} assume !(~r~0 < 0); {22479#(< ~counter~0 20)} is VALID [2022-04-15 15:14:03,072 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22215#true} {22479#(< ~counter~0 20)} #98#return; {22479#(< ~counter~0 20)} is VALID [2022-04-15 15:14:03,073 INFO L290 TraceCheckUtils]: 70: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 15:14:03,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 15:14:03,073 INFO L290 TraceCheckUtils]: 68: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 15:14:03,073 INFO L272 TraceCheckUtils]: 67: Hoare triple {22479#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22215#true} is VALID [2022-04-15 15:14:03,073 INFO L290 TraceCheckUtils]: 66: Hoare triple {22479#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {22479#(< ~counter~0 20)} is VALID [2022-04-15 15:14:03,074 INFO L290 TraceCheckUtils]: 65: Hoare triple {22504#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22479#(< ~counter~0 20)} is VALID [2022-04-15 15:14:03,074 INFO L290 TraceCheckUtils]: 64: Hoare triple {22504#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22504#(< ~counter~0 19)} is VALID [2022-04-15 15:14:03,075 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22215#true} {22504#(< ~counter~0 19)} #98#return; {22504#(< ~counter~0 19)} is VALID [2022-04-15 15:14:03,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 15:14:03,075 INFO L290 TraceCheckUtils]: 61: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 15:14:03,075 INFO L290 TraceCheckUtils]: 60: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 15:14:03,075 INFO L272 TraceCheckUtils]: 59: Hoare triple {22504#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22215#true} is VALID [2022-04-15 15:14:03,075 INFO L290 TraceCheckUtils]: 58: Hoare triple {22504#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {22504#(< ~counter~0 19)} is VALID [2022-04-15 15:14:03,076 INFO L290 TraceCheckUtils]: 57: Hoare triple {22529#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22504#(< ~counter~0 19)} is VALID [2022-04-15 15:14:03,076 INFO L290 TraceCheckUtils]: 56: Hoare triple {22529#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22529#(< ~counter~0 18)} is VALID [2022-04-15 15:14:03,076 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22215#true} {22529#(< ~counter~0 18)} #98#return; {22529#(< ~counter~0 18)} is VALID [2022-04-15 15:14:03,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 15:14:03,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 15:14:03,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 15:14:03,077 INFO L272 TraceCheckUtils]: 51: Hoare triple {22529#(< ~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)); {22215#true} is VALID [2022-04-15 15:14:03,077 INFO L290 TraceCheckUtils]: 50: Hoare triple {22529#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {22529#(< ~counter~0 18)} is VALID [2022-04-15 15:14:03,078 INFO L290 TraceCheckUtils]: 49: Hoare triple {22554#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22529#(< ~counter~0 18)} is VALID [2022-04-15 15:14:03,078 INFO L290 TraceCheckUtils]: 48: Hoare triple {22554#(< ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22554#(< ~counter~0 17)} is VALID [2022-04-15 15:14:03,078 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22215#true} {22554#(< ~counter~0 17)} #98#return; {22554#(< ~counter~0 17)} is VALID [2022-04-15 15:14:03,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 15:14:03,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 15:14:03,079 INFO L290 TraceCheckUtils]: 44: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 15:14:03,079 INFO L272 TraceCheckUtils]: 43: Hoare triple {22554#(< ~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)); {22215#true} is VALID [2022-04-15 15:14:03,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {22554#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {22554#(< ~counter~0 17)} is VALID [2022-04-15 15:14:03,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {22579#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22554#(< ~counter~0 17)} is VALID [2022-04-15 15:14:03,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {22579#(< ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22579#(< ~counter~0 16)} is VALID [2022-04-15 15:14:03,080 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22215#true} {22579#(< ~counter~0 16)} #98#return; {22579#(< ~counter~0 16)} is VALID [2022-04-15 15:14:03,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 15:14:03,080 INFO L290 TraceCheckUtils]: 37: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 15:14:03,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 15:14:03,081 INFO L272 TraceCheckUtils]: 35: Hoare triple {22579#(< ~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)); {22215#true} is VALID [2022-04-15 15:14:03,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {22579#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {22579#(< ~counter~0 16)} is VALID [2022-04-15 15:14:03,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {22604#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22579#(< ~counter~0 16)} is VALID [2022-04-15 15:14:03,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {22604#(< ~counter~0 15)} assume !(~r~0 > 0); {22604#(< ~counter~0 15)} is VALID [2022-04-15 15:14:03,082 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22215#true} {22604#(< ~counter~0 15)} #96#return; {22604#(< ~counter~0 15)} is VALID [2022-04-15 15:14:03,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 15:14:03,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 15:14:03,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 15:14:03,082 INFO L272 TraceCheckUtils]: 27: Hoare triple {22604#(< ~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)); {22215#true} is VALID [2022-04-15 15:14:03,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {22604#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {22604#(< ~counter~0 15)} is VALID [2022-04-15 15:14:03,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {22629#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22604#(< ~counter~0 15)} is VALID [2022-04-15 15:14:03,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {22629#(< ~counter~0 14)} assume !!(0 != ~r~0); {22629#(< ~counter~0 14)} is VALID [2022-04-15 15:14:03,084 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22215#true} {22629#(< ~counter~0 14)} #94#return; {22629#(< ~counter~0 14)} is VALID [2022-04-15 15:14:03,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 15:14:03,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 15:14:03,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 15:14:03,084 INFO L272 TraceCheckUtils]: 19: Hoare triple {22629#(< ~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)); {22215#true} is VALID [2022-04-15 15:14:03,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {22629#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {22629#(< ~counter~0 14)} is VALID [2022-04-15 15:14:03,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {22654#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22629#(< ~counter~0 14)} is VALID [2022-04-15 15:14:03,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {22654#(< ~counter~0 13)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22654#(< ~counter~0 13)} is VALID [2022-04-15 15:14:03,086 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22215#true} {22654#(< ~counter~0 13)} #92#return; {22654#(< ~counter~0 13)} is VALID [2022-04-15 15:14:03,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 15:14:03,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 15:14:03,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 15:14:03,086 INFO L272 TraceCheckUtils]: 11: Hoare triple {22654#(< ~counter~0 13)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {22215#true} is VALID [2022-04-15 15:14:03,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22215#true} {22654#(< ~counter~0 13)} #90#return; {22654#(< ~counter~0 13)} is VALID [2022-04-15 15:14:03,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 15:14:03,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 15:14:03,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 15:14:03,087 INFO L272 TraceCheckUtils]: 6: Hoare triple {22654#(< ~counter~0 13)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {22215#true} is VALID [2022-04-15 15:14:03,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {22654#(< ~counter~0 13)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {22654#(< ~counter~0 13)} is VALID [2022-04-15 15:14:03,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {22654#(< ~counter~0 13)} call #t~ret9 := main(); {22654#(< ~counter~0 13)} is VALID [2022-04-15 15:14:03,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22654#(< ~counter~0 13)} {22215#true} #102#return; {22654#(< ~counter~0 13)} is VALID [2022-04-15 15:14:03,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {22654#(< ~counter~0 13)} assume true; {22654#(< ~counter~0 13)} is VALID [2022-04-15 15:14:03,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {22215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22654#(< ~counter~0 13)} is VALID [2022-04-15 15:14:03,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {22215#true} call ULTIMATE.init(); {22215#true} is VALID [2022-04-15 15:14:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-15 15:14:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:03,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738941928] [2022-04-15 15:14:03,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:03,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571636755] [2022-04-15 15:14:03,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571636755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:03,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:03,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 15:14:03,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:03,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [444891336] [2022-04-15 15:14:03,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [444891336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:03,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:03,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 15:14:03,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876940765] [2022-04-15 15:14:03,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:03,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-15 15:14:03,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:03,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:03,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:03,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 15:14:03,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:03,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 15:14:03,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 15:14:03,154 INFO L87 Difference]: Start difference. First operand 222 states and 281 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:03,840 INFO L93 Difference]: Finished difference Result 256 states and 323 transitions. [2022-04-15 15:14:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 15:14:03,840 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-15 15:14:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-15 15:14:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-15 15:14:03,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-15 15:14:03,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:03,974 INFO L225 Difference]: With dead ends: 256 [2022-04-15 15:14:03,974 INFO L226 Difference]: Without dead ends: 251 [2022-04-15 15:14:03,975 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=327, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:14:03,975 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 78 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:03,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 198 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:14:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-04-15 15:14:04,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 242. [2022-04-15 15:14:04,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:04,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 242 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 184 states have internal predecessors, (215), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 15:14:04,204 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 242 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 184 states have internal predecessors, (215), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 15:14:04,204 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 242 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 184 states have internal predecessors, (215), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 15:14:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:04,209 INFO L93 Difference]: Finished difference Result 251 states and 317 transitions. [2022-04-15 15:14:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 317 transitions. [2022-04-15 15:14:04,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:04,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:04,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 184 states have internal predecessors, (215), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) Second operand 251 states. [2022-04-15 15:14:04,211 INFO L87 Difference]: Start difference. First operand has 242 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 184 states have internal predecessors, (215), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) Second operand 251 states. [2022-04-15 15:14:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:04,216 INFO L93 Difference]: Finished difference Result 251 states and 317 transitions. [2022-04-15 15:14:04,216 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 317 transitions. [2022-04-15 15:14:04,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:04,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:04,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:04,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 184 states have internal predecessors, (215), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 15:14:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 307 transitions. [2022-04-15 15:14:04,222 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 307 transitions. Word has length 79 [2022-04-15 15:14:04,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:04,223 INFO L478 AbstractCegarLoop]: Abstraction has 242 states and 307 transitions. [2022-04-15 15:14:04,223 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:04,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 307 transitions. [2022-04-15 15:14:12,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 305 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 307 transitions. [2022-04-15 15:14:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 15:14:12,732 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:12,732 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:14:12,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 15:14:12,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:12,939 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:12,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-15 15:14:12,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:12,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [201960906] [2022-04-15 15:14:12,940 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-15 15:14:12,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:12,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550254995] [2022-04-15 15:14:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:12,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:12,953 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:12,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440750208] [2022-04-15 15:14:12,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:14:12,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:12,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:12,954 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:14:12,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 15:14:13,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:14:13,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:13,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 15:14:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:13,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:13,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {24214#true} call ULTIMATE.init(); {24214#true} is VALID [2022-04-15 15:14:13,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {24214#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {24222#(<= ~counter~0 0)} assume true; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24222#(<= ~counter~0 0)} {24214#true} #102#return; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {24222#(<= ~counter~0 0)} call #t~ret9 := main(); {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {24222#(<= ~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; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {24222#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {24222#(<= ~counter~0 0)} ~cond := #in~cond; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {24222#(<= ~counter~0 0)} assume !(0 == ~cond); {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {24222#(<= ~counter~0 0)} assume true; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24222#(<= ~counter~0 0)} {24222#(<= ~counter~0 0)} #90#return; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,396 INFO L272 TraceCheckUtils]: 11: Hoare triple {24222#(<= ~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)); {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {24222#(<= ~counter~0 0)} ~cond := #in~cond; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {24222#(<= ~counter~0 0)} assume !(0 == ~cond); {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {24222#(<= ~counter~0 0)} assume true; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,397 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24222#(<= ~counter~0 0)} {24222#(<= ~counter~0 0)} #92#return; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {24222#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:13,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {24222#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24271#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:13,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {24271#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {24271#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:13,399 INFO L272 TraceCheckUtils]: 19: Hoare triple {24271#(<= ~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)); {24271#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:13,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {24271#(<= ~counter~0 1)} ~cond := #in~cond; {24271#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:13,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {24271#(<= ~counter~0 1)} assume !(0 == ~cond); {24271#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:13,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {24271#(<= ~counter~0 1)} assume true; {24271#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:13,400 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {24271#(<= ~counter~0 1)} {24271#(<= ~counter~0 1)} #94#return; {24271#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:13,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {24271#(<= ~counter~0 1)} assume !!(0 != ~r~0); {24271#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:13,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {24271#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24296#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:13,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {24296#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {24296#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:13,402 INFO L272 TraceCheckUtils]: 27: Hoare triple {24296#(<= ~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)); {24296#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:13,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {24296#(<= ~counter~0 2)} ~cond := #in~cond; {24296#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:13,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {24296#(<= ~counter~0 2)} assume !(0 == ~cond); {24296#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:13,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {24296#(<= ~counter~0 2)} assume true; {24296#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:13,403 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {24296#(<= ~counter~0 2)} {24296#(<= ~counter~0 2)} #96#return; {24296#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:13,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {24296#(<= ~counter~0 2)} assume !(~r~0 > 0); {24296#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:13,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {24296#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24321#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:13,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {24321#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {24321#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:13,405 INFO L272 TraceCheckUtils]: 35: Hoare triple {24321#(<= ~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)); {24321#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:13,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {24321#(<= ~counter~0 3)} ~cond := #in~cond; {24321#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:13,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {24321#(<= ~counter~0 3)} assume !(0 == ~cond); {24321#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:13,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {24321#(<= ~counter~0 3)} assume true; {24321#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:13,406 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24321#(<= ~counter~0 3)} {24321#(<= ~counter~0 3)} #98#return; {24321#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:13,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {24321#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {24321#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:13,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {24321#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24346#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:13,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {24346#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {24346#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:13,408 INFO L272 TraceCheckUtils]: 43: Hoare triple {24346#(<= ~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)); {24346#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:13,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {24346#(<= ~counter~0 4)} ~cond := #in~cond; {24346#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:13,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {24346#(<= ~counter~0 4)} assume !(0 == ~cond); {24346#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:13,409 INFO L290 TraceCheckUtils]: 46: Hoare triple {24346#(<= ~counter~0 4)} assume true; {24346#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:13,409 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {24346#(<= ~counter~0 4)} {24346#(<= ~counter~0 4)} #98#return; {24346#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:13,409 INFO L290 TraceCheckUtils]: 48: Hoare triple {24346#(<= ~counter~0 4)} assume !(~r~0 < 0); {24346#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:13,410 INFO L290 TraceCheckUtils]: 49: Hoare triple {24346#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24371#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:13,410 INFO L290 TraceCheckUtils]: 50: Hoare triple {24371#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {24371#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:13,411 INFO L272 TraceCheckUtils]: 51: Hoare triple {24371#(<= ~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)); {24371#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:13,411 INFO L290 TraceCheckUtils]: 52: Hoare triple {24371#(<= ~counter~0 5)} ~cond := #in~cond; {24371#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:13,411 INFO L290 TraceCheckUtils]: 53: Hoare triple {24371#(<= ~counter~0 5)} assume !(0 == ~cond); {24371#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:13,411 INFO L290 TraceCheckUtils]: 54: Hoare triple {24371#(<= ~counter~0 5)} assume true; {24371#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:13,412 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {24371#(<= ~counter~0 5)} {24371#(<= ~counter~0 5)} #94#return; {24371#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:13,412 INFO L290 TraceCheckUtils]: 56: Hoare triple {24371#(<= ~counter~0 5)} assume !!(0 != ~r~0); {24371#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:13,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {24371#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24396#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:13,413 INFO L290 TraceCheckUtils]: 58: Hoare triple {24396#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {24396#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:13,413 INFO L272 TraceCheckUtils]: 59: Hoare triple {24396#(<= ~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)); {24396#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:13,414 INFO L290 TraceCheckUtils]: 60: Hoare triple {24396#(<= ~counter~0 6)} ~cond := #in~cond; {24396#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:13,414 INFO L290 TraceCheckUtils]: 61: Hoare triple {24396#(<= ~counter~0 6)} assume !(0 == ~cond); {24396#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:13,414 INFO L290 TraceCheckUtils]: 62: Hoare triple {24396#(<= ~counter~0 6)} assume true; {24396#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:13,415 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24396#(<= ~counter~0 6)} {24396#(<= ~counter~0 6)} #96#return; {24396#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:13,415 INFO L290 TraceCheckUtils]: 64: Hoare triple {24396#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24396#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:13,416 INFO L290 TraceCheckUtils]: 65: Hoare triple {24396#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24421#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:13,416 INFO L290 TraceCheckUtils]: 66: Hoare triple {24421#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {24421#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:13,416 INFO L272 TraceCheckUtils]: 67: Hoare triple {24421#(<= ~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)); {24421#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:13,417 INFO L290 TraceCheckUtils]: 68: Hoare triple {24421#(<= ~counter~0 7)} ~cond := #in~cond; {24421#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:13,417 INFO L290 TraceCheckUtils]: 69: Hoare triple {24421#(<= ~counter~0 7)} assume !(0 == ~cond); {24421#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:13,417 INFO L290 TraceCheckUtils]: 70: Hoare triple {24421#(<= ~counter~0 7)} assume true; {24421#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:13,418 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24421#(<= ~counter~0 7)} {24421#(<= ~counter~0 7)} #96#return; {24421#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:13,418 INFO L290 TraceCheckUtils]: 72: Hoare triple {24421#(<= ~counter~0 7)} assume !(~r~0 > 0); {24421#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:13,418 INFO L290 TraceCheckUtils]: 73: Hoare triple {24421#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24446#(<= |main_#t~post8| 7)} is VALID [2022-04-15 15:14:13,419 INFO L290 TraceCheckUtils]: 74: Hoare triple {24446#(<= |main_#t~post8| 7)} assume !(#t~post8 < 20);havoc #t~post8; {24215#false} is VALID [2022-04-15 15:14:13,419 INFO L290 TraceCheckUtils]: 75: Hoare triple {24215#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24215#false} is VALID [2022-04-15 15:14:13,419 INFO L290 TraceCheckUtils]: 76: Hoare triple {24215#false} assume !(#t~post6 < 20);havoc #t~post6; {24215#false} is VALID [2022-04-15 15:14:13,419 INFO L272 TraceCheckUtils]: 77: Hoare triple {24215#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24215#false} is VALID [2022-04-15 15:14:13,419 INFO L290 TraceCheckUtils]: 78: Hoare triple {24215#false} ~cond := #in~cond; {24215#false} is VALID [2022-04-15 15:14:13,419 INFO L290 TraceCheckUtils]: 79: Hoare triple {24215#false} assume 0 == ~cond; {24215#false} is VALID [2022-04-15 15:14:13,419 INFO L290 TraceCheckUtils]: 80: Hoare triple {24215#false} assume !false; {24215#false} is VALID [2022-04-15 15:14:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:14:13,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:13,844 INFO L290 TraceCheckUtils]: 80: Hoare triple {24215#false} assume !false; {24215#false} is VALID [2022-04-15 15:14:13,844 INFO L290 TraceCheckUtils]: 79: Hoare triple {24215#false} assume 0 == ~cond; {24215#false} is VALID [2022-04-15 15:14:13,844 INFO L290 TraceCheckUtils]: 78: Hoare triple {24215#false} ~cond := #in~cond; {24215#false} is VALID [2022-04-15 15:14:13,845 INFO L272 TraceCheckUtils]: 77: Hoare triple {24215#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24215#false} is VALID [2022-04-15 15:14:13,845 INFO L290 TraceCheckUtils]: 76: Hoare triple {24215#false} assume !(#t~post6 < 20);havoc #t~post6; {24215#false} is VALID [2022-04-15 15:14:13,845 INFO L290 TraceCheckUtils]: 75: Hoare triple {24215#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24215#false} is VALID [2022-04-15 15:14:13,845 INFO L290 TraceCheckUtils]: 74: Hoare triple {24486#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {24215#false} is VALID [2022-04-15 15:14:13,845 INFO L290 TraceCheckUtils]: 73: Hoare triple {24490#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24486#(< |main_#t~post8| 20)} is VALID [2022-04-15 15:14:13,846 INFO L290 TraceCheckUtils]: 72: Hoare triple {24490#(< ~counter~0 20)} assume !(~r~0 > 0); {24490#(< ~counter~0 20)} is VALID [2022-04-15 15:14:13,846 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24214#true} {24490#(< ~counter~0 20)} #96#return; {24490#(< ~counter~0 20)} is VALID [2022-04-15 15:14:13,846 INFO L290 TraceCheckUtils]: 70: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 15:14:13,846 INFO L290 TraceCheckUtils]: 69: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 15:14:13,846 INFO L290 TraceCheckUtils]: 68: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 15:14:13,846 INFO L272 TraceCheckUtils]: 67: Hoare triple {24490#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24214#true} is VALID [2022-04-15 15:14:13,847 INFO L290 TraceCheckUtils]: 66: Hoare triple {24490#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {24490#(< ~counter~0 20)} is VALID [2022-04-15 15:14:13,847 INFO L290 TraceCheckUtils]: 65: Hoare triple {24515#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24490#(< ~counter~0 20)} is VALID [2022-04-15 15:14:13,848 INFO L290 TraceCheckUtils]: 64: Hoare triple {24515#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24515#(< ~counter~0 19)} is VALID [2022-04-15 15:14:13,848 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24214#true} {24515#(< ~counter~0 19)} #96#return; {24515#(< ~counter~0 19)} is VALID [2022-04-15 15:14:13,848 INFO L290 TraceCheckUtils]: 62: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 15:14:13,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 15:14:13,849 INFO L290 TraceCheckUtils]: 60: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 15:14:13,849 INFO L272 TraceCheckUtils]: 59: Hoare triple {24515#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24214#true} is VALID [2022-04-15 15:14:13,849 INFO L290 TraceCheckUtils]: 58: Hoare triple {24515#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {24515#(< ~counter~0 19)} is VALID [2022-04-15 15:14:13,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {24540#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24515#(< ~counter~0 19)} is VALID [2022-04-15 15:14:13,850 INFO L290 TraceCheckUtils]: 56: Hoare triple {24540#(< ~counter~0 18)} assume !!(0 != ~r~0); {24540#(< ~counter~0 18)} is VALID [2022-04-15 15:14:13,850 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {24214#true} {24540#(< ~counter~0 18)} #94#return; {24540#(< ~counter~0 18)} is VALID [2022-04-15 15:14:13,850 INFO L290 TraceCheckUtils]: 54: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 15:14:13,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 15:14:13,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 15:14:13,851 INFO L272 TraceCheckUtils]: 51: Hoare triple {24540#(< ~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)); {24214#true} is VALID [2022-04-15 15:14:13,851 INFO L290 TraceCheckUtils]: 50: Hoare triple {24540#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {24540#(< ~counter~0 18)} is VALID [2022-04-15 15:14:13,852 INFO L290 TraceCheckUtils]: 49: Hoare triple {24565#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24540#(< ~counter~0 18)} is VALID [2022-04-15 15:14:13,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {24565#(< ~counter~0 17)} assume !(~r~0 < 0); {24565#(< ~counter~0 17)} is VALID [2022-04-15 15:14:13,852 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {24214#true} {24565#(< ~counter~0 17)} #98#return; {24565#(< ~counter~0 17)} is VALID [2022-04-15 15:14:13,852 INFO L290 TraceCheckUtils]: 46: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 15:14:13,852 INFO L290 TraceCheckUtils]: 45: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 15:14:13,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 15:14:13,853 INFO L272 TraceCheckUtils]: 43: Hoare triple {24565#(< ~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)); {24214#true} is VALID [2022-04-15 15:14:13,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {24565#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {24565#(< ~counter~0 17)} is VALID [2022-04-15 15:14:13,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {24590#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24565#(< ~counter~0 17)} is VALID [2022-04-15 15:14:13,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {24590#(< ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {24590#(< ~counter~0 16)} is VALID [2022-04-15 15:14:13,854 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24214#true} {24590#(< ~counter~0 16)} #98#return; {24590#(< ~counter~0 16)} is VALID [2022-04-15 15:14:13,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 15:14:13,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 15:14:13,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 15:14:13,854 INFO L272 TraceCheckUtils]: 35: Hoare triple {24590#(< ~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)); {24214#true} is VALID [2022-04-15 15:14:13,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {24590#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {24590#(< ~counter~0 16)} is VALID [2022-04-15 15:14:13,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {24615#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24590#(< ~counter~0 16)} is VALID [2022-04-15 15:14:13,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {24615#(< ~counter~0 15)} assume !(~r~0 > 0); {24615#(< ~counter~0 15)} is VALID [2022-04-15 15:14:13,856 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {24214#true} {24615#(< ~counter~0 15)} #96#return; {24615#(< ~counter~0 15)} is VALID [2022-04-15 15:14:13,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 15:14:13,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 15:14:13,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 15:14:13,856 INFO L272 TraceCheckUtils]: 27: Hoare triple {24615#(< ~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)); {24214#true} is VALID [2022-04-15 15:14:13,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {24615#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {24615#(< ~counter~0 15)} is VALID [2022-04-15 15:14:13,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {24640#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24615#(< ~counter~0 15)} is VALID [2022-04-15 15:14:13,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {24640#(< ~counter~0 14)} assume !!(0 != ~r~0); {24640#(< ~counter~0 14)} is VALID [2022-04-15 15:14:13,858 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {24214#true} {24640#(< ~counter~0 14)} #94#return; {24640#(< ~counter~0 14)} is VALID [2022-04-15 15:14:13,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 15:14:13,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 15:14:13,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 15:14:13,858 INFO L272 TraceCheckUtils]: 19: Hoare triple {24640#(< ~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)); {24214#true} is VALID [2022-04-15 15:14:13,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {24640#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {24640#(< ~counter~0 14)} is VALID [2022-04-15 15:14:13,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {24665#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24640#(< ~counter~0 14)} is VALID [2022-04-15 15:14:13,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {24665#(< ~counter~0 13)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {24665#(< ~counter~0 13)} is VALID [2022-04-15 15:14:13,860 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24214#true} {24665#(< ~counter~0 13)} #92#return; {24665#(< ~counter~0 13)} is VALID [2022-04-15 15:14:13,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 15:14:13,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 15:14:13,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 15:14:13,860 INFO L272 TraceCheckUtils]: 11: Hoare triple {24665#(< ~counter~0 13)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {24214#true} is VALID [2022-04-15 15:14:13,860 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24214#true} {24665#(< ~counter~0 13)} #90#return; {24665#(< ~counter~0 13)} is VALID [2022-04-15 15:14:13,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 15:14:13,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 15:14:13,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 15:14:13,861 INFO L272 TraceCheckUtils]: 6: Hoare triple {24665#(< ~counter~0 13)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {24214#true} is VALID [2022-04-15 15:14:13,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {24665#(< ~counter~0 13)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {24665#(< ~counter~0 13)} is VALID [2022-04-15 15:14:13,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {24665#(< ~counter~0 13)} call #t~ret9 := main(); {24665#(< ~counter~0 13)} is VALID [2022-04-15 15:14:13,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24665#(< ~counter~0 13)} {24214#true} #102#return; {24665#(< ~counter~0 13)} is VALID [2022-04-15 15:14:13,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {24665#(< ~counter~0 13)} assume true; {24665#(< ~counter~0 13)} is VALID [2022-04-15 15:14:13,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {24214#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24665#(< ~counter~0 13)} is VALID [2022-04-15 15:14:13,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {24214#true} call ULTIMATE.init(); {24214#true} is VALID [2022-04-15 15:14:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-15 15:14:13,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:13,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550254995] [2022-04-15 15:14:13,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:13,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440750208] [2022-04-15 15:14:13,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440750208] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:13,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:13,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 15:14:13,863 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:13,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [201960906] [2022-04-15 15:14:13,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [201960906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:13,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:13,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 15:14:13,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934102024] [2022-04-15 15:14:13,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:13,867 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-15 15:14:13,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:13,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:13,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:13,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 15:14:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:13,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 15:14:13,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 15:14:13,937 INFO L87 Difference]: Start difference. First operand 242 states and 307 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:14,605 INFO L93 Difference]: Finished difference Result 340 states and 447 transitions. [2022-04-15 15:14:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 15:14:14,605 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-15 15:14:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-15 15:14:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-15 15:14:14,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-15 15:14:14,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:14,760 INFO L225 Difference]: With dead ends: 340 [2022-04-15 15:14:14,761 INFO L226 Difference]: Without dead ends: 253 [2022-04-15 15:14:14,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=357, Unknown=0, NotChecked=0, Total=600 [2022-04-15 15:14:14,762 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 78 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:14,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 195 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:14:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-15 15:14:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 247. [2022-04-15 15:14:15,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:15,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 247 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 188 states have internal predecessors, (221), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 15:14:15,006 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 247 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 188 states have internal predecessors, (221), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 15:14:15,006 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 247 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 188 states have internal predecessors, (221), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 15:14:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:15,011 INFO L93 Difference]: Finished difference Result 253 states and 319 transitions. [2022-04-15 15:14:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 319 transitions. [2022-04-15 15:14:15,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:15,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:15,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 188 states have internal predecessors, (221), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) Second operand 253 states. [2022-04-15 15:14:15,013 INFO L87 Difference]: Start difference. First operand has 247 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 188 states have internal predecessors, (221), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) Second operand 253 states. [2022-04-15 15:14:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:15,018 INFO L93 Difference]: Finished difference Result 253 states and 319 transitions. [2022-04-15 15:14:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 319 transitions. [2022-04-15 15:14:15,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:15,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:15,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:15,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 188 states have internal predecessors, (221), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 15:14:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 313 transitions. [2022-04-15 15:14:15,024 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 313 transitions. Word has length 81 [2022-04-15 15:14:15,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:15,025 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 313 transitions. [2022-04-15 15:14:15,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:15,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 247 states and 313 transitions. [2022-04-15 15:14:24,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 312 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 313 transitions. [2022-04-15 15:14:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 15:14:24,573 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:24,573 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:14:24,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-15 15:14:24,774 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:24,774 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:24,774 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-15 15:14:24,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:24,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99474221] [2022-04-15 15:14:24,775 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:24,775 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-15 15:14:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:24,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901837685] [2022-04-15 15:14:24,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:24,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:24,786 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:24,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1938552915] [2022-04-15 15:14:24,793 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:14:24,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:24,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:24,794 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:14:24,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 15:14:24,909 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:14:24,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:24,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 15:14:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:24,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:25,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {26409#true} call ULTIMATE.init(); {26409#true} is VALID [2022-04-15 15:14:25,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {26409#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {26417#(<= ~counter~0 0)} assume true; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26417#(<= ~counter~0 0)} {26409#true} #102#return; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {26417#(<= ~counter~0 0)} call #t~ret9 := main(); {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {26417#(<= ~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; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {26417#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {26417#(<= ~counter~0 0)} ~cond := #in~cond; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {26417#(<= ~counter~0 0)} assume !(0 == ~cond); {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {26417#(<= ~counter~0 0)} assume true; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,302 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26417#(<= ~counter~0 0)} {26417#(<= ~counter~0 0)} #90#return; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,303 INFO L272 TraceCheckUtils]: 11: Hoare triple {26417#(<= ~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)); {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {26417#(<= ~counter~0 0)} ~cond := #in~cond; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {26417#(<= ~counter~0 0)} assume !(0 == ~cond); {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {26417#(<= ~counter~0 0)} assume true; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,304 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26417#(<= ~counter~0 0)} {26417#(<= ~counter~0 0)} #92#return; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {26417#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:25,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {26417#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26466#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:25,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {26466#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {26466#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:25,306 INFO L272 TraceCheckUtils]: 19: Hoare triple {26466#(<= ~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)); {26466#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:25,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {26466#(<= ~counter~0 1)} ~cond := #in~cond; {26466#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:25,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {26466#(<= ~counter~0 1)} assume !(0 == ~cond); {26466#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:25,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {26466#(<= ~counter~0 1)} assume true; {26466#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:25,307 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26466#(<= ~counter~0 1)} {26466#(<= ~counter~0 1)} #94#return; {26466#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:25,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {26466#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26466#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:25,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {26466#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26491#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:25,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {26491#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {26491#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:25,309 INFO L272 TraceCheckUtils]: 27: Hoare triple {26491#(<= ~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)); {26491#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:25,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {26491#(<= ~counter~0 2)} ~cond := #in~cond; {26491#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:25,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {26491#(<= ~counter~0 2)} assume !(0 == ~cond); {26491#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:25,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {26491#(<= ~counter~0 2)} assume true; {26491#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:25,310 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26491#(<= ~counter~0 2)} {26491#(<= ~counter~0 2)} #96#return; {26491#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:25,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {26491#(<= ~counter~0 2)} assume !(~r~0 > 0); {26491#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:25,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {26491#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26516#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:25,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {26516#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {26516#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:25,312 INFO L272 TraceCheckUtils]: 35: Hoare triple {26516#(<= ~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)); {26516#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:25,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {26516#(<= ~counter~0 3)} ~cond := #in~cond; {26516#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:25,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {26516#(<= ~counter~0 3)} assume !(0 == ~cond); {26516#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:25,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {26516#(<= ~counter~0 3)} assume true; {26516#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:25,313 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26516#(<= ~counter~0 3)} {26516#(<= ~counter~0 3)} #98#return; {26516#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:25,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {26516#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26516#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:25,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {26516#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26541#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:25,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {26541#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {26541#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:25,314 INFO L272 TraceCheckUtils]: 43: Hoare triple {26541#(<= ~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)); {26541#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:25,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {26541#(<= ~counter~0 4)} ~cond := #in~cond; {26541#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:25,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {26541#(<= ~counter~0 4)} assume !(0 == ~cond); {26541#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:25,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {26541#(<= ~counter~0 4)} assume true; {26541#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:25,316 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26541#(<= ~counter~0 4)} {26541#(<= ~counter~0 4)} #98#return; {26541#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:25,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {26541#(<= ~counter~0 4)} assume !(~r~0 < 0); {26541#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:25,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {26541#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26566#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:25,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {26566#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {26566#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:25,317 INFO L272 TraceCheckUtils]: 51: Hoare triple {26566#(<= ~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)); {26566#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:25,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {26566#(<= ~counter~0 5)} ~cond := #in~cond; {26566#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:25,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {26566#(<= ~counter~0 5)} assume !(0 == ~cond); {26566#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:25,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {26566#(<= ~counter~0 5)} assume true; {26566#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:25,319 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26566#(<= ~counter~0 5)} {26566#(<= ~counter~0 5)} #94#return; {26566#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:25,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {26566#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26566#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:25,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {26566#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26591#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:25,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {26591#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {26591#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:25,320 INFO L272 TraceCheckUtils]: 59: Hoare triple {26591#(<= ~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)); {26591#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:25,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {26591#(<= ~counter~0 6)} ~cond := #in~cond; {26591#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:25,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {26591#(<= ~counter~0 6)} assume !(0 == ~cond); {26591#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:25,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {26591#(<= ~counter~0 6)} assume true; {26591#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:25,322 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26591#(<= ~counter~0 6)} {26591#(<= ~counter~0 6)} #96#return; {26591#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:25,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {26591#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26591#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:25,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {26591#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26616#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:25,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {26616#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {26616#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:25,323 INFO L272 TraceCheckUtils]: 67: Hoare triple {26616#(<= ~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)); {26616#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:25,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {26616#(<= ~counter~0 7)} ~cond := #in~cond; {26616#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:25,324 INFO L290 TraceCheckUtils]: 69: Hoare triple {26616#(<= ~counter~0 7)} assume !(0 == ~cond); {26616#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:25,324 INFO L290 TraceCheckUtils]: 70: Hoare triple {26616#(<= ~counter~0 7)} assume true; {26616#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:25,324 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26616#(<= ~counter~0 7)} {26616#(<= ~counter~0 7)} #96#return; {26616#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:25,325 INFO L290 TraceCheckUtils]: 72: Hoare triple {26616#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26616#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:25,325 INFO L290 TraceCheckUtils]: 73: Hoare triple {26616#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26641#(<= |main_#t~post7| 7)} is VALID [2022-04-15 15:14:25,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {26641#(<= |main_#t~post7| 7)} assume !(#t~post7 < 20);havoc #t~post7; {26410#false} is VALID [2022-04-15 15:14:25,326 INFO L290 TraceCheckUtils]: 75: Hoare triple {26410#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26410#false} is VALID [2022-04-15 15:14:25,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {26410#false} assume !(#t~post8 < 20);havoc #t~post8; {26410#false} is VALID [2022-04-15 15:14:25,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {26410#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26410#false} is VALID [2022-04-15 15:14:25,326 INFO L290 TraceCheckUtils]: 78: Hoare triple {26410#false} assume !(#t~post6 < 20);havoc #t~post6; {26410#false} is VALID [2022-04-15 15:14:25,326 INFO L272 TraceCheckUtils]: 79: Hoare triple {26410#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26410#false} is VALID [2022-04-15 15:14:25,326 INFO L290 TraceCheckUtils]: 80: Hoare triple {26410#false} ~cond := #in~cond; {26410#false} is VALID [2022-04-15 15:14:25,326 INFO L290 TraceCheckUtils]: 81: Hoare triple {26410#false} assume 0 == ~cond; {26410#false} is VALID [2022-04-15 15:14:25,326 INFO L290 TraceCheckUtils]: 82: Hoare triple {26410#false} assume !false; {26410#false} is VALID [2022-04-15 15:14:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:14:25,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:25,757 INFO L290 TraceCheckUtils]: 82: Hoare triple {26410#false} assume !false; {26410#false} is VALID [2022-04-15 15:14:25,758 INFO L290 TraceCheckUtils]: 81: Hoare triple {26410#false} assume 0 == ~cond; {26410#false} is VALID [2022-04-15 15:14:25,758 INFO L290 TraceCheckUtils]: 80: Hoare triple {26410#false} ~cond := #in~cond; {26410#false} is VALID [2022-04-15 15:14:25,758 INFO L272 TraceCheckUtils]: 79: Hoare triple {26410#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26410#false} is VALID [2022-04-15 15:14:25,758 INFO L290 TraceCheckUtils]: 78: Hoare triple {26410#false} assume !(#t~post6 < 20);havoc #t~post6; {26410#false} is VALID [2022-04-15 15:14:25,758 INFO L290 TraceCheckUtils]: 77: Hoare triple {26410#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26410#false} is VALID [2022-04-15 15:14:25,758 INFO L290 TraceCheckUtils]: 76: Hoare triple {26410#false} assume !(#t~post8 < 20);havoc #t~post8; {26410#false} is VALID [2022-04-15 15:14:25,758 INFO L290 TraceCheckUtils]: 75: Hoare triple {26410#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26410#false} is VALID [2022-04-15 15:14:25,758 INFO L290 TraceCheckUtils]: 74: Hoare triple {26693#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {26410#false} is VALID [2022-04-15 15:14:25,759 INFO L290 TraceCheckUtils]: 73: Hoare triple {26697#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26693#(< |main_#t~post7| 20)} is VALID [2022-04-15 15:14:25,759 INFO L290 TraceCheckUtils]: 72: Hoare triple {26697#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26697#(< ~counter~0 20)} is VALID [2022-04-15 15:14:25,760 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26409#true} {26697#(< ~counter~0 20)} #96#return; {26697#(< ~counter~0 20)} is VALID [2022-04-15 15:14:25,760 INFO L290 TraceCheckUtils]: 70: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 15:14:25,760 INFO L290 TraceCheckUtils]: 69: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 15:14:25,760 INFO L290 TraceCheckUtils]: 68: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 15:14:25,760 INFO L272 TraceCheckUtils]: 67: Hoare triple {26697#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26409#true} is VALID [2022-04-15 15:14:25,760 INFO L290 TraceCheckUtils]: 66: Hoare triple {26697#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {26697#(< ~counter~0 20)} is VALID [2022-04-15 15:14:25,761 INFO L290 TraceCheckUtils]: 65: Hoare triple {26722#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#(< ~counter~0 20)} is VALID [2022-04-15 15:14:25,761 INFO L290 TraceCheckUtils]: 64: Hoare triple {26722#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26722#(< ~counter~0 19)} is VALID [2022-04-15 15:14:25,762 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26409#true} {26722#(< ~counter~0 19)} #96#return; {26722#(< ~counter~0 19)} is VALID [2022-04-15 15:14:25,762 INFO L290 TraceCheckUtils]: 62: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 15:14:25,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 15:14:25,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 15:14:25,762 INFO L272 TraceCheckUtils]: 59: Hoare triple {26722#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26409#true} is VALID [2022-04-15 15:14:25,762 INFO L290 TraceCheckUtils]: 58: Hoare triple {26722#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {26722#(< ~counter~0 19)} is VALID [2022-04-15 15:14:25,763 INFO L290 TraceCheckUtils]: 57: Hoare triple {26747#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26722#(< ~counter~0 19)} is VALID [2022-04-15 15:14:25,763 INFO L290 TraceCheckUtils]: 56: Hoare triple {26747#(< ~counter~0 18)} assume !!(0 != ~r~0); {26747#(< ~counter~0 18)} is VALID [2022-04-15 15:14:25,764 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26409#true} {26747#(< ~counter~0 18)} #94#return; {26747#(< ~counter~0 18)} is VALID [2022-04-15 15:14:25,764 INFO L290 TraceCheckUtils]: 54: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 15:14:25,764 INFO L290 TraceCheckUtils]: 53: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 15:14:25,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 15:14:25,764 INFO L272 TraceCheckUtils]: 51: Hoare triple {26747#(< ~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)); {26409#true} is VALID [2022-04-15 15:14:25,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {26747#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {26747#(< ~counter~0 18)} is VALID [2022-04-15 15:14:25,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {26772#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26747#(< ~counter~0 18)} is VALID [2022-04-15 15:14:25,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {26772#(< ~counter~0 17)} assume !(~r~0 < 0); {26772#(< ~counter~0 17)} is VALID [2022-04-15 15:14:25,765 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26409#true} {26772#(< ~counter~0 17)} #98#return; {26772#(< ~counter~0 17)} is VALID [2022-04-15 15:14:25,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 15:14:25,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 15:14:25,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 15:14:25,766 INFO L272 TraceCheckUtils]: 43: Hoare triple {26772#(< ~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)); {26409#true} is VALID [2022-04-15 15:14:25,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {26772#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {26772#(< ~counter~0 17)} is VALID [2022-04-15 15:14:25,767 INFO L290 TraceCheckUtils]: 41: Hoare triple {26797#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26772#(< ~counter~0 17)} is VALID [2022-04-15 15:14:25,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {26797#(< ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26797#(< ~counter~0 16)} is VALID [2022-04-15 15:14:25,767 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26409#true} {26797#(< ~counter~0 16)} #98#return; {26797#(< ~counter~0 16)} is VALID [2022-04-15 15:14:25,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 15:14:25,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 15:14:25,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 15:14:25,768 INFO L272 TraceCheckUtils]: 35: Hoare triple {26797#(< ~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)); {26409#true} is VALID [2022-04-15 15:14:25,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {26797#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {26797#(< ~counter~0 16)} is VALID [2022-04-15 15:14:25,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {26822#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26797#(< ~counter~0 16)} is VALID [2022-04-15 15:14:25,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {26822#(< ~counter~0 15)} assume !(~r~0 > 0); {26822#(< ~counter~0 15)} is VALID [2022-04-15 15:14:25,769 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26409#true} {26822#(< ~counter~0 15)} #96#return; {26822#(< ~counter~0 15)} is VALID [2022-04-15 15:14:25,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 15:14:25,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 15:14:25,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 15:14:25,770 INFO L272 TraceCheckUtils]: 27: Hoare triple {26822#(< ~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)); {26409#true} is VALID [2022-04-15 15:14:25,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {26822#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {26822#(< ~counter~0 15)} is VALID [2022-04-15 15:14:25,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {26847#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26822#(< ~counter~0 15)} is VALID [2022-04-15 15:14:25,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {26847#(< ~counter~0 14)} assume !!(0 != ~r~0); {26847#(< ~counter~0 14)} is VALID [2022-04-15 15:14:25,771 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26409#true} {26847#(< ~counter~0 14)} #94#return; {26847#(< ~counter~0 14)} is VALID [2022-04-15 15:14:25,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 15:14:25,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 15:14:25,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 15:14:25,771 INFO L272 TraceCheckUtils]: 19: Hoare triple {26847#(< ~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)); {26409#true} is VALID [2022-04-15 15:14:25,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {26847#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {26847#(< ~counter~0 14)} is VALID [2022-04-15 15:14:25,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {26872#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26847#(< ~counter~0 14)} is VALID [2022-04-15 15:14:25,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {26872#(< ~counter~0 13)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26872#(< ~counter~0 13)} is VALID [2022-04-15 15:14:25,773 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26409#true} {26872#(< ~counter~0 13)} #92#return; {26872#(< ~counter~0 13)} is VALID [2022-04-15 15:14:25,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 15:14:25,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 15:14:25,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 15:14:25,773 INFO L272 TraceCheckUtils]: 11: Hoare triple {26872#(< ~counter~0 13)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {26409#true} is VALID [2022-04-15 15:14:25,774 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26409#true} {26872#(< ~counter~0 13)} #90#return; {26872#(< ~counter~0 13)} is VALID [2022-04-15 15:14:25,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 15:14:25,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 15:14:25,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 15:14:25,774 INFO L272 TraceCheckUtils]: 6: Hoare triple {26872#(< ~counter~0 13)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26409#true} is VALID [2022-04-15 15:14:25,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {26872#(< ~counter~0 13)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {26872#(< ~counter~0 13)} is VALID [2022-04-15 15:14:25,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {26872#(< ~counter~0 13)} call #t~ret9 := main(); {26872#(< ~counter~0 13)} is VALID [2022-04-15 15:14:25,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26872#(< ~counter~0 13)} {26409#true} #102#return; {26872#(< ~counter~0 13)} is VALID [2022-04-15 15:14:25,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {26872#(< ~counter~0 13)} assume true; {26872#(< ~counter~0 13)} is VALID [2022-04-15 15:14:25,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {26409#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26872#(< ~counter~0 13)} is VALID [2022-04-15 15:14:25,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {26409#true} call ULTIMATE.init(); {26409#true} is VALID [2022-04-15 15:14:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-15 15:14:25,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:25,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901837685] [2022-04-15 15:14:25,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:25,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938552915] [2022-04-15 15:14:25,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938552915] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:25,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:25,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 15:14:25,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:25,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99474221] [2022-04-15 15:14:25,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99474221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:25,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:25,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 15:14:25,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641360008] [2022-04-15 15:14:25,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:25,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-15 15:14:25,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:25,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:25,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:25,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 15:14:25,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:25,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 15:14:25,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 15:14:25,833 INFO L87 Difference]: Start difference. First operand 247 states and 313 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:26,533 INFO L93 Difference]: Finished difference Result 319 states and 413 transitions. [2022-04-15 15:14:26,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 15:14:26,533 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-15 15:14:26,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-15 15:14:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-15 15:14:26,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-15 15:14:26,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:26,673 INFO L225 Difference]: With dead ends: 319 [2022-04-15 15:14:26,673 INFO L226 Difference]: Without dead ends: 256 [2022-04-15 15:14:26,673 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=266, Invalid=384, Unknown=0, NotChecked=0, Total=650 [2022-04-15 15:14:26,674 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 98 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:26,674 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 182 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:14:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-15 15:14:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2022-04-15 15:14:26,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:26,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 253 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 15:14:26,943 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 253 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 15:14:26,943 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 253 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 15:14:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:26,948 INFO L93 Difference]: Finished difference Result 256 states and 322 transitions. [2022-04-15 15:14:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 322 transitions. [2022-04-15 15:14:26,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:26,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:26,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) Second operand 256 states. [2022-04-15 15:14:26,949 INFO L87 Difference]: Start difference. First operand has 253 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) Second operand 256 states. [2022-04-15 15:14:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:26,954 INFO L93 Difference]: Finished difference Result 256 states and 322 transitions. [2022-04-15 15:14:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 322 transitions. [2022-04-15 15:14:26,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:26,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:26,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:26,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 15:14:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 319 transitions. [2022-04-15 15:14:26,961 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 319 transitions. Word has length 83 [2022-04-15 15:14:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:26,962 INFO L478 AbstractCegarLoop]: Abstraction has 253 states and 319 transitions. [2022-04-15 15:14:26,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 15:14:26,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 253 states and 319 transitions. [2022-04-15 15:14:34,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:34,674 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 319 transitions. [2022-04-15 15:14:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 15:14:34,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:34,675 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:14:34,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 15:14:34,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:34,875 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:34,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:34,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-15 15:14:34,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:34,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [92493994] [2022-04-15 15:14:34,876 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:34,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-15 15:14:34,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:34,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730916326] [2022-04-15 15:14:34,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:34,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:34,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:34,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [250821454] [2022-04-15 15:14:34,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:14:34,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:34,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:34,893 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:14:34,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 15:14:34,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:14:34,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:34,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 15:14:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:34,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:35,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {28594#true} call ULTIMATE.init(); {28594#true} is VALID [2022-04-15 15:14:35,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {28594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {28602#(<= ~counter~0 0)} assume true; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28602#(<= ~counter~0 0)} {28594#true} #102#return; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {28602#(<= ~counter~0 0)} call #t~ret9 := main(); {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {28602#(<= ~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; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {28602#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {28602#(<= ~counter~0 0)} ~cond := #in~cond; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {28602#(<= ~counter~0 0)} assume !(0 == ~cond); {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {28602#(<= ~counter~0 0)} assume true; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,384 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28602#(<= ~counter~0 0)} {28602#(<= ~counter~0 0)} #90#return; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,384 INFO L272 TraceCheckUtils]: 11: Hoare triple {28602#(<= ~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)); {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {28602#(<= ~counter~0 0)} ~cond := #in~cond; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {28602#(<= ~counter~0 0)} assume !(0 == ~cond); {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {28602#(<= ~counter~0 0)} assume true; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,386 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28602#(<= ~counter~0 0)} {28602#(<= ~counter~0 0)} #92#return; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {28602#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {28602#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28651#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {28651#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {28651#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,388 INFO L272 TraceCheckUtils]: 19: Hoare triple {28651#(<= ~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)); {28651#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {28651#(<= ~counter~0 1)} ~cond := #in~cond; {28651#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {28651#(<= ~counter~0 1)} assume !(0 == ~cond); {28651#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {28651#(<= ~counter~0 1)} assume true; {28651#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,389 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28651#(<= ~counter~0 1)} {28651#(<= ~counter~0 1)} #94#return; {28651#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {28651#(<= ~counter~0 1)} assume !!(0 != ~r~0); {28651#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {28651#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28676#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {28676#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {28676#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,391 INFO L272 TraceCheckUtils]: 27: Hoare triple {28676#(<= ~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)); {28676#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {28676#(<= ~counter~0 2)} ~cond := #in~cond; {28676#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {28676#(<= ~counter~0 2)} assume !(0 == ~cond); {28676#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {28676#(<= ~counter~0 2)} assume true; {28676#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,392 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28676#(<= ~counter~0 2)} {28676#(<= ~counter~0 2)} #96#return; {28676#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {28676#(<= ~counter~0 2)} assume !(~r~0 > 0); {28676#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {28676#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28701#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {28701#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {28701#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,393 INFO L272 TraceCheckUtils]: 35: Hoare triple {28701#(<= ~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)); {28701#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {28701#(<= ~counter~0 3)} ~cond := #in~cond; {28701#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {28701#(<= ~counter~0 3)} assume !(0 == ~cond); {28701#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {28701#(<= ~counter~0 3)} assume true; {28701#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,395 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28701#(<= ~counter~0 3)} {28701#(<= ~counter~0 3)} #98#return; {28701#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {28701#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28701#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {28701#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28726#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {28726#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {28726#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,400 INFO L272 TraceCheckUtils]: 43: Hoare triple {28726#(<= ~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)); {28726#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {28726#(<= ~counter~0 4)} ~cond := #in~cond; {28726#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {28726#(<= ~counter~0 4)} assume !(0 == ~cond); {28726#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {28726#(<= ~counter~0 4)} assume true; {28726#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,402 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28726#(<= ~counter~0 4)} {28726#(<= ~counter~0 4)} #98#return; {28726#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {28726#(<= ~counter~0 4)} assume !(~r~0 < 0); {28726#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {28726#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28751#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {28751#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {28751#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,404 INFO L272 TraceCheckUtils]: 51: Hoare triple {28751#(<= ~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)); {28751#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {28751#(<= ~counter~0 5)} ~cond := #in~cond; {28751#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {28751#(<= ~counter~0 5)} assume !(0 == ~cond); {28751#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {28751#(<= ~counter~0 5)} assume true; {28751#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,405 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28751#(<= ~counter~0 5)} {28751#(<= ~counter~0 5)} #94#return; {28751#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {28751#(<= ~counter~0 5)} assume !!(0 != ~r~0); {28751#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {28751#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28776#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {28776#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {28776#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,407 INFO L272 TraceCheckUtils]: 59: Hoare triple {28776#(<= ~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)); {28776#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {28776#(<= ~counter~0 6)} ~cond := #in~cond; {28776#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {28776#(<= ~counter~0 6)} assume !(0 == ~cond); {28776#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {28776#(<= ~counter~0 6)} assume true; {28776#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,408 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28776#(<= ~counter~0 6)} {28776#(<= ~counter~0 6)} #96#return; {28776#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {28776#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28776#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {28776#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28801#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,409 INFO L290 TraceCheckUtils]: 66: Hoare triple {28801#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {28801#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,410 INFO L272 TraceCheckUtils]: 67: Hoare triple {28801#(<= ~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)); {28801#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,410 INFO L290 TraceCheckUtils]: 68: Hoare triple {28801#(<= ~counter~0 7)} ~cond := #in~cond; {28801#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,410 INFO L290 TraceCheckUtils]: 69: Hoare triple {28801#(<= ~counter~0 7)} assume !(0 == ~cond); {28801#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,410 INFO L290 TraceCheckUtils]: 70: Hoare triple {28801#(<= ~counter~0 7)} assume true; {28801#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,411 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28801#(<= ~counter~0 7)} {28801#(<= ~counter~0 7)} #96#return; {28801#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,411 INFO L290 TraceCheckUtils]: 72: Hoare triple {28801#(<= ~counter~0 7)} assume !(~r~0 > 0); {28801#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,412 INFO L290 TraceCheckUtils]: 73: Hoare triple {28801#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28826#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,412 INFO L290 TraceCheckUtils]: 74: Hoare triple {28826#(<= ~counter~0 8)} assume !!(#t~post8 < 20);havoc #t~post8; {28826#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,413 INFO L272 TraceCheckUtils]: 75: Hoare triple {28826#(<= ~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)); {28826#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,413 INFO L290 TraceCheckUtils]: 76: Hoare triple {28826#(<= ~counter~0 8)} ~cond := #in~cond; {28826#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,413 INFO L290 TraceCheckUtils]: 77: Hoare triple {28826#(<= ~counter~0 8)} assume !(0 == ~cond); {28826#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,413 INFO L290 TraceCheckUtils]: 78: Hoare triple {28826#(<= ~counter~0 8)} assume true; {28826#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,414 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28826#(<= ~counter~0 8)} {28826#(<= ~counter~0 8)} #98#return; {28826#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,414 INFO L290 TraceCheckUtils]: 80: Hoare triple {28826#(<= ~counter~0 8)} assume !(~r~0 < 0); {28826#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,415 INFO L290 TraceCheckUtils]: 81: Hoare triple {28826#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28851#(<= |main_#t~post6| 8)} is VALID [2022-04-15 15:14:35,415 INFO L290 TraceCheckUtils]: 82: Hoare triple {28851#(<= |main_#t~post6| 8)} assume !(#t~post6 < 20);havoc #t~post6; {28595#false} is VALID [2022-04-15 15:14:35,415 INFO L272 TraceCheckUtils]: 83: Hoare triple {28595#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28595#false} is VALID [2022-04-15 15:14:35,415 INFO L290 TraceCheckUtils]: 84: Hoare triple {28595#false} ~cond := #in~cond; {28595#false} is VALID [2022-04-15 15:14:35,415 INFO L290 TraceCheckUtils]: 85: Hoare triple {28595#false} assume 0 == ~cond; {28595#false} is VALID [2022-04-15 15:14:35,415 INFO L290 TraceCheckUtils]: 86: Hoare triple {28595#false} assume !false; {28595#false} is VALID [2022-04-15 15:14:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:14:35,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:35,899 INFO L290 TraceCheckUtils]: 86: Hoare triple {28595#false} assume !false; {28595#false} is VALID [2022-04-15 15:14:35,899 INFO L290 TraceCheckUtils]: 85: Hoare triple {28595#false} assume 0 == ~cond; {28595#false} is VALID [2022-04-15 15:14:35,899 INFO L290 TraceCheckUtils]: 84: Hoare triple {28595#false} ~cond := #in~cond; {28595#false} is VALID [2022-04-15 15:14:35,899 INFO L272 TraceCheckUtils]: 83: Hoare triple {28595#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28595#false} is VALID [2022-04-15 15:14:35,899 INFO L290 TraceCheckUtils]: 82: Hoare triple {28879#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {28595#false} is VALID [2022-04-15 15:14:35,900 INFO L290 TraceCheckUtils]: 81: Hoare triple {28883#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28879#(< |main_#t~post6| 20)} is VALID [2022-04-15 15:14:35,900 INFO L290 TraceCheckUtils]: 80: Hoare triple {28883#(< ~counter~0 20)} assume !(~r~0 < 0); {28883#(< ~counter~0 20)} is VALID [2022-04-15 15:14:35,900 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28594#true} {28883#(< ~counter~0 20)} #98#return; {28883#(< ~counter~0 20)} is VALID [2022-04-15 15:14:35,901 INFO L290 TraceCheckUtils]: 78: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 15:14:35,901 INFO L290 TraceCheckUtils]: 77: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 15:14:35,901 INFO L290 TraceCheckUtils]: 76: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 15:14:35,901 INFO L272 TraceCheckUtils]: 75: Hoare triple {28883#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28594#true} is VALID [2022-04-15 15:14:35,901 INFO L290 TraceCheckUtils]: 74: Hoare triple {28883#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {28883#(< ~counter~0 20)} is VALID [2022-04-15 15:14:35,902 INFO L290 TraceCheckUtils]: 73: Hoare triple {28908#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28883#(< ~counter~0 20)} is VALID [2022-04-15 15:14:35,902 INFO L290 TraceCheckUtils]: 72: Hoare triple {28908#(< ~counter~0 19)} assume !(~r~0 > 0); {28908#(< ~counter~0 19)} is VALID [2022-04-15 15:14:35,903 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28594#true} {28908#(< ~counter~0 19)} #96#return; {28908#(< ~counter~0 19)} is VALID [2022-04-15 15:14:35,903 INFO L290 TraceCheckUtils]: 70: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 15:14:35,903 INFO L290 TraceCheckUtils]: 69: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 15:14:35,903 INFO L290 TraceCheckUtils]: 68: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 15:14:35,903 INFO L272 TraceCheckUtils]: 67: Hoare triple {28908#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28594#true} is VALID [2022-04-15 15:14:35,903 INFO L290 TraceCheckUtils]: 66: Hoare triple {28908#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {28908#(< ~counter~0 19)} is VALID [2022-04-15 15:14:35,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {28933#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28908#(< ~counter~0 19)} is VALID [2022-04-15 15:14:35,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {28933#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28933#(< ~counter~0 18)} is VALID [2022-04-15 15:14:35,905 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28594#true} {28933#(< ~counter~0 18)} #96#return; {28933#(< ~counter~0 18)} is VALID [2022-04-15 15:14:35,905 INFO L290 TraceCheckUtils]: 62: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 15:14:35,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 15:14:35,905 INFO L290 TraceCheckUtils]: 60: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 15:14:35,905 INFO L272 TraceCheckUtils]: 59: Hoare triple {28933#(< ~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)); {28594#true} is VALID [2022-04-15 15:14:35,905 INFO L290 TraceCheckUtils]: 58: Hoare triple {28933#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {28933#(< ~counter~0 18)} is VALID [2022-04-15 15:14:35,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {28958#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28933#(< ~counter~0 18)} is VALID [2022-04-15 15:14:35,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {28958#(< ~counter~0 17)} assume !!(0 != ~r~0); {28958#(< ~counter~0 17)} is VALID [2022-04-15 15:14:35,907 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28594#true} {28958#(< ~counter~0 17)} #94#return; {28958#(< ~counter~0 17)} is VALID [2022-04-15 15:14:35,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 15:14:35,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 15:14:35,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 15:14:35,907 INFO L272 TraceCheckUtils]: 51: Hoare triple {28958#(< ~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)); {28594#true} is VALID [2022-04-15 15:14:35,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {28958#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {28958#(< ~counter~0 17)} is VALID [2022-04-15 15:14:35,908 INFO L290 TraceCheckUtils]: 49: Hoare triple {28983#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28958#(< ~counter~0 17)} is VALID [2022-04-15 15:14:35,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {28983#(< ~counter~0 16)} assume !(~r~0 < 0); {28983#(< ~counter~0 16)} is VALID [2022-04-15 15:14:35,908 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28594#true} {28983#(< ~counter~0 16)} #98#return; {28983#(< ~counter~0 16)} is VALID [2022-04-15 15:14:35,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 15:14:35,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 15:14:35,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 15:14:35,909 INFO L272 TraceCheckUtils]: 43: Hoare triple {28983#(< ~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)); {28594#true} is VALID [2022-04-15 15:14:35,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {28983#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {28983#(< ~counter~0 16)} is VALID [2022-04-15 15:14:35,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {29008#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28983#(< ~counter~0 16)} is VALID [2022-04-15 15:14:35,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {29008#(< ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {29008#(< ~counter~0 15)} is VALID [2022-04-15 15:14:35,921 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28594#true} {29008#(< ~counter~0 15)} #98#return; {29008#(< ~counter~0 15)} is VALID [2022-04-15 15:14:35,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 15:14:35,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 15:14:35,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 15:14:35,921 INFO L272 TraceCheckUtils]: 35: Hoare triple {29008#(< ~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)); {28594#true} is VALID [2022-04-15 15:14:35,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {29008#(< ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {29008#(< ~counter~0 15)} is VALID [2022-04-15 15:14:35,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {29033#(< ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29008#(< ~counter~0 15)} is VALID [2022-04-15 15:14:35,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {29033#(< ~counter~0 14)} assume !(~r~0 > 0); {29033#(< ~counter~0 14)} is VALID [2022-04-15 15:14:35,923 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28594#true} {29033#(< ~counter~0 14)} #96#return; {29033#(< ~counter~0 14)} is VALID [2022-04-15 15:14:35,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 15:14:35,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 15:14:35,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 15:14:35,924 INFO L272 TraceCheckUtils]: 27: Hoare triple {29033#(< ~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)); {28594#true} is VALID [2022-04-15 15:14:35,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {29033#(< ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {29033#(< ~counter~0 14)} is VALID [2022-04-15 15:14:35,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {29058#(< ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29033#(< ~counter~0 14)} is VALID [2022-04-15 15:14:35,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {29058#(< ~counter~0 13)} assume !!(0 != ~r~0); {29058#(< ~counter~0 13)} is VALID [2022-04-15 15:14:35,926 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28594#true} {29058#(< ~counter~0 13)} #94#return; {29058#(< ~counter~0 13)} is VALID [2022-04-15 15:14:35,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 15:14:35,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 15:14:35,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 15:14:35,926 INFO L272 TraceCheckUtils]: 19: Hoare triple {29058#(< ~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)); {28594#true} is VALID [2022-04-15 15:14:35,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {29058#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {29058#(< ~counter~0 13)} is VALID [2022-04-15 15:14:35,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {29083#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29058#(< ~counter~0 13)} is VALID [2022-04-15 15:14:35,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {29083#(< ~counter~0 12)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {29083#(< ~counter~0 12)} is VALID [2022-04-15 15:14:35,928 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28594#true} {29083#(< ~counter~0 12)} #92#return; {29083#(< ~counter~0 12)} is VALID [2022-04-15 15:14:35,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 15:14:35,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 15:14:35,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 15:14:35,929 INFO L272 TraceCheckUtils]: 11: Hoare triple {29083#(< ~counter~0 12)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {28594#true} is VALID [2022-04-15 15:14:35,929 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28594#true} {29083#(< ~counter~0 12)} #90#return; {29083#(< ~counter~0 12)} is VALID [2022-04-15 15:14:35,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 15:14:35,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 15:14:35,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 15:14:35,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {29083#(< ~counter~0 12)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28594#true} is VALID [2022-04-15 15:14:35,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {29083#(< ~counter~0 12)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {29083#(< ~counter~0 12)} is VALID [2022-04-15 15:14:35,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {29083#(< ~counter~0 12)} call #t~ret9 := main(); {29083#(< ~counter~0 12)} is VALID [2022-04-15 15:14:35,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29083#(< ~counter~0 12)} {28594#true} #102#return; {29083#(< ~counter~0 12)} is VALID [2022-04-15 15:14:35,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {29083#(< ~counter~0 12)} assume true; {29083#(< ~counter~0 12)} is VALID [2022-04-15 15:14:35,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {28594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29083#(< ~counter~0 12)} is VALID [2022-04-15 15:14:35,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {28594#true} call ULTIMATE.init(); {28594#true} is VALID [2022-04-15 15:14:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-15 15:14:35,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:35,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730916326] [2022-04-15 15:14:35,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:35,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250821454] [2022-04-15 15:14:35,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250821454] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:35,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:35,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-15 15:14:35,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:35,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [92493994] [2022-04-15 15:14:35,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [92493994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:35,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:35,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 15:14:35,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508635535] [2022-04-15 15:14:35,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:35,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-15 15:14:35,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:35,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:14:36,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:36,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 15:14:36,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:36,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 15:14:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-15 15:14:36,008 INFO L87 Difference]: Start difference. First operand 253 states and 319 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:14:36,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:36,807 INFO L93 Difference]: Finished difference Result 287 states and 361 transitions. [2022-04-15 15:14:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 15:14:36,807 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-15 15:14:36,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:14:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-15 15:14:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:14:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-15 15:14:36,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-15 15:14:36,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:36,956 INFO L225 Difference]: With dead ends: 287 [2022-04-15 15:14:36,956 INFO L226 Difference]: Without dead ends: 282 [2022-04-15 15:14:36,956 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=414, Unknown=0, NotChecked=0, Total=702 [2022-04-15 15:14:36,957 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 93 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:36,957 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 220 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:14:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-04-15 15:14:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 273. [2022-04-15 15:14:37,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:37,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 273 states, 201 states have (on average 1.199004975124378) internal successors, (241), 208 states have internal predecessors, (241), 53 states have call successors, (53), 20 states have call predecessors, (53), 18 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-15 15:14:37,240 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 273 states, 201 states have (on average 1.199004975124378) internal successors, (241), 208 states have internal predecessors, (241), 53 states have call successors, (53), 20 states have call predecessors, (53), 18 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-15 15:14:37,241 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 273 states, 201 states have (on average 1.199004975124378) internal successors, (241), 208 states have internal predecessors, (241), 53 states have call successors, (53), 20 states have call predecessors, (53), 18 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-15 15:14:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:37,246 INFO L93 Difference]: Finished difference Result 282 states and 355 transitions. [2022-04-15 15:14:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 355 transitions. [2022-04-15 15:14:37,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:37,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:37,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 201 states have (on average 1.199004975124378) internal successors, (241), 208 states have internal predecessors, (241), 53 states have call successors, (53), 20 states have call predecessors, (53), 18 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) Second operand 282 states. [2022-04-15 15:14:37,248 INFO L87 Difference]: Start difference. First operand has 273 states, 201 states have (on average 1.199004975124378) internal successors, (241), 208 states have internal predecessors, (241), 53 states have call successors, (53), 20 states have call predecessors, (53), 18 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) Second operand 282 states. [2022-04-15 15:14:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:37,253 INFO L93 Difference]: Finished difference Result 282 states and 355 transitions. [2022-04-15 15:14:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 355 transitions. [2022-04-15 15:14:37,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:37,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:37,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:37,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 201 states have (on average 1.199004975124378) internal successors, (241), 208 states have internal predecessors, (241), 53 states have call successors, (53), 20 states have call predecessors, (53), 18 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-15 15:14:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 345 transitions. [2022-04-15 15:14:37,261 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 345 transitions. Word has length 87 [2022-04-15 15:14:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:37,262 INFO L478 AbstractCegarLoop]: Abstraction has 273 states and 345 transitions. [2022-04-15 15:14:37,262 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:14:37,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 273 states and 345 transitions. [2022-04-15 15:14:48,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 345 edges. 342 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 345 transitions. [2022-04-15 15:14:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 15:14:48,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:48,224 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:14:48,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 15:14:48,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:48,425 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:48,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:48,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-15 15:14:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:48,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1259367887] [2022-04-15 15:14:48,426 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-15 15:14:48,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:48,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388371837] [2022-04-15 15:14:48,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:48,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:48,437 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:48,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005904166] [2022-04-15 15:14:48,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:14:48,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:48,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:48,438 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:14:48,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 15:14:48,493 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:14:48,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:48,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 15:14:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:48,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:48,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {30831#true} call ULTIMATE.init(); {30831#true} is VALID [2022-04-15 15:14:48,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {30831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {30831#true} is VALID [2022-04-15 15:14:48,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:48,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30831#true} {30831#true} #102#return; {30831#true} is VALID [2022-04-15 15:14:48,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {30831#true} call #t~ret9 := main(); {30831#true} is VALID [2022-04-15 15:14:48,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {30831#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; {30831#true} is VALID [2022-04-15 15:14:48,732 INFO L272 TraceCheckUtils]: 6: Hoare triple {30831#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {30831#true} is VALID [2022-04-15 15:14:48,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:48,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:48,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:48,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30831#true} {30831#true} #90#return; {30831#true} is VALID [2022-04-15 15:14:48,733 INFO L272 TraceCheckUtils]: 11: Hoare triple {30831#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)); {30831#true} is VALID [2022-04-15 15:14:48,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:48,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:48,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:48,733 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30831#true} {30831#true} #92#return; {30831#true} is VALID [2022-04-15 15:14:48,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {30831#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {30884#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,734 INFO L272 TraceCheckUtils]: 19: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 15:14:48,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:48,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:48,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:48,735 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #94#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {30884#(<= main_~v~0 1)} assume !!(0 != ~r~0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {30884#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,736 INFO L272 TraceCheckUtils]: 27: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 15:14:48,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:48,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:48,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:48,736 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #96#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {30884#(<= main_~v~0 1)} assume !(~r~0 > 0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {30884#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post8 < 20);havoc #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,737 INFO L272 TraceCheckUtils]: 35: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 15:14:48,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:48,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:48,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:48,738 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #98#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {30884#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {30884#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post8 < 20);havoc #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,739 INFO L272 TraceCheckUtils]: 43: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 15:14:48,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:48,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:48,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:48,740 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #98#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {30884#(<= main_~v~0 1)} assume !(~r~0 < 0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {30884#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,741 INFO L272 TraceCheckUtils]: 51: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 15:14:48,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:48,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:48,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:48,741 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #94#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {30884#(<= main_~v~0 1)} assume !!(0 != ~r~0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {30884#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,743 INFO L272 TraceCheckUtils]: 59: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 15:14:48,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:48,743 INFO L290 TraceCheckUtils]: 61: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:48,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:48,744 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #96#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:48,744 INFO L290 TraceCheckUtils]: 64: Hoare triple {30884#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:48,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {31029#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:48,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:48,745 INFO L272 TraceCheckUtils]: 67: Hoare triple {31029#(< 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)); {30831#true} is VALID [2022-04-15 15:14:48,745 INFO L290 TraceCheckUtils]: 68: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:48,746 INFO L290 TraceCheckUtils]: 69: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:48,746 INFO L290 TraceCheckUtils]: 70: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:48,746 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {30831#true} {31029#(< 0 (+ main_~r~0 1))} #96#return; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:48,747 INFO L290 TraceCheckUtils]: 72: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:48,747 INFO L290 TraceCheckUtils]: 73: Hoare triple {31029#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:48,747 INFO L290 TraceCheckUtils]: 74: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:48,747 INFO L272 TraceCheckUtils]: 75: Hoare triple {31029#(< 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)); {30831#true} is VALID [2022-04-15 15:14:48,748 INFO L290 TraceCheckUtils]: 76: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:48,748 INFO L290 TraceCheckUtils]: 77: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:48,748 INFO L290 TraceCheckUtils]: 78: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:48,748 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {30831#true} {31029#(< 0 (+ main_~r~0 1))} #98#return; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:48,749 INFO L290 TraceCheckUtils]: 80: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30832#false} is VALID [2022-04-15 15:14:48,750 INFO L290 TraceCheckUtils]: 81: Hoare triple {30832#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30832#false} is VALID [2022-04-15 15:14:48,750 INFO L290 TraceCheckUtils]: 82: Hoare triple {30832#false} assume !(#t~post8 < 20);havoc #t~post8; {30832#false} is VALID [2022-04-15 15:14:48,750 INFO L290 TraceCheckUtils]: 83: Hoare triple {30832#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30832#false} is VALID [2022-04-15 15:14:48,750 INFO L290 TraceCheckUtils]: 84: Hoare triple {30832#false} assume !(#t~post6 < 20);havoc #t~post6; {30832#false} is VALID [2022-04-15 15:14:48,750 INFO L272 TraceCheckUtils]: 85: Hoare triple {30832#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {30832#false} is VALID [2022-04-15 15:14:48,750 INFO L290 TraceCheckUtils]: 86: Hoare triple {30832#false} ~cond := #in~cond; {30832#false} is VALID [2022-04-15 15:14:48,750 INFO L290 TraceCheckUtils]: 87: Hoare triple {30832#false} assume 0 == ~cond; {30832#false} is VALID [2022-04-15 15:14:48,750 INFO L290 TraceCheckUtils]: 88: Hoare triple {30832#false} assume !false; {30832#false} is VALID [2022-04-15 15:14:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-15 15:14:48,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:49,002 INFO L290 TraceCheckUtils]: 88: Hoare triple {30832#false} assume !false; {30832#false} is VALID [2022-04-15 15:14:49,002 INFO L290 TraceCheckUtils]: 87: Hoare triple {30832#false} assume 0 == ~cond; {30832#false} is VALID [2022-04-15 15:14:49,002 INFO L290 TraceCheckUtils]: 86: Hoare triple {30832#false} ~cond := #in~cond; {30832#false} is VALID [2022-04-15 15:14:49,002 INFO L272 TraceCheckUtils]: 85: Hoare triple {30832#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {30832#false} is VALID [2022-04-15 15:14:49,003 INFO L290 TraceCheckUtils]: 84: Hoare triple {30832#false} assume !(#t~post6 < 20);havoc #t~post6; {30832#false} is VALID [2022-04-15 15:14:49,003 INFO L290 TraceCheckUtils]: 83: Hoare triple {30832#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30832#false} is VALID [2022-04-15 15:14:49,003 INFO L290 TraceCheckUtils]: 82: Hoare triple {30832#false} assume !(#t~post8 < 20);havoc #t~post8; {30832#false} is VALID [2022-04-15 15:14:49,003 INFO L290 TraceCheckUtils]: 81: Hoare triple {30832#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30832#false} is VALID [2022-04-15 15:14:49,004 INFO L290 TraceCheckUtils]: 80: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30832#false} is VALID [2022-04-15 15:14:49,004 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {30831#true} {31029#(< 0 (+ main_~r~0 1))} #98#return; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:49,004 INFO L290 TraceCheckUtils]: 78: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:49,004 INFO L290 TraceCheckUtils]: 77: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:49,004 INFO L290 TraceCheckUtils]: 76: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:49,005 INFO L272 TraceCheckUtils]: 75: Hoare triple {31029#(< 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)); {30831#true} is VALID [2022-04-15 15:14:49,005 INFO L290 TraceCheckUtils]: 74: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:49,005 INFO L290 TraceCheckUtils]: 73: Hoare triple {31029#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:49,005 INFO L290 TraceCheckUtils]: 72: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:49,006 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {30831#true} {31029#(< 0 (+ main_~r~0 1))} #96#return; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:49,006 INFO L290 TraceCheckUtils]: 70: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:49,006 INFO L290 TraceCheckUtils]: 69: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:49,006 INFO L290 TraceCheckUtils]: 68: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:49,006 INFO L272 TraceCheckUtils]: 67: Hoare triple {31029#(< 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)); {30831#true} is VALID [2022-04-15 15:14:49,006 INFO L290 TraceCheckUtils]: 66: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:49,007 INFO L290 TraceCheckUtils]: 65: Hoare triple {31029#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:49,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {30884#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:14:49,008 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #96#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,008 INFO L290 TraceCheckUtils]: 62: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:49,008 INFO L290 TraceCheckUtils]: 61: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:49,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:49,008 INFO L272 TraceCheckUtils]: 59: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 15:14:49,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {30884#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {30884#(<= main_~v~0 1)} assume !!(0 != ~r~0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,009 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #94#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,010 INFO L290 TraceCheckUtils]: 54: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:49,010 INFO L290 TraceCheckUtils]: 53: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:49,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:49,010 INFO L272 TraceCheckUtils]: 51: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 15:14:49,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {30884#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {30884#(<= main_~v~0 1)} assume !(~r~0 < 0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,011 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #98#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:49,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:49,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:49,011 INFO L272 TraceCheckUtils]: 43: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 15:14:49,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post8 < 20);havoc #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {30884#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {30884#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,013 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #98#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:49,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:49,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:49,013 INFO L272 TraceCheckUtils]: 35: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 15:14:49,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post8 < 20);havoc #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {30884#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {30884#(<= main_~v~0 1)} assume !(~r~0 > 0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,014 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #96#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:49,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:49,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:49,015 INFO L272 TraceCheckUtils]: 27: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 15:14:49,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {30884#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {30884#(<= main_~v~0 1)} assume !!(0 != ~r~0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,016 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #94#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:49,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:49,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:49,016 INFO L272 TraceCheckUtils]: 19: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 15:14:49,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {30884#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {30831#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 15:14:49,017 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30831#true} {30831#true} #92#return; {30831#true} is VALID [2022-04-15 15:14:49,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:49,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:49,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:49,018 INFO L272 TraceCheckUtils]: 11: Hoare triple {30831#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)); {30831#true} is VALID [2022-04-15 15:14:49,018 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30831#true} {30831#true} #90#return; {30831#true} is VALID [2022-04-15 15:14:49,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:49,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 15:14:49,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 15:14:49,018 INFO L272 TraceCheckUtils]: 6: Hoare triple {30831#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {30831#true} is VALID [2022-04-15 15:14:49,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {30831#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; {30831#true} is VALID [2022-04-15 15:14:49,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {30831#true} call #t~ret9 := main(); {30831#true} is VALID [2022-04-15 15:14:49,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30831#true} {30831#true} #102#return; {30831#true} is VALID [2022-04-15 15:14:49,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 15:14:49,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {30831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {30831#true} is VALID [2022-04-15 15:14:49,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {30831#true} call ULTIMATE.init(); {30831#true} is VALID [2022-04-15 15:14:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-15 15:14:49,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:49,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388371837] [2022-04-15 15:14:49,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:49,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005904166] [2022-04-15 15:14:49,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005904166] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:49,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:49,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-15 15:14:49,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:49,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1259367887] [2022-04-15 15:14:49,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1259367887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:49,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:49,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:14:49,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504510683] [2022-04-15 15:14:49,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:49,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-15 15:14:49,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:49,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:14:49,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:49,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:14:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:49,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:14:49,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:14:49,058 INFO L87 Difference]: Start difference. First operand 273 states and 345 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:14:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:49,704 INFO L93 Difference]: Finished difference Result 435 states and 564 transitions. [2022-04-15 15:14:49,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:14:49,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-15 15:14:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:14:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-15 15:14:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:14:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-15 15:14:49,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-15 15:14:49,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:49,828 INFO L225 Difference]: With dead ends: 435 [2022-04-15 15:14:49,828 INFO L226 Difference]: Without dead ends: 329 [2022-04-15 15:14:49,828 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:14:49,829 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:49,829 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 145 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:14:49,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-15 15:14:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 324. [2022-04-15 15:14:50,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:50,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 324 states, 240 states have (on average 1.2) internal successors, (288), 246 states have internal predecessors, (288), 65 states have call successors, (65), 20 states have call predecessors, (65), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 15:14:50,325 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 324 states, 240 states have (on average 1.2) internal successors, (288), 246 states have internal predecessors, (288), 65 states have call successors, (65), 20 states have call predecessors, (65), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 15:14:50,325 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 324 states, 240 states have (on average 1.2) internal successors, (288), 246 states have internal predecessors, (288), 65 states have call successors, (65), 20 states have call predecessors, (65), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 15:14:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:50,333 INFO L93 Difference]: Finished difference Result 329 states and 422 transitions. [2022-04-15 15:14:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 422 transitions. [2022-04-15 15:14:50,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:50,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:50,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 240 states have (on average 1.2) internal successors, (288), 246 states have internal predecessors, (288), 65 states have call successors, (65), 20 states have call predecessors, (65), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 329 states. [2022-04-15 15:14:50,335 INFO L87 Difference]: Start difference. First operand has 324 states, 240 states have (on average 1.2) internal successors, (288), 246 states have internal predecessors, (288), 65 states have call successors, (65), 20 states have call predecessors, (65), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 329 states. [2022-04-15 15:14:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:50,343 INFO L93 Difference]: Finished difference Result 329 states and 422 transitions. [2022-04-15 15:14:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 422 transitions. [2022-04-15 15:14:50,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:50,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:50,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:50,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 240 states have (on average 1.2) internal successors, (288), 246 states have internal predecessors, (288), 65 states have call successors, (65), 20 states have call predecessors, (65), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 15:14:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 416 transitions. [2022-04-15 15:14:50,354 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 416 transitions. Word has length 89 [2022-04-15 15:14:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:50,354 INFO L478 AbstractCegarLoop]: Abstraction has 324 states and 416 transitions. [2022-04-15 15:14:50,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:14:50,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 324 states and 416 transitions. [2022-04-15 15:15:01,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 414 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 416 transitions. [2022-04-15 15:15:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 15:15:01,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:01,950 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:15:01,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 15:15:02,150 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 15:15:02,150 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:02,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-15 15:15:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:02,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [150714680] [2022-04-15 15:15:02,151 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-15 15:15:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:02,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965240181] [2022-04-15 15:15:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:02,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:02,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502589620] [2022-04-15 15:15:02,162 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:15:02,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:02,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:02,163 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:15:02,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 15:15:02,293 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 15:15:02,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:02,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 15:15:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:02,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:15:02,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {33546#true} call ULTIMATE.init(); {33546#true} is VALID [2022-04-15 15:15:02,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {33546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {33554#(<= ~counter~0 0)} assume true; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33554#(<= ~counter~0 0)} {33546#true} #102#return; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {33554#(<= ~counter~0 0)} call #t~ret9 := main(); {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {33554#(<= ~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; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {33554#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {33554#(<= ~counter~0 0)} ~cond := #in~cond; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {33554#(<= ~counter~0 0)} assume !(0 == ~cond); {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {33554#(<= ~counter~0 0)} assume true; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,786 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33554#(<= ~counter~0 0)} {33554#(<= ~counter~0 0)} #90#return; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,786 INFO L272 TraceCheckUtils]: 11: Hoare triple {33554#(<= ~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)); {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {33554#(<= ~counter~0 0)} ~cond := #in~cond; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {33554#(<= ~counter~0 0)} assume !(0 == ~cond); {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {33554#(<= ~counter~0 0)} assume true; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,793 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33554#(<= ~counter~0 0)} {33554#(<= ~counter~0 0)} #92#return; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {33554#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:02,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {33554#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33603#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:02,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {33603#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {33603#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:02,796 INFO L272 TraceCheckUtils]: 19: Hoare triple {33603#(<= ~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)); {33603#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:02,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {33603#(<= ~counter~0 1)} ~cond := #in~cond; {33603#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:02,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {33603#(<= ~counter~0 1)} assume !(0 == ~cond); {33603#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:02,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {33603#(<= ~counter~0 1)} assume true; {33603#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:02,797 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {33603#(<= ~counter~0 1)} {33603#(<= ~counter~0 1)} #94#return; {33603#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:02,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {33603#(<= ~counter~0 1)} assume !!(0 != ~r~0); {33603#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:02,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {33603#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33628#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:02,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {33628#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {33628#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:02,799 INFO L272 TraceCheckUtils]: 27: Hoare triple {33628#(<= ~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)); {33628#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:02,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {33628#(<= ~counter~0 2)} ~cond := #in~cond; {33628#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:02,803 INFO L290 TraceCheckUtils]: 29: Hoare triple {33628#(<= ~counter~0 2)} assume !(0 == ~cond); {33628#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:02,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {33628#(<= ~counter~0 2)} assume true; {33628#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:02,804 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {33628#(<= ~counter~0 2)} {33628#(<= ~counter~0 2)} #96#return; {33628#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:02,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {33628#(<= ~counter~0 2)} assume !(~r~0 > 0); {33628#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:02,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {33628#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33653#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:02,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {33653#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {33653#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:02,806 INFO L272 TraceCheckUtils]: 35: Hoare triple {33653#(<= ~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)); {33653#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:02,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {33653#(<= ~counter~0 3)} ~cond := #in~cond; {33653#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:02,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {33653#(<= ~counter~0 3)} assume !(0 == ~cond); {33653#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:02,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {33653#(<= ~counter~0 3)} assume true; {33653#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:02,808 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {33653#(<= ~counter~0 3)} {33653#(<= ~counter~0 3)} #98#return; {33653#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:02,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {33653#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {33653#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:02,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {33653#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33678#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:02,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {33678#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {33678#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:02,810 INFO L272 TraceCheckUtils]: 43: Hoare triple {33678#(<= ~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)); {33678#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:02,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {33678#(<= ~counter~0 4)} ~cond := #in~cond; {33678#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:02,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {33678#(<= ~counter~0 4)} assume !(0 == ~cond); {33678#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:02,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {33678#(<= ~counter~0 4)} assume true; {33678#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:02,812 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {33678#(<= ~counter~0 4)} {33678#(<= ~counter~0 4)} #98#return; {33678#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:02,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {33678#(<= ~counter~0 4)} assume !(~r~0 < 0); {33678#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:02,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {33678#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33703#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:02,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {33703#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {33703#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:02,814 INFO L272 TraceCheckUtils]: 51: Hoare triple {33703#(<= ~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)); {33703#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:02,815 INFO L290 TraceCheckUtils]: 52: Hoare triple {33703#(<= ~counter~0 5)} ~cond := #in~cond; {33703#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:02,815 INFO L290 TraceCheckUtils]: 53: Hoare triple {33703#(<= ~counter~0 5)} assume !(0 == ~cond); {33703#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:02,815 INFO L290 TraceCheckUtils]: 54: Hoare triple {33703#(<= ~counter~0 5)} assume true; {33703#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:02,816 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {33703#(<= ~counter~0 5)} {33703#(<= ~counter~0 5)} #94#return; {33703#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:02,816 INFO L290 TraceCheckUtils]: 56: Hoare triple {33703#(<= ~counter~0 5)} assume !!(0 != ~r~0); {33703#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:02,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {33703#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33728#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:02,818 INFO L290 TraceCheckUtils]: 58: Hoare triple {33728#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {33728#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:02,818 INFO L272 TraceCheckUtils]: 59: Hoare triple {33728#(<= ~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)); {33728#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:02,819 INFO L290 TraceCheckUtils]: 60: Hoare triple {33728#(<= ~counter~0 6)} ~cond := #in~cond; {33728#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:02,819 INFO L290 TraceCheckUtils]: 61: Hoare triple {33728#(<= ~counter~0 6)} assume !(0 == ~cond); {33728#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:02,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {33728#(<= ~counter~0 6)} assume true; {33728#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:02,820 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {33728#(<= ~counter~0 6)} {33728#(<= ~counter~0 6)} #96#return; {33728#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:02,820 INFO L290 TraceCheckUtils]: 64: Hoare triple {33728#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33728#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:02,821 INFO L290 TraceCheckUtils]: 65: Hoare triple {33728#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33753#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:02,821 INFO L290 TraceCheckUtils]: 66: Hoare triple {33753#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {33753#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:02,822 INFO L272 TraceCheckUtils]: 67: Hoare triple {33753#(<= ~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)); {33753#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:02,823 INFO L290 TraceCheckUtils]: 68: Hoare triple {33753#(<= ~counter~0 7)} ~cond := #in~cond; {33753#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:02,823 INFO L290 TraceCheckUtils]: 69: Hoare triple {33753#(<= ~counter~0 7)} assume !(0 == ~cond); {33753#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:02,823 INFO L290 TraceCheckUtils]: 70: Hoare triple {33753#(<= ~counter~0 7)} assume true; {33753#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:02,824 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {33753#(<= ~counter~0 7)} {33753#(<= ~counter~0 7)} #96#return; {33753#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:02,824 INFO L290 TraceCheckUtils]: 72: Hoare triple {33753#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33753#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:02,825 INFO L290 TraceCheckUtils]: 73: Hoare triple {33753#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33778#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:02,825 INFO L290 TraceCheckUtils]: 74: Hoare triple {33778#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {33778#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:02,826 INFO L272 TraceCheckUtils]: 75: Hoare triple {33778#(<= ~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)); {33778#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:02,826 INFO L290 TraceCheckUtils]: 76: Hoare triple {33778#(<= ~counter~0 8)} ~cond := #in~cond; {33778#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:02,827 INFO L290 TraceCheckUtils]: 77: Hoare triple {33778#(<= ~counter~0 8)} assume !(0 == ~cond); {33778#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:02,827 INFO L290 TraceCheckUtils]: 78: Hoare triple {33778#(<= ~counter~0 8)} assume true; {33778#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:02,828 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {33778#(<= ~counter~0 8)} {33778#(<= ~counter~0 8)} #96#return; {33778#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:02,828 INFO L290 TraceCheckUtils]: 80: Hoare triple {33778#(<= ~counter~0 8)} assume !(~r~0 > 0); {33778#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:02,829 INFO L290 TraceCheckUtils]: 81: Hoare triple {33778#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33803#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:02,829 INFO L290 TraceCheckUtils]: 82: Hoare triple {33803#(<= ~counter~0 9)} assume !(#t~post8 < 20);havoc #t~post8; {33803#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:02,830 INFO L290 TraceCheckUtils]: 83: Hoare triple {33803#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33810#(<= |main_#t~post6| 9)} is VALID [2022-04-15 15:15:02,830 INFO L290 TraceCheckUtils]: 84: Hoare triple {33810#(<= |main_#t~post6| 9)} assume !(#t~post6 < 20);havoc #t~post6; {33547#false} is VALID [2022-04-15 15:15:02,830 INFO L272 TraceCheckUtils]: 85: Hoare triple {33547#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33547#false} is VALID [2022-04-15 15:15:02,830 INFO L290 TraceCheckUtils]: 86: Hoare triple {33547#false} ~cond := #in~cond; {33547#false} is VALID [2022-04-15 15:15:02,831 INFO L290 TraceCheckUtils]: 87: Hoare triple {33547#false} assume 0 == ~cond; {33547#false} is VALID [2022-04-15 15:15:02,831 INFO L290 TraceCheckUtils]: 88: Hoare triple {33547#false} assume !false; {33547#false} is VALID [2022-04-15 15:15:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:15:02,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:15:03,350 INFO L290 TraceCheckUtils]: 88: Hoare triple {33547#false} assume !false; {33547#false} is VALID [2022-04-15 15:15:03,351 INFO L290 TraceCheckUtils]: 87: Hoare triple {33547#false} assume 0 == ~cond; {33547#false} is VALID [2022-04-15 15:15:03,351 INFO L290 TraceCheckUtils]: 86: Hoare triple {33547#false} ~cond := #in~cond; {33547#false} is VALID [2022-04-15 15:15:03,351 INFO L272 TraceCheckUtils]: 85: Hoare triple {33547#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33547#false} is VALID [2022-04-15 15:15:03,351 INFO L290 TraceCheckUtils]: 84: Hoare triple {33838#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {33547#false} is VALID [2022-04-15 15:15:03,352 INFO L290 TraceCheckUtils]: 83: Hoare triple {33842#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33838#(< |main_#t~post6| 20)} is VALID [2022-04-15 15:15:03,352 INFO L290 TraceCheckUtils]: 82: Hoare triple {33842#(< ~counter~0 20)} assume !(#t~post8 < 20);havoc #t~post8; {33842#(< ~counter~0 20)} is VALID [2022-04-15 15:15:03,354 INFO L290 TraceCheckUtils]: 81: Hoare triple {33849#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33842#(< ~counter~0 20)} is VALID [2022-04-15 15:15:03,354 INFO L290 TraceCheckUtils]: 80: Hoare triple {33849#(< ~counter~0 19)} assume !(~r~0 > 0); {33849#(< ~counter~0 19)} is VALID [2022-04-15 15:15:03,354 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {33546#true} {33849#(< ~counter~0 19)} #96#return; {33849#(< ~counter~0 19)} is VALID [2022-04-15 15:15:03,355 INFO L290 TraceCheckUtils]: 78: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 15:15:03,355 INFO L290 TraceCheckUtils]: 77: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 15:15:03,355 INFO L290 TraceCheckUtils]: 76: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 15:15:03,355 INFO L272 TraceCheckUtils]: 75: Hoare triple {33849#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33546#true} is VALID [2022-04-15 15:15:03,355 INFO L290 TraceCheckUtils]: 74: Hoare triple {33849#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {33849#(< ~counter~0 19)} is VALID [2022-04-15 15:15:03,356 INFO L290 TraceCheckUtils]: 73: Hoare triple {33874#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33849#(< ~counter~0 19)} is VALID [2022-04-15 15:15:03,357 INFO L290 TraceCheckUtils]: 72: Hoare triple {33874#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33874#(< ~counter~0 18)} is VALID [2022-04-15 15:15:03,357 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {33546#true} {33874#(< ~counter~0 18)} #96#return; {33874#(< ~counter~0 18)} is VALID [2022-04-15 15:15:03,357 INFO L290 TraceCheckUtils]: 70: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 15:15:03,358 INFO L290 TraceCheckUtils]: 69: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 15:15:03,358 INFO L290 TraceCheckUtils]: 68: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 15:15:03,358 INFO L272 TraceCheckUtils]: 67: Hoare triple {33874#(< ~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)); {33546#true} is VALID [2022-04-15 15:15:03,358 INFO L290 TraceCheckUtils]: 66: Hoare triple {33874#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {33874#(< ~counter~0 18)} is VALID [2022-04-15 15:15:03,358 INFO L290 TraceCheckUtils]: 65: Hoare triple {33899#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33874#(< ~counter~0 18)} is VALID [2022-04-15 15:15:03,359 INFO L290 TraceCheckUtils]: 64: Hoare triple {33899#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33899#(< ~counter~0 17)} is VALID [2022-04-15 15:15:03,359 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {33546#true} {33899#(< ~counter~0 17)} #96#return; {33899#(< ~counter~0 17)} is VALID [2022-04-15 15:15:03,359 INFO L290 TraceCheckUtils]: 62: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 15:15:03,359 INFO L290 TraceCheckUtils]: 61: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 15:15:03,360 INFO L290 TraceCheckUtils]: 60: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 15:15:03,360 INFO L272 TraceCheckUtils]: 59: Hoare triple {33899#(< ~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)); {33546#true} is VALID [2022-04-15 15:15:03,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {33899#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {33899#(< ~counter~0 17)} is VALID [2022-04-15 15:15:03,360 INFO L290 TraceCheckUtils]: 57: Hoare triple {33924#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33899#(< ~counter~0 17)} is VALID [2022-04-15 15:15:03,361 INFO L290 TraceCheckUtils]: 56: Hoare triple {33924#(< ~counter~0 16)} assume !!(0 != ~r~0); {33924#(< ~counter~0 16)} is VALID [2022-04-15 15:15:03,361 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {33546#true} {33924#(< ~counter~0 16)} #94#return; {33924#(< ~counter~0 16)} is VALID [2022-04-15 15:15:03,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 15:15:03,361 INFO L290 TraceCheckUtils]: 53: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 15:15:03,361 INFO L290 TraceCheckUtils]: 52: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 15:15:03,362 INFO L272 TraceCheckUtils]: 51: Hoare triple {33924#(< ~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)); {33546#true} is VALID [2022-04-15 15:15:03,362 INFO L290 TraceCheckUtils]: 50: Hoare triple {33924#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {33924#(< ~counter~0 16)} is VALID [2022-04-15 15:15:03,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {33949#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33924#(< ~counter~0 16)} is VALID [2022-04-15 15:15:03,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {33949#(< ~counter~0 15)} assume !(~r~0 < 0); {33949#(< ~counter~0 15)} is VALID [2022-04-15 15:15:03,363 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {33546#true} {33949#(< ~counter~0 15)} #98#return; {33949#(< ~counter~0 15)} is VALID [2022-04-15 15:15:03,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 15:15:03,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 15:15:03,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 15:15:03,363 INFO L272 TraceCheckUtils]: 43: Hoare triple {33949#(< ~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)); {33546#true} is VALID [2022-04-15 15:15:03,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {33949#(< ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {33949#(< ~counter~0 15)} is VALID [2022-04-15 15:15:03,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {33974#(< ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33949#(< ~counter~0 15)} is VALID [2022-04-15 15:15:03,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {33974#(< ~counter~0 14)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {33974#(< ~counter~0 14)} is VALID [2022-04-15 15:15:03,365 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {33546#true} {33974#(< ~counter~0 14)} #98#return; {33974#(< ~counter~0 14)} is VALID [2022-04-15 15:15:03,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 15:15:03,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 15:15:03,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 15:15:03,365 INFO L272 TraceCheckUtils]: 35: Hoare triple {33974#(< ~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)); {33546#true} is VALID [2022-04-15 15:15:03,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {33974#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {33974#(< ~counter~0 14)} is VALID [2022-04-15 15:15:03,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {33999#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33974#(< ~counter~0 14)} is VALID [2022-04-15 15:15:03,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {33999#(< ~counter~0 13)} assume !(~r~0 > 0); {33999#(< ~counter~0 13)} is VALID [2022-04-15 15:15:03,367 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {33546#true} {33999#(< ~counter~0 13)} #96#return; {33999#(< ~counter~0 13)} is VALID [2022-04-15 15:15:03,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 15:15:03,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 15:15:03,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 15:15:03,367 INFO L272 TraceCheckUtils]: 27: Hoare triple {33999#(< ~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)); {33546#true} is VALID [2022-04-15 15:15:03,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {33999#(< ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {33999#(< ~counter~0 13)} is VALID [2022-04-15 15:15:03,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {34024#(< ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33999#(< ~counter~0 13)} is VALID [2022-04-15 15:15:03,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {34024#(< ~counter~0 12)} assume !!(0 != ~r~0); {34024#(< ~counter~0 12)} is VALID [2022-04-15 15:15:03,369 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {33546#true} {34024#(< ~counter~0 12)} #94#return; {34024#(< ~counter~0 12)} is VALID [2022-04-15 15:15:03,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 15:15:03,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 15:15:03,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 15:15:03,369 INFO L272 TraceCheckUtils]: 19: Hoare triple {34024#(< ~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)); {33546#true} is VALID [2022-04-15 15:15:03,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {34024#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {34024#(< ~counter~0 12)} is VALID [2022-04-15 15:15:03,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {34049#(< ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34024#(< ~counter~0 12)} is VALID [2022-04-15 15:15:03,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {34049#(< ~counter~0 11)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34049#(< ~counter~0 11)} is VALID [2022-04-15 15:15:03,371 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33546#true} {34049#(< ~counter~0 11)} #92#return; {34049#(< ~counter~0 11)} is VALID [2022-04-15 15:15:03,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 15:15:03,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 15:15:03,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 15:15:03,371 INFO L272 TraceCheckUtils]: 11: Hoare triple {34049#(< ~counter~0 11)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {33546#true} is VALID [2022-04-15 15:15:03,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33546#true} {34049#(< ~counter~0 11)} #90#return; {34049#(< ~counter~0 11)} is VALID [2022-04-15 15:15:03,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 15:15:03,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 15:15:03,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 15:15:03,372 INFO L272 TraceCheckUtils]: 6: Hoare triple {34049#(< ~counter~0 11)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33546#true} is VALID [2022-04-15 15:15:03,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {34049#(< ~counter~0 11)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {34049#(< ~counter~0 11)} is VALID [2022-04-15 15:15:03,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {34049#(< ~counter~0 11)} call #t~ret9 := main(); {34049#(< ~counter~0 11)} is VALID [2022-04-15 15:15:03,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34049#(< ~counter~0 11)} {33546#true} #102#return; {34049#(< ~counter~0 11)} is VALID [2022-04-15 15:15:03,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {34049#(< ~counter~0 11)} assume true; {34049#(< ~counter~0 11)} is VALID [2022-04-15 15:15:03,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {33546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34049#(< ~counter~0 11)} is VALID [2022-04-15 15:15:03,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {33546#true} call ULTIMATE.init(); {33546#true} is VALID [2022-04-15 15:15:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-15 15:15:03,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:15:03,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965240181] [2022-04-15 15:15:03,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:15:03,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502589620] [2022-04-15 15:15:03,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502589620] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:15:03,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:15:03,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 15:15:03,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:15:03,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [150714680] [2022-04-15 15:15:03,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [150714680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:03,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:03,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:15:03,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151131813] [2022-04-15 15:15:03,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:15:03,375 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-15 15:15:03,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:15:03,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:15:03,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:03,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:15:03,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:03,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:15:03,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:15:03,443 INFO L87 Difference]: Start difference. First operand 324 states and 416 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:15:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:04,659 INFO L93 Difference]: Finished difference Result 394 states and 510 transitions. [2022-04-15 15:15:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 15:15:04,660 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-15 15:15:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:15:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:15:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 15:15:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:15:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 15:15:04,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-15 15:15:04,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:04,818 INFO L225 Difference]: With dead ends: 394 [2022-04-15 15:15:04,818 INFO L226 Difference]: Without dead ends: 389 [2022-04-15 15:15:04,819 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=359, Invalid=511, Unknown=0, NotChecked=0, Total=870 [2022-04-15 15:15:04,819 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 201 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:15:04,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 219 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:15:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-04-15 15:15:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 374. [2022-04-15 15:15:05,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:15:05,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 389 states. Second operand has 374 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 285 states have internal predecessors, (338), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:05,319 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand has 374 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 285 states have internal predecessors, (338), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:05,319 INFO L87 Difference]: Start difference. First operand 389 states. Second operand has 374 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 285 states have internal predecessors, (338), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:05,329 INFO L93 Difference]: Finished difference Result 389 states and 501 transitions. [2022-04-15 15:15:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 501 transitions. [2022-04-15 15:15:05,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:05,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:05,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 374 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 285 states have internal predecessors, (338), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 389 states. [2022-04-15 15:15:05,331 INFO L87 Difference]: Start difference. First operand has 374 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 285 states have internal predecessors, (338), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 389 states. [2022-04-15 15:15:05,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:05,340 INFO L93 Difference]: Finished difference Result 389 states and 501 transitions. [2022-04-15 15:15:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 501 transitions. [2022-04-15 15:15:05,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:05,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:05,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:15:05,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:15:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 285 states have internal predecessors, (338), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 484 transitions. [2022-04-15 15:15:05,353 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 484 transitions. Word has length 89 [2022-04-15 15:15:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:15:05,353 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 484 transitions. [2022-04-15 15:15:05,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:15:05,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 374 states and 484 transitions. [2022-04-15 15:15:18,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 482 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 484 transitions. [2022-04-15 15:15:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 15:15:18,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:18,133 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:15:18,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 15:15:18,333 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 15:15:18,333 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:18,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-15 15:15:18,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:18,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1116893290] [2022-04-15 15:15:18,334 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-15 15:15:18,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:18,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660209398] [2022-04-15 15:15:18,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:18,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:18,345 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:18,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481334478] [2022-04-15 15:15:18,345 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:15:18,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:18,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:18,347 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:15:18,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 15:15:18,491 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 15:15:18,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:18,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 15:15:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:18,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:15:18,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {36429#true} call ULTIMATE.init(); {36429#true} is VALID [2022-04-15 15:15:18,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {36429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {36437#(<= ~counter~0 0)} assume true; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36437#(<= ~counter~0 0)} {36429#true} #102#return; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {36437#(<= ~counter~0 0)} call #t~ret9 := main(); {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {36437#(<= ~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; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {36437#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {36437#(<= ~counter~0 0)} ~cond := #in~cond; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {36437#(<= ~counter~0 0)} assume !(0 == ~cond); {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {36437#(<= ~counter~0 0)} assume true; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,918 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36437#(<= ~counter~0 0)} {36437#(<= ~counter~0 0)} #90#return; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,919 INFO L272 TraceCheckUtils]: 11: Hoare triple {36437#(<= ~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)); {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {36437#(<= ~counter~0 0)} ~cond := #in~cond; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {36437#(<= ~counter~0 0)} assume !(0 == ~cond); {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {36437#(<= ~counter~0 0)} assume true; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,920 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36437#(<= ~counter~0 0)} {36437#(<= ~counter~0 0)} #92#return; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {36437#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:18,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {36437#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36486#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:18,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {36486#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {36486#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:18,922 INFO L272 TraceCheckUtils]: 19: Hoare triple {36486#(<= ~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)); {36486#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:18,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {36486#(<= ~counter~0 1)} ~cond := #in~cond; {36486#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:18,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {36486#(<= ~counter~0 1)} assume !(0 == ~cond); {36486#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:18,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {36486#(<= ~counter~0 1)} assume true; {36486#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:18,923 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {36486#(<= ~counter~0 1)} {36486#(<= ~counter~0 1)} #94#return; {36486#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:18,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {36486#(<= ~counter~0 1)} assume !!(0 != ~r~0); {36486#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:18,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {36486#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36511#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:18,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {36511#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {36511#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:18,925 INFO L272 TraceCheckUtils]: 27: Hoare triple {36511#(<= ~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)); {36511#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:18,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {36511#(<= ~counter~0 2)} ~cond := #in~cond; {36511#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:18,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {36511#(<= ~counter~0 2)} assume !(0 == ~cond); {36511#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:18,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {36511#(<= ~counter~0 2)} assume true; {36511#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:18,926 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {36511#(<= ~counter~0 2)} {36511#(<= ~counter~0 2)} #96#return; {36511#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:18,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {36511#(<= ~counter~0 2)} assume !(~r~0 > 0); {36511#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:18,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {36511#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36536#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:18,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {36536#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {36536#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:18,928 INFO L272 TraceCheckUtils]: 35: Hoare triple {36536#(<= ~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)); {36536#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:18,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {36536#(<= ~counter~0 3)} ~cond := #in~cond; {36536#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:18,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {36536#(<= ~counter~0 3)} assume !(0 == ~cond); {36536#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:18,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {36536#(<= ~counter~0 3)} assume true; {36536#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:18,929 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {36536#(<= ~counter~0 3)} {36536#(<= ~counter~0 3)} #98#return; {36536#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:18,929 INFO L290 TraceCheckUtils]: 40: Hoare triple {36536#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {36536#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:18,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {36536#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36561#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:18,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {36561#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {36561#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:18,931 INFO L272 TraceCheckUtils]: 43: Hoare triple {36561#(<= ~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)); {36561#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:18,931 INFO L290 TraceCheckUtils]: 44: Hoare triple {36561#(<= ~counter~0 4)} ~cond := #in~cond; {36561#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:18,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {36561#(<= ~counter~0 4)} assume !(0 == ~cond); {36561#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:18,931 INFO L290 TraceCheckUtils]: 46: Hoare triple {36561#(<= ~counter~0 4)} assume true; {36561#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:18,932 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {36561#(<= ~counter~0 4)} {36561#(<= ~counter~0 4)} #98#return; {36561#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:18,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {36561#(<= ~counter~0 4)} assume !(~r~0 < 0); {36561#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:18,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {36561#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36586#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:18,933 INFO L290 TraceCheckUtils]: 50: Hoare triple {36586#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {36586#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:18,933 INFO L272 TraceCheckUtils]: 51: Hoare triple {36586#(<= ~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)); {36586#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:18,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {36586#(<= ~counter~0 5)} ~cond := #in~cond; {36586#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:18,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {36586#(<= ~counter~0 5)} assume !(0 == ~cond); {36586#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:18,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {36586#(<= ~counter~0 5)} assume true; {36586#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:18,935 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {36586#(<= ~counter~0 5)} {36586#(<= ~counter~0 5)} #94#return; {36586#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:18,935 INFO L290 TraceCheckUtils]: 56: Hoare triple {36586#(<= ~counter~0 5)} assume !!(0 != ~r~0); {36586#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:18,935 INFO L290 TraceCheckUtils]: 57: Hoare triple {36586#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36611#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:18,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {36611#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {36611#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:18,936 INFO L272 TraceCheckUtils]: 59: Hoare triple {36611#(<= ~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)); {36611#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:18,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {36611#(<= ~counter~0 6)} ~cond := #in~cond; {36611#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:18,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {36611#(<= ~counter~0 6)} assume !(0 == ~cond); {36611#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:18,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {36611#(<= ~counter~0 6)} assume true; {36611#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:18,938 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {36611#(<= ~counter~0 6)} {36611#(<= ~counter~0 6)} #96#return; {36611#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:18,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {36611#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36611#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:18,938 INFO L290 TraceCheckUtils]: 65: Hoare triple {36611#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36636#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:18,939 INFO L290 TraceCheckUtils]: 66: Hoare triple {36636#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {36636#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:18,939 INFO L272 TraceCheckUtils]: 67: Hoare triple {36636#(<= ~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)); {36636#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:18,939 INFO L290 TraceCheckUtils]: 68: Hoare triple {36636#(<= ~counter~0 7)} ~cond := #in~cond; {36636#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:18,940 INFO L290 TraceCheckUtils]: 69: Hoare triple {36636#(<= ~counter~0 7)} assume !(0 == ~cond); {36636#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:18,940 INFO L290 TraceCheckUtils]: 70: Hoare triple {36636#(<= ~counter~0 7)} assume true; {36636#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:18,940 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {36636#(<= ~counter~0 7)} {36636#(<= ~counter~0 7)} #96#return; {36636#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:18,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {36636#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36636#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:18,941 INFO L290 TraceCheckUtils]: 73: Hoare triple {36636#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36661#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:18,941 INFO L290 TraceCheckUtils]: 74: Hoare triple {36661#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {36661#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:18,942 INFO L272 TraceCheckUtils]: 75: Hoare triple {36661#(<= ~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)); {36661#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:18,942 INFO L290 TraceCheckUtils]: 76: Hoare triple {36661#(<= ~counter~0 8)} ~cond := #in~cond; {36661#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:18,943 INFO L290 TraceCheckUtils]: 77: Hoare triple {36661#(<= ~counter~0 8)} assume !(0 == ~cond); {36661#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:18,943 INFO L290 TraceCheckUtils]: 78: Hoare triple {36661#(<= ~counter~0 8)} assume true; {36661#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:18,943 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {36661#(<= ~counter~0 8)} {36661#(<= ~counter~0 8)} #96#return; {36661#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:18,944 INFO L290 TraceCheckUtils]: 80: Hoare triple {36661#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36661#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:18,944 INFO L290 TraceCheckUtils]: 81: Hoare triple {36661#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36686#(<= |main_#t~post7| 8)} is VALID [2022-04-15 15:15:18,944 INFO L290 TraceCheckUtils]: 82: Hoare triple {36686#(<= |main_#t~post7| 8)} assume !(#t~post7 < 20);havoc #t~post7; {36430#false} is VALID [2022-04-15 15:15:18,944 INFO L290 TraceCheckUtils]: 83: Hoare triple {36430#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36430#false} is VALID [2022-04-15 15:15:18,944 INFO L290 TraceCheckUtils]: 84: Hoare triple {36430#false} assume !(#t~post8 < 20);havoc #t~post8; {36430#false} is VALID [2022-04-15 15:15:18,944 INFO L290 TraceCheckUtils]: 85: Hoare triple {36430#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36430#false} is VALID [2022-04-15 15:15:18,945 INFO L290 TraceCheckUtils]: 86: Hoare triple {36430#false} assume !(#t~post6 < 20);havoc #t~post6; {36430#false} is VALID [2022-04-15 15:15:18,945 INFO L272 TraceCheckUtils]: 87: Hoare triple {36430#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36430#false} is VALID [2022-04-15 15:15:18,945 INFO L290 TraceCheckUtils]: 88: Hoare triple {36430#false} ~cond := #in~cond; {36430#false} is VALID [2022-04-15 15:15:18,945 INFO L290 TraceCheckUtils]: 89: Hoare triple {36430#false} assume 0 == ~cond; {36430#false} is VALID [2022-04-15 15:15:18,945 INFO L290 TraceCheckUtils]: 90: Hoare triple {36430#false} assume !false; {36430#false} is VALID [2022-04-15 15:15:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:15:18,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:15:19,408 INFO L290 TraceCheckUtils]: 90: Hoare triple {36430#false} assume !false; {36430#false} is VALID [2022-04-15 15:15:19,408 INFO L290 TraceCheckUtils]: 89: Hoare triple {36430#false} assume 0 == ~cond; {36430#false} is VALID [2022-04-15 15:15:19,408 INFO L290 TraceCheckUtils]: 88: Hoare triple {36430#false} ~cond := #in~cond; {36430#false} is VALID [2022-04-15 15:15:19,409 INFO L272 TraceCheckUtils]: 87: Hoare triple {36430#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36430#false} is VALID [2022-04-15 15:15:19,409 INFO L290 TraceCheckUtils]: 86: Hoare triple {36430#false} assume !(#t~post6 < 20);havoc #t~post6; {36430#false} is VALID [2022-04-15 15:15:19,409 INFO L290 TraceCheckUtils]: 85: Hoare triple {36430#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36430#false} is VALID [2022-04-15 15:15:19,409 INFO L290 TraceCheckUtils]: 84: Hoare triple {36430#false} assume !(#t~post8 < 20);havoc #t~post8; {36430#false} is VALID [2022-04-15 15:15:19,409 INFO L290 TraceCheckUtils]: 83: Hoare triple {36430#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36430#false} is VALID [2022-04-15 15:15:19,409 INFO L290 TraceCheckUtils]: 82: Hoare triple {36738#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {36430#false} is VALID [2022-04-15 15:15:19,410 INFO L290 TraceCheckUtils]: 81: Hoare triple {36742#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36738#(< |main_#t~post7| 20)} is VALID [2022-04-15 15:15:19,410 INFO L290 TraceCheckUtils]: 80: Hoare triple {36742#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36742#(< ~counter~0 20)} is VALID [2022-04-15 15:15:19,411 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {36429#true} {36742#(< ~counter~0 20)} #96#return; {36742#(< ~counter~0 20)} is VALID [2022-04-15 15:15:19,411 INFO L290 TraceCheckUtils]: 78: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 15:15:19,411 INFO L290 TraceCheckUtils]: 77: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 15:15:19,411 INFO L290 TraceCheckUtils]: 76: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 15:15:19,411 INFO L272 TraceCheckUtils]: 75: Hoare triple {36742#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36429#true} is VALID [2022-04-15 15:15:19,412 INFO L290 TraceCheckUtils]: 74: Hoare triple {36742#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {36742#(< ~counter~0 20)} is VALID [2022-04-15 15:15:19,413 INFO L290 TraceCheckUtils]: 73: Hoare triple {36767#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36742#(< ~counter~0 20)} is VALID [2022-04-15 15:15:19,413 INFO L290 TraceCheckUtils]: 72: Hoare triple {36767#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36767#(< ~counter~0 19)} is VALID [2022-04-15 15:15:19,414 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {36429#true} {36767#(< ~counter~0 19)} #96#return; {36767#(< ~counter~0 19)} is VALID [2022-04-15 15:15:19,414 INFO L290 TraceCheckUtils]: 70: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 15:15:19,414 INFO L290 TraceCheckUtils]: 69: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 15:15:19,414 INFO L290 TraceCheckUtils]: 68: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 15:15:19,414 INFO L272 TraceCheckUtils]: 67: Hoare triple {36767#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36429#true} is VALID [2022-04-15 15:15:19,415 INFO L290 TraceCheckUtils]: 66: Hoare triple {36767#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {36767#(< ~counter~0 19)} is VALID [2022-04-15 15:15:19,415 INFO L290 TraceCheckUtils]: 65: Hoare triple {36792#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36767#(< ~counter~0 19)} is VALID [2022-04-15 15:15:19,416 INFO L290 TraceCheckUtils]: 64: Hoare triple {36792#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36792#(< ~counter~0 18)} is VALID [2022-04-15 15:15:19,417 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {36429#true} {36792#(< ~counter~0 18)} #96#return; {36792#(< ~counter~0 18)} is VALID [2022-04-15 15:15:19,417 INFO L290 TraceCheckUtils]: 62: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 15:15:19,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 15:15:19,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 15:15:19,417 INFO L272 TraceCheckUtils]: 59: Hoare triple {36792#(< ~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)); {36429#true} is VALID [2022-04-15 15:15:19,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {36792#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {36792#(< ~counter~0 18)} is VALID [2022-04-15 15:15:19,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {36817#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36792#(< ~counter~0 18)} is VALID [2022-04-15 15:15:19,419 INFO L290 TraceCheckUtils]: 56: Hoare triple {36817#(< ~counter~0 17)} assume !!(0 != ~r~0); {36817#(< ~counter~0 17)} is VALID [2022-04-15 15:15:19,419 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {36429#true} {36817#(< ~counter~0 17)} #94#return; {36817#(< ~counter~0 17)} is VALID [2022-04-15 15:15:19,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 15:15:19,420 INFO L290 TraceCheckUtils]: 53: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 15:15:19,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 15:15:19,420 INFO L272 TraceCheckUtils]: 51: Hoare triple {36817#(< ~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)); {36429#true} is VALID [2022-04-15 15:15:19,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {36817#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {36817#(< ~counter~0 17)} is VALID [2022-04-15 15:15:19,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {36842#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36817#(< ~counter~0 17)} is VALID [2022-04-15 15:15:19,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {36842#(< ~counter~0 16)} assume !(~r~0 < 0); {36842#(< ~counter~0 16)} is VALID [2022-04-15 15:15:19,422 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {36429#true} {36842#(< ~counter~0 16)} #98#return; {36842#(< ~counter~0 16)} is VALID [2022-04-15 15:15:19,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 15:15:19,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 15:15:19,422 INFO L290 TraceCheckUtils]: 44: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 15:15:19,422 INFO L272 TraceCheckUtils]: 43: Hoare triple {36842#(< ~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)); {36429#true} is VALID [2022-04-15 15:15:19,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {36842#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {36842#(< ~counter~0 16)} is VALID [2022-04-15 15:15:19,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {36867#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36842#(< ~counter~0 16)} is VALID [2022-04-15 15:15:19,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {36867#(< ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {36867#(< ~counter~0 15)} is VALID [2022-04-15 15:15:19,425 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {36429#true} {36867#(< ~counter~0 15)} #98#return; {36867#(< ~counter~0 15)} is VALID [2022-04-15 15:15:19,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 15:15:19,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 15:15:19,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 15:15:19,425 INFO L272 TraceCheckUtils]: 35: Hoare triple {36867#(< ~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)); {36429#true} is VALID [2022-04-15 15:15:19,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {36867#(< ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {36867#(< ~counter~0 15)} is VALID [2022-04-15 15:15:19,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {36892#(< ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36867#(< ~counter~0 15)} is VALID [2022-04-15 15:15:19,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {36892#(< ~counter~0 14)} assume !(~r~0 > 0); {36892#(< ~counter~0 14)} is VALID [2022-04-15 15:15:19,427 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {36429#true} {36892#(< ~counter~0 14)} #96#return; {36892#(< ~counter~0 14)} is VALID [2022-04-15 15:15:19,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 15:15:19,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 15:15:19,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 15:15:19,428 INFO L272 TraceCheckUtils]: 27: Hoare triple {36892#(< ~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)); {36429#true} is VALID [2022-04-15 15:15:19,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {36892#(< ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {36892#(< ~counter~0 14)} is VALID [2022-04-15 15:15:19,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {36917#(< ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36892#(< ~counter~0 14)} is VALID [2022-04-15 15:15:19,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {36917#(< ~counter~0 13)} assume !!(0 != ~r~0); {36917#(< ~counter~0 13)} is VALID [2022-04-15 15:15:19,430 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {36429#true} {36917#(< ~counter~0 13)} #94#return; {36917#(< ~counter~0 13)} is VALID [2022-04-15 15:15:19,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 15:15:19,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 15:15:19,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 15:15:19,430 INFO L272 TraceCheckUtils]: 19: Hoare triple {36917#(< ~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)); {36429#true} is VALID [2022-04-15 15:15:19,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {36917#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {36917#(< ~counter~0 13)} is VALID [2022-04-15 15:15:19,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {36942#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36917#(< ~counter~0 13)} is VALID [2022-04-15 15:15:19,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {36942#(< ~counter~0 12)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {36942#(< ~counter~0 12)} is VALID [2022-04-15 15:15:19,436 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36429#true} {36942#(< ~counter~0 12)} #92#return; {36942#(< ~counter~0 12)} is VALID [2022-04-15 15:15:19,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 15:15:19,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 15:15:19,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 15:15:19,437 INFO L272 TraceCheckUtils]: 11: Hoare triple {36942#(< ~counter~0 12)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {36429#true} is VALID [2022-04-15 15:15:19,437 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36429#true} {36942#(< ~counter~0 12)} #90#return; {36942#(< ~counter~0 12)} is VALID [2022-04-15 15:15:19,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 15:15:19,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 15:15:19,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 15:15:19,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {36942#(< ~counter~0 12)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {36429#true} is VALID [2022-04-15 15:15:19,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {36942#(< ~counter~0 12)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {36942#(< ~counter~0 12)} is VALID [2022-04-15 15:15:19,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {36942#(< ~counter~0 12)} call #t~ret9 := main(); {36942#(< ~counter~0 12)} is VALID [2022-04-15 15:15:19,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36942#(< ~counter~0 12)} {36429#true} #102#return; {36942#(< ~counter~0 12)} is VALID [2022-04-15 15:15:19,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {36942#(< ~counter~0 12)} assume true; {36942#(< ~counter~0 12)} is VALID [2022-04-15 15:15:19,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {36429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {36942#(< ~counter~0 12)} is VALID [2022-04-15 15:15:19,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {36429#true} call ULTIMATE.init(); {36429#true} is VALID [2022-04-15 15:15:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-15 15:15:19,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:15:19,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660209398] [2022-04-15 15:15:19,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:15:19,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481334478] [2022-04-15 15:15:19,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481334478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:15:19,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:15:19,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-15 15:15:19,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:15:19,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1116893290] [2022-04-15 15:15:19,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1116893290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:19,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:19,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 15:15:19,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325579351] [2022-04-15 15:15:19,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:15:19,442 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-15 15:15:19,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:15:19,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:15:19,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:19,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 15:15:19,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:19,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 15:15:19,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-15 15:15:19,523 INFO L87 Difference]: Start difference. First operand 374 states and 484 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:15:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:20,597 INFO L93 Difference]: Finished difference Result 463 states and 612 transitions. [2022-04-15 15:15:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 15:15:20,597 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-15 15:15:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:15:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:15:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 15:15:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:15:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 15:15:20,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-15 15:15:20,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:20,761 INFO L225 Difference]: With dead ends: 463 [2022-04-15 15:15:20,761 INFO L226 Difference]: Without dead ends: 374 [2022-04-15 15:15:20,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=477, Unknown=0, NotChecked=0, Total=812 [2022-04-15 15:15:20,762 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 98 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:15:20,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 224 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:15:20,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-04-15 15:15:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2022-04-15 15:15:21,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:15:21,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 374 states. Second operand has 374 states, 279 states have (on average 1.1971326164874552) internal successors, (334), 285 states have internal predecessors, (334), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:21,301 INFO L74 IsIncluded]: Start isIncluded. First operand 374 states. Second operand has 374 states, 279 states have (on average 1.1971326164874552) internal successors, (334), 285 states have internal predecessors, (334), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:21,302 INFO L87 Difference]: Start difference. First operand 374 states. Second operand has 374 states, 279 states have (on average 1.1971326164874552) internal successors, (334), 285 states have internal predecessors, (334), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:21,310 INFO L93 Difference]: Finished difference Result 374 states and 480 transitions. [2022-04-15 15:15:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 480 transitions. [2022-04-15 15:15:21,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:21,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:21,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 374 states, 279 states have (on average 1.1971326164874552) internal successors, (334), 285 states have internal predecessors, (334), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 374 states. [2022-04-15 15:15:21,312 INFO L87 Difference]: Start difference. First operand has 374 states, 279 states have (on average 1.1971326164874552) internal successors, (334), 285 states have internal predecessors, (334), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 374 states. [2022-04-15 15:15:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:21,320 INFO L93 Difference]: Finished difference Result 374 states and 480 transitions. [2022-04-15 15:15:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 480 transitions. [2022-04-15 15:15:21,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:21,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:21,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:15:21,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:15:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 279 states have (on average 1.1971326164874552) internal successors, (334), 285 states have internal predecessors, (334), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 480 transitions. [2022-04-15 15:15:21,333 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 480 transitions. Word has length 91 [2022-04-15 15:15:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:15:21,333 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 480 transitions. [2022-04-15 15:15:21,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 15:15:21,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 374 states and 480 transitions. [2022-04-15 15:15:28,754 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-15 15:15:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 480 transitions. [2022-04-15 15:15:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 15:15:28,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:28,755 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:15:28,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 15:15:28,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 15:15:28,960 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:28,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-15 15:15:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:28,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2059934676] [2022-04-15 15:15:28,960 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-15 15:15:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:28,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139741409] [2022-04-15 15:15:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:28,979 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:28,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672061071] [2022-04-15 15:15:28,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:15:28,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:28,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:28,982 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:15:28,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 15:15:29,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:15:29,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:29,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 15:15:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:29,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:15:29,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {39432#true} call ULTIMATE.init(); {39432#true} is VALID [2022-04-15 15:15:29,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {39432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {39440#(<= ~counter~0 0)} assume true; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39440#(<= ~counter~0 0)} {39432#true} #102#return; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {39440#(<= ~counter~0 0)} call #t~ret9 := main(); {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {39440#(<= ~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; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,537 INFO L272 TraceCheckUtils]: 6: Hoare triple {39440#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {39440#(<= ~counter~0 0)} ~cond := #in~cond; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {39440#(<= ~counter~0 0)} assume !(0 == ~cond); {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {39440#(<= ~counter~0 0)} assume true; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,538 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39440#(<= ~counter~0 0)} {39440#(<= ~counter~0 0)} #90#return; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,538 INFO L272 TraceCheckUtils]: 11: Hoare triple {39440#(<= ~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)); {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {39440#(<= ~counter~0 0)} ~cond := #in~cond; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {39440#(<= ~counter~0 0)} assume !(0 == ~cond); {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {39440#(<= ~counter~0 0)} assume true; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,540 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {39440#(<= ~counter~0 0)} {39440#(<= ~counter~0 0)} #92#return; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {39440#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:29,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {39440#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39489#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:29,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {39489#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {39489#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:29,542 INFO L272 TraceCheckUtils]: 19: Hoare triple {39489#(<= ~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)); {39489#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:29,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {39489#(<= ~counter~0 1)} ~cond := #in~cond; {39489#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:29,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {39489#(<= ~counter~0 1)} assume !(0 == ~cond); {39489#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:29,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {39489#(<= ~counter~0 1)} assume true; {39489#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:29,543 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {39489#(<= ~counter~0 1)} {39489#(<= ~counter~0 1)} #94#return; {39489#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:29,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {39489#(<= ~counter~0 1)} assume !!(0 != ~r~0); {39489#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:29,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {39489#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39514#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:29,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {39514#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {39514#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:29,545 INFO L272 TraceCheckUtils]: 27: Hoare triple {39514#(<= ~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)); {39514#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:29,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {39514#(<= ~counter~0 2)} ~cond := #in~cond; {39514#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:29,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {39514#(<= ~counter~0 2)} assume !(0 == ~cond); {39514#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:29,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {39514#(<= ~counter~0 2)} assume true; {39514#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:29,546 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {39514#(<= ~counter~0 2)} {39514#(<= ~counter~0 2)} #96#return; {39514#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:29,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {39514#(<= ~counter~0 2)} assume !(~r~0 > 0); {39514#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:29,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {39514#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39539#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:29,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {39539#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {39539#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:29,547 INFO L272 TraceCheckUtils]: 35: Hoare triple {39539#(<= ~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)); {39539#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:29,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {39539#(<= ~counter~0 3)} ~cond := #in~cond; {39539#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:29,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {39539#(<= ~counter~0 3)} assume !(0 == ~cond); {39539#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:29,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {39539#(<= ~counter~0 3)} assume true; {39539#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:29,549 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {39539#(<= ~counter~0 3)} {39539#(<= ~counter~0 3)} #98#return; {39539#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:29,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {39539#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {39539#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:29,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {39539#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39564#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:29,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {39564#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {39564#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:29,550 INFO L272 TraceCheckUtils]: 43: Hoare triple {39564#(<= ~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)); {39564#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:29,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {39564#(<= ~counter~0 4)} ~cond := #in~cond; {39564#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:29,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {39564#(<= ~counter~0 4)} assume !(0 == ~cond); {39564#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:29,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {39564#(<= ~counter~0 4)} assume true; {39564#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:29,552 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {39564#(<= ~counter~0 4)} {39564#(<= ~counter~0 4)} #98#return; {39564#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:29,552 INFO L290 TraceCheckUtils]: 48: Hoare triple {39564#(<= ~counter~0 4)} assume !(~r~0 < 0); {39564#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:29,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {39564#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39589#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:29,553 INFO L290 TraceCheckUtils]: 50: Hoare triple {39589#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {39589#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:29,553 INFO L272 TraceCheckUtils]: 51: Hoare triple {39589#(<= ~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)); {39589#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:29,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {39589#(<= ~counter~0 5)} ~cond := #in~cond; {39589#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:29,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {39589#(<= ~counter~0 5)} assume !(0 == ~cond); {39589#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:29,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {39589#(<= ~counter~0 5)} assume true; {39589#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:29,555 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {39589#(<= ~counter~0 5)} {39589#(<= ~counter~0 5)} #94#return; {39589#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:29,555 INFO L290 TraceCheckUtils]: 56: Hoare triple {39589#(<= ~counter~0 5)} assume !!(0 != ~r~0); {39589#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:29,556 INFO L290 TraceCheckUtils]: 57: Hoare triple {39589#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39614#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:29,556 INFO L290 TraceCheckUtils]: 58: Hoare triple {39614#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {39614#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:29,556 INFO L272 TraceCheckUtils]: 59: Hoare triple {39614#(<= ~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)); {39614#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:29,557 INFO L290 TraceCheckUtils]: 60: Hoare triple {39614#(<= ~counter~0 6)} ~cond := #in~cond; {39614#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:29,557 INFO L290 TraceCheckUtils]: 61: Hoare triple {39614#(<= ~counter~0 6)} assume !(0 == ~cond); {39614#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:29,557 INFO L290 TraceCheckUtils]: 62: Hoare triple {39614#(<= ~counter~0 6)} assume true; {39614#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:29,558 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {39614#(<= ~counter~0 6)} {39614#(<= ~counter~0 6)} #96#return; {39614#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:29,558 INFO L290 TraceCheckUtils]: 64: Hoare triple {39614#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {39614#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:29,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {39614#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39639#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:29,559 INFO L290 TraceCheckUtils]: 66: Hoare triple {39639#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {39639#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:29,559 INFO L272 TraceCheckUtils]: 67: Hoare triple {39639#(<= ~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)); {39639#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:29,560 INFO L290 TraceCheckUtils]: 68: Hoare triple {39639#(<= ~counter~0 7)} ~cond := #in~cond; {39639#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:29,560 INFO L290 TraceCheckUtils]: 69: Hoare triple {39639#(<= ~counter~0 7)} assume !(0 == ~cond); {39639#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:29,560 INFO L290 TraceCheckUtils]: 70: Hoare triple {39639#(<= ~counter~0 7)} assume true; {39639#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:29,561 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {39639#(<= ~counter~0 7)} {39639#(<= ~counter~0 7)} #96#return; {39639#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:29,561 INFO L290 TraceCheckUtils]: 72: Hoare triple {39639#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {39639#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:29,561 INFO L290 TraceCheckUtils]: 73: Hoare triple {39639#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39664#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:29,562 INFO L290 TraceCheckUtils]: 74: Hoare triple {39664#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {39664#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:29,562 INFO L272 TraceCheckUtils]: 75: Hoare triple {39664#(<= ~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)); {39664#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:29,562 INFO L290 TraceCheckUtils]: 76: Hoare triple {39664#(<= ~counter~0 8)} ~cond := #in~cond; {39664#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:29,563 INFO L290 TraceCheckUtils]: 77: Hoare triple {39664#(<= ~counter~0 8)} assume !(0 == ~cond); {39664#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:29,563 INFO L290 TraceCheckUtils]: 78: Hoare triple {39664#(<= ~counter~0 8)} assume true; {39664#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:29,564 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {39664#(<= ~counter~0 8)} {39664#(<= ~counter~0 8)} #96#return; {39664#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:29,564 INFO L290 TraceCheckUtils]: 80: Hoare triple {39664#(<= ~counter~0 8)} assume !(~r~0 > 0); {39664#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:29,564 INFO L290 TraceCheckUtils]: 81: Hoare triple {39664#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39689#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:29,565 INFO L290 TraceCheckUtils]: 82: Hoare triple {39689#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {39689#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:29,565 INFO L272 TraceCheckUtils]: 83: Hoare triple {39689#(<= ~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)); {39689#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:29,565 INFO L290 TraceCheckUtils]: 84: Hoare triple {39689#(<= ~counter~0 9)} ~cond := #in~cond; {39689#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:29,566 INFO L290 TraceCheckUtils]: 85: Hoare triple {39689#(<= ~counter~0 9)} assume !(0 == ~cond); {39689#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:29,566 INFO L290 TraceCheckUtils]: 86: Hoare triple {39689#(<= ~counter~0 9)} assume true; {39689#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:29,566 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {39689#(<= ~counter~0 9)} {39689#(<= ~counter~0 9)} #98#return; {39689#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:29,567 INFO L290 TraceCheckUtils]: 88: Hoare triple {39689#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {39689#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:29,567 INFO L290 TraceCheckUtils]: 89: Hoare triple {39689#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39714#(<= |main_#t~post8| 9)} is VALID [2022-04-15 15:15:29,567 INFO L290 TraceCheckUtils]: 90: Hoare triple {39714#(<= |main_#t~post8| 9)} assume !(#t~post8 < 20);havoc #t~post8; {39433#false} is VALID [2022-04-15 15:15:29,567 INFO L290 TraceCheckUtils]: 91: Hoare triple {39433#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39433#false} is VALID [2022-04-15 15:15:29,568 INFO L290 TraceCheckUtils]: 92: Hoare triple {39433#false} assume !(#t~post6 < 20);havoc #t~post6; {39433#false} is VALID [2022-04-15 15:15:29,568 INFO L272 TraceCheckUtils]: 93: Hoare triple {39433#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39433#false} is VALID [2022-04-15 15:15:29,568 INFO L290 TraceCheckUtils]: 94: Hoare triple {39433#false} ~cond := #in~cond; {39433#false} is VALID [2022-04-15 15:15:29,568 INFO L290 TraceCheckUtils]: 95: Hoare triple {39433#false} assume 0 == ~cond; {39433#false} is VALID [2022-04-15 15:15:29,568 INFO L290 TraceCheckUtils]: 96: Hoare triple {39433#false} assume !false; {39433#false} is VALID [2022-04-15 15:15:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:15:29,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:15:30,104 INFO L290 TraceCheckUtils]: 96: Hoare triple {39433#false} assume !false; {39433#false} is VALID [2022-04-15 15:15:30,105 INFO L290 TraceCheckUtils]: 95: Hoare triple {39433#false} assume 0 == ~cond; {39433#false} is VALID [2022-04-15 15:15:30,105 INFO L290 TraceCheckUtils]: 94: Hoare triple {39433#false} ~cond := #in~cond; {39433#false} is VALID [2022-04-15 15:15:30,105 INFO L272 TraceCheckUtils]: 93: Hoare triple {39433#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39433#false} is VALID [2022-04-15 15:15:30,105 INFO L290 TraceCheckUtils]: 92: Hoare triple {39433#false} assume !(#t~post6 < 20);havoc #t~post6; {39433#false} is VALID [2022-04-15 15:15:30,105 INFO L290 TraceCheckUtils]: 91: Hoare triple {39433#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39433#false} is VALID [2022-04-15 15:15:30,105 INFO L290 TraceCheckUtils]: 90: Hoare triple {39754#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {39433#false} is VALID [2022-04-15 15:15:30,106 INFO L290 TraceCheckUtils]: 89: Hoare triple {39758#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39754#(< |main_#t~post8| 20)} is VALID [2022-04-15 15:15:30,106 INFO L290 TraceCheckUtils]: 88: Hoare triple {39758#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {39758#(< ~counter~0 20)} is VALID [2022-04-15 15:15:30,106 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {39432#true} {39758#(< ~counter~0 20)} #98#return; {39758#(< ~counter~0 20)} is VALID [2022-04-15 15:15:30,107 INFO L290 TraceCheckUtils]: 86: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 15:15:30,107 INFO L290 TraceCheckUtils]: 85: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 15:15:30,107 INFO L290 TraceCheckUtils]: 84: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 15:15:30,107 INFO L272 TraceCheckUtils]: 83: Hoare triple {39758#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 15:15:30,107 INFO L290 TraceCheckUtils]: 82: Hoare triple {39758#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {39758#(< ~counter~0 20)} is VALID [2022-04-15 15:15:30,108 INFO L290 TraceCheckUtils]: 81: Hoare triple {39783#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39758#(< ~counter~0 20)} is VALID [2022-04-15 15:15:30,108 INFO L290 TraceCheckUtils]: 80: Hoare triple {39783#(< ~counter~0 19)} assume !(~r~0 > 0); {39783#(< ~counter~0 19)} is VALID [2022-04-15 15:15:30,109 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {39432#true} {39783#(< ~counter~0 19)} #96#return; {39783#(< ~counter~0 19)} is VALID [2022-04-15 15:15:30,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 15:15:30,109 INFO L290 TraceCheckUtils]: 77: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 15:15:30,109 INFO L290 TraceCheckUtils]: 76: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 15:15:30,109 INFO L272 TraceCheckUtils]: 75: Hoare triple {39783#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 15:15:30,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {39783#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {39783#(< ~counter~0 19)} is VALID [2022-04-15 15:15:30,110 INFO L290 TraceCheckUtils]: 73: Hoare triple {39808#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39783#(< ~counter~0 19)} is VALID [2022-04-15 15:15:30,110 INFO L290 TraceCheckUtils]: 72: Hoare triple {39808#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {39808#(< ~counter~0 18)} is VALID [2022-04-15 15:15:30,111 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {39432#true} {39808#(< ~counter~0 18)} #96#return; {39808#(< ~counter~0 18)} is VALID [2022-04-15 15:15:30,111 INFO L290 TraceCheckUtils]: 70: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 15:15:30,111 INFO L290 TraceCheckUtils]: 69: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 15:15:30,111 INFO L290 TraceCheckUtils]: 68: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 15:15:30,111 INFO L272 TraceCheckUtils]: 67: Hoare triple {39808#(< ~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)); {39432#true} is VALID [2022-04-15 15:15:30,111 INFO L290 TraceCheckUtils]: 66: Hoare triple {39808#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {39808#(< ~counter~0 18)} is VALID [2022-04-15 15:15:30,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {39833#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39808#(< ~counter~0 18)} is VALID [2022-04-15 15:15:30,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {39833#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {39833#(< ~counter~0 17)} is VALID [2022-04-15 15:15:30,113 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {39432#true} {39833#(< ~counter~0 17)} #96#return; {39833#(< ~counter~0 17)} is VALID [2022-04-15 15:15:30,113 INFO L290 TraceCheckUtils]: 62: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 15:15:30,113 INFO L290 TraceCheckUtils]: 61: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 15:15:30,113 INFO L290 TraceCheckUtils]: 60: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 15:15:30,113 INFO L272 TraceCheckUtils]: 59: Hoare triple {39833#(< ~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)); {39432#true} is VALID [2022-04-15 15:15:30,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {39833#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {39833#(< ~counter~0 17)} is VALID [2022-04-15 15:15:30,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {39858#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39833#(< ~counter~0 17)} is VALID [2022-04-15 15:15:30,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {39858#(< ~counter~0 16)} assume !!(0 != ~r~0); {39858#(< ~counter~0 16)} is VALID [2022-04-15 15:15:30,115 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {39432#true} {39858#(< ~counter~0 16)} #94#return; {39858#(< ~counter~0 16)} is VALID [2022-04-15 15:15:30,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 15:15:30,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 15:15:30,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 15:15:30,115 INFO L272 TraceCheckUtils]: 51: Hoare triple {39858#(< ~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)); {39432#true} is VALID [2022-04-15 15:15:30,115 INFO L290 TraceCheckUtils]: 50: Hoare triple {39858#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {39858#(< ~counter~0 16)} is VALID [2022-04-15 15:15:30,116 INFO L290 TraceCheckUtils]: 49: Hoare triple {39883#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39858#(< ~counter~0 16)} is VALID [2022-04-15 15:15:30,116 INFO L290 TraceCheckUtils]: 48: Hoare triple {39883#(< ~counter~0 15)} assume !(~r~0 < 0); {39883#(< ~counter~0 15)} is VALID [2022-04-15 15:15:30,117 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {39432#true} {39883#(< ~counter~0 15)} #98#return; {39883#(< ~counter~0 15)} is VALID [2022-04-15 15:15:30,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 15:15:30,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 15:15:30,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 15:15:30,117 INFO L272 TraceCheckUtils]: 43: Hoare triple {39883#(< ~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)); {39432#true} is VALID [2022-04-15 15:15:30,117 INFO L290 TraceCheckUtils]: 42: Hoare triple {39883#(< ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {39883#(< ~counter~0 15)} is VALID [2022-04-15 15:15:30,118 INFO L290 TraceCheckUtils]: 41: Hoare triple {39908#(< ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39883#(< ~counter~0 15)} is VALID [2022-04-15 15:15:30,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {39908#(< ~counter~0 14)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {39908#(< ~counter~0 14)} is VALID [2022-04-15 15:15:30,119 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {39432#true} {39908#(< ~counter~0 14)} #98#return; {39908#(< ~counter~0 14)} is VALID [2022-04-15 15:15:30,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 15:15:30,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 15:15:30,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 15:15:30,119 INFO L272 TraceCheckUtils]: 35: Hoare triple {39908#(< ~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)); {39432#true} is VALID [2022-04-15 15:15:30,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {39908#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {39908#(< ~counter~0 14)} is VALID [2022-04-15 15:15:30,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {39933#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39908#(< ~counter~0 14)} is VALID [2022-04-15 15:15:30,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {39933#(< ~counter~0 13)} assume !(~r~0 > 0); {39933#(< ~counter~0 13)} is VALID [2022-04-15 15:15:30,120 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {39432#true} {39933#(< ~counter~0 13)} #96#return; {39933#(< ~counter~0 13)} is VALID [2022-04-15 15:15:30,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 15:15:30,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 15:15:30,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 15:15:30,121 INFO L272 TraceCheckUtils]: 27: Hoare triple {39933#(< ~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)); {39432#true} is VALID [2022-04-15 15:15:30,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {39933#(< ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {39933#(< ~counter~0 13)} is VALID [2022-04-15 15:15:30,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {39958#(< ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39933#(< ~counter~0 13)} is VALID [2022-04-15 15:15:30,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {39958#(< ~counter~0 12)} assume !!(0 != ~r~0); {39958#(< ~counter~0 12)} is VALID [2022-04-15 15:15:30,122 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {39432#true} {39958#(< ~counter~0 12)} #94#return; {39958#(< ~counter~0 12)} is VALID [2022-04-15 15:15:30,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 15:15:30,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 15:15:30,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 15:15:30,123 INFO L272 TraceCheckUtils]: 19: Hoare triple {39958#(< ~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)); {39432#true} is VALID [2022-04-15 15:15:30,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {39958#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {39958#(< ~counter~0 12)} is VALID [2022-04-15 15:15:30,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {39983#(< ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39958#(< ~counter~0 12)} is VALID [2022-04-15 15:15:30,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {39983#(< ~counter~0 11)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {39983#(< ~counter~0 11)} is VALID [2022-04-15 15:15:30,124 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {39432#true} {39983#(< ~counter~0 11)} #92#return; {39983#(< ~counter~0 11)} is VALID [2022-04-15 15:15:30,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 15:15:30,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 15:15:30,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 15:15:30,125 INFO L272 TraceCheckUtils]: 11: Hoare triple {39983#(< ~counter~0 11)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {39432#true} is VALID [2022-04-15 15:15:30,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39432#true} {39983#(< ~counter~0 11)} #90#return; {39983#(< ~counter~0 11)} is VALID [2022-04-15 15:15:30,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 15:15:30,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 15:15:30,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 15:15:30,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {39983#(< ~counter~0 11)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 15:15:30,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {39983#(< ~counter~0 11)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {39983#(< ~counter~0 11)} is VALID [2022-04-15 15:15:30,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {39983#(< ~counter~0 11)} call #t~ret9 := main(); {39983#(< ~counter~0 11)} is VALID [2022-04-15 15:15:30,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39983#(< ~counter~0 11)} {39432#true} #102#return; {39983#(< ~counter~0 11)} is VALID [2022-04-15 15:15:30,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {39983#(< ~counter~0 11)} assume true; {39983#(< ~counter~0 11)} is VALID [2022-04-15 15:15:30,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {39432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {39983#(< ~counter~0 11)} is VALID [2022-04-15 15:15:30,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {39432#true} call ULTIMATE.init(); {39432#true} is VALID [2022-04-15 15:15:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-15 15:15:30,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:15:30,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139741409] [2022-04-15 15:15:30,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:15:30,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672061071] [2022-04-15 15:15:30,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672061071] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:15:30,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:15:30,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 15:15:30,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:15:30,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2059934676] [2022-04-15 15:15:30,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2059934676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:30,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:30,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:15:30,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292309116] [2022-04-15 15:15:30,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:15:30,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-15 15:15:30,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:15:30,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 15:15:30,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:30,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:15:30,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:30,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:15:30,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:15:30,201 INFO L87 Difference]: Start difference. First operand 374 states and 480 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 15:15:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:31,343 INFO L93 Difference]: Finished difference Result 503 states and 667 transitions. [2022-04-15 15:15:31,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 15:15:31,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-15 15:15:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:15:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 15:15:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-15 15:15:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 15:15:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-15 15:15:31,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-15 15:15:31,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:31,514 INFO L225 Difference]: With dead ends: 503 [2022-04-15 15:15:31,515 INFO L226 Difference]: Without dead ends: 384 [2022-04-15 15:15:31,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=383, Invalid=547, Unknown=0, NotChecked=0, Total=930 [2022-04-15 15:15:31,516 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 124 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:15:31,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 252 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:15:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-04-15 15:15:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 376. [2022-04-15 15:15:32,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:15:32,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand has 376 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 285 states have internal predecessors, (335), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:32,050 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand has 376 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 285 states have internal predecessors, (335), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:32,050 INFO L87 Difference]: Start difference. First operand 384 states. Second operand has 376 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 285 states have internal predecessors, (335), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:32,059 INFO L93 Difference]: Finished difference Result 384 states and 489 transitions. [2022-04-15 15:15:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 489 transitions. [2022-04-15 15:15:32,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:32,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:32,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 376 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 285 states have internal predecessors, (335), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 384 states. [2022-04-15 15:15:32,061 INFO L87 Difference]: Start difference. First operand has 376 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 285 states have internal predecessors, (335), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 384 states. [2022-04-15 15:15:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:32,074 INFO L93 Difference]: Finished difference Result 384 states and 489 transitions. [2022-04-15 15:15:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 489 transitions. [2022-04-15 15:15:32,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:32,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:32,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:15:32,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:15:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 285 states have internal predecessors, (335), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 481 transitions. [2022-04-15 15:15:32,086 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 481 transitions. Word has length 97 [2022-04-15 15:15:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:15:32,086 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 481 transitions. [2022-04-15 15:15:32,087 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 15:15:32,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 376 states and 481 transitions. [2022-04-15 15:15:46,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 477 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 481 transitions. [2022-04-15 15:15:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 15:15:46,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:46,576 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:15:46,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 15:15:46,776 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 15:15:46,777 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:46,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-15 15:15:46,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:46,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1956766301] [2022-04-15 15:15:46,778 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-15 15:15:46,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:46,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585000193] [2022-04-15 15:15:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:46,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:46,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:46,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737971507] [2022-04-15 15:15:46,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:15:46,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:46,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:46,790 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:15:46,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 15:15:46,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:15:46,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:46,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 15:15:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:46,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:15:47,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {42577#true} call ULTIMATE.init(); {42577#true} is VALID [2022-04-15 15:15:47,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {42577#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42577#true} is VALID [2022-04-15 15:15:47,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 15:15:47,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42577#true} {42577#true} #102#return; {42577#true} is VALID [2022-04-15 15:15:47,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {42577#true} call #t~ret9 := main(); {42577#true} is VALID [2022-04-15 15:15:47,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {42577#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; {42577#true} is VALID [2022-04-15 15:15:47,163 INFO L272 TraceCheckUtils]: 6: Hoare triple {42577#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {42577#true} is VALID [2022-04-15 15:15:47,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 15:15:47,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 15:15:47,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 15:15:47,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42577#true} {42577#true} #90#return; {42577#true} is VALID [2022-04-15 15:15:47,164 INFO L272 TraceCheckUtils]: 11: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 15:15:47,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 15:15:47,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 15:15:47,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 15:15:47,164 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42577#true} {42577#true} #92#return; {42577#true} is VALID [2022-04-15 15:15:47,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {42577#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {42577#true} is VALID [2022-04-15 15:15:47,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {42577#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42577#true} is VALID [2022-04-15 15:15:47,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {42577#true} assume !!(#t~post6 < 20);havoc #t~post6; {42577#true} is VALID [2022-04-15 15:15:47,165 INFO L272 TraceCheckUtils]: 19: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 15:15:47,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 15:15:47,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 15:15:47,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 15:15:47,165 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {42577#true} {42577#true} #94#return; {42577#true} is VALID [2022-04-15 15:15:47,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {42577#true} assume !!(0 != ~r~0); {42577#true} is VALID [2022-04-15 15:15:47,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {42577#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42577#true} is VALID [2022-04-15 15:15:47,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {42577#true} assume !!(#t~post7 < 20);havoc #t~post7; {42577#true} is VALID [2022-04-15 15:15:47,165 INFO L272 TraceCheckUtils]: 27: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 15:15:47,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 15:15:47,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 15:15:47,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 15:15:47,166 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {42577#true} {42577#true} #96#return; {42577#true} is VALID [2022-04-15 15:15:47,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {42577#true} assume !(~r~0 > 0); {42577#true} is VALID [2022-04-15 15:15:47,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {42577#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42577#true} is VALID [2022-04-15 15:15:47,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {42577#true} assume !!(#t~post8 < 20);havoc #t~post8; {42577#true} is VALID [2022-04-15 15:15:47,166 INFO L272 TraceCheckUtils]: 35: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 15:15:47,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 15:15:47,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 15:15:47,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 15:15:47,166 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {42577#true} {42577#true} #98#return; {42577#true} is VALID [2022-04-15 15:15:47,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {42577#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {42577#true} is VALID [2022-04-15 15:15:47,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {42577#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42577#true} is VALID [2022-04-15 15:15:47,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {42577#true} assume !!(#t~post8 < 20);havoc #t~post8; {42577#true} is VALID [2022-04-15 15:15:47,167 INFO L272 TraceCheckUtils]: 43: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 15:15:47,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 15:15:47,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 15:15:47,167 INFO L290 TraceCheckUtils]: 46: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 15:15:47,167 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {42577#true} {42577#true} #98#return; {42577#true} is VALID [2022-04-15 15:15:47,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {42577#true} assume !(~r~0 < 0); {42577#true} is VALID [2022-04-15 15:15:47,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {42577#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42577#true} is VALID [2022-04-15 15:15:47,167 INFO L290 TraceCheckUtils]: 50: Hoare triple {42577#true} assume !!(#t~post6 < 20);havoc #t~post6; {42577#true} is VALID [2022-04-15 15:15:47,168 INFO L272 TraceCheckUtils]: 51: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 15:15:47,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 15:15:47,168 INFO L290 TraceCheckUtils]: 53: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 15:15:47,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 15:15:47,168 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {42577#true} {42577#true} #94#return; {42577#true} is VALID [2022-04-15 15:15:47,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {42577#true} assume !!(0 != ~r~0); {42577#true} is VALID [2022-04-15 15:15:47,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {42577#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42577#true} is VALID [2022-04-15 15:15:47,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {42577#true} assume !!(#t~post7 < 20);havoc #t~post7; {42577#true} is VALID [2022-04-15 15:15:47,168 INFO L272 TraceCheckUtils]: 59: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 15:15:47,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 15:15:47,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 15:15:47,169 INFO L290 TraceCheckUtils]: 62: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 15:15:47,169 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {42577#true} {42577#true} #96#return; {42577#true} is VALID [2022-04-15 15:15:47,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {42577#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42577#true} is VALID [2022-04-15 15:15:47,169 INFO L290 TraceCheckUtils]: 65: Hoare triple {42577#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42577#true} is VALID [2022-04-15 15:15:47,169 INFO L290 TraceCheckUtils]: 66: Hoare triple {42577#true} assume !!(#t~post7 < 20);havoc #t~post7; {42577#true} is VALID [2022-04-15 15:15:47,169 INFO L272 TraceCheckUtils]: 67: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 15:15:47,169 INFO L290 TraceCheckUtils]: 68: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 15:15:47,169 INFO L290 TraceCheckUtils]: 69: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 15:15:47,169 INFO L290 TraceCheckUtils]: 70: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 15:15:47,169 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42577#true} {42577#true} #96#return; {42577#true} is VALID [2022-04-15 15:15:47,170 INFO L290 TraceCheckUtils]: 72: Hoare triple {42577#true} assume !(~r~0 > 0); {42798#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:15:47,170 INFO L290 TraceCheckUtils]: 73: Hoare triple {42798#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42798#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:15:47,170 INFO L290 TraceCheckUtils]: 74: Hoare triple {42798#(not (< 0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {42798#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:15:47,170 INFO L272 TraceCheckUtils]: 75: Hoare triple {42798#(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)); {42577#true} is VALID [2022-04-15 15:15:47,171 INFO L290 TraceCheckUtils]: 76: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 15:15:47,171 INFO L290 TraceCheckUtils]: 77: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 15:15:47,171 INFO L290 TraceCheckUtils]: 78: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 15:15:47,171 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {42577#true} {42798#(not (< 0 main_~r~0))} #98#return; {42798#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:15:47,172 INFO L290 TraceCheckUtils]: 80: Hoare triple {42798#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:15:47,172 INFO L290 TraceCheckUtils]: 81: Hoare triple {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:15:47,173 INFO L290 TraceCheckUtils]: 82: Hoare triple {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 20);havoc #t~post6; {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:15:47,173 INFO L272 TraceCheckUtils]: 83: Hoare triple {42823#(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)); {42577#true} is VALID [2022-04-15 15:15:47,173 INFO L290 TraceCheckUtils]: 84: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 15:15:47,173 INFO L290 TraceCheckUtils]: 85: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 15:15:47,173 INFO L290 TraceCheckUtils]: 86: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 15:15:47,173 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {42577#true} {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:15:47,174 INFO L290 TraceCheckUtils]: 88: Hoare triple {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {42578#false} is VALID [2022-04-15 15:15:47,174 INFO L290 TraceCheckUtils]: 89: Hoare triple {42578#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42578#false} is VALID [2022-04-15 15:15:47,174 INFO L290 TraceCheckUtils]: 90: Hoare triple {42578#false} assume !(#t~post7 < 20);havoc #t~post7; {42578#false} is VALID [2022-04-15 15:15:47,174 INFO L290 TraceCheckUtils]: 91: Hoare triple {42578#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42578#false} is VALID [2022-04-15 15:15:47,174 INFO L290 TraceCheckUtils]: 92: Hoare triple {42578#false} assume !(#t~post8 < 20);havoc #t~post8; {42578#false} is VALID [2022-04-15 15:15:47,174 INFO L290 TraceCheckUtils]: 93: Hoare triple {42578#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42578#false} is VALID [2022-04-15 15:15:47,175 INFO L290 TraceCheckUtils]: 94: Hoare triple {42578#false} assume !(#t~post6 < 20);havoc #t~post6; {42578#false} is VALID [2022-04-15 15:15:47,175 INFO L272 TraceCheckUtils]: 95: Hoare triple {42578#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42578#false} is VALID [2022-04-15 15:15:47,175 INFO L290 TraceCheckUtils]: 96: Hoare triple {42578#false} ~cond := #in~cond; {42578#false} is VALID [2022-04-15 15:15:47,175 INFO L290 TraceCheckUtils]: 97: Hoare triple {42578#false} assume 0 == ~cond; {42578#false} is VALID [2022-04-15 15:15:47,175 INFO L290 TraceCheckUtils]: 98: Hoare triple {42578#false} assume !false; {42578#false} is VALID [2022-04-15 15:15:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-04-15 15:15:47,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:15:47,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:15:47,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585000193] [2022-04-15 15:15:47,176 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:15:47,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737971507] [2022-04-15 15:15:47,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737971507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:47,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:47,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:15:47,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:15:47,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1956766301] [2022-04-15 15:15:47,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1956766301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:47,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:47,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:15:47,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280098148] [2022-04-15 15:15:47,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:15:47,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-15 15:15:47,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:15:47,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:15:47,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:47,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:15:47,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:47,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:15:47,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:15:47,230 INFO L87 Difference]: Start difference. First operand 376 states and 481 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:15:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:47,948 INFO L93 Difference]: Finished difference Result 536 states and 699 transitions. [2022-04-15 15:15:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:15:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-15 15:15:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:15:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:15:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 15:15:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:15:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 15:15:47,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 15:15:48,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:48,035 INFO L225 Difference]: With dead ends: 536 [2022-04-15 15:15:48,035 INFO L226 Difference]: Without dead ends: 394 [2022-04-15 15:15:48,036 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:15:48,037 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:15:48,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 93 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:15:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-04-15 15:15:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 384. [2022-04-15 15:15:48,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:15:48,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 384 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 293 states have internal predecessors, (346), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:48,596 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 384 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 293 states have internal predecessors, (346), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:48,596 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 384 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 293 states have internal predecessors, (346), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:48,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:48,606 INFO L93 Difference]: Finished difference Result 394 states and 505 transitions. [2022-04-15 15:15:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 505 transitions. [2022-04-15 15:15:48,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:48,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:48,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 384 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 293 states have internal predecessors, (346), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 394 states. [2022-04-15 15:15:48,608 INFO L87 Difference]: Start difference. First operand has 384 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 293 states have internal predecessors, (346), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 394 states. [2022-04-15 15:15:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:48,618 INFO L93 Difference]: Finished difference Result 394 states and 505 transitions. [2022-04-15 15:15:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 505 transitions. [2022-04-15 15:15:48,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:48,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:48,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:15:48,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:15:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 293 states have internal predecessors, (346), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:15:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 492 transitions. [2022-04-15 15:15:48,631 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 492 transitions. Word has length 99 [2022-04-15 15:15:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:15:48,632 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 492 transitions. [2022-04-15 15:15:48,632 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:15:48,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 384 states and 492 transitions. [2022-04-15 15:16:02,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 489 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 492 transitions. [2022-04-15 15:16:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 15:16:02,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:16:02,498 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:16:02,514 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-15 15:16:02,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 15:16:02,699 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:16:02,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:16:02,699 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-15 15:16:02,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:02,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1146911143] [2022-04-15 15:16:02,700 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:16:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-15 15:16:02,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:16:02,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026016162] [2022-04-15 15:16:02,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:16:02,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:16:02,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:16:02,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1433932888] [2022-04-15 15:16:02,711 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:16:02,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:16:02,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:16:02,712 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:16:02,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 15:16:02,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:16:02,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:16:02,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 15:16:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:16:02,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:16:03,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {45505#true} call ULTIMATE.init(); {45505#true} is VALID [2022-04-15 15:16:03,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {45505#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {45513#(<= ~counter~0 0)} assume true; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45513#(<= ~counter~0 0)} {45505#true} #102#return; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {45513#(<= ~counter~0 0)} call #t~ret9 := main(); {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {45513#(<= ~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; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,384 INFO L272 TraceCheckUtils]: 6: Hoare triple {45513#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {45513#(<= ~counter~0 0)} ~cond := #in~cond; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {45513#(<= ~counter~0 0)} assume !(0 == ~cond); {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {45513#(<= ~counter~0 0)} assume true; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45513#(<= ~counter~0 0)} {45513#(<= ~counter~0 0)} #90#return; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,386 INFO L272 TraceCheckUtils]: 11: Hoare triple {45513#(<= ~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)); {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {45513#(<= ~counter~0 0)} ~cond := #in~cond; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {45513#(<= ~counter~0 0)} assume !(0 == ~cond); {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {45513#(<= ~counter~0 0)} assume true; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,388 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45513#(<= ~counter~0 0)} {45513#(<= ~counter~0 0)} #92#return; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {45513#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:03,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {45513#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45562#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:03,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {45562#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {45562#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:03,390 INFO L272 TraceCheckUtils]: 19: Hoare triple {45562#(<= ~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)); {45562#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:03,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {45562#(<= ~counter~0 1)} ~cond := #in~cond; {45562#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:03,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {45562#(<= ~counter~0 1)} assume !(0 == ~cond); {45562#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:03,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {45562#(<= ~counter~0 1)} assume true; {45562#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:03,392 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {45562#(<= ~counter~0 1)} {45562#(<= ~counter~0 1)} #94#return; {45562#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:03,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {45562#(<= ~counter~0 1)} assume !!(0 != ~r~0); {45562#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:03,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {45562#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45587#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:03,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {45587#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {45587#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:03,394 INFO L272 TraceCheckUtils]: 27: Hoare triple {45587#(<= ~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)); {45587#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:03,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {45587#(<= ~counter~0 2)} ~cond := #in~cond; {45587#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:03,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {45587#(<= ~counter~0 2)} assume !(0 == ~cond); {45587#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:03,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {45587#(<= ~counter~0 2)} assume true; {45587#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:03,396 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {45587#(<= ~counter~0 2)} {45587#(<= ~counter~0 2)} #96#return; {45587#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:03,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {45587#(<= ~counter~0 2)} assume !(~r~0 > 0); {45587#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:03,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {45587#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45612#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:03,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {45612#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {45612#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:03,398 INFO L272 TraceCheckUtils]: 35: Hoare triple {45612#(<= ~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)); {45612#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:03,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {45612#(<= ~counter~0 3)} ~cond := #in~cond; {45612#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:03,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {45612#(<= ~counter~0 3)} assume !(0 == ~cond); {45612#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:03,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {45612#(<= ~counter~0 3)} assume true; {45612#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:03,400 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {45612#(<= ~counter~0 3)} {45612#(<= ~counter~0 3)} #98#return; {45612#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:03,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {45612#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {45612#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:03,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {45612#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45637#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:03,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {45637#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {45637#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:03,402 INFO L272 TraceCheckUtils]: 43: Hoare triple {45637#(<= ~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)); {45637#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:03,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {45637#(<= ~counter~0 4)} ~cond := #in~cond; {45637#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:03,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {45637#(<= ~counter~0 4)} assume !(0 == ~cond); {45637#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:03,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {45637#(<= ~counter~0 4)} assume true; {45637#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:03,404 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {45637#(<= ~counter~0 4)} {45637#(<= ~counter~0 4)} #98#return; {45637#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:03,404 INFO L290 TraceCheckUtils]: 48: Hoare triple {45637#(<= ~counter~0 4)} assume !(~r~0 < 0); {45637#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:03,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {45637#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45662#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:03,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {45662#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {45662#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:03,406 INFO L272 TraceCheckUtils]: 51: Hoare triple {45662#(<= ~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)); {45662#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:03,406 INFO L290 TraceCheckUtils]: 52: Hoare triple {45662#(<= ~counter~0 5)} ~cond := #in~cond; {45662#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:03,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {45662#(<= ~counter~0 5)} assume !(0 == ~cond); {45662#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:03,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {45662#(<= ~counter~0 5)} assume true; {45662#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:03,408 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {45662#(<= ~counter~0 5)} {45662#(<= ~counter~0 5)} #94#return; {45662#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:03,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {45662#(<= ~counter~0 5)} assume !!(0 != ~r~0); {45662#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:03,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {45662#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45687#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:03,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {45687#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {45687#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:03,410 INFO L272 TraceCheckUtils]: 59: Hoare triple {45687#(<= ~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)); {45687#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:03,410 INFO L290 TraceCheckUtils]: 60: Hoare triple {45687#(<= ~counter~0 6)} ~cond := #in~cond; {45687#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:03,411 INFO L290 TraceCheckUtils]: 61: Hoare triple {45687#(<= ~counter~0 6)} assume !(0 == ~cond); {45687#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:03,411 INFO L290 TraceCheckUtils]: 62: Hoare triple {45687#(<= ~counter~0 6)} assume true; {45687#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:03,412 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {45687#(<= ~counter~0 6)} {45687#(<= ~counter~0 6)} #96#return; {45687#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:03,412 INFO L290 TraceCheckUtils]: 64: Hoare triple {45687#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45687#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:03,413 INFO L290 TraceCheckUtils]: 65: Hoare triple {45687#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45712#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:03,413 INFO L290 TraceCheckUtils]: 66: Hoare triple {45712#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {45712#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:03,414 INFO L272 TraceCheckUtils]: 67: Hoare triple {45712#(<= ~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)); {45712#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:03,414 INFO L290 TraceCheckUtils]: 68: Hoare triple {45712#(<= ~counter~0 7)} ~cond := #in~cond; {45712#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:03,415 INFO L290 TraceCheckUtils]: 69: Hoare triple {45712#(<= ~counter~0 7)} assume !(0 == ~cond); {45712#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:03,415 INFO L290 TraceCheckUtils]: 70: Hoare triple {45712#(<= ~counter~0 7)} assume true; {45712#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:03,416 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {45712#(<= ~counter~0 7)} {45712#(<= ~counter~0 7)} #96#return; {45712#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:03,416 INFO L290 TraceCheckUtils]: 72: Hoare triple {45712#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45712#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:03,417 INFO L290 TraceCheckUtils]: 73: Hoare triple {45712#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45737#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:03,417 INFO L290 TraceCheckUtils]: 74: Hoare triple {45737#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {45737#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:03,418 INFO L272 TraceCheckUtils]: 75: Hoare triple {45737#(<= ~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)); {45737#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:03,418 INFO L290 TraceCheckUtils]: 76: Hoare triple {45737#(<= ~counter~0 8)} ~cond := #in~cond; {45737#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:03,419 INFO L290 TraceCheckUtils]: 77: Hoare triple {45737#(<= ~counter~0 8)} assume !(0 == ~cond); {45737#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:03,419 INFO L290 TraceCheckUtils]: 78: Hoare triple {45737#(<= ~counter~0 8)} assume true; {45737#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:03,420 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {45737#(<= ~counter~0 8)} {45737#(<= ~counter~0 8)} #96#return; {45737#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:03,420 INFO L290 TraceCheckUtils]: 80: Hoare triple {45737#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45737#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:03,421 INFO L290 TraceCheckUtils]: 81: Hoare triple {45737#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45762#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:03,421 INFO L290 TraceCheckUtils]: 82: Hoare triple {45762#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {45762#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:03,422 INFO L272 TraceCheckUtils]: 83: Hoare triple {45762#(<= ~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)); {45762#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:03,422 INFO L290 TraceCheckUtils]: 84: Hoare triple {45762#(<= ~counter~0 9)} ~cond := #in~cond; {45762#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:03,423 INFO L290 TraceCheckUtils]: 85: Hoare triple {45762#(<= ~counter~0 9)} assume !(0 == ~cond); {45762#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:03,423 INFO L290 TraceCheckUtils]: 86: Hoare triple {45762#(<= ~counter~0 9)} assume true; {45762#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:03,424 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {45762#(<= ~counter~0 9)} {45762#(<= ~counter~0 9)} #96#return; {45762#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:03,424 INFO L290 TraceCheckUtils]: 88: Hoare triple {45762#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45762#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:03,424 INFO L290 TraceCheckUtils]: 89: Hoare triple {45762#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45787#(<= |main_#t~post7| 9)} is VALID [2022-04-15 15:16:03,425 INFO L290 TraceCheckUtils]: 90: Hoare triple {45787#(<= |main_#t~post7| 9)} assume !(#t~post7 < 20);havoc #t~post7; {45506#false} is VALID [2022-04-15 15:16:03,425 INFO L290 TraceCheckUtils]: 91: Hoare triple {45506#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45506#false} is VALID [2022-04-15 15:16:03,425 INFO L290 TraceCheckUtils]: 92: Hoare triple {45506#false} assume !(#t~post8 < 20);havoc #t~post8; {45506#false} is VALID [2022-04-15 15:16:03,425 INFO L290 TraceCheckUtils]: 93: Hoare triple {45506#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45506#false} is VALID [2022-04-15 15:16:03,425 INFO L290 TraceCheckUtils]: 94: Hoare triple {45506#false} assume !(#t~post6 < 20);havoc #t~post6; {45506#false} is VALID [2022-04-15 15:16:03,425 INFO L272 TraceCheckUtils]: 95: Hoare triple {45506#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45506#false} is VALID [2022-04-15 15:16:03,425 INFO L290 TraceCheckUtils]: 96: Hoare triple {45506#false} ~cond := #in~cond; {45506#false} is VALID [2022-04-15 15:16:03,426 INFO L290 TraceCheckUtils]: 97: Hoare triple {45506#false} assume 0 == ~cond; {45506#false} is VALID [2022-04-15 15:16:03,426 INFO L290 TraceCheckUtils]: 98: Hoare triple {45506#false} assume !false; {45506#false} is VALID [2022-04-15 15:16:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 202 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:16:03,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:16:04,039 INFO L290 TraceCheckUtils]: 98: Hoare triple {45506#false} assume !false; {45506#false} is VALID [2022-04-15 15:16:04,039 INFO L290 TraceCheckUtils]: 97: Hoare triple {45506#false} assume 0 == ~cond; {45506#false} is VALID [2022-04-15 15:16:04,039 INFO L290 TraceCheckUtils]: 96: Hoare triple {45506#false} ~cond := #in~cond; {45506#false} is VALID [2022-04-15 15:16:04,039 INFO L272 TraceCheckUtils]: 95: Hoare triple {45506#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45506#false} is VALID [2022-04-15 15:16:04,039 INFO L290 TraceCheckUtils]: 94: Hoare triple {45506#false} assume !(#t~post6 < 20);havoc #t~post6; {45506#false} is VALID [2022-04-15 15:16:04,039 INFO L290 TraceCheckUtils]: 93: Hoare triple {45506#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45506#false} is VALID [2022-04-15 15:16:04,039 INFO L290 TraceCheckUtils]: 92: Hoare triple {45506#false} assume !(#t~post8 < 20);havoc #t~post8; {45506#false} is VALID [2022-04-15 15:16:04,040 INFO L290 TraceCheckUtils]: 91: Hoare triple {45506#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45506#false} is VALID [2022-04-15 15:16:04,051 INFO L290 TraceCheckUtils]: 90: Hoare triple {45839#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {45506#false} is VALID [2022-04-15 15:16:04,051 INFO L290 TraceCheckUtils]: 89: Hoare triple {45843#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45839#(< |main_#t~post7| 20)} is VALID [2022-04-15 15:16:04,052 INFO L290 TraceCheckUtils]: 88: Hoare triple {45843#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45843#(< ~counter~0 20)} is VALID [2022-04-15 15:16:04,052 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {45505#true} {45843#(< ~counter~0 20)} #96#return; {45843#(< ~counter~0 20)} is VALID [2022-04-15 15:16:04,052 INFO L290 TraceCheckUtils]: 86: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 15:16:04,052 INFO L290 TraceCheckUtils]: 85: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 15:16:04,052 INFO L290 TraceCheckUtils]: 84: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 15:16:04,053 INFO L272 TraceCheckUtils]: 83: Hoare triple {45843#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 15:16:04,053 INFO L290 TraceCheckUtils]: 82: Hoare triple {45843#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {45843#(< ~counter~0 20)} is VALID [2022-04-15 15:16:04,056 INFO L290 TraceCheckUtils]: 81: Hoare triple {45868#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45843#(< ~counter~0 20)} is VALID [2022-04-15 15:16:04,057 INFO L290 TraceCheckUtils]: 80: Hoare triple {45868#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45868#(< ~counter~0 19)} is VALID [2022-04-15 15:16:04,058 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {45505#true} {45868#(< ~counter~0 19)} #96#return; {45868#(< ~counter~0 19)} is VALID [2022-04-15 15:16:04,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 15:16:04,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 15:16:04,058 INFO L290 TraceCheckUtils]: 76: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 15:16:04,058 INFO L272 TraceCheckUtils]: 75: Hoare triple {45868#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 15:16:04,059 INFO L290 TraceCheckUtils]: 74: Hoare triple {45868#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {45868#(< ~counter~0 19)} is VALID [2022-04-15 15:16:04,059 INFO L290 TraceCheckUtils]: 73: Hoare triple {45893#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45868#(< ~counter~0 19)} is VALID [2022-04-15 15:16:04,060 INFO L290 TraceCheckUtils]: 72: Hoare triple {45893#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45893#(< ~counter~0 18)} is VALID [2022-04-15 15:16:04,060 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {45505#true} {45893#(< ~counter~0 18)} #96#return; {45893#(< ~counter~0 18)} is VALID [2022-04-15 15:16:04,060 INFO L290 TraceCheckUtils]: 70: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 15:16:04,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 15:16:04,061 INFO L290 TraceCheckUtils]: 68: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 15:16:04,061 INFO L272 TraceCheckUtils]: 67: Hoare triple {45893#(< ~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)); {45505#true} is VALID [2022-04-15 15:16:04,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {45893#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {45893#(< ~counter~0 18)} is VALID [2022-04-15 15:16:04,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {45918#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45893#(< ~counter~0 18)} is VALID [2022-04-15 15:16:04,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {45918#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45918#(< ~counter~0 17)} is VALID [2022-04-15 15:16:04,062 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {45505#true} {45918#(< ~counter~0 17)} #96#return; {45918#(< ~counter~0 17)} is VALID [2022-04-15 15:16:04,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 15:16:04,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 15:16:04,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 15:16:04,063 INFO L272 TraceCheckUtils]: 59: Hoare triple {45918#(< ~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)); {45505#true} is VALID [2022-04-15 15:16:04,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {45918#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {45918#(< ~counter~0 17)} is VALID [2022-04-15 15:16:04,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {45943#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45918#(< ~counter~0 17)} is VALID [2022-04-15 15:16:04,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {45943#(< ~counter~0 16)} assume !!(0 != ~r~0); {45943#(< ~counter~0 16)} is VALID [2022-04-15 15:16:04,064 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {45505#true} {45943#(< ~counter~0 16)} #94#return; {45943#(< ~counter~0 16)} is VALID [2022-04-15 15:16:04,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 15:16:04,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 15:16:04,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 15:16:04,065 INFO L272 TraceCheckUtils]: 51: Hoare triple {45943#(< ~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)); {45505#true} is VALID [2022-04-15 15:16:04,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {45943#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {45943#(< ~counter~0 16)} is VALID [2022-04-15 15:16:04,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {45968#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45943#(< ~counter~0 16)} is VALID [2022-04-15 15:16:04,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {45968#(< ~counter~0 15)} assume !(~r~0 < 0); {45968#(< ~counter~0 15)} is VALID [2022-04-15 15:16:04,066 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {45505#true} {45968#(< ~counter~0 15)} #98#return; {45968#(< ~counter~0 15)} is VALID [2022-04-15 15:16:04,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 15:16:04,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 15:16:04,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 15:16:04,067 INFO L272 TraceCheckUtils]: 43: Hoare triple {45968#(< ~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)); {45505#true} is VALID [2022-04-15 15:16:04,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {45968#(< ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {45968#(< ~counter~0 15)} is VALID [2022-04-15 15:16:04,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {45993#(< ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45968#(< ~counter~0 15)} is VALID [2022-04-15 15:16:04,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {45993#(< ~counter~0 14)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {45993#(< ~counter~0 14)} is VALID [2022-04-15 15:16:04,068 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {45505#true} {45993#(< ~counter~0 14)} #98#return; {45993#(< ~counter~0 14)} is VALID [2022-04-15 15:16:04,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 15:16:04,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 15:16:04,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 15:16:04,068 INFO L272 TraceCheckUtils]: 35: Hoare triple {45993#(< ~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)); {45505#true} is VALID [2022-04-15 15:16:04,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {45993#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {45993#(< ~counter~0 14)} is VALID [2022-04-15 15:16:04,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {46018#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45993#(< ~counter~0 14)} is VALID [2022-04-15 15:16:04,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {46018#(< ~counter~0 13)} assume !(~r~0 > 0); {46018#(< ~counter~0 13)} is VALID [2022-04-15 15:16:04,070 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {45505#true} {46018#(< ~counter~0 13)} #96#return; {46018#(< ~counter~0 13)} is VALID [2022-04-15 15:16:04,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 15:16:04,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 15:16:04,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 15:16:04,070 INFO L272 TraceCheckUtils]: 27: Hoare triple {46018#(< ~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)); {45505#true} is VALID [2022-04-15 15:16:04,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {46018#(< ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {46018#(< ~counter~0 13)} is VALID [2022-04-15 15:16:04,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {46043#(< ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {46018#(< ~counter~0 13)} is VALID [2022-04-15 15:16:04,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {46043#(< ~counter~0 12)} assume !!(0 != ~r~0); {46043#(< ~counter~0 12)} is VALID [2022-04-15 15:16:04,072 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {45505#true} {46043#(< ~counter~0 12)} #94#return; {46043#(< ~counter~0 12)} is VALID [2022-04-15 15:16:04,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 15:16:04,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 15:16:04,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 15:16:04,072 INFO L272 TraceCheckUtils]: 19: Hoare triple {46043#(< ~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)); {45505#true} is VALID [2022-04-15 15:16:04,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {46043#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {46043#(< ~counter~0 12)} is VALID [2022-04-15 15:16:04,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {46068#(< ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46043#(< ~counter~0 12)} is VALID [2022-04-15 15:16:04,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {46068#(< ~counter~0 11)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {46068#(< ~counter~0 11)} is VALID [2022-04-15 15:16:04,074 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45505#true} {46068#(< ~counter~0 11)} #92#return; {46068#(< ~counter~0 11)} is VALID [2022-04-15 15:16:04,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 15:16:04,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 15:16:04,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 15:16:04,074 INFO L272 TraceCheckUtils]: 11: Hoare triple {46068#(< ~counter~0 11)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {45505#true} is VALID [2022-04-15 15:16:04,075 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45505#true} {46068#(< ~counter~0 11)} #90#return; {46068#(< ~counter~0 11)} is VALID [2022-04-15 15:16:04,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 15:16:04,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 15:16:04,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 15:16:04,075 INFO L272 TraceCheckUtils]: 6: Hoare triple {46068#(< ~counter~0 11)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 15:16:04,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {46068#(< ~counter~0 11)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {46068#(< ~counter~0 11)} is VALID [2022-04-15 15:16:04,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {46068#(< ~counter~0 11)} call #t~ret9 := main(); {46068#(< ~counter~0 11)} is VALID [2022-04-15 15:16:04,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46068#(< ~counter~0 11)} {45505#true} #102#return; {46068#(< ~counter~0 11)} is VALID [2022-04-15 15:16:04,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {46068#(< ~counter~0 11)} assume true; {46068#(< ~counter~0 11)} is VALID [2022-04-15 15:16:04,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {45505#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {46068#(< ~counter~0 11)} is VALID [2022-04-15 15:16:04,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {45505#true} call ULTIMATE.init(); {45505#true} is VALID [2022-04-15 15:16:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-15 15:16:04,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:16:04,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026016162] [2022-04-15 15:16:04,077 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:16:04,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433932888] [2022-04-15 15:16:04,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433932888] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:16:04,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:16:04,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 15:16:04,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:16:04,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1146911143] [2022-04-15 15:16:04,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1146911143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:16:04,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:16:04,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:16:04,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649633516] [2022-04-15 15:16:04,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:16:04,078 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-15 15:16:04,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:16:04,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 15:16:04,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:04,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:16:04,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:04,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:16:04,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:16:04,149 INFO L87 Difference]: Start difference. First operand 384 states and 492 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 15:16:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:05,345 INFO L93 Difference]: Finished difference Result 507 states and 669 transitions. [2022-04-15 15:16:05,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 15:16:05,345 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-15 15:16:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:16:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 15:16:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-15 15:16:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 15:16:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-15 15:16:05,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-15 15:16:05,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:05,559 INFO L225 Difference]: With dead ends: 507 [2022-04-15 15:16:05,559 INFO L226 Difference]: Without dead ends: 396 [2022-04-15 15:16:05,560 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=412, Invalid=580, Unknown=0, NotChecked=0, Total=992 [2022-04-15 15:16:05,560 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 117 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:16:05,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 234 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:16:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-15 15:16:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2022-04-15 15:16:06,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:16:06,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 396 states, 301 states have (on average 1.1893687707641196) internal successors, (358), 301 states have internal predecessors, (358), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:16:06,244 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 396 states, 301 states have (on average 1.1893687707641196) internal successors, (358), 301 states have internal predecessors, (358), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:16:06,244 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 396 states, 301 states have (on average 1.1893687707641196) internal successors, (358), 301 states have internal predecessors, (358), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:16:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:06,252 INFO L93 Difference]: Finished difference Result 396 states and 504 transitions. [2022-04-15 15:16:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 504 transitions. [2022-04-15 15:16:06,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:06,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:06,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 396 states, 301 states have (on average 1.1893687707641196) internal successors, (358), 301 states have internal predecessors, (358), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 396 states. [2022-04-15 15:16:06,253 INFO L87 Difference]: Start difference. First operand has 396 states, 301 states have (on average 1.1893687707641196) internal successors, (358), 301 states have internal predecessors, (358), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 396 states. [2022-04-15 15:16:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:06,263 INFO L93 Difference]: Finished difference Result 396 states and 504 transitions. [2022-04-15 15:16:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 504 transitions. [2022-04-15 15:16:06,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:06,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:06,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:16:06,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:16:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 301 states have (on average 1.1893687707641196) internal successors, (358), 301 states have internal predecessors, (358), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:16:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 504 transitions. [2022-04-15 15:16:06,277 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 504 transitions. Word has length 99 [2022-04-15 15:16:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:16:06,277 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 504 transitions. [2022-04-15 15:16:06,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 15:16:06,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 396 states and 504 transitions. [2022-04-15 15:16:19,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 504 edges. 501 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 504 transitions. [2022-04-15 15:16:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 15:16:19,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:16:19,133 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:16:19,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 15:16:19,333 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:16:19,334 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:16:19,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:16:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-15 15:16:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:19,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1928916774] [2022-04-15 15:16:19,334 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:16:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-15 15:16:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:16:19,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266644081] [2022-04-15 15:16:19,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:16:19,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:16:19,361 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:16:19,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634673075] [2022-04-15 15:16:19,362 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:16:19,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:16:19,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:16:19,363 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:16:19,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 15:16:19,482 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:16:19,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:16:19,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 15:16:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:16:19,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:16:20,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {48736#true} call ULTIMATE.init(); {48736#true} is VALID [2022-04-15 15:16:20,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {48736#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#(<= ~counter~0 0)} assume true; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#(<= ~counter~0 0)} {48736#true} #102#return; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {48744#(<= ~counter~0 0)} call #t~ret9 := main(); {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {48744#(<= ~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; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,023 INFO L272 TraceCheckUtils]: 6: Hoare triple {48744#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {48744#(<= ~counter~0 0)} ~cond := #in~cond; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {48744#(<= ~counter~0 0)} assume !(0 == ~cond); {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {48744#(<= ~counter~0 0)} assume true; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,024 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {48744#(<= ~counter~0 0)} {48744#(<= ~counter~0 0)} #90#return; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,024 INFO L272 TraceCheckUtils]: 11: Hoare triple {48744#(<= ~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)); {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#(<= ~counter~0 0)} ~cond := #in~cond; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#(<= ~counter~0 0)} assume !(0 == ~cond); {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#(<= ~counter~0 0)} assume true; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,025 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48744#(<= ~counter~0 0)} {48744#(<= ~counter~0 0)} #92#return; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {48744#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:20,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48793#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:20,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {48793#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {48793#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:20,028 INFO L272 TraceCheckUtils]: 19: Hoare triple {48793#(<= ~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)); {48793#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:20,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {48793#(<= ~counter~0 1)} ~cond := #in~cond; {48793#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:20,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {48793#(<= ~counter~0 1)} assume !(0 == ~cond); {48793#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:20,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {48793#(<= ~counter~0 1)} assume true; {48793#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:20,029 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {48793#(<= ~counter~0 1)} {48793#(<= ~counter~0 1)} #94#return; {48793#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:20,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {48793#(<= ~counter~0 1)} assume !!(0 != ~r~0); {48793#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:20,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {48793#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48818#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:20,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {48818#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {48818#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:20,031 INFO L272 TraceCheckUtils]: 27: Hoare triple {48818#(<= ~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)); {48818#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:20,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {48818#(<= ~counter~0 2)} ~cond := #in~cond; {48818#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:20,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {48818#(<= ~counter~0 2)} assume !(0 == ~cond); {48818#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:20,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {48818#(<= ~counter~0 2)} assume true; {48818#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:20,032 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {48818#(<= ~counter~0 2)} {48818#(<= ~counter~0 2)} #96#return; {48818#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:20,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {48818#(<= ~counter~0 2)} assume !(~r~0 > 0); {48818#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:20,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {48818#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48843#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:20,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {48843#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {48843#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:20,034 INFO L272 TraceCheckUtils]: 35: Hoare triple {48843#(<= ~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)); {48843#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:20,034 INFO L290 TraceCheckUtils]: 36: Hoare triple {48843#(<= ~counter~0 3)} ~cond := #in~cond; {48843#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:20,034 INFO L290 TraceCheckUtils]: 37: Hoare triple {48843#(<= ~counter~0 3)} assume !(0 == ~cond); {48843#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:20,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {48843#(<= ~counter~0 3)} assume true; {48843#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:20,035 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {48843#(<= ~counter~0 3)} {48843#(<= ~counter~0 3)} #98#return; {48843#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:20,035 INFO L290 TraceCheckUtils]: 40: Hoare triple {48843#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48843#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:20,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {48843#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48868#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:20,036 INFO L290 TraceCheckUtils]: 42: Hoare triple {48868#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {48868#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:20,037 INFO L272 TraceCheckUtils]: 43: Hoare triple {48868#(<= ~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)); {48868#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:20,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {48868#(<= ~counter~0 4)} ~cond := #in~cond; {48868#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:20,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {48868#(<= ~counter~0 4)} assume !(0 == ~cond); {48868#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:20,037 INFO L290 TraceCheckUtils]: 46: Hoare triple {48868#(<= ~counter~0 4)} assume true; {48868#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:20,038 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {48868#(<= ~counter~0 4)} {48868#(<= ~counter~0 4)} #98#return; {48868#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:20,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {48868#(<= ~counter~0 4)} assume !(~r~0 < 0); {48868#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:20,039 INFO L290 TraceCheckUtils]: 49: Hoare triple {48868#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48893#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:20,039 INFO L290 TraceCheckUtils]: 50: Hoare triple {48893#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {48893#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:20,039 INFO L272 TraceCheckUtils]: 51: Hoare triple {48893#(<= ~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)); {48893#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:20,040 INFO L290 TraceCheckUtils]: 52: Hoare triple {48893#(<= ~counter~0 5)} ~cond := #in~cond; {48893#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:20,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {48893#(<= ~counter~0 5)} assume !(0 == ~cond); {48893#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:20,040 INFO L290 TraceCheckUtils]: 54: Hoare triple {48893#(<= ~counter~0 5)} assume true; {48893#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:20,041 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48893#(<= ~counter~0 5)} {48893#(<= ~counter~0 5)} #94#return; {48893#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:20,041 INFO L290 TraceCheckUtils]: 56: Hoare triple {48893#(<= ~counter~0 5)} assume !!(0 != ~r~0); {48893#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:20,042 INFO L290 TraceCheckUtils]: 57: Hoare triple {48893#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48918#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:20,042 INFO L290 TraceCheckUtils]: 58: Hoare triple {48918#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {48918#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:20,042 INFO L272 TraceCheckUtils]: 59: Hoare triple {48918#(<= ~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)); {48918#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:20,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {48918#(<= ~counter~0 6)} ~cond := #in~cond; {48918#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:20,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {48918#(<= ~counter~0 6)} assume !(0 == ~cond); {48918#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:20,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {48918#(<= ~counter~0 6)} assume true; {48918#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:20,044 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {48918#(<= ~counter~0 6)} {48918#(<= ~counter~0 6)} #96#return; {48918#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:20,044 INFO L290 TraceCheckUtils]: 64: Hoare triple {48918#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48918#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:20,045 INFO L290 TraceCheckUtils]: 65: Hoare triple {48918#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48943#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:20,045 INFO L290 TraceCheckUtils]: 66: Hoare triple {48943#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {48943#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:20,045 INFO L272 TraceCheckUtils]: 67: Hoare triple {48943#(<= ~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)); {48943#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:20,046 INFO L290 TraceCheckUtils]: 68: Hoare triple {48943#(<= ~counter~0 7)} ~cond := #in~cond; {48943#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:20,046 INFO L290 TraceCheckUtils]: 69: Hoare triple {48943#(<= ~counter~0 7)} assume !(0 == ~cond); {48943#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:20,046 INFO L290 TraceCheckUtils]: 70: Hoare triple {48943#(<= ~counter~0 7)} assume true; {48943#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:20,047 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {48943#(<= ~counter~0 7)} {48943#(<= ~counter~0 7)} #96#return; {48943#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:20,047 INFO L290 TraceCheckUtils]: 72: Hoare triple {48943#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48943#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:20,048 INFO L290 TraceCheckUtils]: 73: Hoare triple {48943#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48968#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:20,048 INFO L290 TraceCheckUtils]: 74: Hoare triple {48968#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {48968#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:20,048 INFO L272 TraceCheckUtils]: 75: Hoare triple {48968#(<= ~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)); {48968#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:20,049 INFO L290 TraceCheckUtils]: 76: Hoare triple {48968#(<= ~counter~0 8)} ~cond := #in~cond; {48968#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:20,049 INFO L290 TraceCheckUtils]: 77: Hoare triple {48968#(<= ~counter~0 8)} assume !(0 == ~cond); {48968#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:20,049 INFO L290 TraceCheckUtils]: 78: Hoare triple {48968#(<= ~counter~0 8)} assume true; {48968#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:20,050 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48968#(<= ~counter~0 8)} {48968#(<= ~counter~0 8)} #96#return; {48968#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:20,050 INFO L290 TraceCheckUtils]: 80: Hoare triple {48968#(<= ~counter~0 8)} assume !(~r~0 > 0); {48968#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:20,051 INFO L290 TraceCheckUtils]: 81: Hoare triple {48968#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,051 INFO L290 TraceCheckUtils]: 82: Hoare triple {48993#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,051 INFO L272 TraceCheckUtils]: 83: Hoare triple {48993#(<= ~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)); {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,052 INFO L290 TraceCheckUtils]: 84: Hoare triple {48993#(<= ~counter~0 9)} ~cond := #in~cond; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,052 INFO L290 TraceCheckUtils]: 85: Hoare triple {48993#(<= ~counter~0 9)} assume !(0 == ~cond); {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,052 INFO L290 TraceCheckUtils]: 86: Hoare triple {48993#(<= ~counter~0 9)} assume true; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,053 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {48993#(<= ~counter~0 9)} {48993#(<= ~counter~0 9)} #98#return; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,053 INFO L290 TraceCheckUtils]: 88: Hoare triple {48993#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,054 INFO L290 TraceCheckUtils]: 89: Hoare triple {48993#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:20,054 INFO L290 TraceCheckUtils]: 90: Hoare triple {49018#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:20,054 INFO L272 TraceCheckUtils]: 91: Hoare triple {49018#(<= ~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)); {49018#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:20,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {49018#(<= ~counter~0 10)} ~cond := #in~cond; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:20,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {49018#(<= ~counter~0 10)} assume !(0 == ~cond); {49018#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:20,055 INFO L290 TraceCheckUtils]: 94: Hoare triple {49018#(<= ~counter~0 10)} assume true; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:20,056 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {49018#(<= ~counter~0 10)} {49018#(<= ~counter~0 10)} #98#return; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:20,056 INFO L290 TraceCheckUtils]: 96: Hoare triple {49018#(<= ~counter~0 10)} assume !(~r~0 < 0); {49018#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:20,056 INFO L290 TraceCheckUtils]: 97: Hoare triple {49018#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49043#(<= |main_#t~post6| 10)} is VALID [2022-04-15 15:16:20,057 INFO L290 TraceCheckUtils]: 98: Hoare triple {49043#(<= |main_#t~post6| 10)} assume !(#t~post6 < 20);havoc #t~post6; {48737#false} is VALID [2022-04-15 15:16:20,057 INFO L272 TraceCheckUtils]: 99: Hoare triple {48737#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48737#false} is VALID [2022-04-15 15:16:20,057 INFO L290 TraceCheckUtils]: 100: Hoare triple {48737#false} ~cond := #in~cond; {48737#false} is VALID [2022-04-15 15:16:20,057 INFO L290 TraceCheckUtils]: 101: Hoare triple {48737#false} assume 0 == ~cond; {48737#false} is VALID [2022-04-15 15:16:20,057 INFO L290 TraceCheckUtils]: 102: Hoare triple {48737#false} assume !false; {48737#false} is VALID [2022-04-15 15:16:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 236 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:16:20,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:16:20,631 INFO L290 TraceCheckUtils]: 102: Hoare triple {48737#false} assume !false; {48737#false} is VALID [2022-04-15 15:16:20,631 INFO L290 TraceCheckUtils]: 101: Hoare triple {48737#false} assume 0 == ~cond; {48737#false} is VALID [2022-04-15 15:16:20,631 INFO L290 TraceCheckUtils]: 100: Hoare triple {48737#false} ~cond := #in~cond; {48737#false} is VALID [2022-04-15 15:16:20,631 INFO L272 TraceCheckUtils]: 99: Hoare triple {48737#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48737#false} is VALID [2022-04-15 15:16:20,631 INFO L290 TraceCheckUtils]: 98: Hoare triple {49071#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {48737#false} is VALID [2022-04-15 15:16:20,632 INFO L290 TraceCheckUtils]: 97: Hoare triple {49075#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49071#(< |main_#t~post6| 20)} is VALID [2022-04-15 15:16:20,632 INFO L290 TraceCheckUtils]: 96: Hoare triple {49075#(< ~counter~0 20)} assume !(~r~0 < 0); {49075#(< ~counter~0 20)} is VALID [2022-04-15 15:16:20,633 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {48736#true} {49075#(< ~counter~0 20)} #98#return; {49075#(< ~counter~0 20)} is VALID [2022-04-15 15:16:20,633 INFO L290 TraceCheckUtils]: 94: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 15:16:20,633 INFO L290 TraceCheckUtils]: 93: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 15:16:20,633 INFO L290 TraceCheckUtils]: 92: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 15:16:20,633 INFO L272 TraceCheckUtils]: 91: Hoare triple {49075#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 15:16:20,633 INFO L290 TraceCheckUtils]: 90: Hoare triple {49075#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {49075#(< ~counter~0 20)} is VALID [2022-04-15 15:16:20,634 INFO L290 TraceCheckUtils]: 89: Hoare triple {49100#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {49075#(< ~counter~0 20)} is VALID [2022-04-15 15:16:20,635 INFO L290 TraceCheckUtils]: 88: Hoare triple {49100#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {49100#(< ~counter~0 19)} is VALID [2022-04-15 15:16:20,635 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {48736#true} {49100#(< ~counter~0 19)} #98#return; {49100#(< ~counter~0 19)} is VALID [2022-04-15 15:16:20,635 INFO L290 TraceCheckUtils]: 86: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 15:16:20,635 INFO L290 TraceCheckUtils]: 85: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 15:16:20,635 INFO L290 TraceCheckUtils]: 84: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 15:16:20,635 INFO L272 TraceCheckUtils]: 83: Hoare triple {49100#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 15:16:20,636 INFO L290 TraceCheckUtils]: 82: Hoare triple {49100#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {49100#(< ~counter~0 19)} is VALID [2022-04-15 15:16:20,636 INFO L290 TraceCheckUtils]: 81: Hoare triple {49125#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {49100#(< ~counter~0 19)} is VALID [2022-04-15 15:16:20,637 INFO L290 TraceCheckUtils]: 80: Hoare triple {49125#(< ~counter~0 18)} assume !(~r~0 > 0); {49125#(< ~counter~0 18)} is VALID [2022-04-15 15:16:20,637 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48736#true} {49125#(< ~counter~0 18)} #96#return; {49125#(< ~counter~0 18)} is VALID [2022-04-15 15:16:20,637 INFO L290 TraceCheckUtils]: 78: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 15:16:20,637 INFO L290 TraceCheckUtils]: 77: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 15:16:20,637 INFO L290 TraceCheckUtils]: 76: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 15:16:20,637 INFO L272 TraceCheckUtils]: 75: Hoare triple {49125#(< ~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)); {48736#true} is VALID [2022-04-15 15:16:20,638 INFO L290 TraceCheckUtils]: 74: Hoare triple {49125#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {49125#(< ~counter~0 18)} is VALID [2022-04-15 15:16:20,638 INFO L290 TraceCheckUtils]: 73: Hoare triple {49150#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49125#(< ~counter~0 18)} is VALID [2022-04-15 15:16:20,639 INFO L290 TraceCheckUtils]: 72: Hoare triple {49150#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {49150#(< ~counter~0 17)} is VALID [2022-04-15 15:16:20,639 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {48736#true} {49150#(< ~counter~0 17)} #96#return; {49150#(< ~counter~0 17)} is VALID [2022-04-15 15:16:20,639 INFO L290 TraceCheckUtils]: 70: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 15:16:20,639 INFO L290 TraceCheckUtils]: 69: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 15:16:20,639 INFO L290 TraceCheckUtils]: 68: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 15:16:20,639 INFO L272 TraceCheckUtils]: 67: Hoare triple {49150#(< ~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)); {48736#true} is VALID [2022-04-15 15:16:20,640 INFO L290 TraceCheckUtils]: 66: Hoare triple {49150#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {49150#(< ~counter~0 17)} is VALID [2022-04-15 15:16:20,640 INFO L290 TraceCheckUtils]: 65: Hoare triple {49175#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49150#(< ~counter~0 17)} is VALID [2022-04-15 15:16:20,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {49175#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {49175#(< ~counter~0 16)} is VALID [2022-04-15 15:16:20,641 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {48736#true} {49175#(< ~counter~0 16)} #96#return; {49175#(< ~counter~0 16)} is VALID [2022-04-15 15:16:20,641 INFO L290 TraceCheckUtils]: 62: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 15:16:20,641 INFO L290 TraceCheckUtils]: 61: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 15:16:20,641 INFO L290 TraceCheckUtils]: 60: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 15:16:20,641 INFO L272 TraceCheckUtils]: 59: Hoare triple {49175#(< ~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)); {48736#true} is VALID [2022-04-15 15:16:20,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {49175#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {49175#(< ~counter~0 16)} is VALID [2022-04-15 15:16:20,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {49200#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49175#(< ~counter~0 16)} is VALID [2022-04-15 15:16:20,642 INFO L290 TraceCheckUtils]: 56: Hoare triple {49200#(< ~counter~0 15)} assume !!(0 != ~r~0); {49200#(< ~counter~0 15)} is VALID [2022-04-15 15:16:20,643 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48736#true} {49200#(< ~counter~0 15)} #94#return; {49200#(< ~counter~0 15)} is VALID [2022-04-15 15:16:20,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 15:16:20,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 15:16:20,643 INFO L290 TraceCheckUtils]: 52: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 15:16:20,643 INFO L272 TraceCheckUtils]: 51: Hoare triple {49200#(< ~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)); {48736#true} is VALID [2022-04-15 15:16:20,644 INFO L290 TraceCheckUtils]: 50: Hoare triple {49200#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {49200#(< ~counter~0 15)} is VALID [2022-04-15 15:16:20,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {49225#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49200#(< ~counter~0 15)} is VALID [2022-04-15 15:16:20,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {49225#(< ~counter~0 14)} assume !(~r~0 < 0); {49225#(< ~counter~0 14)} is VALID [2022-04-15 15:16:20,645 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {48736#true} {49225#(< ~counter~0 14)} #98#return; {49225#(< ~counter~0 14)} is VALID [2022-04-15 15:16:20,645 INFO L290 TraceCheckUtils]: 46: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 15:16:20,645 INFO L290 TraceCheckUtils]: 45: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 15:16:20,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 15:16:20,645 INFO L272 TraceCheckUtils]: 43: Hoare triple {49225#(< ~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)); {48736#true} is VALID [2022-04-15 15:16:20,646 INFO L290 TraceCheckUtils]: 42: Hoare triple {49225#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {49225#(< ~counter~0 14)} is VALID [2022-04-15 15:16:20,646 INFO L290 TraceCheckUtils]: 41: Hoare triple {49250#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {49225#(< ~counter~0 14)} is VALID [2022-04-15 15:16:20,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {49250#(< ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {49250#(< ~counter~0 13)} is VALID [2022-04-15 15:16:20,647 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {48736#true} {49250#(< ~counter~0 13)} #98#return; {49250#(< ~counter~0 13)} is VALID [2022-04-15 15:16:20,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 15:16:20,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 15:16:20,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 15:16:20,647 INFO L272 TraceCheckUtils]: 35: Hoare triple {49250#(< ~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)); {48736#true} is VALID [2022-04-15 15:16:20,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {49250#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {49250#(< ~counter~0 13)} is VALID [2022-04-15 15:16:20,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {49275#(< ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {49250#(< ~counter~0 13)} is VALID [2022-04-15 15:16:20,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {49275#(< ~counter~0 12)} assume !(~r~0 > 0); {49275#(< ~counter~0 12)} is VALID [2022-04-15 15:16:20,649 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {48736#true} {49275#(< ~counter~0 12)} #96#return; {49275#(< ~counter~0 12)} is VALID [2022-04-15 15:16:20,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 15:16:20,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 15:16:20,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 15:16:20,649 INFO L272 TraceCheckUtils]: 27: Hoare triple {49275#(< ~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)); {48736#true} is VALID [2022-04-15 15:16:20,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {49275#(< ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {49275#(< ~counter~0 12)} is VALID [2022-04-15 15:16:20,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {49018#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49275#(< ~counter~0 12)} is VALID [2022-04-15 15:16:20,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {49018#(<= ~counter~0 10)} assume !!(0 != ~r~0); {49018#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:20,651 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {48736#true} {49018#(<= ~counter~0 10)} #94#return; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:20,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 15:16:20,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 15:16:20,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 15:16:20,651 INFO L272 TraceCheckUtils]: 19: Hoare triple {49018#(<= ~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)); {48736#true} is VALID [2022-04-15 15:16:20,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {49018#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:20,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {48993#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:20,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {48993#(<= ~counter~0 9)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,653 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48736#true} {48993#(<= ~counter~0 9)} #92#return; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 15:16:20,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 15:16:20,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 15:16:20,653 INFO L272 TraceCheckUtils]: 11: Hoare triple {48993#(<= ~counter~0 9)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {48736#true} is VALID [2022-04-15 15:16:20,653 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {48736#true} {48993#(<= ~counter~0 9)} #90#return; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 15:16:20,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 15:16:20,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 15:16:20,654 INFO L272 TraceCheckUtils]: 6: Hoare triple {48993#(<= ~counter~0 9)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 15:16:20,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {48993#(<= ~counter~0 9)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {48993#(<= ~counter~0 9)} call #t~ret9 := main(); {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48993#(<= ~counter~0 9)} {48736#true} #102#return; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {48993#(<= ~counter~0 9)} assume true; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {48736#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:20,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {48736#true} call ULTIMATE.init(); {48736#true} is VALID [2022-04-15 15:16:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 15:16:20,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:16:20,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266644081] [2022-04-15 15:16:20,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:16:20,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634673075] [2022-04-15 15:16:20,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634673075] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:16:20,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:16:20,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-15 15:16:20,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:16:20,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1928916774] [2022-04-15 15:16:20,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1928916774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:16:20,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:16:20,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 15:16:20,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166441372] [2022-04-15 15:16:20,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:16:20,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 103 [2022-04-15 15:16:20,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:16:20,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:16:20,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:20,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 15:16:20,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 15:16:20,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:16:20,746 INFO L87 Difference]: Start difference. First operand 396 states and 504 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:16:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:22,130 INFO L93 Difference]: Finished difference Result 443 states and 565 transitions. [2022-04-15 15:16:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 15:16:22,131 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 103 [2022-04-15 15:16:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:16:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:16:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-15 15:16:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:16:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-15 15:16:22,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 214 transitions. [2022-04-15 15:16:22,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:22,301 INFO L225 Difference]: With dead ends: 443 [2022-04-15 15:16:22,301 INFO L226 Difference]: Without dead ends: 432 [2022-04-15 15:16:22,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=379, Invalid=551, Unknown=0, NotChecked=0, Total=930 [2022-04-15 15:16:22,302 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 153 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:16:22,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 256 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:16:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-04-15 15:16:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 413. [2022-04-15 15:16:22,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:16:22,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 432 states. Second operand has 413 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 315 states have internal predecessors, (366), 82 states have call successors, (82), 24 states have call predecessors, (82), 22 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-15 15:16:22,894 INFO L74 IsIncluded]: Start isIncluded. First operand 432 states. Second operand has 413 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 315 states have internal predecessors, (366), 82 states have call successors, (82), 24 states have call predecessors, (82), 22 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-15 15:16:22,895 INFO L87 Difference]: Start difference. First operand 432 states. Second operand has 413 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 315 states have internal predecessors, (366), 82 states have call successors, (82), 24 states have call predecessors, (82), 22 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-15 15:16:22,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:22,905 INFO L93 Difference]: Finished difference Result 432 states and 550 transitions. [2022-04-15 15:16:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 550 transitions. [2022-04-15 15:16:22,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:22,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:22,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 413 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 315 states have internal predecessors, (366), 82 states have call successors, (82), 24 states have call predecessors, (82), 22 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 432 states. [2022-04-15 15:16:22,907 INFO L87 Difference]: Start difference. First operand has 413 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 315 states have internal predecessors, (366), 82 states have call successors, (82), 24 states have call predecessors, (82), 22 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 432 states. [2022-04-15 15:16:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:22,918 INFO L93 Difference]: Finished difference Result 432 states and 550 transitions. [2022-04-15 15:16:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 550 transitions. [2022-04-15 15:16:22,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:22,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:22,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:16:22,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:16:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 315 states have internal predecessors, (366), 82 states have call successors, (82), 24 states have call predecessors, (82), 22 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-15 15:16:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 528 transitions. [2022-04-15 15:16:22,933 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 528 transitions. Word has length 103 [2022-04-15 15:16:22,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:16:22,934 INFO L478 AbstractCegarLoop]: Abstraction has 413 states and 528 transitions. [2022-04-15 15:16:22,934 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:16:22,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 413 states and 528 transitions. [2022-04-15 15:16:38,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 528 edges. 525 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 528 transitions. [2022-04-15 15:16:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 15:16:38,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:16:38,478 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:16:38,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 15:16:38,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:16:38,679 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:16:38,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:16:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 9 times [2022-04-15 15:16:38,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:38,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1401340053] [2022-04-15 15:16:38,680 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:16:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 10 times [2022-04-15 15:16:38,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:16:38,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166323854] [2022-04-15 15:16:38,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:16:38,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:16:38,693 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:16:38,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1467482081] [2022-04-15 15:16:38,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:16:38,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:16:38,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:16:38,694 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:16:38,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 15:16:38,745 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:16:38,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:16:38,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:16:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:16:38,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:16:39,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {51967#true} call ULTIMATE.init(); {51967#true} is VALID [2022-04-15 15:16:39,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {51967#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51967#true} is VALID [2022-04-15 15:16:39,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51967#true} {51967#true} #102#return; {51967#true} is VALID [2022-04-15 15:16:39,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {51967#true} call #t~ret9 := main(); {51967#true} is VALID [2022-04-15 15:16:39,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {51967#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; {51967#true} is VALID [2022-04-15 15:16:39,630 INFO L272 TraceCheckUtils]: 6: Hoare triple {51967#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51967#true} {51967#true} #90#return; {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L272 TraceCheckUtils]: 11: Hoare triple {51967#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)); {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51967#true} {51967#true} #92#return; {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {51967#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {51967#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {51967#true} assume !!(#t~post6 < 20);havoc #t~post6; {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L272 TraceCheckUtils]: 19: Hoare triple {51967#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)); {51967#true} is VALID [2022-04-15 15:16:39,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51967#true} {51967#true} #94#return; {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {51967#true} assume !!(0 != ~r~0); {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {51967#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {51967#true} assume !!(#t~post7 < 20);havoc #t~post7; {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L272 TraceCheckUtils]: 27: Hoare triple {51967#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)); {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51967#true} {51967#true} #96#return; {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {51967#true} assume !(~r~0 > 0); {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {51967#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {51967#true} assume !!(#t~post8 < 20);havoc #t~post8; {51967#true} is VALID [2022-04-15 15:16:39,632 INFO L272 TraceCheckUtils]: 35: Hoare triple {51967#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)); {51967#true} is VALID [2022-04-15 15:16:39,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:39,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:39,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,633 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51967#true} {51967#true} #98#return; {51967#true} is VALID [2022-04-15 15:16:39,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {51967#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52092#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:16:39,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {52092#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52092#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:16:39,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {52092#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 20);havoc #t~post8; {52092#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:16:39,635 INFO L272 TraceCheckUtils]: 43: Hoare triple {52092#(< (+ 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)); {51967#true} is VALID [2022-04-15 15:16:39,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:39,635 INFO L290 TraceCheckUtils]: 45: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:39,635 INFO L290 TraceCheckUtils]: 46: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,635 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51967#true} {52092#(< (+ main_~r~0 2) main_~u~0)} #98#return; {52092#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:16:39,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {52092#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {52092#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:16:39,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {52092#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52092#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:16:39,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {52092#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 20);havoc #t~post6; {52092#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:16:39,636 INFO L272 TraceCheckUtils]: 51: Hoare triple {52092#(< (+ 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)); {51967#true} is VALID [2022-04-15 15:16:39,637 INFO L290 TraceCheckUtils]: 52: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:39,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:39,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,637 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51967#true} {52092#(< (+ main_~r~0 2) main_~u~0)} #94#return; {52092#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:16:39,637 INFO L290 TraceCheckUtils]: 56: Hoare triple {52092#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {52092#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:16:39,638 INFO L290 TraceCheckUtils]: 57: Hoare triple {52092#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52092#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:16:39,638 INFO L290 TraceCheckUtils]: 58: Hoare triple {52092#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {52092#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:16:39,638 INFO L272 TraceCheckUtils]: 59: Hoare triple {52092#(< (+ 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)); {51967#true} is VALID [2022-04-15 15:16:39,638 INFO L290 TraceCheckUtils]: 60: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:39,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:39,638 INFO L290 TraceCheckUtils]: 62: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,639 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51967#true} {52092#(< (+ main_~r~0 2) main_~u~0)} #96#return; {52092#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:16:39,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {52092#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52165#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 15:16:39,640 INFO L290 TraceCheckUtils]: 65: Hoare triple {52165#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52165#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 15:16:39,640 INFO L290 TraceCheckUtils]: 66: Hoare triple {52165#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {52165#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 15:16:39,640 INFO L272 TraceCheckUtils]: 67: Hoare triple {52165#(< (+ 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)); {51967#true} is VALID [2022-04-15 15:16:39,640 INFO L290 TraceCheckUtils]: 68: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:39,640 INFO L290 TraceCheckUtils]: 69: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:39,640 INFO L290 TraceCheckUtils]: 70: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,641 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51967#true} {52165#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {52165#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 15:16:39,641 INFO L290 TraceCheckUtils]: 72: Hoare triple {52165#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:16:39,642 INFO L290 TraceCheckUtils]: 73: Hoare triple {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:16:39,642 INFO L290 TraceCheckUtils]: 74: Hoare triple {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 20);havoc #t~post7; {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:16:39,642 INFO L272 TraceCheckUtils]: 75: Hoare triple {52190#(< 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)); {51967#true} is VALID [2022-04-15 15:16:39,642 INFO L290 TraceCheckUtils]: 76: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:39,642 INFO L290 TraceCheckUtils]: 77: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:39,642 INFO L290 TraceCheckUtils]: 78: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,643 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51967#true} {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #96#return; {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:16:39,643 INFO L290 TraceCheckUtils]: 80: Hoare triple {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:16:39,643 INFO L290 TraceCheckUtils]: 81: Hoare triple {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:16:39,644 INFO L290 TraceCheckUtils]: 82: Hoare triple {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 20);havoc #t~post8; {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:16:39,644 INFO L272 TraceCheckUtils]: 83: Hoare triple {52190#(< 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)); {51967#true} is VALID [2022-04-15 15:16:39,644 INFO L290 TraceCheckUtils]: 84: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:39,644 INFO L290 TraceCheckUtils]: 85: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:39,644 INFO L290 TraceCheckUtils]: 86: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,644 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51967#true} {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #98#return; {52190#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:16:39,645 INFO L290 TraceCheckUtils]: 88: Hoare triple {52190#(< 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; {52239#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 15:16:39,645 INFO L290 TraceCheckUtils]: 89: Hoare triple {52239#(< 0 (div (+ (- 1) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52239#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 15:16:39,646 INFO L290 TraceCheckUtils]: 90: Hoare triple {52239#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(#t~post8 < 20);havoc #t~post8; {52239#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 15:16:39,646 INFO L272 TraceCheckUtils]: 91: Hoare triple {52239#(< 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)); {51967#true} is VALID [2022-04-15 15:16:39,646 INFO L290 TraceCheckUtils]: 92: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:39,646 INFO L290 TraceCheckUtils]: 93: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:39,646 INFO L290 TraceCheckUtils]: 94: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:39,646 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51967#true} {52239#(< 0 (div (+ (- 1) main_~r~0) 2))} #98#return; {52239#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 15:16:39,647 INFO L290 TraceCheckUtils]: 96: Hoare triple {52239#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51968#false} is VALID [2022-04-15 15:16:39,647 INFO L290 TraceCheckUtils]: 97: Hoare triple {51968#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51968#false} is VALID [2022-04-15 15:16:39,647 INFO L290 TraceCheckUtils]: 98: Hoare triple {51968#false} assume !(#t~post8 < 20);havoc #t~post8; {51968#false} is VALID [2022-04-15 15:16:39,647 INFO L290 TraceCheckUtils]: 99: Hoare triple {51968#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51968#false} is VALID [2022-04-15 15:16:39,647 INFO L290 TraceCheckUtils]: 100: Hoare triple {51968#false} assume !(#t~post6 < 20);havoc #t~post6; {51968#false} is VALID [2022-04-15 15:16:39,648 INFO L272 TraceCheckUtils]: 101: Hoare triple {51968#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51968#false} is VALID [2022-04-15 15:16:39,648 INFO L290 TraceCheckUtils]: 102: Hoare triple {51968#false} ~cond := #in~cond; {51968#false} is VALID [2022-04-15 15:16:39,648 INFO L290 TraceCheckUtils]: 103: Hoare triple {51968#false} assume 0 == ~cond; {51968#false} is VALID [2022-04-15 15:16:39,648 INFO L290 TraceCheckUtils]: 104: Hoare triple {51968#false} assume !false; {51968#false} is VALID [2022-04-15 15:16:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 15:16:39,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:16:40,084 INFO L290 TraceCheckUtils]: 104: Hoare triple {51968#false} assume !false; {51968#false} is VALID [2022-04-15 15:16:40,084 INFO L290 TraceCheckUtils]: 103: Hoare triple {51968#false} assume 0 == ~cond; {51968#false} is VALID [2022-04-15 15:16:40,084 INFO L290 TraceCheckUtils]: 102: Hoare triple {51968#false} ~cond := #in~cond; {51968#false} is VALID [2022-04-15 15:16:40,084 INFO L272 TraceCheckUtils]: 101: Hoare triple {51968#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51968#false} is VALID [2022-04-15 15:16:40,084 INFO L290 TraceCheckUtils]: 100: Hoare triple {51968#false} assume !(#t~post6 < 20);havoc #t~post6; {51968#false} is VALID [2022-04-15 15:16:40,084 INFO L290 TraceCheckUtils]: 99: Hoare triple {51968#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51968#false} is VALID [2022-04-15 15:16:40,084 INFO L290 TraceCheckUtils]: 98: Hoare triple {51968#false} assume !(#t~post8 < 20);havoc #t~post8; {51968#false} is VALID [2022-04-15 15:16:40,084 INFO L290 TraceCheckUtils]: 97: Hoare triple {51968#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51968#false} is VALID [2022-04-15 15:16:40,085 INFO L290 TraceCheckUtils]: 96: Hoare triple {52312#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51968#false} is VALID [2022-04-15 15:16:40,086 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51967#true} {52312#(not (< main_~r~0 0))} #98#return; {52312#(not (< main_~r~0 0))} is VALID [2022-04-15 15:16:40,086 INFO L290 TraceCheckUtils]: 94: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,086 INFO L290 TraceCheckUtils]: 93: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:40,086 INFO L290 TraceCheckUtils]: 92: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:40,086 INFO L272 TraceCheckUtils]: 91: Hoare triple {52312#(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)); {51967#true} is VALID [2022-04-15 15:16:40,087 INFO L290 TraceCheckUtils]: 90: Hoare triple {52312#(not (< main_~r~0 0))} assume !!(#t~post8 < 20);havoc #t~post8; {52312#(not (< main_~r~0 0))} is VALID [2022-04-15 15:16:40,087 INFO L290 TraceCheckUtils]: 89: Hoare triple {52312#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52312#(not (< main_~r~0 0))} is VALID [2022-04-15 15:16:40,088 INFO L290 TraceCheckUtils]: 88: Hoare triple {52337#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52312#(not (< main_~r~0 0))} is VALID [2022-04-15 15:16:40,088 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51967#true} {52337#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {52337#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:16:40,088 INFO L290 TraceCheckUtils]: 86: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,088 INFO L290 TraceCheckUtils]: 85: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:40,088 INFO L290 TraceCheckUtils]: 84: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:40,089 INFO L272 TraceCheckUtils]: 83: Hoare triple {52337#(<= 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)); {51967#true} is VALID [2022-04-15 15:16:40,089 INFO L290 TraceCheckUtils]: 82: Hoare triple {52337#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {52337#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:16:40,089 INFO L290 TraceCheckUtils]: 81: Hoare triple {52337#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52337#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:16:40,090 INFO L290 TraceCheckUtils]: 80: Hoare triple {52337#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {52337#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:16:40,090 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51967#true} {52337#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {52337#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:16:40,090 INFO L290 TraceCheckUtils]: 78: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,090 INFO L290 TraceCheckUtils]: 77: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:40,090 INFO L290 TraceCheckUtils]: 76: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:40,091 INFO L272 TraceCheckUtils]: 75: Hoare triple {52337#(<= 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)); {51967#true} is VALID [2022-04-15 15:16:40,091 INFO L290 TraceCheckUtils]: 74: Hoare triple {52337#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {52337#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:16:40,091 INFO L290 TraceCheckUtils]: 73: Hoare triple {52337#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52337#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:16:40,092 INFO L290 TraceCheckUtils]: 72: Hoare triple {52386#(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; {52337#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:16:40,093 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51967#true} {52386#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {52386#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:16:40,093 INFO L290 TraceCheckUtils]: 70: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,093 INFO L290 TraceCheckUtils]: 69: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:40,093 INFO L290 TraceCheckUtils]: 68: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:40,093 INFO L272 TraceCheckUtils]: 67: Hoare triple {52386#(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)); {51967#true} is VALID [2022-04-15 15:16:40,093 INFO L290 TraceCheckUtils]: 66: Hoare triple {52386#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {52386#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:16:40,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {52386#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52386#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:16:40,095 INFO L290 TraceCheckUtils]: 64: Hoare triple {52411#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52386#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:16:40,096 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51967#true} {52411#(<= main_~r~0 main_~u~0)} #96#return; {52411#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:16:40,096 INFO L290 TraceCheckUtils]: 62: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,096 INFO L290 TraceCheckUtils]: 61: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:40,096 INFO L290 TraceCheckUtils]: 60: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:40,096 INFO L272 TraceCheckUtils]: 59: Hoare triple {52411#(<= 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)); {51967#true} is VALID [2022-04-15 15:16:40,096 INFO L290 TraceCheckUtils]: 58: Hoare triple {52411#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {52411#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:16:40,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {52411#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52411#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:16:40,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {52411#(<= main_~r~0 main_~u~0)} assume !!(0 != ~r~0); {52411#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:16:40,098 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51967#true} {52411#(<= main_~r~0 main_~u~0)} #94#return; {52411#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:16:40,098 INFO L290 TraceCheckUtils]: 54: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,098 INFO L290 TraceCheckUtils]: 53: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:40,098 INFO L290 TraceCheckUtils]: 52: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:40,098 INFO L272 TraceCheckUtils]: 51: Hoare triple {52411#(<= 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)); {51967#true} is VALID [2022-04-15 15:16:40,098 INFO L290 TraceCheckUtils]: 50: Hoare triple {52411#(<= main_~r~0 main_~u~0)} assume !!(#t~post6 < 20);havoc #t~post6; {52411#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:16:40,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {52411#(<= main_~r~0 main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52411#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:16:40,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {52411#(<= main_~r~0 main_~u~0)} assume !(~r~0 < 0); {52411#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:16:40,100 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51967#true} {52411#(<= main_~r~0 main_~u~0)} #98#return; {52411#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:16:40,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,100 INFO L290 TraceCheckUtils]: 45: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:40,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:40,100 INFO L272 TraceCheckUtils]: 43: Hoare triple {52411#(<= 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)); {51967#true} is VALID [2022-04-15 15:16:40,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {52411#(<= main_~r~0 main_~u~0)} assume !!(#t~post8 < 20);havoc #t~post8; {52411#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:16:40,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {52411#(<= main_~r~0 main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52411#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:16:40,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {51967#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52411#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:16:40,102 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51967#true} {51967#true} #98#return; {51967#true} is VALID [2022-04-15 15:16:40,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:40,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:40,102 INFO L272 TraceCheckUtils]: 35: Hoare triple {51967#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)); {51967#true} is VALID [2022-04-15 15:16:40,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {51967#true} assume !!(#t~post8 < 20);havoc #t~post8; {51967#true} is VALID [2022-04-15 15:16:40,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {51967#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51967#true} is VALID [2022-04-15 15:16:40,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {51967#true} assume !(~r~0 > 0); {51967#true} is VALID [2022-04-15 15:16:40,103 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51967#true} {51967#true} #96#return; {51967#true} is VALID [2022-04-15 15:16:40,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:40,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:40,103 INFO L272 TraceCheckUtils]: 27: Hoare triple {51967#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)); {51967#true} is VALID [2022-04-15 15:16:40,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {51967#true} assume !!(#t~post7 < 20);havoc #t~post7; {51967#true} is VALID [2022-04-15 15:16:40,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {51967#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51967#true} is VALID [2022-04-15 15:16:40,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {51967#true} assume !!(0 != ~r~0); {51967#true} is VALID [2022-04-15 15:16:40,103 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51967#true} {51967#true} #94#return; {51967#true} is VALID [2022-04-15 15:16:40,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:40,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:40,104 INFO L272 TraceCheckUtils]: 19: Hoare triple {51967#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)); {51967#true} is VALID [2022-04-15 15:16:40,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {51967#true} assume !!(#t~post6 < 20);havoc #t~post6; {51967#true} is VALID [2022-04-15 15:16:40,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {51967#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51967#true} is VALID [2022-04-15 15:16:40,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {51967#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51967#true} is VALID [2022-04-15 15:16:40,104 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51967#true} {51967#true} #92#return; {51967#true} is VALID [2022-04-15 15:16:40,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:40,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:40,104 INFO L272 TraceCheckUtils]: 11: Hoare triple {51967#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)); {51967#true} is VALID [2022-04-15 15:16:40,105 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51967#true} {51967#true} #90#return; {51967#true} is VALID [2022-04-15 15:16:40,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {51967#true} assume !(0 == ~cond); {51967#true} is VALID [2022-04-15 15:16:40,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {51967#true} ~cond := #in~cond; {51967#true} is VALID [2022-04-15 15:16:40,105 INFO L272 TraceCheckUtils]: 6: Hoare triple {51967#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51967#true} is VALID [2022-04-15 15:16:40,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {51967#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; {51967#true} is VALID [2022-04-15 15:16:40,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {51967#true} call #t~ret9 := main(); {51967#true} is VALID [2022-04-15 15:16:40,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51967#true} {51967#true} #102#return; {51967#true} is VALID [2022-04-15 15:16:40,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {51967#true} assume true; {51967#true} is VALID [2022-04-15 15:16:40,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {51967#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51967#true} is VALID [2022-04-15 15:16:40,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {51967#true} call ULTIMATE.init(); {51967#true} is VALID [2022-04-15 15:16:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 15:16:40,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:16:40,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166323854] [2022-04-15 15:16:40,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:16:40,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467482081] [2022-04-15 15:16:40,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467482081] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:16:40,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:16:40,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 15:16:40,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:16:40,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1401340053] [2022-04-15 15:16:40,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1401340053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:16:40,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:16:40,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:16:40,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340911700] [2022-04-15 15:16:40,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:16:40,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-15 15:16:40,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:16:40,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 15:16:40,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:40,183 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:16:40,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:40,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:16:40,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:16:40,183 INFO L87 Difference]: Start difference. First operand 413 states and 528 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 15:16:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:42,003 INFO L93 Difference]: Finished difference Result 685 states and 934 transitions. [2022-04-15 15:16:42,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 15:16:42,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-15 15:16:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:16:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 15:16:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-15 15:16:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 15:16:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-15 15:16:42,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 171 transitions. [2022-04-15 15:16:42,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:42,173 INFO L225 Difference]: With dead ends: 685 [2022-04-15 15:16:42,173 INFO L226 Difference]: Without dead ends: 624 [2022-04-15 15:16:42,174 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 15:16:42,174 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 36 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:16:42,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 287 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:16:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-04-15 15:16:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 540. [2022-04-15 15:16:43,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:16:43,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 624 states. Second operand has 540 states, 403 states have (on average 1.2307692307692308) internal successors, (496), 413 states have internal predecessors, (496), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:16:43,251 INFO L74 IsIncluded]: Start isIncluded. First operand 624 states. Second operand has 540 states, 403 states have (on average 1.2307692307692308) internal successors, (496), 413 states have internal predecessors, (496), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:16:43,252 INFO L87 Difference]: Start difference. First operand 624 states. Second operand has 540 states, 403 states have (on average 1.2307692307692308) internal successors, (496), 413 states have internal predecessors, (496), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:16:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:43,266 INFO L93 Difference]: Finished difference Result 624 states and 843 transitions. [2022-04-15 15:16:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 843 transitions. [2022-04-15 15:16:43,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:43,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:43,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 540 states, 403 states have (on average 1.2307692307692308) internal successors, (496), 413 states have internal predecessors, (496), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 624 states. [2022-04-15 15:16:43,268 INFO L87 Difference]: Start difference. First operand has 540 states, 403 states have (on average 1.2307692307692308) internal successors, (496), 413 states have internal predecessors, (496), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 624 states. [2022-04-15 15:16:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:43,289 INFO L93 Difference]: Finished difference Result 624 states and 843 transitions. [2022-04-15 15:16:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 843 transitions. [2022-04-15 15:16:43,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:43,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:43,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:16:43,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:16:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 403 states have (on average 1.2307692307692308) internal successors, (496), 413 states have internal predecessors, (496), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:16:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 722 transitions. [2022-04-15 15:16:43,313 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 722 transitions. Word has length 105 [2022-04-15 15:16:43,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:16:43,313 INFO L478 AbstractCegarLoop]: Abstraction has 540 states and 722 transitions. [2022-04-15 15:16:43,314 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 15:16:43,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 540 states and 722 transitions. [2022-04-15 15:16:59,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 722 edges. 720 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 722 transitions. [2022-04-15 15:16:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 15:16:59,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:16:59,592 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:16:59,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 15:16:59,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:16:59,795 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:16:59,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:16:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 11 times [2022-04-15 15:16:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:59,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1932571508] [2022-04-15 15:16:59,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:16:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 12 times [2022-04-15 15:16:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:16:59,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890885005] [2022-04-15 15:16:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:16:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:16:59,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:16:59,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1918707140] [2022-04-15 15:16:59,808 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:16:59,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:16:59,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:16:59,809 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:16:59,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 15:16:59,937 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 15:16:59,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:16:59,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 15:16:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:16:59,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:17:00,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {56310#true} call ULTIMATE.init(); {56310#true} is VALID [2022-04-15 15:17:00,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {56310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {56318#(<= ~counter~0 0)} assume true; {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56318#(<= ~counter~0 0)} {56310#true} #102#return; {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {56318#(<= ~counter~0 0)} call #t~ret9 := main(); {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {56318#(<= ~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; {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,471 INFO L272 TraceCheckUtils]: 6: Hoare triple {56318#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {56318#(<= ~counter~0 0)} ~cond := #in~cond; {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {56318#(<= ~counter~0 0)} assume !(0 == ~cond); {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {56318#(<= ~counter~0 0)} assume true; {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,472 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56318#(<= ~counter~0 0)} {56318#(<= ~counter~0 0)} #90#return; {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,473 INFO L272 TraceCheckUtils]: 11: Hoare triple {56318#(<= ~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)); {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {56318#(<= ~counter~0 0)} ~cond := #in~cond; {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {56318#(<= ~counter~0 0)} assume !(0 == ~cond); {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {56318#(<= ~counter~0 0)} assume true; {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,474 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56318#(<= ~counter~0 0)} {56318#(<= ~counter~0 0)} #92#return; {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {56318#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56318#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:00,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {56318#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56367#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:00,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {56367#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {56367#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:00,476 INFO L272 TraceCheckUtils]: 19: Hoare triple {56367#(<= ~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)); {56367#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:00,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {56367#(<= ~counter~0 1)} ~cond := #in~cond; {56367#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:00,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {56367#(<= ~counter~0 1)} assume !(0 == ~cond); {56367#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:00,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {56367#(<= ~counter~0 1)} assume true; {56367#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:00,478 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56367#(<= ~counter~0 1)} {56367#(<= ~counter~0 1)} #94#return; {56367#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:00,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {56367#(<= ~counter~0 1)} assume !!(0 != ~r~0); {56367#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:00,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {56367#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56392#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:00,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {56392#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {56392#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:00,479 INFO L272 TraceCheckUtils]: 27: Hoare triple {56392#(<= ~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)); {56392#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:00,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {56392#(<= ~counter~0 2)} ~cond := #in~cond; {56392#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:00,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {56392#(<= ~counter~0 2)} assume !(0 == ~cond); {56392#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:00,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {56392#(<= ~counter~0 2)} assume true; {56392#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:00,481 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56392#(<= ~counter~0 2)} {56392#(<= ~counter~0 2)} #96#return; {56392#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:00,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {56392#(<= ~counter~0 2)} assume !(~r~0 > 0); {56392#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:00,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {56392#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56417#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:00,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {56417#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {56417#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:00,482 INFO L272 TraceCheckUtils]: 35: Hoare triple {56417#(<= ~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)); {56417#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:00,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {56417#(<= ~counter~0 3)} ~cond := #in~cond; {56417#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:00,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {56417#(<= ~counter~0 3)} assume !(0 == ~cond); {56417#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:00,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {56417#(<= ~counter~0 3)} assume true; {56417#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:00,484 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56417#(<= ~counter~0 3)} {56417#(<= ~counter~0 3)} #98#return; {56417#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:00,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {56417#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56417#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:00,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {56417#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56442#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:00,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {56442#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {56442#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:00,486 INFO L272 TraceCheckUtils]: 43: Hoare triple {56442#(<= ~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)); {56442#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:00,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {56442#(<= ~counter~0 4)} ~cond := #in~cond; {56442#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:00,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {56442#(<= ~counter~0 4)} assume !(0 == ~cond); {56442#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:00,486 INFO L290 TraceCheckUtils]: 46: Hoare triple {56442#(<= ~counter~0 4)} assume true; {56442#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:00,487 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56442#(<= ~counter~0 4)} {56442#(<= ~counter~0 4)} #98#return; {56442#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:00,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {56442#(<= ~counter~0 4)} assume !(~r~0 < 0); {56442#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:00,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {56442#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56467#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:00,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {56467#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {56467#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:00,489 INFO L272 TraceCheckUtils]: 51: Hoare triple {56467#(<= ~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)); {56467#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:00,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {56467#(<= ~counter~0 5)} ~cond := #in~cond; {56467#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:00,489 INFO L290 TraceCheckUtils]: 53: Hoare triple {56467#(<= ~counter~0 5)} assume !(0 == ~cond); {56467#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:00,489 INFO L290 TraceCheckUtils]: 54: Hoare triple {56467#(<= ~counter~0 5)} assume true; {56467#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:00,490 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56467#(<= ~counter~0 5)} {56467#(<= ~counter~0 5)} #94#return; {56467#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:00,490 INFO L290 TraceCheckUtils]: 56: Hoare triple {56467#(<= ~counter~0 5)} assume !!(0 != ~r~0); {56467#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:00,491 INFO L290 TraceCheckUtils]: 57: Hoare triple {56467#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56492#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:00,491 INFO L290 TraceCheckUtils]: 58: Hoare triple {56492#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {56492#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:00,492 INFO L272 TraceCheckUtils]: 59: Hoare triple {56492#(<= ~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)); {56492#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:00,492 INFO L290 TraceCheckUtils]: 60: Hoare triple {56492#(<= ~counter~0 6)} ~cond := #in~cond; {56492#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:00,492 INFO L290 TraceCheckUtils]: 61: Hoare triple {56492#(<= ~counter~0 6)} assume !(0 == ~cond); {56492#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:00,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {56492#(<= ~counter~0 6)} assume true; {56492#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:00,493 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56492#(<= ~counter~0 6)} {56492#(<= ~counter~0 6)} #96#return; {56492#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:00,493 INFO L290 TraceCheckUtils]: 64: Hoare triple {56492#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56492#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:00,494 INFO L290 TraceCheckUtils]: 65: Hoare triple {56492#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56517#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:00,494 INFO L290 TraceCheckUtils]: 66: Hoare triple {56517#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {56517#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:00,495 INFO L272 TraceCheckUtils]: 67: Hoare triple {56517#(<= ~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)); {56517#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:00,495 INFO L290 TraceCheckUtils]: 68: Hoare triple {56517#(<= ~counter~0 7)} ~cond := #in~cond; {56517#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:00,495 INFO L290 TraceCheckUtils]: 69: Hoare triple {56517#(<= ~counter~0 7)} assume !(0 == ~cond); {56517#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:00,496 INFO L290 TraceCheckUtils]: 70: Hoare triple {56517#(<= ~counter~0 7)} assume true; {56517#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:00,496 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56517#(<= ~counter~0 7)} {56517#(<= ~counter~0 7)} #96#return; {56517#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:00,496 INFO L290 TraceCheckUtils]: 72: Hoare triple {56517#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56517#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:00,497 INFO L290 TraceCheckUtils]: 73: Hoare triple {56517#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56542#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:00,497 INFO L290 TraceCheckUtils]: 74: Hoare triple {56542#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {56542#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:00,498 INFO L272 TraceCheckUtils]: 75: Hoare triple {56542#(<= ~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)); {56542#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:00,498 INFO L290 TraceCheckUtils]: 76: Hoare triple {56542#(<= ~counter~0 8)} ~cond := #in~cond; {56542#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:00,498 INFO L290 TraceCheckUtils]: 77: Hoare triple {56542#(<= ~counter~0 8)} assume !(0 == ~cond); {56542#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:00,499 INFO L290 TraceCheckUtils]: 78: Hoare triple {56542#(<= ~counter~0 8)} assume true; {56542#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:00,499 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56542#(<= ~counter~0 8)} {56542#(<= ~counter~0 8)} #96#return; {56542#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:00,499 INFO L290 TraceCheckUtils]: 80: Hoare triple {56542#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56542#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:00,500 INFO L290 TraceCheckUtils]: 81: Hoare triple {56542#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:00,500 INFO L290 TraceCheckUtils]: 82: Hoare triple {56567#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:00,501 INFO L272 TraceCheckUtils]: 83: Hoare triple {56567#(<= ~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)); {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:00,501 INFO L290 TraceCheckUtils]: 84: Hoare triple {56567#(<= ~counter~0 9)} ~cond := #in~cond; {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:00,501 INFO L290 TraceCheckUtils]: 85: Hoare triple {56567#(<= ~counter~0 9)} assume !(0 == ~cond); {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:00,502 INFO L290 TraceCheckUtils]: 86: Hoare triple {56567#(<= ~counter~0 9)} assume true; {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:00,502 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56567#(<= ~counter~0 9)} {56567#(<= ~counter~0 9)} #96#return; {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:00,502 INFO L290 TraceCheckUtils]: 88: Hoare triple {56567#(<= ~counter~0 9)} assume !(~r~0 > 0); {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:00,503 INFO L290 TraceCheckUtils]: 89: Hoare triple {56567#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56592#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:00,503 INFO L290 TraceCheckUtils]: 90: Hoare triple {56592#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {56592#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:00,504 INFO L272 TraceCheckUtils]: 91: Hoare triple {56592#(<= ~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)); {56592#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:00,504 INFO L290 TraceCheckUtils]: 92: Hoare triple {56592#(<= ~counter~0 10)} ~cond := #in~cond; {56592#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:00,504 INFO L290 TraceCheckUtils]: 93: Hoare triple {56592#(<= ~counter~0 10)} assume !(0 == ~cond); {56592#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:00,505 INFO L290 TraceCheckUtils]: 94: Hoare triple {56592#(<= ~counter~0 10)} assume true; {56592#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:00,505 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56592#(<= ~counter~0 10)} {56592#(<= ~counter~0 10)} #98#return; {56592#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:00,506 INFO L290 TraceCheckUtils]: 96: Hoare triple {56592#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56592#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:00,506 INFO L290 TraceCheckUtils]: 97: Hoare triple {56592#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56617#(<= |main_#t~post8| 10)} is VALID [2022-04-15 15:17:00,506 INFO L290 TraceCheckUtils]: 98: Hoare triple {56617#(<= |main_#t~post8| 10)} assume !(#t~post8 < 20);havoc #t~post8; {56311#false} is VALID [2022-04-15 15:17:00,506 INFO L290 TraceCheckUtils]: 99: Hoare triple {56311#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56311#false} is VALID [2022-04-15 15:17:00,506 INFO L290 TraceCheckUtils]: 100: Hoare triple {56311#false} assume !(#t~post6 < 20);havoc #t~post6; {56311#false} is VALID [2022-04-15 15:17:00,506 INFO L272 TraceCheckUtils]: 101: Hoare triple {56311#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56311#false} is VALID [2022-04-15 15:17:00,506 INFO L290 TraceCheckUtils]: 102: Hoare triple {56311#false} ~cond := #in~cond; {56311#false} is VALID [2022-04-15 15:17:00,507 INFO L290 TraceCheckUtils]: 103: Hoare triple {56311#false} assume 0 == ~cond; {56311#false} is VALID [2022-04-15 15:17:00,507 INFO L290 TraceCheckUtils]: 104: Hoare triple {56311#false} assume !false; {56311#false} is VALID [2022-04-15 15:17:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 242 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:17:00,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:17:01,076 INFO L290 TraceCheckUtils]: 104: Hoare triple {56311#false} assume !false; {56311#false} is VALID [2022-04-15 15:17:01,077 INFO L290 TraceCheckUtils]: 103: Hoare triple {56311#false} assume 0 == ~cond; {56311#false} is VALID [2022-04-15 15:17:01,077 INFO L290 TraceCheckUtils]: 102: Hoare triple {56311#false} ~cond := #in~cond; {56311#false} is VALID [2022-04-15 15:17:01,077 INFO L272 TraceCheckUtils]: 101: Hoare triple {56311#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56311#false} is VALID [2022-04-15 15:17:01,077 INFO L290 TraceCheckUtils]: 100: Hoare triple {56311#false} assume !(#t~post6 < 20);havoc #t~post6; {56311#false} is VALID [2022-04-15 15:17:01,077 INFO L290 TraceCheckUtils]: 99: Hoare triple {56311#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56311#false} is VALID [2022-04-15 15:17:01,077 INFO L290 TraceCheckUtils]: 98: Hoare triple {56657#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {56311#false} is VALID [2022-04-15 15:17:01,078 INFO L290 TraceCheckUtils]: 97: Hoare triple {56661#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56657#(< |main_#t~post8| 20)} is VALID [2022-04-15 15:17:01,078 INFO L290 TraceCheckUtils]: 96: Hoare triple {56661#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56661#(< ~counter~0 20)} is VALID [2022-04-15 15:17:01,078 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56310#true} {56661#(< ~counter~0 20)} #98#return; {56661#(< ~counter~0 20)} is VALID [2022-04-15 15:17:01,079 INFO L290 TraceCheckUtils]: 94: Hoare triple {56310#true} assume true; {56310#true} is VALID [2022-04-15 15:17:01,079 INFO L290 TraceCheckUtils]: 93: Hoare triple {56310#true} assume !(0 == ~cond); {56310#true} is VALID [2022-04-15 15:17:01,079 INFO L290 TraceCheckUtils]: 92: Hoare triple {56310#true} ~cond := #in~cond; {56310#true} is VALID [2022-04-15 15:17:01,079 INFO L272 TraceCheckUtils]: 91: Hoare triple {56661#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56310#true} is VALID [2022-04-15 15:17:01,079 INFO L290 TraceCheckUtils]: 90: Hoare triple {56661#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {56661#(< ~counter~0 20)} is VALID [2022-04-15 15:17:01,080 INFO L290 TraceCheckUtils]: 89: Hoare triple {56686#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56661#(< ~counter~0 20)} is VALID [2022-04-15 15:17:01,080 INFO L290 TraceCheckUtils]: 88: Hoare triple {56686#(< ~counter~0 19)} assume !(~r~0 > 0); {56686#(< ~counter~0 19)} is VALID [2022-04-15 15:17:01,081 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56310#true} {56686#(< ~counter~0 19)} #96#return; {56686#(< ~counter~0 19)} is VALID [2022-04-15 15:17:01,081 INFO L290 TraceCheckUtils]: 86: Hoare triple {56310#true} assume true; {56310#true} is VALID [2022-04-15 15:17:01,081 INFO L290 TraceCheckUtils]: 85: Hoare triple {56310#true} assume !(0 == ~cond); {56310#true} is VALID [2022-04-15 15:17:01,081 INFO L290 TraceCheckUtils]: 84: Hoare triple {56310#true} ~cond := #in~cond; {56310#true} is VALID [2022-04-15 15:17:01,081 INFO L272 TraceCheckUtils]: 83: Hoare triple {56686#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56310#true} is VALID [2022-04-15 15:17:01,082 INFO L290 TraceCheckUtils]: 82: Hoare triple {56686#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {56686#(< ~counter~0 19)} is VALID [2022-04-15 15:17:01,082 INFO L290 TraceCheckUtils]: 81: Hoare triple {56711#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56686#(< ~counter~0 19)} is VALID [2022-04-15 15:17:01,082 INFO L290 TraceCheckUtils]: 80: Hoare triple {56711#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56711#(< ~counter~0 18)} is VALID [2022-04-15 15:17:01,083 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56310#true} {56711#(< ~counter~0 18)} #96#return; {56711#(< ~counter~0 18)} is VALID [2022-04-15 15:17:01,083 INFO L290 TraceCheckUtils]: 78: Hoare triple {56310#true} assume true; {56310#true} is VALID [2022-04-15 15:17:01,083 INFO L290 TraceCheckUtils]: 77: Hoare triple {56310#true} assume !(0 == ~cond); {56310#true} is VALID [2022-04-15 15:17:01,083 INFO L290 TraceCheckUtils]: 76: Hoare triple {56310#true} ~cond := #in~cond; {56310#true} is VALID [2022-04-15 15:17:01,083 INFO L272 TraceCheckUtils]: 75: Hoare triple {56711#(< ~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)); {56310#true} is VALID [2022-04-15 15:17:01,084 INFO L290 TraceCheckUtils]: 74: Hoare triple {56711#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {56711#(< ~counter~0 18)} is VALID [2022-04-15 15:17:01,084 INFO L290 TraceCheckUtils]: 73: Hoare triple {56736#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56711#(< ~counter~0 18)} is VALID [2022-04-15 15:17:01,085 INFO L290 TraceCheckUtils]: 72: Hoare triple {56736#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56736#(< ~counter~0 17)} is VALID [2022-04-15 15:17:01,085 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56310#true} {56736#(< ~counter~0 17)} #96#return; {56736#(< ~counter~0 17)} is VALID [2022-04-15 15:17:01,085 INFO L290 TraceCheckUtils]: 70: Hoare triple {56310#true} assume true; {56310#true} is VALID [2022-04-15 15:17:01,085 INFO L290 TraceCheckUtils]: 69: Hoare triple {56310#true} assume !(0 == ~cond); {56310#true} is VALID [2022-04-15 15:17:01,085 INFO L290 TraceCheckUtils]: 68: Hoare triple {56310#true} ~cond := #in~cond; {56310#true} is VALID [2022-04-15 15:17:01,085 INFO L272 TraceCheckUtils]: 67: Hoare triple {56736#(< ~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)); {56310#true} is VALID [2022-04-15 15:17:01,086 INFO L290 TraceCheckUtils]: 66: Hoare triple {56736#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {56736#(< ~counter~0 17)} is VALID [2022-04-15 15:17:01,086 INFO L290 TraceCheckUtils]: 65: Hoare triple {56761#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56736#(< ~counter~0 17)} is VALID [2022-04-15 15:17:01,087 INFO L290 TraceCheckUtils]: 64: Hoare triple {56761#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56761#(< ~counter~0 16)} is VALID [2022-04-15 15:17:01,087 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56310#true} {56761#(< ~counter~0 16)} #96#return; {56761#(< ~counter~0 16)} is VALID [2022-04-15 15:17:01,087 INFO L290 TraceCheckUtils]: 62: Hoare triple {56310#true} assume true; {56310#true} is VALID [2022-04-15 15:17:01,087 INFO L290 TraceCheckUtils]: 61: Hoare triple {56310#true} assume !(0 == ~cond); {56310#true} is VALID [2022-04-15 15:17:01,087 INFO L290 TraceCheckUtils]: 60: Hoare triple {56310#true} ~cond := #in~cond; {56310#true} is VALID [2022-04-15 15:17:01,087 INFO L272 TraceCheckUtils]: 59: Hoare triple {56761#(< ~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)); {56310#true} is VALID [2022-04-15 15:17:01,088 INFO L290 TraceCheckUtils]: 58: Hoare triple {56761#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {56761#(< ~counter~0 16)} is VALID [2022-04-15 15:17:01,088 INFO L290 TraceCheckUtils]: 57: Hoare triple {56786#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56761#(< ~counter~0 16)} is VALID [2022-04-15 15:17:01,089 INFO L290 TraceCheckUtils]: 56: Hoare triple {56786#(< ~counter~0 15)} assume !!(0 != ~r~0); {56786#(< ~counter~0 15)} is VALID [2022-04-15 15:17:01,089 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56310#true} {56786#(< ~counter~0 15)} #94#return; {56786#(< ~counter~0 15)} is VALID [2022-04-15 15:17:01,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {56310#true} assume true; {56310#true} is VALID [2022-04-15 15:17:01,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {56310#true} assume !(0 == ~cond); {56310#true} is VALID [2022-04-15 15:17:01,089 INFO L290 TraceCheckUtils]: 52: Hoare triple {56310#true} ~cond := #in~cond; {56310#true} is VALID [2022-04-15 15:17:01,089 INFO L272 TraceCheckUtils]: 51: Hoare triple {56786#(< ~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)); {56310#true} is VALID [2022-04-15 15:17:01,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {56786#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {56786#(< ~counter~0 15)} is VALID [2022-04-15 15:17:01,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {56811#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56786#(< ~counter~0 15)} is VALID [2022-04-15 15:17:01,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {56811#(< ~counter~0 14)} assume !(~r~0 < 0); {56811#(< ~counter~0 14)} is VALID [2022-04-15 15:17:01,091 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56310#true} {56811#(< ~counter~0 14)} #98#return; {56811#(< ~counter~0 14)} is VALID [2022-04-15 15:17:01,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {56310#true} assume true; {56310#true} is VALID [2022-04-15 15:17:01,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {56310#true} assume !(0 == ~cond); {56310#true} is VALID [2022-04-15 15:17:01,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {56310#true} ~cond := #in~cond; {56310#true} is VALID [2022-04-15 15:17:01,091 INFO L272 TraceCheckUtils]: 43: Hoare triple {56811#(< ~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)); {56310#true} is VALID [2022-04-15 15:17:01,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {56811#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {56811#(< ~counter~0 14)} is VALID [2022-04-15 15:17:01,092 INFO L290 TraceCheckUtils]: 41: Hoare triple {56836#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56811#(< ~counter~0 14)} is VALID [2022-04-15 15:17:01,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {56836#(< ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56836#(< ~counter~0 13)} is VALID [2022-04-15 15:17:01,093 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56310#true} {56836#(< ~counter~0 13)} #98#return; {56836#(< ~counter~0 13)} is VALID [2022-04-15 15:17:01,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {56310#true} assume true; {56310#true} is VALID [2022-04-15 15:17:01,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {56310#true} assume !(0 == ~cond); {56310#true} is VALID [2022-04-15 15:17:01,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {56310#true} ~cond := #in~cond; {56310#true} is VALID [2022-04-15 15:17:01,093 INFO L272 TraceCheckUtils]: 35: Hoare triple {56836#(< ~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)); {56310#true} is VALID [2022-04-15 15:17:01,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {56836#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {56836#(< ~counter~0 13)} is VALID [2022-04-15 15:17:01,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {56861#(< ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56836#(< ~counter~0 13)} is VALID [2022-04-15 15:17:01,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {56861#(< ~counter~0 12)} assume !(~r~0 > 0); {56861#(< ~counter~0 12)} is VALID [2022-04-15 15:17:01,095 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56310#true} {56861#(< ~counter~0 12)} #96#return; {56861#(< ~counter~0 12)} is VALID [2022-04-15 15:17:01,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {56310#true} assume true; {56310#true} is VALID [2022-04-15 15:17:01,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {56310#true} assume !(0 == ~cond); {56310#true} is VALID [2022-04-15 15:17:01,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {56310#true} ~cond := #in~cond; {56310#true} is VALID [2022-04-15 15:17:01,095 INFO L272 TraceCheckUtils]: 27: Hoare triple {56861#(< ~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)); {56310#true} is VALID [2022-04-15 15:17:01,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {56861#(< ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {56861#(< ~counter~0 12)} is VALID [2022-04-15 15:17:01,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {56592#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56861#(< ~counter~0 12)} is VALID [2022-04-15 15:17:01,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {56592#(<= ~counter~0 10)} assume !!(0 != ~r~0); {56592#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:01,097 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56310#true} {56592#(<= ~counter~0 10)} #94#return; {56592#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:01,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {56310#true} assume true; {56310#true} is VALID [2022-04-15 15:17:01,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {56310#true} assume !(0 == ~cond); {56310#true} is VALID [2022-04-15 15:17:01,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {56310#true} ~cond := #in~cond; {56310#true} is VALID [2022-04-15 15:17:01,097 INFO L272 TraceCheckUtils]: 19: Hoare triple {56592#(<= ~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)); {56310#true} is VALID [2022-04-15 15:17:01,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {56592#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {56592#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:01,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {56567#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56592#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:01,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {56567#(<= ~counter~0 9)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:01,099 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56310#true} {56567#(<= ~counter~0 9)} #92#return; {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:01,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {56310#true} assume true; {56310#true} is VALID [2022-04-15 15:17:01,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {56310#true} assume !(0 == ~cond); {56310#true} is VALID [2022-04-15 15:17:01,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {56310#true} ~cond := #in~cond; {56310#true} is VALID [2022-04-15 15:17:01,099 INFO L272 TraceCheckUtils]: 11: Hoare triple {56567#(<= ~counter~0 9)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {56310#true} is VALID [2022-04-15 15:17:01,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56310#true} {56567#(<= ~counter~0 9)} #90#return; {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:01,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {56310#true} assume true; {56310#true} is VALID [2022-04-15 15:17:01,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {56310#true} assume !(0 == ~cond); {56310#true} is VALID [2022-04-15 15:17:01,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {56310#true} ~cond := #in~cond; {56310#true} is VALID [2022-04-15 15:17:01,100 INFO L272 TraceCheckUtils]: 6: Hoare triple {56567#(<= ~counter~0 9)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {56310#true} is VALID [2022-04-15 15:17:01,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {56567#(<= ~counter~0 9)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:01,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {56567#(<= ~counter~0 9)} call #t~ret9 := main(); {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:01,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56567#(<= ~counter~0 9)} {56310#true} #102#return; {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:01,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {56567#(<= ~counter~0 9)} assume true; {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:01,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {56310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {56567#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:01,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {56310#true} call ULTIMATE.init(); {56310#true} is VALID [2022-04-15 15:17:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 15:17:01,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:17:01,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890885005] [2022-04-15 15:17:01,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:17:01,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918707140] [2022-04-15 15:17:01,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918707140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:17:01,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:17:01,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-15 15:17:01,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:17:01,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1932571508] [2022-04-15 15:17:01,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1932571508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:17:01,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:17:01,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 15:17:01,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916436335] [2022-04-15 15:17:01,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:17:01,104 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 105 [2022-04-15 15:17:01,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:17:01,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:17:01,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:01,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 15:17:01,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:17:01,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 15:17:01,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:17:01,182 INFO L87 Difference]: Start difference. First operand 540 states and 722 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:17:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:17:02,991 INFO L93 Difference]: Finished difference Result 793 states and 1103 transitions. [2022-04-15 15:17:02,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 15:17:02,991 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 105 [2022-04-15 15:17:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:17:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:17:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-15 15:17:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:17:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-15 15:17:02,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 236 transitions. [2022-04-15 15:17:03,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:03,202 INFO L225 Difference]: With dead ends: 793 [2022-04-15 15:17:03,202 INFO L226 Difference]: Without dead ends: 568 [2022-04-15 15:17:03,203 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=404, Invalid=588, Unknown=0, NotChecked=0, Total=992 [2022-04-15 15:17:03,203 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 125 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:17:03,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 265 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:17:03,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-04-15 15:17:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 558. [2022-04-15 15:17:04,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:17:04,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 568 states. Second operand has 558 states, 421 states have (on average 1.2304038004750595) internal successors, (518), 425 states have internal predecessors, (518), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:17:04,264 INFO L74 IsIncluded]: Start isIncluded. First operand 568 states. Second operand has 558 states, 421 states have (on average 1.2304038004750595) internal successors, (518), 425 states have internal predecessors, (518), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:17:04,264 INFO L87 Difference]: Start difference. First operand 568 states. Second operand has 558 states, 421 states have (on average 1.2304038004750595) internal successors, (518), 425 states have internal predecessors, (518), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:17:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:17:04,281 INFO L93 Difference]: Finished difference Result 568 states and 754 transitions. [2022-04-15 15:17:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 754 transitions. [2022-04-15 15:17:04,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:17:04,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:17:04,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 558 states, 421 states have (on average 1.2304038004750595) internal successors, (518), 425 states have internal predecessors, (518), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 568 states. [2022-04-15 15:17:04,284 INFO L87 Difference]: Start difference. First operand has 558 states, 421 states have (on average 1.2304038004750595) internal successors, (518), 425 states have internal predecessors, (518), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 568 states. [2022-04-15 15:17:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:17:04,300 INFO L93 Difference]: Finished difference Result 568 states and 754 transitions. [2022-04-15 15:17:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 754 transitions. [2022-04-15 15:17:04,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:17:04,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:17:04,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:17:04,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:17:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 421 states have (on average 1.2304038004750595) internal successors, (518), 425 states have internal predecessors, (518), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:17:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 744 transitions. [2022-04-15 15:17:04,317 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 744 transitions. Word has length 105 [2022-04-15 15:17:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:17:04,317 INFO L478 AbstractCegarLoop]: Abstraction has 558 states and 744 transitions. [2022-04-15 15:17:04,317 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:17:04,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 558 states and 744 transitions. [2022-04-15 15:17:16,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 744 edges. 743 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 744 transitions. [2022-04-15 15:17:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 15:17:16,701 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:17:16,701 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 7, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:17:16,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 15:17:16,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-15 15:17:16,903 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:17:16,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:17:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 11 times [2022-04-15 15:17:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:17:16,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1048995708] [2022-04-15 15:17:16,904 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:17:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 12 times [2022-04-15 15:17:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:17:16,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988783485] [2022-04-15 15:17:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:17:16,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:17:16,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:17:16,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [988251335] [2022-04-15 15:17:16,924 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:17:16,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:17:16,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:17:16,926 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:17:16,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 15:17:17,046 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 15:17:17,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:17:17,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 15:17:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:17:17,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:17:17,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {60817#true} call ULTIMATE.init(); {60817#true} is VALID [2022-04-15 15:17:17,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {60817#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {60825#(<= ~counter~0 0)} assume true; {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60825#(<= ~counter~0 0)} {60817#true} #102#return; {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {60825#(<= ~counter~0 0)} call #t~ret9 := main(); {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {60825#(<= ~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; {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {60825#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {60825#(<= ~counter~0 0)} ~cond := #in~cond; {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {60825#(<= ~counter~0 0)} assume !(0 == ~cond); {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {60825#(<= ~counter~0 0)} assume true; {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,582 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60825#(<= ~counter~0 0)} {60825#(<= ~counter~0 0)} #90#return; {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,583 INFO L272 TraceCheckUtils]: 11: Hoare triple {60825#(<= ~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)); {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {60825#(<= ~counter~0 0)} ~cond := #in~cond; {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {60825#(<= ~counter~0 0)} assume !(0 == ~cond); {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {60825#(<= ~counter~0 0)} assume true; {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,584 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60825#(<= ~counter~0 0)} {60825#(<= ~counter~0 0)} #92#return; {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {60825#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60825#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:17,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {60825#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60874#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:17,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {60874#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {60874#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:17,586 INFO L272 TraceCheckUtils]: 19: Hoare triple {60874#(<= ~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)); {60874#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:17,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {60874#(<= ~counter~0 1)} ~cond := #in~cond; {60874#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:17,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {60874#(<= ~counter~0 1)} assume !(0 == ~cond); {60874#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:17,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {60874#(<= ~counter~0 1)} assume true; {60874#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:17,588 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60874#(<= ~counter~0 1)} {60874#(<= ~counter~0 1)} #94#return; {60874#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:17,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {60874#(<= ~counter~0 1)} assume !!(0 != ~r~0); {60874#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:17,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {60874#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60899#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:17,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {60899#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {60899#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:17,589 INFO L272 TraceCheckUtils]: 27: Hoare triple {60899#(<= ~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)); {60899#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:17,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {60899#(<= ~counter~0 2)} ~cond := #in~cond; {60899#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:17,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {60899#(<= ~counter~0 2)} assume !(0 == ~cond); {60899#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:17,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {60899#(<= ~counter~0 2)} assume true; {60899#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:17,591 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60899#(<= ~counter~0 2)} {60899#(<= ~counter~0 2)} #96#return; {60899#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:17,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {60899#(<= ~counter~0 2)} assume !(~r~0 > 0); {60899#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:17,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {60899#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60924#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:17,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {60924#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {60924#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:17,592 INFO L272 TraceCheckUtils]: 35: Hoare triple {60924#(<= ~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)); {60924#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:17,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {60924#(<= ~counter~0 3)} ~cond := #in~cond; {60924#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:17,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {60924#(<= ~counter~0 3)} assume !(0 == ~cond); {60924#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:17,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {60924#(<= ~counter~0 3)} assume true; {60924#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:17,594 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60924#(<= ~counter~0 3)} {60924#(<= ~counter~0 3)} #98#return; {60924#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:17,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {60924#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60924#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:17,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {60924#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60949#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:17,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {60949#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {60949#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:17,596 INFO L272 TraceCheckUtils]: 43: Hoare triple {60949#(<= ~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)); {60949#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:17,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {60949#(<= ~counter~0 4)} ~cond := #in~cond; {60949#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:17,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {60949#(<= ~counter~0 4)} assume !(0 == ~cond); {60949#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:17,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {60949#(<= ~counter~0 4)} assume true; {60949#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:17,597 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60949#(<= ~counter~0 4)} {60949#(<= ~counter~0 4)} #98#return; {60949#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:17,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {60949#(<= ~counter~0 4)} assume !(~r~0 < 0); {60949#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:17,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {60949#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60974#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:17,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {60974#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {60974#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:17,599 INFO L272 TraceCheckUtils]: 51: Hoare triple {60974#(<= ~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)); {60974#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:17,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {60974#(<= ~counter~0 5)} ~cond := #in~cond; {60974#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:17,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {60974#(<= ~counter~0 5)} assume !(0 == ~cond); {60974#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:17,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {60974#(<= ~counter~0 5)} assume true; {60974#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:17,600 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60974#(<= ~counter~0 5)} {60974#(<= ~counter~0 5)} #94#return; {60974#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:17,600 INFO L290 TraceCheckUtils]: 56: Hoare triple {60974#(<= ~counter~0 5)} assume !!(0 != ~r~0); {60974#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:17,601 INFO L290 TraceCheckUtils]: 57: Hoare triple {60974#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60999#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:17,601 INFO L290 TraceCheckUtils]: 58: Hoare triple {60999#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {60999#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:17,602 INFO L272 TraceCheckUtils]: 59: Hoare triple {60999#(<= ~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)); {60999#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:17,602 INFO L290 TraceCheckUtils]: 60: Hoare triple {60999#(<= ~counter~0 6)} ~cond := #in~cond; {60999#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:17,602 INFO L290 TraceCheckUtils]: 61: Hoare triple {60999#(<= ~counter~0 6)} assume !(0 == ~cond); {60999#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:17,603 INFO L290 TraceCheckUtils]: 62: Hoare triple {60999#(<= ~counter~0 6)} assume true; {60999#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:17,603 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60999#(<= ~counter~0 6)} {60999#(<= ~counter~0 6)} #96#return; {60999#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:17,603 INFO L290 TraceCheckUtils]: 64: Hoare triple {60999#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60999#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:17,604 INFO L290 TraceCheckUtils]: 65: Hoare triple {60999#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61024#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:17,604 INFO L290 TraceCheckUtils]: 66: Hoare triple {61024#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {61024#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:17,605 INFO L272 TraceCheckUtils]: 67: Hoare triple {61024#(<= ~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)); {61024#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:17,605 INFO L290 TraceCheckUtils]: 68: Hoare triple {61024#(<= ~counter~0 7)} ~cond := #in~cond; {61024#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:17,605 INFO L290 TraceCheckUtils]: 69: Hoare triple {61024#(<= ~counter~0 7)} assume !(0 == ~cond); {61024#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:17,606 INFO L290 TraceCheckUtils]: 70: Hoare triple {61024#(<= ~counter~0 7)} assume true; {61024#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:17,606 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {61024#(<= ~counter~0 7)} {61024#(<= ~counter~0 7)} #96#return; {61024#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:17,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {61024#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61024#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:17,607 INFO L290 TraceCheckUtils]: 73: Hoare triple {61024#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61049#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:17,607 INFO L290 TraceCheckUtils]: 74: Hoare triple {61049#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {61049#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:17,608 INFO L272 TraceCheckUtils]: 75: Hoare triple {61049#(<= ~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)); {61049#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:17,608 INFO L290 TraceCheckUtils]: 76: Hoare triple {61049#(<= ~counter~0 8)} ~cond := #in~cond; {61049#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:17,608 INFO L290 TraceCheckUtils]: 77: Hoare triple {61049#(<= ~counter~0 8)} assume !(0 == ~cond); {61049#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:17,609 INFO L290 TraceCheckUtils]: 78: Hoare triple {61049#(<= ~counter~0 8)} assume true; {61049#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:17,609 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {61049#(<= ~counter~0 8)} {61049#(<= ~counter~0 8)} #96#return; {61049#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:17,610 INFO L290 TraceCheckUtils]: 80: Hoare triple {61049#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61049#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:17,610 INFO L290 TraceCheckUtils]: 81: Hoare triple {61049#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:17,610 INFO L290 TraceCheckUtils]: 82: Hoare triple {61074#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:17,611 INFO L272 TraceCheckUtils]: 83: Hoare triple {61074#(<= ~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)); {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:17,611 INFO L290 TraceCheckUtils]: 84: Hoare triple {61074#(<= ~counter~0 9)} ~cond := #in~cond; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:17,612 INFO L290 TraceCheckUtils]: 85: Hoare triple {61074#(<= ~counter~0 9)} assume !(0 == ~cond); {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:17,612 INFO L290 TraceCheckUtils]: 86: Hoare triple {61074#(<= ~counter~0 9)} assume true; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:17,612 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {61074#(<= ~counter~0 9)} {61074#(<= ~counter~0 9)} #96#return; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:17,613 INFO L290 TraceCheckUtils]: 88: Hoare triple {61074#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:17,613 INFO L290 TraceCheckUtils]: 89: Hoare triple {61074#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61099#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:17,614 INFO L290 TraceCheckUtils]: 90: Hoare triple {61099#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {61099#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:17,614 INFO L272 TraceCheckUtils]: 91: Hoare triple {61099#(<= ~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)); {61099#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:17,614 INFO L290 TraceCheckUtils]: 92: Hoare triple {61099#(<= ~counter~0 10)} ~cond := #in~cond; {61099#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:17,615 INFO L290 TraceCheckUtils]: 93: Hoare triple {61099#(<= ~counter~0 10)} assume !(0 == ~cond); {61099#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:17,615 INFO L290 TraceCheckUtils]: 94: Hoare triple {61099#(<= ~counter~0 10)} assume true; {61099#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:17,615 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {61099#(<= ~counter~0 10)} {61099#(<= ~counter~0 10)} #96#return; {61099#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:17,616 INFO L290 TraceCheckUtils]: 96: Hoare triple {61099#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61099#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:17,616 INFO L290 TraceCheckUtils]: 97: Hoare triple {61099#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61124#(<= |main_#t~post7| 10)} is VALID [2022-04-15 15:17:17,616 INFO L290 TraceCheckUtils]: 98: Hoare triple {61124#(<= |main_#t~post7| 10)} assume !(#t~post7 < 20);havoc #t~post7; {60818#false} is VALID [2022-04-15 15:17:17,616 INFO L290 TraceCheckUtils]: 99: Hoare triple {60818#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60818#false} is VALID [2022-04-15 15:17:17,617 INFO L290 TraceCheckUtils]: 100: Hoare triple {60818#false} assume !(#t~post8 < 20);havoc #t~post8; {60818#false} is VALID [2022-04-15 15:17:17,617 INFO L290 TraceCheckUtils]: 101: Hoare triple {60818#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60818#false} is VALID [2022-04-15 15:17:17,617 INFO L290 TraceCheckUtils]: 102: Hoare triple {60818#false} assume !(#t~post6 < 20);havoc #t~post6; {60818#false} is VALID [2022-04-15 15:17:17,617 INFO L272 TraceCheckUtils]: 103: Hoare triple {60818#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60818#false} is VALID [2022-04-15 15:17:17,617 INFO L290 TraceCheckUtils]: 104: Hoare triple {60818#false} ~cond := #in~cond; {60818#false} is VALID [2022-04-15 15:17:17,617 INFO L290 TraceCheckUtils]: 105: Hoare triple {60818#false} assume 0 == ~cond; {60818#false} is VALID [2022-04-15 15:17:17,617 INFO L290 TraceCheckUtils]: 106: Hoare triple {60818#false} assume !false; {60818#false} is VALID [2022-04-15 15:17:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 260 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:17:17,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:17:18,201 INFO L290 TraceCheckUtils]: 106: Hoare triple {60818#false} assume !false; {60818#false} is VALID [2022-04-15 15:17:18,201 INFO L290 TraceCheckUtils]: 105: Hoare triple {60818#false} assume 0 == ~cond; {60818#false} is VALID [2022-04-15 15:17:18,201 INFO L290 TraceCheckUtils]: 104: Hoare triple {60818#false} ~cond := #in~cond; {60818#false} is VALID [2022-04-15 15:17:18,201 INFO L272 TraceCheckUtils]: 103: Hoare triple {60818#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60818#false} is VALID [2022-04-15 15:17:18,201 INFO L290 TraceCheckUtils]: 102: Hoare triple {60818#false} assume !(#t~post6 < 20);havoc #t~post6; {60818#false} is VALID [2022-04-15 15:17:18,201 INFO L290 TraceCheckUtils]: 101: Hoare triple {60818#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60818#false} is VALID [2022-04-15 15:17:18,201 INFO L290 TraceCheckUtils]: 100: Hoare triple {60818#false} assume !(#t~post8 < 20);havoc #t~post8; {60818#false} is VALID [2022-04-15 15:17:18,201 INFO L290 TraceCheckUtils]: 99: Hoare triple {60818#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60818#false} is VALID [2022-04-15 15:17:18,202 INFO L290 TraceCheckUtils]: 98: Hoare triple {61176#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {60818#false} is VALID [2022-04-15 15:17:18,202 INFO L290 TraceCheckUtils]: 97: Hoare triple {61180#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61176#(< |main_#t~post7| 20)} is VALID [2022-04-15 15:17:18,203 INFO L290 TraceCheckUtils]: 96: Hoare triple {61180#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61180#(< ~counter~0 20)} is VALID [2022-04-15 15:17:18,203 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60817#true} {61180#(< ~counter~0 20)} #96#return; {61180#(< ~counter~0 20)} is VALID [2022-04-15 15:17:18,203 INFO L290 TraceCheckUtils]: 94: Hoare triple {60817#true} assume true; {60817#true} is VALID [2022-04-15 15:17:18,203 INFO L290 TraceCheckUtils]: 93: Hoare triple {60817#true} assume !(0 == ~cond); {60817#true} is VALID [2022-04-15 15:17:18,203 INFO L290 TraceCheckUtils]: 92: Hoare triple {60817#true} ~cond := #in~cond; {60817#true} is VALID [2022-04-15 15:17:18,204 INFO L272 TraceCheckUtils]: 91: Hoare triple {61180#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60817#true} is VALID [2022-04-15 15:17:18,204 INFO L290 TraceCheckUtils]: 90: Hoare triple {61180#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {61180#(< ~counter~0 20)} is VALID [2022-04-15 15:17:18,205 INFO L290 TraceCheckUtils]: 89: Hoare triple {61205#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61180#(< ~counter~0 20)} is VALID [2022-04-15 15:17:18,205 INFO L290 TraceCheckUtils]: 88: Hoare triple {61205#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61205#(< ~counter~0 19)} is VALID [2022-04-15 15:17:18,206 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60817#true} {61205#(< ~counter~0 19)} #96#return; {61205#(< ~counter~0 19)} is VALID [2022-04-15 15:17:18,206 INFO L290 TraceCheckUtils]: 86: Hoare triple {60817#true} assume true; {60817#true} is VALID [2022-04-15 15:17:18,206 INFO L290 TraceCheckUtils]: 85: Hoare triple {60817#true} assume !(0 == ~cond); {60817#true} is VALID [2022-04-15 15:17:18,206 INFO L290 TraceCheckUtils]: 84: Hoare triple {60817#true} ~cond := #in~cond; {60817#true} is VALID [2022-04-15 15:17:18,206 INFO L272 TraceCheckUtils]: 83: Hoare triple {61205#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60817#true} is VALID [2022-04-15 15:17:18,206 INFO L290 TraceCheckUtils]: 82: Hoare triple {61205#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {61205#(< ~counter~0 19)} is VALID [2022-04-15 15:17:18,207 INFO L290 TraceCheckUtils]: 81: Hoare triple {61230#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61205#(< ~counter~0 19)} is VALID [2022-04-15 15:17:18,207 INFO L290 TraceCheckUtils]: 80: Hoare triple {61230#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61230#(< ~counter~0 18)} is VALID [2022-04-15 15:17:18,208 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60817#true} {61230#(< ~counter~0 18)} #96#return; {61230#(< ~counter~0 18)} is VALID [2022-04-15 15:17:18,208 INFO L290 TraceCheckUtils]: 78: Hoare triple {60817#true} assume true; {60817#true} is VALID [2022-04-15 15:17:18,208 INFO L290 TraceCheckUtils]: 77: Hoare triple {60817#true} assume !(0 == ~cond); {60817#true} is VALID [2022-04-15 15:17:18,208 INFO L290 TraceCheckUtils]: 76: Hoare triple {60817#true} ~cond := #in~cond; {60817#true} is VALID [2022-04-15 15:17:18,208 INFO L272 TraceCheckUtils]: 75: Hoare triple {61230#(< ~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)); {60817#true} is VALID [2022-04-15 15:17:18,209 INFO L290 TraceCheckUtils]: 74: Hoare triple {61230#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {61230#(< ~counter~0 18)} is VALID [2022-04-15 15:17:18,209 INFO L290 TraceCheckUtils]: 73: Hoare triple {61255#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61230#(< ~counter~0 18)} is VALID [2022-04-15 15:17:18,209 INFO L290 TraceCheckUtils]: 72: Hoare triple {61255#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61255#(< ~counter~0 17)} is VALID [2022-04-15 15:17:18,210 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60817#true} {61255#(< ~counter~0 17)} #96#return; {61255#(< ~counter~0 17)} is VALID [2022-04-15 15:17:18,210 INFO L290 TraceCheckUtils]: 70: Hoare triple {60817#true} assume true; {60817#true} is VALID [2022-04-15 15:17:18,210 INFO L290 TraceCheckUtils]: 69: Hoare triple {60817#true} assume !(0 == ~cond); {60817#true} is VALID [2022-04-15 15:17:18,210 INFO L290 TraceCheckUtils]: 68: Hoare triple {60817#true} ~cond := #in~cond; {60817#true} is VALID [2022-04-15 15:17:18,210 INFO L272 TraceCheckUtils]: 67: Hoare triple {61255#(< ~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)); {60817#true} is VALID [2022-04-15 15:17:18,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {61255#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {61255#(< ~counter~0 17)} is VALID [2022-04-15 15:17:18,211 INFO L290 TraceCheckUtils]: 65: Hoare triple {61280#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61255#(< ~counter~0 17)} is VALID [2022-04-15 15:17:18,212 INFO L290 TraceCheckUtils]: 64: Hoare triple {61280#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61280#(< ~counter~0 16)} is VALID [2022-04-15 15:17:18,213 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60817#true} {61280#(< ~counter~0 16)} #96#return; {61280#(< ~counter~0 16)} is VALID [2022-04-15 15:17:18,213 INFO L290 TraceCheckUtils]: 62: Hoare triple {60817#true} assume true; {60817#true} is VALID [2022-04-15 15:17:18,213 INFO L290 TraceCheckUtils]: 61: Hoare triple {60817#true} assume !(0 == ~cond); {60817#true} is VALID [2022-04-15 15:17:18,213 INFO L290 TraceCheckUtils]: 60: Hoare triple {60817#true} ~cond := #in~cond; {60817#true} is VALID [2022-04-15 15:17:18,213 INFO L272 TraceCheckUtils]: 59: Hoare triple {61280#(< ~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)); {60817#true} is VALID [2022-04-15 15:17:18,213 INFO L290 TraceCheckUtils]: 58: Hoare triple {61280#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {61280#(< ~counter~0 16)} is VALID [2022-04-15 15:17:18,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {61305#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61280#(< ~counter~0 16)} is VALID [2022-04-15 15:17:18,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {61305#(< ~counter~0 15)} assume !!(0 != ~r~0); {61305#(< ~counter~0 15)} is VALID [2022-04-15 15:17:18,215 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60817#true} {61305#(< ~counter~0 15)} #94#return; {61305#(< ~counter~0 15)} is VALID [2022-04-15 15:17:18,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {60817#true} assume true; {60817#true} is VALID [2022-04-15 15:17:18,215 INFO L290 TraceCheckUtils]: 53: Hoare triple {60817#true} assume !(0 == ~cond); {60817#true} is VALID [2022-04-15 15:17:18,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {60817#true} ~cond := #in~cond; {60817#true} is VALID [2022-04-15 15:17:18,215 INFO L272 TraceCheckUtils]: 51: Hoare triple {61305#(< ~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)); {60817#true} is VALID [2022-04-15 15:17:18,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {61305#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {61305#(< ~counter~0 15)} is VALID [2022-04-15 15:17:18,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {61330#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61305#(< ~counter~0 15)} is VALID [2022-04-15 15:17:18,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {61330#(< ~counter~0 14)} assume !(~r~0 < 0); {61330#(< ~counter~0 14)} is VALID [2022-04-15 15:17:18,217 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60817#true} {61330#(< ~counter~0 14)} #98#return; {61330#(< ~counter~0 14)} is VALID [2022-04-15 15:17:18,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {60817#true} assume true; {60817#true} is VALID [2022-04-15 15:17:18,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {60817#true} assume !(0 == ~cond); {60817#true} is VALID [2022-04-15 15:17:18,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {60817#true} ~cond := #in~cond; {60817#true} is VALID [2022-04-15 15:17:18,217 INFO L272 TraceCheckUtils]: 43: Hoare triple {61330#(< ~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)); {60817#true} is VALID [2022-04-15 15:17:18,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {61330#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {61330#(< ~counter~0 14)} is VALID [2022-04-15 15:17:18,218 INFO L290 TraceCheckUtils]: 41: Hoare triple {61355#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61330#(< ~counter~0 14)} is VALID [2022-04-15 15:17:18,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {61355#(< ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {61355#(< ~counter~0 13)} is VALID [2022-04-15 15:17:18,219 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60817#true} {61355#(< ~counter~0 13)} #98#return; {61355#(< ~counter~0 13)} is VALID [2022-04-15 15:17:18,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {60817#true} assume true; {60817#true} is VALID [2022-04-15 15:17:18,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {60817#true} assume !(0 == ~cond); {60817#true} is VALID [2022-04-15 15:17:18,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {60817#true} ~cond := #in~cond; {60817#true} is VALID [2022-04-15 15:17:18,219 INFO L272 TraceCheckUtils]: 35: Hoare triple {61355#(< ~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)); {60817#true} is VALID [2022-04-15 15:17:18,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {61355#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {61355#(< ~counter~0 13)} is VALID [2022-04-15 15:17:18,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {61380#(< ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61355#(< ~counter~0 13)} is VALID [2022-04-15 15:17:18,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {61380#(< ~counter~0 12)} assume !(~r~0 > 0); {61380#(< ~counter~0 12)} is VALID [2022-04-15 15:17:18,221 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60817#true} {61380#(< ~counter~0 12)} #96#return; {61380#(< ~counter~0 12)} is VALID [2022-04-15 15:17:18,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {60817#true} assume true; {60817#true} is VALID [2022-04-15 15:17:18,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {60817#true} assume !(0 == ~cond); {60817#true} is VALID [2022-04-15 15:17:18,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {60817#true} ~cond := #in~cond; {60817#true} is VALID [2022-04-15 15:17:18,221 INFO L272 TraceCheckUtils]: 27: Hoare triple {61380#(< ~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)); {60817#true} is VALID [2022-04-15 15:17:18,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {61380#(< ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {61380#(< ~counter~0 12)} is VALID [2022-04-15 15:17:18,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {61099#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61380#(< ~counter~0 12)} is VALID [2022-04-15 15:17:18,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {61099#(<= ~counter~0 10)} assume !!(0 != ~r~0); {61099#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:18,223 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60817#true} {61099#(<= ~counter~0 10)} #94#return; {61099#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:18,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {60817#true} assume true; {60817#true} is VALID [2022-04-15 15:17:18,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {60817#true} assume !(0 == ~cond); {60817#true} is VALID [2022-04-15 15:17:18,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {60817#true} ~cond := #in~cond; {60817#true} is VALID [2022-04-15 15:17:18,223 INFO L272 TraceCheckUtils]: 19: Hoare triple {61099#(<= ~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)); {60817#true} is VALID [2022-04-15 15:17:18,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {61099#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {61099#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:18,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {61074#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61099#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:18,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {61074#(<= ~counter~0 9)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:18,225 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60817#true} {61074#(<= ~counter~0 9)} #92#return; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:18,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {60817#true} assume true; {60817#true} is VALID [2022-04-15 15:17:18,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {60817#true} assume !(0 == ~cond); {60817#true} is VALID [2022-04-15 15:17:18,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {60817#true} ~cond := #in~cond; {60817#true} is VALID [2022-04-15 15:17:18,225 INFO L272 TraceCheckUtils]: 11: Hoare triple {61074#(<= ~counter~0 9)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {60817#true} is VALID [2022-04-15 15:17:18,226 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60817#true} {61074#(<= ~counter~0 9)} #90#return; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:18,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {60817#true} assume true; {60817#true} is VALID [2022-04-15 15:17:18,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {60817#true} assume !(0 == ~cond); {60817#true} is VALID [2022-04-15 15:17:18,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {60817#true} ~cond := #in~cond; {60817#true} is VALID [2022-04-15 15:17:18,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {61074#(<= ~counter~0 9)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60817#true} is VALID [2022-04-15 15:17:18,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {61074#(<= ~counter~0 9)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:18,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {61074#(<= ~counter~0 9)} call #t~ret9 := main(); {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:18,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61074#(<= ~counter~0 9)} {60817#true} #102#return; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:18,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {61074#(<= ~counter~0 9)} assume true; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:18,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {60817#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {61074#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:18,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {60817#true} call ULTIMATE.init(); {60817#true} is VALID [2022-04-15 15:17:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 15:17:18,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:17:18,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988783485] [2022-04-15 15:17:18,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:17:18,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988251335] [2022-04-15 15:17:18,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988251335] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:17:18,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:17:18,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-15 15:17:18,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:17:18,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1048995708] [2022-04-15 15:17:18,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1048995708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:17:18,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:17:18,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 15:17:18,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666971795] [2022-04-15 15:17:18,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:17:18,229 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 107 [2022-04-15 15:17:18,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:17:18,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:17:18,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:18,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 15:17:18,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:17:18,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 15:17:18,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:17:18,311 INFO L87 Difference]: Start difference. First operand 558 states and 744 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:17:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:17:20,212 INFO L93 Difference]: Finished difference Result 775 states and 1071 transitions. [2022-04-15 15:17:20,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 15:17:20,212 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 107 [2022-04-15 15:17:20,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:17:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:17:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-15 15:17:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:17:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-15 15:17:20,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 236 transitions. [2022-04-15 15:17:20,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:20,428 INFO L225 Difference]: With dead ends: 775 [2022-04-15 15:17:20,428 INFO L226 Difference]: Without dead ends: 574 [2022-04-15 15:17:20,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=434, Invalid=622, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 15:17:20,429 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 142 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:17:20,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 243 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:17:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-04-15 15:17:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2022-04-15 15:17:21,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:17:21,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 574 states. Second operand has 574 states, 437 states have (on average 1.2219679633867278) internal successors, (534), 437 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:17:21,570 INFO L74 IsIncluded]: Start isIncluded. First operand 574 states. Second operand has 574 states, 437 states have (on average 1.2219679633867278) internal successors, (534), 437 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:17:21,570 INFO L87 Difference]: Start difference. First operand 574 states. Second operand has 574 states, 437 states have (on average 1.2219679633867278) internal successors, (534), 437 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:17:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:17:21,582 INFO L93 Difference]: Finished difference Result 574 states and 760 transitions. [2022-04-15 15:17:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 760 transitions. [2022-04-15 15:17:21,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:17:21,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:17:21,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 574 states, 437 states have (on average 1.2219679633867278) internal successors, (534), 437 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 574 states. [2022-04-15 15:17:21,583 INFO L87 Difference]: Start difference. First operand has 574 states, 437 states have (on average 1.2219679633867278) internal successors, (534), 437 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 574 states. [2022-04-15 15:17:21,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:17:21,595 INFO L93 Difference]: Finished difference Result 574 states and 760 transitions. [2022-04-15 15:17:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 760 transitions. [2022-04-15 15:17:21,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:17:21,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:17:21,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:17:21,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:17:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 437 states have (on average 1.2219679633867278) internal successors, (534), 437 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:17:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 760 transitions. [2022-04-15 15:17:21,618 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 760 transitions. Word has length 107 [2022-04-15 15:17:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:17:21,618 INFO L478 AbstractCegarLoop]: Abstraction has 574 states and 760 transitions. [2022-04-15 15:17:21,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 15:17:21,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 574 states and 760 transitions. [2022-04-15 15:17:38,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 760 edges. 757 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 760 transitions. [2022-04-15 15:17:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 15:17:38,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:17:38,343 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:17:38,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 15:17:38,543 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:17:38,543 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:17:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:17:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 5 times [2022-04-15 15:17:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:17:38,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2106318175] [2022-04-15 15:17:38,544 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:17:38,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 6 times [2022-04-15 15:17:38,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:17:38,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036759174] [2022-04-15 15:17:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:17:38,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:17:38,563 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:17:38,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417478463] [2022-04-15 15:17:38,564 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:17:38,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:17:38,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:17:38,565 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:17:38,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 15:17:38,711 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:17:38,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:17:38,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 15:17:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:17:38,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:17:39,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {65346#true} call ULTIMATE.init(); {65346#true} is VALID [2022-04-15 15:17:39,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {65346#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {65354#(<= ~counter~0 0)} assume true; {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65354#(<= ~counter~0 0)} {65346#true} #102#return; {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {65354#(<= ~counter~0 0)} call #t~ret9 := main(); {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {65354#(<= ~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; {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,334 INFO L272 TraceCheckUtils]: 6: Hoare triple {65354#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {65354#(<= ~counter~0 0)} ~cond := #in~cond; {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {65354#(<= ~counter~0 0)} assume !(0 == ~cond); {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {65354#(<= ~counter~0 0)} assume true; {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,335 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65354#(<= ~counter~0 0)} {65354#(<= ~counter~0 0)} #90#return; {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,336 INFO L272 TraceCheckUtils]: 11: Hoare triple {65354#(<= ~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)); {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {65354#(<= ~counter~0 0)} ~cond := #in~cond; {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {65354#(<= ~counter~0 0)} assume !(0 == ~cond); {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {65354#(<= ~counter~0 0)} assume true; {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,337 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65354#(<= ~counter~0 0)} {65354#(<= ~counter~0 0)} #92#return; {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {65354#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65354#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:39,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {65354#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65403#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:39,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {65403#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {65403#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:39,339 INFO L272 TraceCheckUtils]: 19: Hoare triple {65403#(<= ~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)); {65403#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:39,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {65403#(<= ~counter~0 1)} ~cond := #in~cond; {65403#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:39,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {65403#(<= ~counter~0 1)} assume !(0 == ~cond); {65403#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:39,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {65403#(<= ~counter~0 1)} assume true; {65403#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:39,341 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65403#(<= ~counter~0 1)} {65403#(<= ~counter~0 1)} #94#return; {65403#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:39,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {65403#(<= ~counter~0 1)} assume !!(0 != ~r~0); {65403#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:39,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {65403#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65428#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:39,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {65428#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {65428#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:39,342 INFO L272 TraceCheckUtils]: 27: Hoare triple {65428#(<= ~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)); {65428#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:39,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {65428#(<= ~counter~0 2)} ~cond := #in~cond; {65428#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:39,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {65428#(<= ~counter~0 2)} assume !(0 == ~cond); {65428#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:39,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {65428#(<= ~counter~0 2)} assume true; {65428#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:39,344 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65428#(<= ~counter~0 2)} {65428#(<= ~counter~0 2)} #96#return; {65428#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:39,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {65428#(<= ~counter~0 2)} assume !(~r~0 > 0); {65428#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:39,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {65428#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65453#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:39,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {65453#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {65453#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:39,345 INFO L272 TraceCheckUtils]: 35: Hoare triple {65453#(<= ~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)); {65453#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:39,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {65453#(<= ~counter~0 3)} ~cond := #in~cond; {65453#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:39,346 INFO L290 TraceCheckUtils]: 37: Hoare triple {65453#(<= ~counter~0 3)} assume !(0 == ~cond); {65453#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:39,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {65453#(<= ~counter~0 3)} assume true; {65453#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:39,347 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65453#(<= ~counter~0 3)} {65453#(<= ~counter~0 3)} #98#return; {65453#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:39,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {65453#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65453#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:39,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {65453#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65478#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:39,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {65478#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {65478#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:39,348 INFO L272 TraceCheckUtils]: 43: Hoare triple {65478#(<= ~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)); {65478#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:39,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {65478#(<= ~counter~0 4)} ~cond := #in~cond; {65478#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:39,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {65478#(<= ~counter~0 4)} assume !(0 == ~cond); {65478#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:39,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {65478#(<= ~counter~0 4)} assume true; {65478#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:39,350 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65478#(<= ~counter~0 4)} {65478#(<= ~counter~0 4)} #98#return; {65478#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:39,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {65478#(<= ~counter~0 4)} assume !(~r~0 < 0); {65478#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:39,351 INFO L290 TraceCheckUtils]: 49: Hoare triple {65478#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65503#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:39,351 INFO L290 TraceCheckUtils]: 50: Hoare triple {65503#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {65503#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:39,352 INFO L272 TraceCheckUtils]: 51: Hoare triple {65503#(<= ~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)); {65503#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:39,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {65503#(<= ~counter~0 5)} ~cond := #in~cond; {65503#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:39,352 INFO L290 TraceCheckUtils]: 53: Hoare triple {65503#(<= ~counter~0 5)} assume !(0 == ~cond); {65503#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:39,352 INFO L290 TraceCheckUtils]: 54: Hoare triple {65503#(<= ~counter~0 5)} assume true; {65503#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:39,353 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65503#(<= ~counter~0 5)} {65503#(<= ~counter~0 5)} #94#return; {65503#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:39,353 INFO L290 TraceCheckUtils]: 56: Hoare triple {65503#(<= ~counter~0 5)} assume !!(0 != ~r~0); {65503#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:39,354 INFO L290 TraceCheckUtils]: 57: Hoare triple {65503#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65528#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:39,354 INFO L290 TraceCheckUtils]: 58: Hoare triple {65528#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {65528#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:39,355 INFO L272 TraceCheckUtils]: 59: Hoare triple {65528#(<= ~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)); {65528#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:39,355 INFO L290 TraceCheckUtils]: 60: Hoare triple {65528#(<= ~counter~0 6)} ~cond := #in~cond; {65528#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:39,355 INFO L290 TraceCheckUtils]: 61: Hoare triple {65528#(<= ~counter~0 6)} assume !(0 == ~cond); {65528#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:39,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {65528#(<= ~counter~0 6)} assume true; {65528#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:39,356 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65528#(<= ~counter~0 6)} {65528#(<= ~counter~0 6)} #96#return; {65528#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:39,356 INFO L290 TraceCheckUtils]: 64: Hoare triple {65528#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65528#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:39,357 INFO L290 TraceCheckUtils]: 65: Hoare triple {65528#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65553#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:39,357 INFO L290 TraceCheckUtils]: 66: Hoare triple {65553#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {65553#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:39,358 INFO L272 TraceCheckUtils]: 67: Hoare triple {65553#(<= ~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)); {65553#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:39,358 INFO L290 TraceCheckUtils]: 68: Hoare triple {65553#(<= ~counter~0 7)} ~cond := #in~cond; {65553#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:39,358 INFO L290 TraceCheckUtils]: 69: Hoare triple {65553#(<= ~counter~0 7)} assume !(0 == ~cond); {65553#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:39,358 INFO L290 TraceCheckUtils]: 70: Hoare triple {65553#(<= ~counter~0 7)} assume true; {65553#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:39,359 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65553#(<= ~counter~0 7)} {65553#(<= ~counter~0 7)} #96#return; {65553#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:39,359 INFO L290 TraceCheckUtils]: 72: Hoare triple {65553#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65553#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:39,360 INFO L290 TraceCheckUtils]: 73: Hoare triple {65553#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:39,360 INFO L290 TraceCheckUtils]: 74: Hoare triple {65578#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:39,361 INFO L272 TraceCheckUtils]: 75: Hoare triple {65578#(<= ~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)); {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:39,361 INFO L290 TraceCheckUtils]: 76: Hoare triple {65578#(<= ~counter~0 8)} ~cond := #in~cond; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:39,361 INFO L290 TraceCheckUtils]: 77: Hoare triple {65578#(<= ~counter~0 8)} assume !(0 == ~cond); {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:39,361 INFO L290 TraceCheckUtils]: 78: Hoare triple {65578#(<= ~counter~0 8)} assume true; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:39,362 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65578#(<= ~counter~0 8)} {65578#(<= ~counter~0 8)} #96#return; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:39,362 INFO L290 TraceCheckUtils]: 80: Hoare triple {65578#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:39,363 INFO L290 TraceCheckUtils]: 81: Hoare triple {65578#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65603#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:39,363 INFO L290 TraceCheckUtils]: 82: Hoare triple {65603#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {65603#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:39,364 INFO L272 TraceCheckUtils]: 83: Hoare triple {65603#(<= ~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)); {65603#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:39,364 INFO L290 TraceCheckUtils]: 84: Hoare triple {65603#(<= ~counter~0 9)} ~cond := #in~cond; {65603#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:39,364 INFO L290 TraceCheckUtils]: 85: Hoare triple {65603#(<= ~counter~0 9)} assume !(0 == ~cond); {65603#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:39,365 INFO L290 TraceCheckUtils]: 86: Hoare triple {65603#(<= ~counter~0 9)} assume true; {65603#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:39,365 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65603#(<= ~counter~0 9)} {65603#(<= ~counter~0 9)} #96#return; {65603#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:39,365 INFO L290 TraceCheckUtils]: 88: Hoare triple {65603#(<= ~counter~0 9)} assume !(~r~0 > 0); {65603#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:39,366 INFO L290 TraceCheckUtils]: 89: Hoare triple {65603#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65628#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:39,366 INFO L290 TraceCheckUtils]: 90: Hoare triple {65628#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {65628#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:39,367 INFO L272 TraceCheckUtils]: 91: Hoare triple {65628#(<= ~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)); {65628#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:39,367 INFO L290 TraceCheckUtils]: 92: Hoare triple {65628#(<= ~counter~0 10)} ~cond := #in~cond; {65628#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:39,367 INFO L290 TraceCheckUtils]: 93: Hoare triple {65628#(<= ~counter~0 10)} assume !(0 == ~cond); {65628#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:39,368 INFO L290 TraceCheckUtils]: 94: Hoare triple {65628#(<= ~counter~0 10)} assume true; {65628#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:39,368 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65628#(<= ~counter~0 10)} {65628#(<= ~counter~0 10)} #98#return; {65628#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:39,368 INFO L290 TraceCheckUtils]: 96: Hoare triple {65628#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65628#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:39,369 INFO L290 TraceCheckUtils]: 97: Hoare triple {65628#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65653#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:39,369 INFO L290 TraceCheckUtils]: 98: Hoare triple {65653#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {65653#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:39,370 INFO L272 TraceCheckUtils]: 99: Hoare triple {65653#(<= ~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)); {65653#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:39,370 INFO L290 TraceCheckUtils]: 100: Hoare triple {65653#(<= ~counter~0 11)} ~cond := #in~cond; {65653#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:39,370 INFO L290 TraceCheckUtils]: 101: Hoare triple {65653#(<= ~counter~0 11)} assume !(0 == ~cond); {65653#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:39,371 INFO L290 TraceCheckUtils]: 102: Hoare triple {65653#(<= ~counter~0 11)} assume true; {65653#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:39,371 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65653#(<= ~counter~0 11)} {65653#(<= ~counter~0 11)} #98#return; {65653#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:39,371 INFO L290 TraceCheckUtils]: 104: Hoare triple {65653#(<= ~counter~0 11)} assume !(~r~0 < 0); {65653#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:39,372 INFO L290 TraceCheckUtils]: 105: Hoare triple {65653#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65678#(<= |main_#t~post6| 11)} is VALID [2022-04-15 15:17:39,372 INFO L290 TraceCheckUtils]: 106: Hoare triple {65678#(<= |main_#t~post6| 11)} assume !(#t~post6 < 20);havoc #t~post6; {65347#false} is VALID [2022-04-15 15:17:39,372 INFO L272 TraceCheckUtils]: 107: Hoare triple {65347#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65347#false} is VALID [2022-04-15 15:17:39,372 INFO L290 TraceCheckUtils]: 108: Hoare triple {65347#false} ~cond := #in~cond; {65347#false} is VALID [2022-04-15 15:17:39,372 INFO L290 TraceCheckUtils]: 109: Hoare triple {65347#false} assume 0 == ~cond; {65347#false} is VALID [2022-04-15 15:17:39,372 INFO L290 TraceCheckUtils]: 110: Hoare triple {65347#false} assume !false; {65347#false} is VALID [2022-04-15 15:17:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 292 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:17:39,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:17:39,991 INFO L290 TraceCheckUtils]: 110: Hoare triple {65347#false} assume !false; {65347#false} is VALID [2022-04-15 15:17:39,991 INFO L290 TraceCheckUtils]: 109: Hoare triple {65347#false} assume 0 == ~cond; {65347#false} is VALID [2022-04-15 15:17:39,991 INFO L290 TraceCheckUtils]: 108: Hoare triple {65347#false} ~cond := #in~cond; {65347#false} is VALID [2022-04-15 15:17:39,991 INFO L272 TraceCheckUtils]: 107: Hoare triple {65347#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65347#false} is VALID [2022-04-15 15:17:39,992 INFO L290 TraceCheckUtils]: 106: Hoare triple {65706#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {65347#false} is VALID [2022-04-15 15:17:39,992 INFO L290 TraceCheckUtils]: 105: Hoare triple {65710#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65706#(< |main_#t~post6| 20)} is VALID [2022-04-15 15:17:39,992 INFO L290 TraceCheckUtils]: 104: Hoare triple {65710#(< ~counter~0 20)} assume !(~r~0 < 0); {65710#(< ~counter~0 20)} is VALID [2022-04-15 15:17:39,993 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65346#true} {65710#(< ~counter~0 20)} #98#return; {65710#(< ~counter~0 20)} is VALID [2022-04-15 15:17:39,993 INFO L290 TraceCheckUtils]: 102: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:39,993 INFO L290 TraceCheckUtils]: 101: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:39,993 INFO L290 TraceCheckUtils]: 100: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:39,993 INFO L272 TraceCheckUtils]: 99: Hoare triple {65710#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65346#true} is VALID [2022-04-15 15:17:39,993 INFO L290 TraceCheckUtils]: 98: Hoare triple {65710#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {65710#(< ~counter~0 20)} is VALID [2022-04-15 15:17:39,995 INFO L290 TraceCheckUtils]: 97: Hoare triple {65735#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65710#(< ~counter~0 20)} is VALID [2022-04-15 15:17:39,995 INFO L290 TraceCheckUtils]: 96: Hoare triple {65735#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65735#(< ~counter~0 19)} is VALID [2022-04-15 15:17:39,995 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65346#true} {65735#(< ~counter~0 19)} #98#return; {65735#(< ~counter~0 19)} is VALID [2022-04-15 15:17:39,995 INFO L290 TraceCheckUtils]: 94: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:39,995 INFO L290 TraceCheckUtils]: 93: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:39,996 INFO L290 TraceCheckUtils]: 92: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:39,996 INFO L272 TraceCheckUtils]: 91: Hoare triple {65735#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65346#true} is VALID [2022-04-15 15:17:39,996 INFO L290 TraceCheckUtils]: 90: Hoare triple {65735#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {65735#(< ~counter~0 19)} is VALID [2022-04-15 15:17:39,997 INFO L290 TraceCheckUtils]: 89: Hoare triple {65760#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65735#(< ~counter~0 19)} is VALID [2022-04-15 15:17:39,997 INFO L290 TraceCheckUtils]: 88: Hoare triple {65760#(< ~counter~0 18)} assume !(~r~0 > 0); {65760#(< ~counter~0 18)} is VALID [2022-04-15 15:17:39,997 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65346#true} {65760#(< ~counter~0 18)} #96#return; {65760#(< ~counter~0 18)} is VALID [2022-04-15 15:17:39,997 INFO L290 TraceCheckUtils]: 86: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:39,997 INFO L290 TraceCheckUtils]: 85: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:39,998 INFO L290 TraceCheckUtils]: 84: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:39,998 INFO L272 TraceCheckUtils]: 83: Hoare triple {65760#(< ~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)); {65346#true} is VALID [2022-04-15 15:17:39,998 INFO L290 TraceCheckUtils]: 82: Hoare triple {65760#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {65760#(< ~counter~0 18)} is VALID [2022-04-15 15:17:39,999 INFO L290 TraceCheckUtils]: 81: Hoare triple {65785#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65760#(< ~counter~0 18)} is VALID [2022-04-15 15:17:39,999 INFO L290 TraceCheckUtils]: 80: Hoare triple {65785#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65785#(< ~counter~0 17)} is VALID [2022-04-15 15:17:39,999 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65346#true} {65785#(< ~counter~0 17)} #96#return; {65785#(< ~counter~0 17)} is VALID [2022-04-15 15:17:39,999 INFO L290 TraceCheckUtils]: 78: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:39,999 INFO L290 TraceCheckUtils]: 77: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:40,000 INFO L290 TraceCheckUtils]: 76: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:40,000 INFO L272 TraceCheckUtils]: 75: Hoare triple {65785#(< ~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)); {65346#true} is VALID [2022-04-15 15:17:40,000 INFO L290 TraceCheckUtils]: 74: Hoare triple {65785#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {65785#(< ~counter~0 17)} is VALID [2022-04-15 15:17:40,001 INFO L290 TraceCheckUtils]: 73: Hoare triple {65810#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65785#(< ~counter~0 17)} is VALID [2022-04-15 15:17:40,001 INFO L290 TraceCheckUtils]: 72: Hoare triple {65810#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65810#(< ~counter~0 16)} is VALID [2022-04-15 15:17:40,001 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65346#true} {65810#(< ~counter~0 16)} #96#return; {65810#(< ~counter~0 16)} is VALID [2022-04-15 15:17:40,001 INFO L290 TraceCheckUtils]: 70: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:40,001 INFO L290 TraceCheckUtils]: 69: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:40,002 INFO L290 TraceCheckUtils]: 68: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:40,002 INFO L272 TraceCheckUtils]: 67: Hoare triple {65810#(< ~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)); {65346#true} is VALID [2022-04-15 15:17:40,002 INFO L290 TraceCheckUtils]: 66: Hoare triple {65810#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {65810#(< ~counter~0 16)} is VALID [2022-04-15 15:17:40,003 INFO L290 TraceCheckUtils]: 65: Hoare triple {65835#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65810#(< ~counter~0 16)} is VALID [2022-04-15 15:17:40,003 INFO L290 TraceCheckUtils]: 64: Hoare triple {65835#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65835#(< ~counter~0 15)} is VALID [2022-04-15 15:17:40,003 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65346#true} {65835#(< ~counter~0 15)} #96#return; {65835#(< ~counter~0 15)} is VALID [2022-04-15 15:17:40,004 INFO L290 TraceCheckUtils]: 62: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:40,004 INFO L290 TraceCheckUtils]: 61: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:40,004 INFO L290 TraceCheckUtils]: 60: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:40,004 INFO L272 TraceCheckUtils]: 59: Hoare triple {65835#(< ~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)); {65346#true} is VALID [2022-04-15 15:17:40,004 INFO L290 TraceCheckUtils]: 58: Hoare triple {65835#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {65835#(< ~counter~0 15)} is VALID [2022-04-15 15:17:40,005 INFO L290 TraceCheckUtils]: 57: Hoare triple {65860#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65835#(< ~counter~0 15)} is VALID [2022-04-15 15:17:40,005 INFO L290 TraceCheckUtils]: 56: Hoare triple {65860#(< ~counter~0 14)} assume !!(0 != ~r~0); {65860#(< ~counter~0 14)} is VALID [2022-04-15 15:17:40,005 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65346#true} {65860#(< ~counter~0 14)} #94#return; {65860#(< ~counter~0 14)} is VALID [2022-04-15 15:17:40,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:40,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:40,006 INFO L290 TraceCheckUtils]: 52: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:40,006 INFO L272 TraceCheckUtils]: 51: Hoare triple {65860#(< ~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)); {65346#true} is VALID [2022-04-15 15:17:40,006 INFO L290 TraceCheckUtils]: 50: Hoare triple {65860#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {65860#(< ~counter~0 14)} is VALID [2022-04-15 15:17:40,007 INFO L290 TraceCheckUtils]: 49: Hoare triple {65885#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65860#(< ~counter~0 14)} is VALID [2022-04-15 15:17:40,007 INFO L290 TraceCheckUtils]: 48: Hoare triple {65885#(< ~counter~0 13)} assume !(~r~0 < 0); {65885#(< ~counter~0 13)} is VALID [2022-04-15 15:17:40,007 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65346#true} {65885#(< ~counter~0 13)} #98#return; {65885#(< ~counter~0 13)} is VALID [2022-04-15 15:17:40,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:40,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:40,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:40,008 INFO L272 TraceCheckUtils]: 43: Hoare triple {65885#(< ~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)); {65346#true} is VALID [2022-04-15 15:17:40,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {65885#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {65885#(< ~counter~0 13)} is VALID [2022-04-15 15:17:40,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {65653#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65885#(< ~counter~0 13)} is VALID [2022-04-15 15:17:40,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {65653#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65653#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:40,009 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65346#true} {65653#(<= ~counter~0 11)} #98#return; {65653#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:40,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:40,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:40,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:40,010 INFO L272 TraceCheckUtils]: 35: Hoare triple {65653#(<= ~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)); {65346#true} is VALID [2022-04-15 15:17:40,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {65653#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {65653#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:40,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {65628#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65653#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:40,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {65628#(<= ~counter~0 10)} assume !(~r~0 > 0); {65628#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:40,011 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65346#true} {65628#(<= ~counter~0 10)} #96#return; {65628#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:40,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:40,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:40,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:40,012 INFO L272 TraceCheckUtils]: 27: Hoare triple {65628#(<= ~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)); {65346#true} is VALID [2022-04-15 15:17:40,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {65628#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {65628#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:40,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {65603#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65628#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:40,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {65603#(<= ~counter~0 9)} assume !!(0 != ~r~0); {65603#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:40,013 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65346#true} {65603#(<= ~counter~0 9)} #94#return; {65603#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:40,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:40,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:40,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:40,014 INFO L272 TraceCheckUtils]: 19: Hoare triple {65603#(<= ~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)); {65346#true} is VALID [2022-04-15 15:17:40,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {65603#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {65603#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:40,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {65578#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65603#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:40,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {65578#(<= ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:40,015 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65346#true} {65578#(<= ~counter~0 8)} #92#return; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:40,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:40,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:40,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:40,016 INFO L272 TraceCheckUtils]: 11: Hoare triple {65578#(<= ~counter~0 8)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {65346#true} is VALID [2022-04-15 15:17:40,016 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65346#true} {65578#(<= ~counter~0 8)} #90#return; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:40,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {65346#true} assume true; {65346#true} is VALID [2022-04-15 15:17:40,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {65346#true} assume !(0 == ~cond); {65346#true} is VALID [2022-04-15 15:17:40,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {65346#true} ~cond := #in~cond; {65346#true} is VALID [2022-04-15 15:17:40,016 INFO L272 TraceCheckUtils]: 6: Hoare triple {65578#(<= ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65346#true} is VALID [2022-04-15 15:17:40,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {65578#(<= ~counter~0 8)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:40,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {65578#(<= ~counter~0 8)} call #t~ret9 := main(); {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:40,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65578#(<= ~counter~0 8)} {65346#true} #102#return; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:40,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {65578#(<= ~counter~0 8)} assume true; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:40,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {65346#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {65578#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:40,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {65346#true} call ULTIMATE.init(); {65346#true} is VALID [2022-04-15 15:17:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 15:17:40,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:17:40,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036759174] [2022-04-15 15:17:40,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:17:40,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417478463] [2022-04-15 15:17:40,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417478463] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:17:40,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:17:40,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-15 15:17:40,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:17:40,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2106318175] [2022-04-15 15:17:40,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2106318175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:17:40,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:17:40,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 15:17:40,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689125225] [2022-04-15 15:17:40,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:17:40,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 111 [2022-04-15 15:17:40,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:17:40,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:17:40,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:40,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 15:17:40,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:17:40,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 15:17:40,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:17:40,114 INFO L87 Difference]: Start difference. First operand 574 states and 760 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:17:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:17:42,346 INFO L93 Difference]: Finished difference Result 633 states and 840 transitions. [2022-04-15 15:17:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 15:17:42,347 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 111 [2022-04-15 15:17:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:17:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:17:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-15 15:17:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:17:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-15 15:17:42,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 234 transitions. [2022-04-15 15:17:42,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:42,556 INFO L225 Difference]: With dead ends: 633 [2022-04-15 15:17:42,556 INFO L226 Difference]: Without dead ends: 622 [2022-04-15 15:17:42,557 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=399, Invalid=593, Unknown=0, NotChecked=0, Total=992 [2022-04-15 15:17:42,557 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 150 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:17:42,557 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 275 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:17:42,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-04-15 15:17:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 600. [2022-04-15 15:17:43,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:17:43,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 622 states. Second operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:17:43,760 INFO L74 IsIncluded]: Start isIncluded. First operand 622 states. Second operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:17:43,760 INFO L87 Difference]: Start difference. First operand 622 states. Second operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:17:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:17:43,773 INFO L93 Difference]: Finished difference Result 622 states and 824 transitions. [2022-04-15 15:17:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 824 transitions. [2022-04-15 15:17:43,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:17:43,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:17:43,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 622 states. [2022-04-15 15:17:43,775 INFO L87 Difference]: Start difference. First operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 622 states. [2022-04-15 15:17:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:17:43,787 INFO L93 Difference]: Finished difference Result 622 states and 824 transitions. [2022-04-15 15:17:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 824 transitions. [2022-04-15 15:17:43,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:17:43,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:17:43,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:17:43,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:17:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:17:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 798 transitions. [2022-04-15 15:17:43,810 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 798 transitions. Word has length 111 [2022-04-15 15:17:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:17:43,810 INFO L478 AbstractCegarLoop]: Abstraction has 600 states and 798 transitions. [2022-04-15 15:17:43,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:17:43,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 600 states and 798 transitions. [2022-04-15 15:17:55,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 798 edges. 795 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 798 transitions. [2022-04-15 15:17:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 15:17:55,938 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:17:55,938 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:17:55,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 15:17:56,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 15:17:56,139 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:17:56,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:17:56,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 13 times [2022-04-15 15:17:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:17:56,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1348112457] [2022-04-15 15:17:56,140 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:17:56,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 14 times [2022-04-15 15:17:56,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:17:56,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691013216] [2022-04-15 15:17:56,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:17:56,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:17:56,159 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:17:56,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737734477] [2022-04-15 15:17:56,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:17:56,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:17:56,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:17:56,161 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:17:56,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 15:17:56,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:17:56,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:17:56,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 15:17:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:17:56,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:17:57,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {69761#true} call ULTIMATE.init(); {69761#true} is VALID [2022-04-15 15:17:57,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {69761#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 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#true} is VALID [2022-04-15 15:17:57,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69761#true} {69761#true} #102#return; {69761#true} is VALID [2022-04-15 15:17:57,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {69761#true} call #t~ret9 := main(); {69761#true} is VALID [2022-04-15 15:17:57,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {69761#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; {69761#true} is VALID [2022-04-15 15:17:57,105 INFO L272 TraceCheckUtils]: 6: Hoare triple {69761#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69761#true} is VALID [2022-04-15 15:17:57,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,105 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69761#true} {69761#true} #90#return; {69761#true} is VALID [2022-04-15 15:17:57,106 INFO L272 TraceCheckUtils]: 11: Hoare triple {69761#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)); {69761#true} is VALID [2022-04-15 15:17:57,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,106 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69761#true} {69761#true} #92#return; {69761#true} is VALID [2022-04-15 15:17:57,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {69761#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {69814#(<= 1 main_~v~0)} is VALID [2022-04-15 15:17:57,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {69814#(<= 1 main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69814#(<= 1 main_~v~0)} is VALID [2022-04-15 15:17:57,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {69814#(<= 1 main_~v~0)} assume !!(#t~post6 < 20);havoc #t~post6; {69814#(<= 1 main_~v~0)} is VALID [2022-04-15 15:17:57,107 INFO L272 TraceCheckUtils]: 19: Hoare triple {69814#(<= 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)); {69761#true} is VALID [2022-04-15 15:17:57,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,107 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69761#true} {69814#(<= 1 main_~v~0)} #94#return; {69814#(<= 1 main_~v~0)} is VALID [2022-04-15 15:17:57,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {69814#(<= 1 main_~v~0)} assume !!(0 != ~r~0); {69814#(<= 1 main_~v~0)} is VALID [2022-04-15 15:17:57,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {69814#(<= 1 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69814#(<= 1 main_~v~0)} is VALID [2022-04-15 15:17:57,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {69814#(<= 1 main_~v~0)} assume !!(#t~post7 < 20);havoc #t~post7; {69814#(<= 1 main_~v~0)} is VALID [2022-04-15 15:17:57,108 INFO L272 TraceCheckUtils]: 27: Hoare triple {69814#(<= 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)); {69761#true} is VALID [2022-04-15 15:17:57,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,109 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69761#true} {69814#(<= 1 main_~v~0)} #96#return; {69814#(<= 1 main_~v~0)} is VALID [2022-04-15 15:17:57,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {69814#(<= 1 main_~v~0)} assume !(~r~0 > 0); {69814#(<= 1 main_~v~0)} is VALID [2022-04-15 15:17:57,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {69814#(<= 1 main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69814#(<= 1 main_~v~0)} is VALID [2022-04-15 15:17:57,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {69814#(<= 1 main_~v~0)} assume !!(#t~post8 < 20);havoc #t~post8; {69814#(<= 1 main_~v~0)} is VALID [2022-04-15 15:17:57,110 INFO L272 TraceCheckUtils]: 35: Hoare triple {69814#(<= 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)); {69761#true} is VALID [2022-04-15 15:17:57,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,110 INFO L290 TraceCheckUtils]: 38: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,111 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69761#true} {69814#(<= 1 main_~v~0)} #98#return; {69814#(<= 1 main_~v~0)} is VALID [2022-04-15 15:17:57,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {69814#(<= 1 main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:17:57,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:17:57,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post8 < 20);havoc #t~post8; {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:17:57,113 INFO L272 TraceCheckUtils]: 43: Hoare triple {69887#(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)); {69761#true} is VALID [2022-04-15 15:17:57,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,114 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69761#true} {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #98#return; {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:17:57,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !(~r~0 < 0); {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:17:57,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:17:57,115 INFO L290 TraceCheckUtils]: 50: Hoare triple {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post6 < 20);havoc #t~post6; {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:17:57,115 INFO L272 TraceCheckUtils]: 51: Hoare triple {69887#(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)); {69761#true} is VALID [2022-04-15 15:17:57,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,115 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69761#true} {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #94#return; {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:17:57,116 INFO L290 TraceCheckUtils]: 56: Hoare triple {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(0 != ~r~0); {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:17:57,116 INFO L290 TraceCheckUtils]: 57: Hoare triple {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:17:57,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post7 < 20);havoc #t~post7; {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:17:57,117 INFO L272 TraceCheckUtils]: 59: Hoare triple {69887#(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)); {69761#true} is VALID [2022-04-15 15:17:57,117 INFO L290 TraceCheckUtils]: 60: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,117 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69761#true} {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #96#return; {69887#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:17:57,118 INFO L290 TraceCheckUtils]: 64: Hoare triple {69887#(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; {69960#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 15:17:57,118 INFO L290 TraceCheckUtils]: 65: Hoare triple {69960#(< (+ main_~r~0 3) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69960#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 15:17:57,119 INFO L290 TraceCheckUtils]: 66: Hoare triple {69960#(< (+ main_~r~0 3) main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {69960#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 15:17:57,119 INFO L272 TraceCheckUtils]: 67: Hoare triple {69960#(< (+ 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)); {69761#true} is VALID [2022-04-15 15:17:57,119 INFO L290 TraceCheckUtils]: 68: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,119 INFO L290 TraceCheckUtils]: 69: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,119 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69761#true} {69960#(< (+ main_~r~0 3) main_~u~0)} #96#return; {69960#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 15:17:57,120 INFO L290 TraceCheckUtils]: 72: Hoare triple {69960#(< (+ main_~r~0 3) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69985#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 15:17:57,120 INFO L290 TraceCheckUtils]: 73: Hoare triple {69985#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69985#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 15:17:57,121 INFO L290 TraceCheckUtils]: 74: Hoare triple {69985#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {69985#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 15:17:57,121 INFO L272 TraceCheckUtils]: 75: Hoare triple {69985#(< (+ 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)); {69761#true} is VALID [2022-04-15 15:17:57,121 INFO L290 TraceCheckUtils]: 76: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,121 INFO L290 TraceCheckUtils]: 77: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,121 INFO L290 TraceCheckUtils]: 78: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,121 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69761#true} {69985#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #96#return; {69985#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 15:17:57,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {69985#(< (+ 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; {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:17:57,122 INFO L290 TraceCheckUtils]: 81: Hoare triple {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:17:57,122 INFO L290 TraceCheckUtils]: 82: Hoare triple {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 20);havoc #t~post7; {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:17:57,123 INFO L272 TraceCheckUtils]: 83: Hoare triple {70010#(< 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)); {69761#true} is VALID [2022-04-15 15:17:57,123 INFO L290 TraceCheckUtils]: 84: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,123 INFO L290 TraceCheckUtils]: 85: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,123 INFO L290 TraceCheckUtils]: 86: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,123 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69761#true} {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #96#return; {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:17:57,123 INFO L290 TraceCheckUtils]: 88: Hoare triple {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:17:57,124 INFO L290 TraceCheckUtils]: 89: Hoare triple {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:17:57,124 INFO L290 TraceCheckUtils]: 90: Hoare triple {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 20);havoc #t~post8; {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:17:57,124 INFO L272 TraceCheckUtils]: 91: Hoare triple {70010#(< 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)); {69761#true} is VALID [2022-04-15 15:17:57,124 INFO L290 TraceCheckUtils]: 92: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,124 INFO L290 TraceCheckUtils]: 93: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,124 INFO L290 TraceCheckUtils]: 94: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,125 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69761#true} {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #98#return; {70010#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:17:57,126 INFO L290 TraceCheckUtils]: 96: Hoare triple {70010#(< 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; {70059#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 15:17:57,126 INFO L290 TraceCheckUtils]: 97: Hoare triple {70059#(< 0 (div (+ (- 2) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70059#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 15:17:57,126 INFO L290 TraceCheckUtils]: 98: Hoare triple {70059#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(#t~post8 < 20);havoc #t~post8; {70059#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 15:17:57,126 INFO L272 TraceCheckUtils]: 99: Hoare triple {70059#(< 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)); {69761#true} is VALID [2022-04-15 15:17:57,126 INFO L290 TraceCheckUtils]: 100: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,126 INFO L290 TraceCheckUtils]: 101: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,127 INFO L290 TraceCheckUtils]: 102: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,127 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69761#true} {70059#(< 0 (div (+ (- 2) main_~r~0) 2))} #98#return; {70059#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 15:17:57,128 INFO L290 TraceCheckUtils]: 104: Hoare triple {70059#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69762#false} is VALID [2022-04-15 15:17:57,128 INFO L290 TraceCheckUtils]: 105: Hoare triple {69762#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69762#false} is VALID [2022-04-15 15:17:57,128 INFO L290 TraceCheckUtils]: 106: Hoare triple {69762#false} assume !(#t~post8 < 20);havoc #t~post8; {69762#false} is VALID [2022-04-15 15:17:57,128 INFO L290 TraceCheckUtils]: 107: Hoare triple {69762#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69762#false} is VALID [2022-04-15 15:17:57,128 INFO L290 TraceCheckUtils]: 108: Hoare triple {69762#false} assume !(#t~post6 < 20);havoc #t~post6; {69762#false} is VALID [2022-04-15 15:17:57,128 INFO L272 TraceCheckUtils]: 109: Hoare triple {69762#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69762#false} is VALID [2022-04-15 15:17:57,128 INFO L290 TraceCheckUtils]: 110: Hoare triple {69762#false} ~cond := #in~cond; {69762#false} is VALID [2022-04-15 15:17:57,128 INFO L290 TraceCheckUtils]: 111: Hoare triple {69762#false} assume 0 == ~cond; {69762#false} is VALID [2022-04-15 15:17:57,128 INFO L290 TraceCheckUtils]: 112: Hoare triple {69762#false} assume !false; {69762#false} is VALID [2022-04-15 15:17:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 46 proven. 56 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 15:17:57,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:17:57,602 INFO L290 TraceCheckUtils]: 112: Hoare triple {69762#false} assume !false; {69762#false} is VALID [2022-04-15 15:17:57,602 INFO L290 TraceCheckUtils]: 111: Hoare triple {69762#false} assume 0 == ~cond; {69762#false} is VALID [2022-04-15 15:17:57,603 INFO L290 TraceCheckUtils]: 110: Hoare triple {69762#false} ~cond := #in~cond; {69762#false} is VALID [2022-04-15 15:17:57,603 INFO L272 TraceCheckUtils]: 109: Hoare triple {69762#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69762#false} is VALID [2022-04-15 15:17:57,603 INFO L290 TraceCheckUtils]: 108: Hoare triple {69762#false} assume !(#t~post6 < 20);havoc #t~post6; {69762#false} is VALID [2022-04-15 15:17:57,603 INFO L290 TraceCheckUtils]: 107: Hoare triple {69762#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69762#false} is VALID [2022-04-15 15:17:57,603 INFO L290 TraceCheckUtils]: 106: Hoare triple {69762#false} assume !(#t~post8 < 20);havoc #t~post8; {69762#false} is VALID [2022-04-15 15:17:57,603 INFO L290 TraceCheckUtils]: 105: Hoare triple {69762#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69762#false} is VALID [2022-04-15 15:17:57,603 INFO L290 TraceCheckUtils]: 104: Hoare triple {70132#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69762#false} is VALID [2022-04-15 15:17:57,604 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69761#true} {70132#(not (< main_~r~0 0))} #98#return; {70132#(not (< main_~r~0 0))} is VALID [2022-04-15 15:17:57,604 INFO L290 TraceCheckUtils]: 102: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,604 INFO L290 TraceCheckUtils]: 101: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,604 INFO L290 TraceCheckUtils]: 100: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,604 INFO L272 TraceCheckUtils]: 99: Hoare triple {70132#(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)); {69761#true} is VALID [2022-04-15 15:17:57,604 INFO L290 TraceCheckUtils]: 98: Hoare triple {70132#(not (< main_~r~0 0))} assume !!(#t~post8 < 20);havoc #t~post8; {70132#(not (< main_~r~0 0))} is VALID [2022-04-15 15:17:57,604 INFO L290 TraceCheckUtils]: 97: Hoare triple {70132#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70132#(not (< main_~r~0 0))} is VALID [2022-04-15 15:17:57,605 INFO L290 TraceCheckUtils]: 96: Hoare triple {70157#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70132#(not (< main_~r~0 0))} is VALID [2022-04-15 15:17:57,606 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69761#true} {70157#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {70157#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:57,606 INFO L290 TraceCheckUtils]: 94: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,606 INFO L290 TraceCheckUtils]: 93: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,606 INFO L290 TraceCheckUtils]: 92: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,606 INFO L272 TraceCheckUtils]: 91: Hoare triple {70157#(<= 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)); {69761#true} is VALID [2022-04-15 15:17:57,606 INFO L290 TraceCheckUtils]: 90: Hoare triple {70157#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {70157#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:57,606 INFO L290 TraceCheckUtils]: 89: Hoare triple {70157#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70157#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:57,607 INFO L290 TraceCheckUtils]: 88: Hoare triple {70157#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {70157#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:57,607 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69761#true} {70157#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {70157#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:57,607 INFO L290 TraceCheckUtils]: 86: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,607 INFO L290 TraceCheckUtils]: 85: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,607 INFO L290 TraceCheckUtils]: 84: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,607 INFO L272 TraceCheckUtils]: 83: Hoare triple {70157#(<= 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)); {69761#true} is VALID [2022-04-15 15:17:57,608 INFO L290 TraceCheckUtils]: 82: Hoare triple {70157#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {70157#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:57,608 INFO L290 TraceCheckUtils]: 81: Hoare triple {70157#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70157#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:57,609 INFO L290 TraceCheckUtils]: 80: Hoare triple {70206#(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; {70157#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:57,609 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69761#true} {70206#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {70206#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:17:57,609 INFO L290 TraceCheckUtils]: 78: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,609 INFO L290 TraceCheckUtils]: 77: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,609 INFO L290 TraceCheckUtils]: 76: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,609 INFO L272 TraceCheckUtils]: 75: Hoare triple {70206#(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)); {69761#true} is VALID [2022-04-15 15:17:57,610 INFO L290 TraceCheckUtils]: 74: Hoare triple {70206#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {70206#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:17:57,610 INFO L290 TraceCheckUtils]: 73: Hoare triple {70206#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70206#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:17:57,611 INFO L290 TraceCheckUtils]: 72: Hoare triple {70231#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70206#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:17:57,612 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69761#true} {70231#(<= main_~r~0 main_~u~0)} #96#return; {70231#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:17:57,612 INFO L290 TraceCheckUtils]: 70: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,612 INFO L290 TraceCheckUtils]: 69: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,612 INFO L290 TraceCheckUtils]: 68: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,612 INFO L272 TraceCheckUtils]: 67: Hoare triple {70231#(<= 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)); {69761#true} is VALID [2022-04-15 15:17:57,613 INFO L290 TraceCheckUtils]: 66: Hoare triple {70231#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {70231#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:17:57,613 INFO L290 TraceCheckUtils]: 65: Hoare triple {70231#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70231#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:17:57,613 INFO L290 TraceCheckUtils]: 64: Hoare triple {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70231#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:17:57,614 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69761#true} {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #96#return; {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:17:57,614 INFO L290 TraceCheckUtils]: 62: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,614 INFO L290 TraceCheckUtils]: 60: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,614 INFO L272 TraceCheckUtils]: 59: Hoare triple {70256#(<= 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)); {69761#true} is VALID [2022-04-15 15:17:57,614 INFO L290 TraceCheckUtils]: 58: Hoare triple {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post7 < 20);havoc #t~post7; {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:17:57,615 INFO L290 TraceCheckUtils]: 57: Hoare triple {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:17:57,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(0 != ~r~0); {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:17:57,616 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69761#true} {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #94#return; {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:17:57,616 INFO L290 TraceCheckUtils]: 54: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,616 INFO L290 TraceCheckUtils]: 53: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,616 INFO L290 TraceCheckUtils]: 52: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,616 INFO L272 TraceCheckUtils]: 51: Hoare triple {70256#(<= 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)); {69761#true} is VALID [2022-04-15 15:17:57,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post6 < 20);havoc #t~post6; {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:17:57,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:17:57,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !(~r~0 < 0); {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:17:57,617 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69761#true} {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #98#return; {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:17:57,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,618 INFO L272 TraceCheckUtils]: 43: Hoare triple {70256#(<= 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)); {69761#true} is VALID [2022-04-15 15:17:57,618 INFO L290 TraceCheckUtils]: 42: Hoare triple {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post8 < 20);havoc #t~post8; {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:17:57,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:17:57,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {70329#(<= 0 (+ main_~v~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70256#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:17:57,619 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69761#true} {70329#(<= 0 (+ main_~v~0 3))} #98#return; {70329#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:17:57,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,619 INFO L272 TraceCheckUtils]: 35: Hoare triple {70329#(<= 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)); {69761#true} is VALID [2022-04-15 15:17:57,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {70329#(<= 0 (+ main_~v~0 3))} assume !!(#t~post8 < 20);havoc #t~post8; {70329#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:17:57,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {70329#(<= 0 (+ main_~v~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70329#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:17:57,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {70329#(<= 0 (+ main_~v~0 3))} assume !(~r~0 > 0); {70329#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:17:57,621 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69761#true} {70329#(<= 0 (+ main_~v~0 3))} #96#return; {70329#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:17:57,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,621 INFO L272 TraceCheckUtils]: 27: Hoare triple {70329#(<= 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)); {69761#true} is VALID [2022-04-15 15:17:57,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {70329#(<= 0 (+ main_~v~0 3))} assume !!(#t~post7 < 20);havoc #t~post7; {70329#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:17:57,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {70329#(<= 0 (+ main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70329#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:17:57,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {70329#(<= 0 (+ main_~v~0 3))} assume !!(0 != ~r~0); {70329#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:17:57,623 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69761#true} {70329#(<= 0 (+ main_~v~0 3))} #94#return; {70329#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:17:57,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,623 INFO L272 TraceCheckUtils]: 19: Hoare triple {70329#(<= 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)); {69761#true} is VALID [2022-04-15 15:17:57,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {70329#(<= 0 (+ main_~v~0 3))} assume !!(#t~post6 < 20);havoc #t~post6; {70329#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:17:57,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {70329#(<= 0 (+ main_~v~0 3))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70329#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:17:57,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {69761#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {70329#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:17:57,624 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69761#true} {69761#true} #92#return; {69761#true} is VALID [2022-04-15 15:17:57,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,624 INFO L272 TraceCheckUtils]: 11: Hoare triple {69761#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)); {69761#true} is VALID [2022-04-15 15:17:57,624 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69761#true} {69761#true} #90#return; {69761#true} is VALID [2022-04-15 15:17:57,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {69761#true} assume !(0 == ~cond); {69761#true} is VALID [2022-04-15 15:17:57,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {69761#true} ~cond := #in~cond; {69761#true} is VALID [2022-04-15 15:17:57,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {69761#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69761#true} is VALID [2022-04-15 15:17:57,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {69761#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; {69761#true} is VALID [2022-04-15 15:17:57,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {69761#true} call #t~ret9 := main(); {69761#true} is VALID [2022-04-15 15:17:57,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69761#true} {69761#true} #102#return; {69761#true} is VALID [2022-04-15 15:17:57,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {69761#true} assume true; {69761#true} is VALID [2022-04-15 15:17:57,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {69761#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 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#true} is VALID [2022-04-15 15:17:57,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {69761#true} call ULTIMATE.init(); {69761#true} is VALID [2022-04-15 15:17:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 34 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 15:17:57,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:17:57,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691013216] [2022-04-15 15:17:57,626 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:17:57,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737734477] [2022-04-15 15:17:57,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737734477] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:17:57,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:17:57,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 15:17:57,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:17:57,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1348112457] [2022-04-15 15:17:57,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1348112457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:17:57,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:17:57,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:17:57,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336007384] [2022-04-15 15:17:57,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:17:57,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-15 15:17:57,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:17:57,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 15:17:57,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:57,697 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:17:57,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:17:57,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:17:57,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:17:57,698 INFO L87 Difference]: Start difference. First operand 600 states and 798 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 15:18:01,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:01,147 INFO L93 Difference]: Finished difference Result 902 states and 1254 transitions. [2022-04-15 15:18:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:18:01,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-15 15:18:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:18:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 15:18:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-15 15:18:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 15:18:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-15 15:18:01,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2022-04-15 15:18:01,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:01,351 INFO L225 Difference]: With dead ends: 902 [2022-04-15 15:18:01,351 INFO L226 Difference]: Without dead ends: 751 [2022-04-15 15:18:01,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-04-15 15:18:01,352 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 67 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:18:01,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 359 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:18:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-04-15 15:18:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 600. [2022-04-15 15:18:02,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:18:02,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 751 states. Second operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:18:02,946 INFO L74 IsIncluded]: Start isIncluded. First operand 751 states. Second operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:18:02,946 INFO L87 Difference]: Start difference. First operand 751 states. Second operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:18:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:02,973 INFO L93 Difference]: Finished difference Result 751 states and 1019 transitions. [2022-04-15 15:18:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1019 transitions. [2022-04-15 15:18:02,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:02,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:02,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 751 states. [2022-04-15 15:18:02,975 INFO L87 Difference]: Start difference. First operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 751 states. [2022-04-15 15:18:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:02,994 INFO L93 Difference]: Finished difference Result 751 states and 1019 transitions. [2022-04-15 15:18:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1019 transitions. [2022-04-15 15:18:02,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:02,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:02,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:18:02,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:18:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:18:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 798 transitions. [2022-04-15 15:18:03,016 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 798 transitions. Word has length 113 [2022-04-15 15:18:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:18:03,017 INFO L478 AbstractCegarLoop]: Abstraction has 600 states and 798 transitions. [2022-04-15 15:18:03,017 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 15:18:03,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 600 states and 798 transitions. [2022-04-15 15:18:22,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 798 edges. 793 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 798 transitions. [2022-04-15 15:18:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 15:18:22,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:18:22,972 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:18:22,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 15:18:23,172 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:18:23,172 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:18:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:18:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 15 times [2022-04-15 15:18:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:18:23,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1647625280] [2022-04-15 15:18:23,173 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:18:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 16 times [2022-04-15 15:18:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:18:23,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50936542] [2022-04-15 15:18:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:18:23,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:18:23,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:18:23,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972008435] [2022-04-15 15:18:23,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:18:23,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:18:23,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:18:23,187 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:18:23,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 15:18:23,570 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:18:23,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:18:23,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 15:18:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:18:23,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:18:24,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {74968#true} call ULTIMATE.init(); {74968#true} is VALID [2022-04-15 15:18:24,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {74968#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {74976#(<= ~counter~0 0)} assume true; {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74976#(<= ~counter~0 0)} {74968#true} #102#return; {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {74976#(<= ~counter~0 0)} call #t~ret9 := main(); {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {74976#(<= ~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; {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {74976#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {74976#(<= ~counter~0 0)} ~cond := #in~cond; {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {74976#(<= ~counter~0 0)} assume !(0 == ~cond); {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {74976#(<= ~counter~0 0)} assume true; {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,126 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74976#(<= ~counter~0 0)} {74976#(<= ~counter~0 0)} #90#return; {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,126 INFO L272 TraceCheckUtils]: 11: Hoare triple {74976#(<= ~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)); {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {74976#(<= ~counter~0 0)} ~cond := #in~cond; {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {74976#(<= ~counter~0 0)} assume !(0 == ~cond); {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {74976#(<= ~counter~0 0)} assume true; {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,127 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74976#(<= ~counter~0 0)} {74976#(<= ~counter~0 0)} #92#return; {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {74976#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {74976#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:24,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {74976#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75025#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:24,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {75025#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {75025#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:24,130 INFO L272 TraceCheckUtils]: 19: Hoare triple {75025#(<= ~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)); {75025#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:24,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {75025#(<= ~counter~0 1)} ~cond := #in~cond; {75025#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:24,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {75025#(<= ~counter~0 1)} assume !(0 == ~cond); {75025#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:24,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {75025#(<= ~counter~0 1)} assume true; {75025#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:24,131 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {75025#(<= ~counter~0 1)} {75025#(<= ~counter~0 1)} #94#return; {75025#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:24,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {75025#(<= ~counter~0 1)} assume !!(0 != ~r~0); {75025#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:24,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {75025#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75050#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:24,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {75050#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {75050#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:24,133 INFO L272 TraceCheckUtils]: 27: Hoare triple {75050#(<= ~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)); {75050#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:24,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {75050#(<= ~counter~0 2)} ~cond := #in~cond; {75050#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:24,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {75050#(<= ~counter~0 2)} assume !(0 == ~cond); {75050#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:24,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {75050#(<= ~counter~0 2)} assume true; {75050#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:24,134 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {75050#(<= ~counter~0 2)} {75050#(<= ~counter~0 2)} #96#return; {75050#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:24,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {75050#(<= ~counter~0 2)} assume !(~r~0 > 0); {75050#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:24,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {75050#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75075#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:24,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {75075#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {75075#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:24,136 INFO L272 TraceCheckUtils]: 35: Hoare triple {75075#(<= ~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)); {75075#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:24,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {75075#(<= ~counter~0 3)} ~cond := #in~cond; {75075#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:24,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {75075#(<= ~counter~0 3)} assume !(0 == ~cond); {75075#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:24,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {75075#(<= ~counter~0 3)} assume true; {75075#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:24,137 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {75075#(<= ~counter~0 3)} {75075#(<= ~counter~0 3)} #98#return; {75075#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:24,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {75075#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75075#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:24,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {75075#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75100#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:24,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {75100#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {75100#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:24,139 INFO L272 TraceCheckUtils]: 43: Hoare triple {75100#(<= ~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)); {75100#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:24,139 INFO L290 TraceCheckUtils]: 44: Hoare triple {75100#(<= ~counter~0 4)} ~cond := #in~cond; {75100#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:24,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {75100#(<= ~counter~0 4)} assume !(0 == ~cond); {75100#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:24,140 INFO L290 TraceCheckUtils]: 46: Hoare triple {75100#(<= ~counter~0 4)} assume true; {75100#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:24,140 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {75100#(<= ~counter~0 4)} {75100#(<= ~counter~0 4)} #98#return; {75100#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:24,141 INFO L290 TraceCheckUtils]: 48: Hoare triple {75100#(<= ~counter~0 4)} assume !(~r~0 < 0); {75100#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:24,141 INFO L290 TraceCheckUtils]: 49: Hoare triple {75100#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75125#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:24,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {75125#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {75125#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:24,142 INFO L272 TraceCheckUtils]: 51: Hoare triple {75125#(<= ~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)); {75125#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:24,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {75125#(<= ~counter~0 5)} ~cond := #in~cond; {75125#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:24,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {75125#(<= ~counter~0 5)} assume !(0 == ~cond); {75125#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:24,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {75125#(<= ~counter~0 5)} assume true; {75125#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:24,143 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {75125#(<= ~counter~0 5)} {75125#(<= ~counter~0 5)} #94#return; {75125#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:24,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {75125#(<= ~counter~0 5)} assume !!(0 != ~r~0); {75125#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:24,144 INFO L290 TraceCheckUtils]: 57: Hoare triple {75125#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75150#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:24,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {75150#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {75150#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:24,145 INFO L272 TraceCheckUtils]: 59: Hoare triple {75150#(<= ~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)); {75150#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:24,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {75150#(<= ~counter~0 6)} ~cond := #in~cond; {75150#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:24,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {75150#(<= ~counter~0 6)} assume !(0 == ~cond); {75150#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:24,146 INFO L290 TraceCheckUtils]: 62: Hoare triple {75150#(<= ~counter~0 6)} assume true; {75150#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:24,146 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {75150#(<= ~counter~0 6)} {75150#(<= ~counter~0 6)} #96#return; {75150#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:24,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {75150#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75150#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:24,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {75150#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75175#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:24,148 INFO L290 TraceCheckUtils]: 66: Hoare triple {75175#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {75175#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:24,148 INFO L272 TraceCheckUtils]: 67: Hoare triple {75175#(<= ~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)); {75175#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:24,148 INFO L290 TraceCheckUtils]: 68: Hoare triple {75175#(<= ~counter~0 7)} ~cond := #in~cond; {75175#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:24,149 INFO L290 TraceCheckUtils]: 69: Hoare triple {75175#(<= ~counter~0 7)} assume !(0 == ~cond); {75175#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:24,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {75175#(<= ~counter~0 7)} assume true; {75175#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:24,150 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {75175#(<= ~counter~0 7)} {75175#(<= ~counter~0 7)} #96#return; {75175#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:24,150 INFO L290 TraceCheckUtils]: 72: Hoare triple {75175#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75175#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:24,151 INFO L290 TraceCheckUtils]: 73: Hoare triple {75175#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,151 INFO L290 TraceCheckUtils]: 74: Hoare triple {75200#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,151 INFO L272 TraceCheckUtils]: 75: Hoare triple {75200#(<= ~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)); {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,152 INFO L290 TraceCheckUtils]: 76: Hoare triple {75200#(<= ~counter~0 8)} ~cond := #in~cond; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,152 INFO L290 TraceCheckUtils]: 77: Hoare triple {75200#(<= ~counter~0 8)} assume !(0 == ~cond); {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,152 INFO L290 TraceCheckUtils]: 78: Hoare triple {75200#(<= ~counter~0 8)} assume true; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,153 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {75200#(<= ~counter~0 8)} {75200#(<= ~counter~0 8)} #96#return; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,153 INFO L290 TraceCheckUtils]: 80: Hoare triple {75200#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,154 INFO L290 TraceCheckUtils]: 81: Hoare triple {75200#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75225#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:24,154 INFO L290 TraceCheckUtils]: 82: Hoare triple {75225#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {75225#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:24,154 INFO L272 TraceCheckUtils]: 83: Hoare triple {75225#(<= ~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)); {75225#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:24,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {75225#(<= ~counter~0 9)} ~cond := #in~cond; {75225#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:24,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {75225#(<= ~counter~0 9)} assume !(0 == ~cond); {75225#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:24,155 INFO L290 TraceCheckUtils]: 86: Hoare triple {75225#(<= ~counter~0 9)} assume true; {75225#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:24,156 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {75225#(<= ~counter~0 9)} {75225#(<= ~counter~0 9)} #96#return; {75225#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:24,156 INFO L290 TraceCheckUtils]: 88: Hoare triple {75225#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75225#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:24,157 INFO L290 TraceCheckUtils]: 89: Hoare triple {75225#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75250#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:24,157 INFO L290 TraceCheckUtils]: 90: Hoare triple {75250#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {75250#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:24,157 INFO L272 TraceCheckUtils]: 91: Hoare triple {75250#(<= ~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)); {75250#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:24,158 INFO L290 TraceCheckUtils]: 92: Hoare triple {75250#(<= ~counter~0 10)} ~cond := #in~cond; {75250#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:24,158 INFO L290 TraceCheckUtils]: 93: Hoare triple {75250#(<= ~counter~0 10)} assume !(0 == ~cond); {75250#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:24,158 INFO L290 TraceCheckUtils]: 94: Hoare triple {75250#(<= ~counter~0 10)} assume true; {75250#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:24,159 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {75250#(<= ~counter~0 10)} {75250#(<= ~counter~0 10)} #96#return; {75250#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:24,159 INFO L290 TraceCheckUtils]: 96: Hoare triple {75250#(<= ~counter~0 10)} assume !(~r~0 > 0); {75250#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:24,160 INFO L290 TraceCheckUtils]: 97: Hoare triple {75250#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75275#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:24,160 INFO L290 TraceCheckUtils]: 98: Hoare triple {75275#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {75275#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:24,161 INFO L272 TraceCheckUtils]: 99: Hoare triple {75275#(<= ~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)); {75275#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:24,161 INFO L290 TraceCheckUtils]: 100: Hoare triple {75275#(<= ~counter~0 11)} ~cond := #in~cond; {75275#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:24,161 INFO L290 TraceCheckUtils]: 101: Hoare triple {75275#(<= ~counter~0 11)} assume !(0 == ~cond); {75275#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:24,161 INFO L290 TraceCheckUtils]: 102: Hoare triple {75275#(<= ~counter~0 11)} assume true; {75275#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:24,162 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {75275#(<= ~counter~0 11)} {75275#(<= ~counter~0 11)} #98#return; {75275#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:24,162 INFO L290 TraceCheckUtils]: 104: Hoare triple {75275#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75275#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:24,162 INFO L290 TraceCheckUtils]: 105: Hoare triple {75275#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75300#(<= |main_#t~post8| 11)} is VALID [2022-04-15 15:18:24,163 INFO L290 TraceCheckUtils]: 106: Hoare triple {75300#(<= |main_#t~post8| 11)} assume !(#t~post8 < 20);havoc #t~post8; {74969#false} is VALID [2022-04-15 15:18:24,163 INFO L290 TraceCheckUtils]: 107: Hoare triple {74969#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74969#false} is VALID [2022-04-15 15:18:24,163 INFO L290 TraceCheckUtils]: 108: Hoare triple {74969#false} assume !(#t~post6 < 20);havoc #t~post6; {74969#false} is VALID [2022-04-15 15:18:24,163 INFO L272 TraceCheckUtils]: 109: Hoare triple {74969#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74969#false} is VALID [2022-04-15 15:18:24,163 INFO L290 TraceCheckUtils]: 110: Hoare triple {74969#false} ~cond := #in~cond; {74969#false} is VALID [2022-04-15 15:18:24,163 INFO L290 TraceCheckUtils]: 111: Hoare triple {74969#false} assume 0 == ~cond; {74969#false} is VALID [2022-04-15 15:18:24,163 INFO L290 TraceCheckUtils]: 112: Hoare triple {74969#false} assume !false; {74969#false} is VALID [2022-04-15 15:18:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 302 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:18:24,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:18:24,721 INFO L290 TraceCheckUtils]: 112: Hoare triple {74969#false} assume !false; {74969#false} is VALID [2022-04-15 15:18:24,721 INFO L290 TraceCheckUtils]: 111: Hoare triple {74969#false} assume 0 == ~cond; {74969#false} is VALID [2022-04-15 15:18:24,721 INFO L290 TraceCheckUtils]: 110: Hoare triple {74969#false} ~cond := #in~cond; {74969#false} is VALID [2022-04-15 15:18:24,721 INFO L272 TraceCheckUtils]: 109: Hoare triple {74969#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74969#false} is VALID [2022-04-15 15:18:24,721 INFO L290 TraceCheckUtils]: 108: Hoare triple {74969#false} assume !(#t~post6 < 20);havoc #t~post6; {74969#false} is VALID [2022-04-15 15:18:24,721 INFO L290 TraceCheckUtils]: 107: Hoare triple {74969#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74969#false} is VALID [2022-04-15 15:18:24,721 INFO L290 TraceCheckUtils]: 106: Hoare triple {75340#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {74969#false} is VALID [2022-04-15 15:18:24,722 INFO L290 TraceCheckUtils]: 105: Hoare triple {75344#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75340#(< |main_#t~post8| 20)} is VALID [2022-04-15 15:18:24,722 INFO L290 TraceCheckUtils]: 104: Hoare triple {75344#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75344#(< ~counter~0 20)} is VALID [2022-04-15 15:18:24,723 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74968#true} {75344#(< ~counter~0 20)} #98#return; {75344#(< ~counter~0 20)} is VALID [2022-04-15 15:18:24,723 INFO L290 TraceCheckUtils]: 102: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,723 INFO L290 TraceCheckUtils]: 101: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,723 INFO L290 TraceCheckUtils]: 100: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,723 INFO L272 TraceCheckUtils]: 99: Hoare triple {75344#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74968#true} is VALID [2022-04-15 15:18:24,723 INFO L290 TraceCheckUtils]: 98: Hoare triple {75344#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {75344#(< ~counter~0 20)} is VALID [2022-04-15 15:18:24,725 INFO L290 TraceCheckUtils]: 97: Hoare triple {75369#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75344#(< ~counter~0 20)} is VALID [2022-04-15 15:18:24,725 INFO L290 TraceCheckUtils]: 96: Hoare triple {75369#(< ~counter~0 19)} assume !(~r~0 > 0); {75369#(< ~counter~0 19)} is VALID [2022-04-15 15:18:24,725 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74968#true} {75369#(< ~counter~0 19)} #96#return; {75369#(< ~counter~0 19)} is VALID [2022-04-15 15:18:24,726 INFO L290 TraceCheckUtils]: 94: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,726 INFO L290 TraceCheckUtils]: 93: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,726 INFO L290 TraceCheckUtils]: 92: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,726 INFO L272 TraceCheckUtils]: 91: Hoare triple {75369#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74968#true} is VALID [2022-04-15 15:18:24,726 INFO L290 TraceCheckUtils]: 90: Hoare triple {75369#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {75369#(< ~counter~0 19)} is VALID [2022-04-15 15:18:24,727 INFO L290 TraceCheckUtils]: 89: Hoare triple {75394#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75369#(< ~counter~0 19)} is VALID [2022-04-15 15:18:24,727 INFO L290 TraceCheckUtils]: 88: Hoare triple {75394#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75394#(< ~counter~0 18)} is VALID [2022-04-15 15:18:24,728 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74968#true} {75394#(< ~counter~0 18)} #96#return; {75394#(< ~counter~0 18)} is VALID [2022-04-15 15:18:24,728 INFO L290 TraceCheckUtils]: 86: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,728 INFO L290 TraceCheckUtils]: 85: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,728 INFO L290 TraceCheckUtils]: 84: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,728 INFO L272 TraceCheckUtils]: 83: Hoare triple {75394#(< ~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)); {74968#true} is VALID [2022-04-15 15:18:24,728 INFO L290 TraceCheckUtils]: 82: Hoare triple {75394#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {75394#(< ~counter~0 18)} is VALID [2022-04-15 15:18:24,729 INFO L290 TraceCheckUtils]: 81: Hoare triple {75419#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75394#(< ~counter~0 18)} is VALID [2022-04-15 15:18:24,729 INFO L290 TraceCheckUtils]: 80: Hoare triple {75419#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75419#(< ~counter~0 17)} is VALID [2022-04-15 15:18:24,730 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74968#true} {75419#(< ~counter~0 17)} #96#return; {75419#(< ~counter~0 17)} is VALID [2022-04-15 15:18:24,730 INFO L290 TraceCheckUtils]: 78: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,730 INFO L290 TraceCheckUtils]: 77: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,730 INFO L290 TraceCheckUtils]: 76: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,730 INFO L272 TraceCheckUtils]: 75: Hoare triple {75419#(< ~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)); {74968#true} is VALID [2022-04-15 15:18:24,730 INFO L290 TraceCheckUtils]: 74: Hoare triple {75419#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {75419#(< ~counter~0 17)} is VALID [2022-04-15 15:18:24,731 INFO L290 TraceCheckUtils]: 73: Hoare triple {75444#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75419#(< ~counter~0 17)} is VALID [2022-04-15 15:18:24,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {75444#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75444#(< ~counter~0 16)} is VALID [2022-04-15 15:18:24,732 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74968#true} {75444#(< ~counter~0 16)} #96#return; {75444#(< ~counter~0 16)} is VALID [2022-04-15 15:18:24,732 INFO L290 TraceCheckUtils]: 70: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,732 INFO L290 TraceCheckUtils]: 69: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,732 INFO L290 TraceCheckUtils]: 68: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,732 INFO L272 TraceCheckUtils]: 67: Hoare triple {75444#(< ~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)); {74968#true} is VALID [2022-04-15 15:18:24,732 INFO L290 TraceCheckUtils]: 66: Hoare triple {75444#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {75444#(< ~counter~0 16)} is VALID [2022-04-15 15:18:24,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {75469#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75444#(< ~counter~0 16)} is VALID [2022-04-15 15:18:24,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {75469#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75469#(< ~counter~0 15)} is VALID [2022-04-15 15:18:24,734 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74968#true} {75469#(< ~counter~0 15)} #96#return; {75469#(< ~counter~0 15)} is VALID [2022-04-15 15:18:24,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,734 INFO L272 TraceCheckUtils]: 59: Hoare triple {75469#(< ~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)); {74968#true} is VALID [2022-04-15 15:18:24,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {75469#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {75469#(< ~counter~0 15)} is VALID [2022-04-15 15:18:24,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {75494#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75469#(< ~counter~0 15)} is VALID [2022-04-15 15:18:24,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {75494#(< ~counter~0 14)} assume !!(0 != ~r~0); {75494#(< ~counter~0 14)} is VALID [2022-04-15 15:18:24,736 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74968#true} {75494#(< ~counter~0 14)} #94#return; {75494#(< ~counter~0 14)} is VALID [2022-04-15 15:18:24,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,736 INFO L272 TraceCheckUtils]: 51: Hoare triple {75494#(< ~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)); {74968#true} is VALID [2022-04-15 15:18:24,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {75494#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {75494#(< ~counter~0 14)} is VALID [2022-04-15 15:18:24,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {75519#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75494#(< ~counter~0 14)} is VALID [2022-04-15 15:18:24,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {75519#(< ~counter~0 13)} assume !(~r~0 < 0); {75519#(< ~counter~0 13)} is VALID [2022-04-15 15:18:24,738 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74968#true} {75519#(< ~counter~0 13)} #98#return; {75519#(< ~counter~0 13)} is VALID [2022-04-15 15:18:24,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,738 INFO L272 TraceCheckUtils]: 43: Hoare triple {75519#(< ~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)); {74968#true} is VALID [2022-04-15 15:18:24,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {75519#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {75519#(< ~counter~0 13)} is VALID [2022-04-15 15:18:24,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {75275#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75519#(< ~counter~0 13)} is VALID [2022-04-15 15:18:24,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {75275#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75275#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:24,740 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74968#true} {75275#(<= ~counter~0 11)} #98#return; {75275#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:24,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,740 INFO L272 TraceCheckUtils]: 35: Hoare triple {75275#(<= ~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)); {74968#true} is VALID [2022-04-15 15:18:24,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {75275#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {75275#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:24,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {75250#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75275#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:24,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {75250#(<= ~counter~0 10)} assume !(~r~0 > 0); {75250#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:24,742 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74968#true} {75250#(<= ~counter~0 10)} #96#return; {75250#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:24,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,742 INFO L272 TraceCheckUtils]: 27: Hoare triple {75250#(<= ~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)); {74968#true} is VALID [2022-04-15 15:18:24,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {75250#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {75250#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:24,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {75225#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75250#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:24,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {75225#(<= ~counter~0 9)} assume !!(0 != ~r~0); {75225#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:24,744 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74968#true} {75225#(<= ~counter~0 9)} #94#return; {75225#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:24,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,744 INFO L272 TraceCheckUtils]: 19: Hoare triple {75225#(<= ~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)); {74968#true} is VALID [2022-04-15 15:18:24,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {75225#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {75225#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:24,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {75200#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75225#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:24,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {75200#(<= ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,746 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74968#true} {75200#(<= ~counter~0 8)} #92#return; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,746 INFO L272 TraceCheckUtils]: 11: Hoare triple {75200#(<= ~counter~0 8)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {74968#true} is VALID [2022-04-15 15:18:24,747 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74968#true} {75200#(<= ~counter~0 8)} #90#return; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {74968#true} assume true; {74968#true} is VALID [2022-04-15 15:18:24,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {74968#true} assume !(0 == ~cond); {74968#true} is VALID [2022-04-15 15:18:24,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {74968#true} ~cond := #in~cond; {74968#true} is VALID [2022-04-15 15:18:24,747 INFO L272 TraceCheckUtils]: 6: Hoare triple {75200#(<= ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74968#true} is VALID [2022-04-15 15:18:24,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {75200#(<= ~counter~0 8)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {75200#(<= ~counter~0 8)} call #t~ret9 := main(); {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75200#(<= ~counter~0 8)} {74968#true} #102#return; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {75200#(<= ~counter~0 8)} assume true; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {74968#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {75200#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:24,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {74968#true} call ULTIMATE.init(); {74968#true} is VALID [2022-04-15 15:18:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 82 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 15:18:24,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:18:24,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50936542] [2022-04-15 15:18:24,749 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:18:24,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972008435] [2022-04-15 15:18:24,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972008435] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:18:24,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:18:24,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-15 15:18:24,750 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:18:24,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1647625280] [2022-04-15 15:18:24,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1647625280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:18:24,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:18:24,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 15:18:24,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134806544] [2022-04-15 15:18:24,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:18:24,751 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 113 [2022-04-15 15:18:24,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:18:24,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:18:24,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:24,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 15:18:24,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:18:24,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 15:18:24,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:18:24,841 INFO L87 Difference]: Start difference. First operand 600 states and 798 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:18:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:27,458 INFO L93 Difference]: Finished difference Result 825 states and 1134 transitions. [2022-04-15 15:18:27,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 15:18:27,459 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 113 [2022-04-15 15:18:27,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:18:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:18:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-15 15:18:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:18:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-15 15:18:27,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 256 transitions. [2022-04-15 15:18:27,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:27,725 INFO L225 Difference]: With dead ends: 825 [2022-04-15 15:18:27,725 INFO L226 Difference]: Without dead ends: 628 [2022-04-15 15:18:27,726 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=425, Invalid=631, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 15:18:27,726 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 155 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:18:27,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 267 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:18:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-04-15 15:18:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 618. [2022-04-15 15:18:29,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:18:29,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 628 states. Second operand has 618 states, 466 states have (on average 1.2188841201716738) internal successors, (568), 470 states have internal predecessors, (568), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:18:29,371 INFO L74 IsIncluded]: Start isIncluded. First operand 628 states. Second operand has 618 states, 466 states have (on average 1.2188841201716738) internal successors, (568), 470 states have internal predecessors, (568), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:18:29,371 INFO L87 Difference]: Start difference. First operand 628 states. Second operand has 618 states, 466 states have (on average 1.2188841201716738) internal successors, (568), 470 states have internal predecessors, (568), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:18:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:29,384 INFO L93 Difference]: Finished difference Result 628 states and 830 transitions. [2022-04-15 15:18:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 830 transitions. [2022-04-15 15:18:29,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:29,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:29,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 618 states, 466 states have (on average 1.2188841201716738) internal successors, (568), 470 states have internal predecessors, (568), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 628 states. [2022-04-15 15:18:29,386 INFO L87 Difference]: Start difference. First operand has 618 states, 466 states have (on average 1.2188841201716738) internal successors, (568), 470 states have internal predecessors, (568), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 628 states. [2022-04-15 15:18:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:29,401 INFO L93 Difference]: Finished difference Result 628 states and 830 transitions. [2022-04-15 15:18:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 830 transitions. [2022-04-15 15:18:29,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:29,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:29,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:18:29,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:18:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 466 states have (on average 1.2188841201716738) internal successors, (568), 470 states have internal predecessors, (568), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:18:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 820 transitions. [2022-04-15 15:18:29,425 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 820 transitions. Word has length 113 [2022-04-15 15:18:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:18:29,425 INFO L478 AbstractCegarLoop]: Abstraction has 618 states and 820 transitions. [2022-04-15 15:18:29,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:18:29,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 618 states and 820 transitions. [2022-04-15 15:18:47,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 820 edges. 817 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 820 transitions. [2022-04-15 15:18:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 15:18:47,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:18:47,766 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:18:47,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-15 15:18:47,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 15:18:47,967 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:18:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:18:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 13 times [2022-04-15 15:18:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:18:47,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1511303221] [2022-04-15 15:18:47,968 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:18:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 14 times [2022-04-15 15:18:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:18:47,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901096987] [2022-04-15 15:18:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:18:47,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:18:48,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:18:48,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1548421615] [2022-04-15 15:18:48,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:18:48,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:18:48,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:18:48,002 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:18:48,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 15:18:48,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:18:48,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:18:48,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 15:18:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:18:48,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:18:48,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {79829#true} call ULTIMATE.init(); {79829#true} is VALID [2022-04-15 15:18:48,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {79829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {79837#(<= ~counter~0 0)} assume true; {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79837#(<= ~counter~0 0)} {79829#true} #102#return; {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {79837#(<= ~counter~0 0)} call #t~ret9 := main(); {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {79837#(<= ~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; {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,651 INFO L272 TraceCheckUtils]: 6: Hoare triple {79837#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {79837#(<= ~counter~0 0)} ~cond := #in~cond; {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {79837#(<= ~counter~0 0)} assume !(0 == ~cond); {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {79837#(<= ~counter~0 0)} assume true; {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79837#(<= ~counter~0 0)} {79837#(<= ~counter~0 0)} #90#return; {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,653 INFO L272 TraceCheckUtils]: 11: Hoare triple {79837#(<= ~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)); {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {79837#(<= ~counter~0 0)} ~cond := #in~cond; {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {79837#(<= ~counter~0 0)} assume !(0 == ~cond); {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {79837#(<= ~counter~0 0)} assume true; {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,654 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79837#(<= ~counter~0 0)} {79837#(<= ~counter~0 0)} #92#return; {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {79837#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79837#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {79837#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79886#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {79886#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {79886#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,657 INFO L272 TraceCheckUtils]: 19: Hoare triple {79886#(<= ~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)); {79886#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {79886#(<= ~counter~0 1)} ~cond := #in~cond; {79886#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {79886#(<= ~counter~0 1)} assume !(0 == ~cond); {79886#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {79886#(<= ~counter~0 1)} assume true; {79886#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,658 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79886#(<= ~counter~0 1)} {79886#(<= ~counter~0 1)} #94#return; {79886#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {79886#(<= ~counter~0 1)} assume !!(0 != ~r~0); {79886#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {79886#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79911#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:48,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {79911#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {79911#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:48,660 INFO L272 TraceCheckUtils]: 27: Hoare triple {79911#(<= ~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)); {79911#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:48,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {79911#(<= ~counter~0 2)} ~cond := #in~cond; {79911#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:48,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {79911#(<= ~counter~0 2)} assume !(0 == ~cond); {79911#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:48,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {79911#(<= ~counter~0 2)} assume true; {79911#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:48,661 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79911#(<= ~counter~0 2)} {79911#(<= ~counter~0 2)} #96#return; {79911#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:48,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {79911#(<= ~counter~0 2)} assume !(~r~0 > 0); {79911#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:48,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {79911#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79936#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:48,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {79936#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {79936#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:48,663 INFO L272 TraceCheckUtils]: 35: Hoare triple {79936#(<= ~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)); {79936#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:48,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {79936#(<= ~counter~0 3)} ~cond := #in~cond; {79936#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:48,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {79936#(<= ~counter~0 3)} assume !(0 == ~cond); {79936#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:48,664 INFO L290 TraceCheckUtils]: 38: Hoare triple {79936#(<= ~counter~0 3)} assume true; {79936#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:48,664 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79936#(<= ~counter~0 3)} {79936#(<= ~counter~0 3)} #98#return; {79936#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:48,665 INFO L290 TraceCheckUtils]: 40: Hoare triple {79936#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79936#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:48,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {79936#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79961#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:48,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {79961#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {79961#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:48,666 INFO L272 TraceCheckUtils]: 43: Hoare triple {79961#(<= ~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)); {79961#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:48,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {79961#(<= ~counter~0 4)} ~cond := #in~cond; {79961#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:48,667 INFO L290 TraceCheckUtils]: 45: Hoare triple {79961#(<= ~counter~0 4)} assume !(0 == ~cond); {79961#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:48,667 INFO L290 TraceCheckUtils]: 46: Hoare triple {79961#(<= ~counter~0 4)} assume true; {79961#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:48,668 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79961#(<= ~counter~0 4)} {79961#(<= ~counter~0 4)} #98#return; {79961#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:48,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {79961#(<= ~counter~0 4)} assume !(~r~0 < 0); {79961#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:48,669 INFO L290 TraceCheckUtils]: 49: Hoare triple {79961#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79986#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:48,669 INFO L290 TraceCheckUtils]: 50: Hoare triple {79986#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {79986#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:48,670 INFO L272 TraceCheckUtils]: 51: Hoare triple {79986#(<= ~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)); {79986#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:48,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {79986#(<= ~counter~0 5)} ~cond := #in~cond; {79986#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:48,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {79986#(<= ~counter~0 5)} assume !(0 == ~cond); {79986#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:48,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {79986#(<= ~counter~0 5)} assume true; {79986#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:48,671 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79986#(<= ~counter~0 5)} {79986#(<= ~counter~0 5)} #94#return; {79986#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:48,671 INFO L290 TraceCheckUtils]: 56: Hoare triple {79986#(<= ~counter~0 5)} assume !!(0 != ~r~0); {79986#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:48,672 INFO L290 TraceCheckUtils]: 57: Hoare triple {79986#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80011#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:48,672 INFO L290 TraceCheckUtils]: 58: Hoare triple {80011#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {80011#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:48,673 INFO L272 TraceCheckUtils]: 59: Hoare triple {80011#(<= ~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)); {80011#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:48,673 INFO L290 TraceCheckUtils]: 60: Hoare triple {80011#(<= ~counter~0 6)} ~cond := #in~cond; {80011#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:48,673 INFO L290 TraceCheckUtils]: 61: Hoare triple {80011#(<= ~counter~0 6)} assume !(0 == ~cond); {80011#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:48,674 INFO L290 TraceCheckUtils]: 62: Hoare triple {80011#(<= ~counter~0 6)} assume true; {80011#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:48,674 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {80011#(<= ~counter~0 6)} {80011#(<= ~counter~0 6)} #96#return; {80011#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:48,674 INFO L290 TraceCheckUtils]: 64: Hoare triple {80011#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80011#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:48,675 INFO L290 TraceCheckUtils]: 65: Hoare triple {80011#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80036#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:48,676 INFO L290 TraceCheckUtils]: 66: Hoare triple {80036#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {80036#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:48,676 INFO L272 TraceCheckUtils]: 67: Hoare triple {80036#(<= ~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)); {80036#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:48,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {80036#(<= ~counter~0 7)} ~cond := #in~cond; {80036#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:48,677 INFO L290 TraceCheckUtils]: 69: Hoare triple {80036#(<= ~counter~0 7)} assume !(0 == ~cond); {80036#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:48,677 INFO L290 TraceCheckUtils]: 70: Hoare triple {80036#(<= ~counter~0 7)} assume true; {80036#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:48,677 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {80036#(<= ~counter~0 7)} {80036#(<= ~counter~0 7)} #96#return; {80036#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:48,685 INFO L290 TraceCheckUtils]: 72: Hoare triple {80036#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80036#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:48,686 INFO L290 TraceCheckUtils]: 73: Hoare triple {80036#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:48,687 INFO L290 TraceCheckUtils]: 74: Hoare triple {80061#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:48,687 INFO L272 TraceCheckUtils]: 75: Hoare triple {80061#(<= ~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)); {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:48,688 INFO L290 TraceCheckUtils]: 76: Hoare triple {80061#(<= ~counter~0 8)} ~cond := #in~cond; {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:48,688 INFO L290 TraceCheckUtils]: 77: Hoare triple {80061#(<= ~counter~0 8)} assume !(0 == ~cond); {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:48,688 INFO L290 TraceCheckUtils]: 78: Hoare triple {80061#(<= ~counter~0 8)} assume true; {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:48,689 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {80061#(<= ~counter~0 8)} {80061#(<= ~counter~0 8)} #96#return; {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:48,689 INFO L290 TraceCheckUtils]: 80: Hoare triple {80061#(<= ~counter~0 8)} assume !(~r~0 > 0); {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:48,690 INFO L290 TraceCheckUtils]: 81: Hoare triple {80061#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80086#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:48,690 INFO L290 TraceCheckUtils]: 82: Hoare triple {80086#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {80086#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:48,690 INFO L272 TraceCheckUtils]: 83: Hoare triple {80086#(<= ~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)); {80086#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:48,691 INFO L290 TraceCheckUtils]: 84: Hoare triple {80086#(<= ~counter~0 9)} ~cond := #in~cond; {80086#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:48,691 INFO L290 TraceCheckUtils]: 85: Hoare triple {80086#(<= ~counter~0 9)} assume !(0 == ~cond); {80086#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:48,691 INFO L290 TraceCheckUtils]: 86: Hoare triple {80086#(<= ~counter~0 9)} assume true; {80086#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:48,692 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {80086#(<= ~counter~0 9)} {80086#(<= ~counter~0 9)} #98#return; {80086#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:48,692 INFO L290 TraceCheckUtils]: 88: Hoare triple {80086#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80086#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:48,693 INFO L290 TraceCheckUtils]: 89: Hoare triple {80086#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80111#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:48,693 INFO L290 TraceCheckUtils]: 90: Hoare triple {80111#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {80111#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:48,694 INFO L272 TraceCheckUtils]: 91: Hoare triple {80111#(<= ~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)); {80111#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:48,694 INFO L290 TraceCheckUtils]: 92: Hoare triple {80111#(<= ~counter~0 10)} ~cond := #in~cond; {80111#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:48,694 INFO L290 TraceCheckUtils]: 93: Hoare triple {80111#(<= ~counter~0 10)} assume !(0 == ~cond); {80111#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:48,694 INFO L290 TraceCheckUtils]: 94: Hoare triple {80111#(<= ~counter~0 10)} assume true; {80111#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:48,695 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {80111#(<= ~counter~0 10)} {80111#(<= ~counter~0 10)} #98#return; {80111#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:48,695 INFO L290 TraceCheckUtils]: 96: Hoare triple {80111#(<= ~counter~0 10)} assume !(~r~0 < 0); {80111#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:48,696 INFO L290 TraceCheckUtils]: 97: Hoare triple {80111#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80136#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:48,696 INFO L290 TraceCheckUtils]: 98: Hoare triple {80136#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {80136#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:48,697 INFO L272 TraceCheckUtils]: 99: Hoare triple {80136#(<= ~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)); {80136#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:48,697 INFO L290 TraceCheckUtils]: 100: Hoare triple {80136#(<= ~counter~0 11)} ~cond := #in~cond; {80136#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:48,697 INFO L290 TraceCheckUtils]: 101: Hoare triple {80136#(<= ~counter~0 11)} assume !(0 == ~cond); {80136#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:48,699 INFO L290 TraceCheckUtils]: 102: Hoare triple {80136#(<= ~counter~0 11)} assume true; {80136#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:48,700 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {80136#(<= ~counter~0 11)} {80136#(<= ~counter~0 11)} #94#return; {80136#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:48,700 INFO L290 TraceCheckUtils]: 104: Hoare triple {80136#(<= ~counter~0 11)} assume !!(0 != ~r~0); {80136#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:48,700 INFO L290 TraceCheckUtils]: 105: Hoare triple {80136#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80161#(<= |main_#t~post7| 11)} is VALID [2022-04-15 15:18:48,701 INFO L290 TraceCheckUtils]: 106: Hoare triple {80161#(<= |main_#t~post7| 11)} assume !(#t~post7 < 20);havoc #t~post7; {79830#false} is VALID [2022-04-15 15:18:48,701 INFO L290 TraceCheckUtils]: 107: Hoare triple {79830#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79830#false} is VALID [2022-04-15 15:18:48,701 INFO L290 TraceCheckUtils]: 108: Hoare triple {79830#false} assume !(#t~post8 < 20);havoc #t~post8; {79830#false} is VALID [2022-04-15 15:18:48,701 INFO L290 TraceCheckUtils]: 109: Hoare triple {79830#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79830#false} is VALID [2022-04-15 15:18:48,701 INFO L290 TraceCheckUtils]: 110: Hoare triple {79830#false} assume !(#t~post6 < 20);havoc #t~post6; {79830#false} is VALID [2022-04-15 15:18:48,701 INFO L272 TraceCheckUtils]: 111: Hoare triple {79830#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79830#false} is VALID [2022-04-15 15:18:48,701 INFO L290 TraceCheckUtils]: 112: Hoare triple {79830#false} ~cond := #in~cond; {79830#false} is VALID [2022-04-15 15:18:48,701 INFO L290 TraceCheckUtils]: 113: Hoare triple {79830#false} assume 0 == ~cond; {79830#false} is VALID [2022-04-15 15:18:48,701 INFO L290 TraceCheckUtils]: 114: Hoare triple {79830#false} assume !false; {79830#false} is VALID [2022-04-15 15:18:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 288 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:18:48,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:18:49,289 INFO L290 TraceCheckUtils]: 114: Hoare triple {79830#false} assume !false; {79830#false} is VALID [2022-04-15 15:18:49,290 INFO L290 TraceCheckUtils]: 113: Hoare triple {79830#false} assume 0 == ~cond; {79830#false} is VALID [2022-04-15 15:18:49,290 INFO L290 TraceCheckUtils]: 112: Hoare triple {79830#false} ~cond := #in~cond; {79830#false} is VALID [2022-04-15 15:18:49,290 INFO L272 TraceCheckUtils]: 111: Hoare triple {79830#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79830#false} is VALID [2022-04-15 15:18:49,290 INFO L290 TraceCheckUtils]: 110: Hoare triple {79830#false} assume !(#t~post6 < 20);havoc #t~post6; {79830#false} is VALID [2022-04-15 15:18:49,290 INFO L290 TraceCheckUtils]: 109: Hoare triple {79830#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79830#false} is VALID [2022-04-15 15:18:49,290 INFO L290 TraceCheckUtils]: 108: Hoare triple {79830#false} assume !(#t~post8 < 20);havoc #t~post8; {79830#false} is VALID [2022-04-15 15:18:49,290 INFO L290 TraceCheckUtils]: 107: Hoare triple {79830#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79830#false} is VALID [2022-04-15 15:18:49,290 INFO L290 TraceCheckUtils]: 106: Hoare triple {80213#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {79830#false} is VALID [2022-04-15 15:18:49,291 INFO L290 TraceCheckUtils]: 105: Hoare triple {80217#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80213#(< |main_#t~post7| 20)} is VALID [2022-04-15 15:18:49,291 INFO L290 TraceCheckUtils]: 104: Hoare triple {80217#(< ~counter~0 20)} assume !!(0 != ~r~0); {80217#(< ~counter~0 20)} is VALID [2022-04-15 15:18:49,291 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79829#true} {80217#(< ~counter~0 20)} #94#return; {80217#(< ~counter~0 20)} is VALID [2022-04-15 15:18:49,292 INFO L290 TraceCheckUtils]: 102: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,292 INFO L290 TraceCheckUtils]: 101: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,292 INFO L290 TraceCheckUtils]: 100: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,292 INFO L272 TraceCheckUtils]: 99: Hoare triple {80217#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79829#true} is VALID [2022-04-15 15:18:49,292 INFO L290 TraceCheckUtils]: 98: Hoare triple {80217#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {80217#(< ~counter~0 20)} is VALID [2022-04-15 15:18:49,294 INFO L290 TraceCheckUtils]: 97: Hoare triple {80242#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80217#(< ~counter~0 20)} is VALID [2022-04-15 15:18:49,294 INFO L290 TraceCheckUtils]: 96: Hoare triple {80242#(< ~counter~0 19)} assume !(~r~0 < 0); {80242#(< ~counter~0 19)} is VALID [2022-04-15 15:18:49,294 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79829#true} {80242#(< ~counter~0 19)} #98#return; {80242#(< ~counter~0 19)} is VALID [2022-04-15 15:18:49,295 INFO L290 TraceCheckUtils]: 94: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,295 INFO L290 TraceCheckUtils]: 93: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,295 INFO L290 TraceCheckUtils]: 92: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,295 INFO L272 TraceCheckUtils]: 91: Hoare triple {80242#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79829#true} is VALID [2022-04-15 15:18:49,295 INFO L290 TraceCheckUtils]: 90: Hoare triple {80242#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {80242#(< ~counter~0 19)} is VALID [2022-04-15 15:18:49,296 INFO L290 TraceCheckUtils]: 89: Hoare triple {80267#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80242#(< ~counter~0 19)} is VALID [2022-04-15 15:18:49,296 INFO L290 TraceCheckUtils]: 88: Hoare triple {80267#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80267#(< ~counter~0 18)} is VALID [2022-04-15 15:18:49,297 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79829#true} {80267#(< ~counter~0 18)} #98#return; {80267#(< ~counter~0 18)} is VALID [2022-04-15 15:18:49,297 INFO L290 TraceCheckUtils]: 86: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,297 INFO L290 TraceCheckUtils]: 85: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,297 INFO L290 TraceCheckUtils]: 84: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,297 INFO L272 TraceCheckUtils]: 83: Hoare triple {80267#(< ~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)); {79829#true} is VALID [2022-04-15 15:18:49,307 INFO L290 TraceCheckUtils]: 82: Hoare triple {80267#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {80267#(< ~counter~0 18)} is VALID [2022-04-15 15:18:49,308 INFO L290 TraceCheckUtils]: 81: Hoare triple {80292#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80267#(< ~counter~0 18)} is VALID [2022-04-15 15:18:49,309 INFO L290 TraceCheckUtils]: 80: Hoare triple {80292#(< ~counter~0 17)} assume !(~r~0 > 0); {80292#(< ~counter~0 17)} is VALID [2022-04-15 15:18:49,309 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79829#true} {80292#(< ~counter~0 17)} #96#return; {80292#(< ~counter~0 17)} is VALID [2022-04-15 15:18:49,309 INFO L290 TraceCheckUtils]: 78: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,309 INFO L290 TraceCheckUtils]: 77: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,309 INFO L290 TraceCheckUtils]: 76: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,310 INFO L272 TraceCheckUtils]: 75: Hoare triple {80292#(< ~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)); {79829#true} is VALID [2022-04-15 15:18:49,310 INFO L290 TraceCheckUtils]: 74: Hoare triple {80292#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {80292#(< ~counter~0 17)} is VALID [2022-04-15 15:18:49,311 INFO L290 TraceCheckUtils]: 73: Hoare triple {80317#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80292#(< ~counter~0 17)} is VALID [2022-04-15 15:18:49,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {80317#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80317#(< ~counter~0 16)} is VALID [2022-04-15 15:18:49,311 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79829#true} {80317#(< ~counter~0 16)} #96#return; {80317#(< ~counter~0 16)} is VALID [2022-04-15 15:18:49,311 INFO L290 TraceCheckUtils]: 70: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,312 INFO L290 TraceCheckUtils]: 69: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,312 INFO L290 TraceCheckUtils]: 68: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,312 INFO L272 TraceCheckUtils]: 67: Hoare triple {80317#(< ~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)); {79829#true} is VALID [2022-04-15 15:18:49,312 INFO L290 TraceCheckUtils]: 66: Hoare triple {80317#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {80317#(< ~counter~0 16)} is VALID [2022-04-15 15:18:49,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {80342#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80317#(< ~counter~0 16)} is VALID [2022-04-15 15:18:49,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {80342#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80342#(< ~counter~0 15)} is VALID [2022-04-15 15:18:49,314 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79829#true} {80342#(< ~counter~0 15)} #96#return; {80342#(< ~counter~0 15)} is VALID [2022-04-15 15:18:49,314 INFO L290 TraceCheckUtils]: 62: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,314 INFO L290 TraceCheckUtils]: 61: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,314 INFO L290 TraceCheckUtils]: 60: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,314 INFO L272 TraceCheckUtils]: 59: Hoare triple {80342#(< ~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)); {79829#true} is VALID [2022-04-15 15:18:49,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {80342#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {80342#(< ~counter~0 15)} is VALID [2022-04-15 15:18:49,315 INFO L290 TraceCheckUtils]: 57: Hoare triple {80367#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80342#(< ~counter~0 15)} is VALID [2022-04-15 15:18:49,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {80367#(< ~counter~0 14)} assume !!(0 != ~r~0); {80367#(< ~counter~0 14)} is VALID [2022-04-15 15:18:49,316 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79829#true} {80367#(< ~counter~0 14)} #94#return; {80367#(< ~counter~0 14)} is VALID [2022-04-15 15:18:49,316 INFO L290 TraceCheckUtils]: 54: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,316 INFO L290 TraceCheckUtils]: 53: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,316 INFO L290 TraceCheckUtils]: 52: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,316 INFO L272 TraceCheckUtils]: 51: Hoare triple {80367#(< ~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)); {79829#true} is VALID [2022-04-15 15:18:49,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {80367#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {80367#(< ~counter~0 14)} is VALID [2022-04-15 15:18:49,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {80392#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80367#(< ~counter~0 14)} is VALID [2022-04-15 15:18:49,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {80392#(< ~counter~0 13)} assume !(~r~0 < 0); {80392#(< ~counter~0 13)} is VALID [2022-04-15 15:18:49,318 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79829#true} {80392#(< ~counter~0 13)} #98#return; {80392#(< ~counter~0 13)} is VALID [2022-04-15 15:18:49,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,318 INFO L272 TraceCheckUtils]: 43: Hoare triple {80392#(< ~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)); {79829#true} is VALID [2022-04-15 15:18:49,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {80392#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {80392#(< ~counter~0 13)} is VALID [2022-04-15 15:18:49,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {80136#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80392#(< ~counter~0 13)} is VALID [2022-04-15 15:18:49,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {80136#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80136#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:49,320 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79829#true} {80136#(<= ~counter~0 11)} #98#return; {80136#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:49,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,320 INFO L290 TraceCheckUtils]: 37: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,320 INFO L272 TraceCheckUtils]: 35: Hoare triple {80136#(<= ~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)); {79829#true} is VALID [2022-04-15 15:18:49,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {80136#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {80136#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:49,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {80111#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80136#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:49,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {80111#(<= ~counter~0 10)} assume !(~r~0 > 0); {80111#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:49,322 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79829#true} {80111#(<= ~counter~0 10)} #96#return; {80111#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:49,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,322 INFO L272 TraceCheckUtils]: 27: Hoare triple {80111#(<= ~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)); {79829#true} is VALID [2022-04-15 15:18:49,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {80111#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {80111#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:49,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {80086#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80111#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:49,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {80086#(<= ~counter~0 9)} assume !!(0 != ~r~0); {80086#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:49,324 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79829#true} {80086#(<= ~counter~0 9)} #94#return; {80086#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:49,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,324 INFO L272 TraceCheckUtils]: 19: Hoare triple {80086#(<= ~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)); {79829#true} is VALID [2022-04-15 15:18:49,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {80086#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {80086#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:49,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {80061#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80086#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:49,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {80061#(<= ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,326 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79829#true} {80061#(<= ~counter~0 8)} #92#return; {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,326 INFO L272 TraceCheckUtils]: 11: Hoare triple {80061#(<= ~counter~0 8)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {79829#true} is VALID [2022-04-15 15:18:49,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79829#true} {80061#(<= ~counter~0 8)} #90#return; {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {79829#true} assume true; {79829#true} is VALID [2022-04-15 15:18:49,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {79829#true} assume !(0 == ~cond); {79829#true} is VALID [2022-04-15 15:18:49,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {79829#true} ~cond := #in~cond; {79829#true} is VALID [2022-04-15 15:18:49,327 INFO L272 TraceCheckUtils]: 6: Hoare triple {80061#(<= ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79829#true} is VALID [2022-04-15 15:18:49,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {80061#(<= ~counter~0 8)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {80061#(<= ~counter~0 8)} call #t~ret9 := main(); {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80061#(<= ~counter~0 8)} {79829#true} #102#return; {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {80061#(<= ~counter~0 8)} assume true; {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {79829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {80061#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {79829#true} call ULTIMATE.init(); {79829#true} is VALID [2022-04-15 15:18:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 15:18:49,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:18:49,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901096987] [2022-04-15 15:18:49,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:18:49,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548421615] [2022-04-15 15:18:49,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548421615] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:18:49,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:18:49,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-15 15:18:49,330 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:18:49,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1511303221] [2022-04-15 15:18:49,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1511303221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:18:49,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:18:49,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 15:18:49,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813845204] [2022-04-15 15:18:49,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:18:49,330 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-04-15 15:18:49,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:18:49,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:18:49,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:49,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 15:18:49,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:18:49,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 15:18:49,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:18:49,421 INFO L87 Difference]: Start difference. First operand 618 states and 820 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:18:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:52,244 INFO L93 Difference]: Finished difference Result 835 states and 1147 transitions. [2022-04-15 15:18:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 15:18:52,244 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-04-15 15:18:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:18:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:18:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-15 15:18:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:18:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-15 15:18:52,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 256 transitions. [2022-04-15 15:18:52,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:52,478 INFO L225 Difference]: With dead ends: 835 [2022-04-15 15:18:52,478 INFO L226 Difference]: Without dead ends: 634 [2022-04-15 15:18:52,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=456, Invalid=666, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 15:18:52,479 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 190 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:18:52,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 248 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:18:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-04-15 15:18:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2022-04-15 15:18:54,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:18:54,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 634 states. Second operand has 634 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 482 states have internal predecessors, (584), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:18:54,211 INFO L74 IsIncluded]: Start isIncluded. First operand 634 states. Second operand has 634 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 482 states have internal predecessors, (584), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:18:54,211 INFO L87 Difference]: Start difference. First operand 634 states. Second operand has 634 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 482 states have internal predecessors, (584), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:18:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:54,226 INFO L93 Difference]: Finished difference Result 634 states and 836 transitions. [2022-04-15 15:18:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 836 transitions. [2022-04-15 15:18:54,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:54,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:54,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 634 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 482 states have internal predecessors, (584), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 634 states. [2022-04-15 15:18:54,228 INFO L87 Difference]: Start difference. First operand has 634 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 482 states have internal predecessors, (584), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 634 states. [2022-04-15 15:18:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:54,241 INFO L93 Difference]: Finished difference Result 634 states and 836 transitions. [2022-04-15 15:18:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 836 transitions. [2022-04-15 15:18:54,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:54,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:54,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:18:54,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:18:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 482 states have internal predecessors, (584), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:18:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 836 transitions. [2022-04-15 15:18:54,260 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 836 transitions. Word has length 115 [2022-04-15 15:18:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:18:54,261 INFO L478 AbstractCegarLoop]: Abstraction has 634 states and 836 transitions. [2022-04-15 15:18:54,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 15:18:54,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 634 states and 836 transitions. [2022-04-15 15:19:12,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 836 edges. 832 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 836 transitions. [2022-04-15 15:19:12,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 15:19:12,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:19:12,812 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:19:12,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 15:19:13,013 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 15:19:13,013 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:19:13,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:19:13,013 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 7 times [2022-04-15 15:19:13,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:13,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506062039] [2022-04-15 15:19:13,014 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:19:13,014 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 8 times [2022-04-15 15:19:13,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:19:13,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103343515] [2022-04-15 15:19:13,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:19:13,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:19:13,038 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:19:13,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476560170] [2022-04-15 15:19:13,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:19:13,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:19:13,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:19:13,039 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:19:13,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 15:19:13,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:19:13,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:19:13,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 15:19:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:19:13,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:19:13,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {84768#true} call ULTIMATE.init(); {84768#true} is VALID [2022-04-15 15:19:13,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {84768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {84776#(<= ~counter~0 0)} assume true; {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84776#(<= ~counter~0 0)} {84768#true} #102#return; {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {84776#(<= ~counter~0 0)} call #t~ret9 := main(); {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {84776#(<= ~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; {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,771 INFO L272 TraceCheckUtils]: 6: Hoare triple {84776#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {84776#(<= ~counter~0 0)} ~cond := #in~cond; {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {84776#(<= ~counter~0 0)} assume !(0 == ~cond); {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {84776#(<= ~counter~0 0)} assume true; {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84776#(<= ~counter~0 0)} {84776#(<= ~counter~0 0)} #90#return; {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,773 INFO L272 TraceCheckUtils]: 11: Hoare triple {84776#(<= ~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)); {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {84776#(<= ~counter~0 0)} ~cond := #in~cond; {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {84776#(<= ~counter~0 0)} assume !(0 == ~cond); {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {84776#(<= ~counter~0 0)} assume true; {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,774 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84776#(<= ~counter~0 0)} {84776#(<= ~counter~0 0)} #92#return; {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {84776#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {84776#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:13,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {84776#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84825#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:13,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {84825#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {84825#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:13,777 INFO L272 TraceCheckUtils]: 19: Hoare triple {84825#(<= ~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)); {84825#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:13,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {84825#(<= ~counter~0 1)} ~cond := #in~cond; {84825#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:13,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {84825#(<= ~counter~0 1)} assume !(0 == ~cond); {84825#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:13,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {84825#(<= ~counter~0 1)} assume true; {84825#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:13,783 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84825#(<= ~counter~0 1)} {84825#(<= ~counter~0 1)} #94#return; {84825#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:13,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {84825#(<= ~counter~0 1)} assume !!(0 != ~r~0); {84825#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:13,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {84825#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84850#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:13,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {84850#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {84850#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:13,786 INFO L272 TraceCheckUtils]: 27: Hoare triple {84850#(<= ~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)); {84850#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:13,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {84850#(<= ~counter~0 2)} ~cond := #in~cond; {84850#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:13,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {84850#(<= ~counter~0 2)} assume !(0 == ~cond); {84850#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:13,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {84850#(<= ~counter~0 2)} assume true; {84850#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:13,788 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84850#(<= ~counter~0 2)} {84850#(<= ~counter~0 2)} #96#return; {84850#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:13,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {84850#(<= ~counter~0 2)} assume !(~r~0 > 0); {84850#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:13,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {84850#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84875#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:13,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {84875#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {84875#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:13,790 INFO L272 TraceCheckUtils]: 35: Hoare triple {84875#(<= ~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)); {84875#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:13,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {84875#(<= ~counter~0 3)} ~cond := #in~cond; {84875#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:13,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {84875#(<= ~counter~0 3)} assume !(0 == ~cond); {84875#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:13,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {84875#(<= ~counter~0 3)} assume true; {84875#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:13,792 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84875#(<= ~counter~0 3)} {84875#(<= ~counter~0 3)} #98#return; {84875#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:13,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {84875#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84875#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:13,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {84875#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84900#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:13,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {84900#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {84900#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:13,794 INFO L272 TraceCheckUtils]: 43: Hoare triple {84900#(<= ~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)); {84900#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:13,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {84900#(<= ~counter~0 4)} ~cond := #in~cond; {84900#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:13,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {84900#(<= ~counter~0 4)} assume !(0 == ~cond); {84900#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:13,795 INFO L290 TraceCheckUtils]: 46: Hoare triple {84900#(<= ~counter~0 4)} assume true; {84900#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:13,796 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84900#(<= ~counter~0 4)} {84900#(<= ~counter~0 4)} #98#return; {84900#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:13,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {84900#(<= ~counter~0 4)} assume !(~r~0 < 0); {84900#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:13,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {84900#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84925#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:13,798 INFO L290 TraceCheckUtils]: 50: Hoare triple {84925#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {84925#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:13,799 INFO L272 TraceCheckUtils]: 51: Hoare triple {84925#(<= ~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)); {84925#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:13,799 INFO L290 TraceCheckUtils]: 52: Hoare triple {84925#(<= ~counter~0 5)} ~cond := #in~cond; {84925#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:13,799 INFO L290 TraceCheckUtils]: 53: Hoare triple {84925#(<= ~counter~0 5)} assume !(0 == ~cond); {84925#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:13,800 INFO L290 TraceCheckUtils]: 54: Hoare triple {84925#(<= ~counter~0 5)} assume true; {84925#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:13,801 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84925#(<= ~counter~0 5)} {84925#(<= ~counter~0 5)} #94#return; {84925#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:13,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {84925#(<= ~counter~0 5)} assume !!(0 != ~r~0); {84925#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:13,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {84925#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84950#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:13,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {84950#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {84950#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:13,803 INFO L272 TraceCheckUtils]: 59: Hoare triple {84950#(<= ~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)); {84950#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:13,803 INFO L290 TraceCheckUtils]: 60: Hoare triple {84950#(<= ~counter~0 6)} ~cond := #in~cond; {84950#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:13,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {84950#(<= ~counter~0 6)} assume !(0 == ~cond); {84950#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:13,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {84950#(<= ~counter~0 6)} assume true; {84950#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:13,805 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84950#(<= ~counter~0 6)} {84950#(<= ~counter~0 6)} #96#return; {84950#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:13,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {84950#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84950#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:13,806 INFO L290 TraceCheckUtils]: 65: Hoare triple {84950#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:13,807 INFO L290 TraceCheckUtils]: 66: Hoare triple {84975#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:13,808 INFO L272 TraceCheckUtils]: 67: Hoare triple {84975#(<= ~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)); {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:13,808 INFO L290 TraceCheckUtils]: 68: Hoare triple {84975#(<= ~counter~0 7)} ~cond := #in~cond; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:13,808 INFO L290 TraceCheckUtils]: 69: Hoare triple {84975#(<= ~counter~0 7)} assume !(0 == ~cond); {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:13,809 INFO L290 TraceCheckUtils]: 70: Hoare triple {84975#(<= ~counter~0 7)} assume true; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:13,809 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84975#(<= ~counter~0 7)} {84975#(<= ~counter~0 7)} #96#return; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:13,810 INFO L290 TraceCheckUtils]: 72: Hoare triple {84975#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:13,811 INFO L290 TraceCheckUtils]: 73: Hoare triple {84975#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85000#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:13,811 INFO L290 TraceCheckUtils]: 74: Hoare triple {85000#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {85000#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:13,812 INFO L272 TraceCheckUtils]: 75: Hoare triple {85000#(<= ~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)); {85000#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:13,812 INFO L290 TraceCheckUtils]: 76: Hoare triple {85000#(<= ~counter~0 8)} ~cond := #in~cond; {85000#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:13,813 INFO L290 TraceCheckUtils]: 77: Hoare triple {85000#(<= ~counter~0 8)} assume !(0 == ~cond); {85000#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:13,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {85000#(<= ~counter~0 8)} assume true; {85000#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:13,814 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {85000#(<= ~counter~0 8)} {85000#(<= ~counter~0 8)} #96#return; {85000#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:13,814 INFO L290 TraceCheckUtils]: 80: Hoare triple {85000#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85000#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:13,816 INFO L290 TraceCheckUtils]: 81: Hoare triple {85000#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85025#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:13,816 INFO L290 TraceCheckUtils]: 82: Hoare triple {85025#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {85025#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:13,817 INFO L272 TraceCheckUtils]: 83: Hoare triple {85025#(<= ~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)); {85025#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:13,817 INFO L290 TraceCheckUtils]: 84: Hoare triple {85025#(<= ~counter~0 9)} ~cond := #in~cond; {85025#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:13,818 INFO L290 TraceCheckUtils]: 85: Hoare triple {85025#(<= ~counter~0 9)} assume !(0 == ~cond); {85025#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:13,818 INFO L290 TraceCheckUtils]: 86: Hoare triple {85025#(<= ~counter~0 9)} assume true; {85025#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:13,819 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {85025#(<= ~counter~0 9)} {85025#(<= ~counter~0 9)} #96#return; {85025#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:13,819 INFO L290 TraceCheckUtils]: 88: Hoare triple {85025#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85025#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:13,820 INFO L290 TraceCheckUtils]: 89: Hoare triple {85025#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85050#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:13,821 INFO L290 TraceCheckUtils]: 90: Hoare triple {85050#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {85050#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:13,822 INFO L272 TraceCheckUtils]: 91: Hoare triple {85050#(<= ~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)); {85050#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:13,822 INFO L290 TraceCheckUtils]: 92: Hoare triple {85050#(<= ~counter~0 10)} ~cond := #in~cond; {85050#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:13,822 INFO L290 TraceCheckUtils]: 93: Hoare triple {85050#(<= ~counter~0 10)} assume !(0 == ~cond); {85050#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:13,823 INFO L290 TraceCheckUtils]: 94: Hoare triple {85050#(<= ~counter~0 10)} assume true; {85050#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:13,823 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {85050#(<= ~counter~0 10)} {85050#(<= ~counter~0 10)} #96#return; {85050#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:13,824 INFO L290 TraceCheckUtils]: 96: Hoare triple {85050#(<= ~counter~0 10)} assume !(~r~0 > 0); {85050#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:13,825 INFO L290 TraceCheckUtils]: 97: Hoare triple {85050#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85075#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:13,825 INFO L290 TraceCheckUtils]: 98: Hoare triple {85075#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {85075#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:13,826 INFO L272 TraceCheckUtils]: 99: Hoare triple {85075#(<= ~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)); {85075#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:13,826 INFO L290 TraceCheckUtils]: 100: Hoare triple {85075#(<= ~counter~0 11)} ~cond := #in~cond; {85075#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:13,827 INFO L290 TraceCheckUtils]: 101: Hoare triple {85075#(<= ~counter~0 11)} assume !(0 == ~cond); {85075#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:13,827 INFO L290 TraceCheckUtils]: 102: Hoare triple {85075#(<= ~counter~0 11)} assume true; {85075#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:13,828 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {85075#(<= ~counter~0 11)} {85075#(<= ~counter~0 11)} #98#return; {85075#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:13,828 INFO L290 TraceCheckUtils]: 104: Hoare triple {85075#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85075#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:13,829 INFO L290 TraceCheckUtils]: 105: Hoare triple {85075#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85100#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:13,830 INFO L290 TraceCheckUtils]: 106: Hoare triple {85100#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {85100#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:13,831 INFO L272 TraceCheckUtils]: 107: Hoare triple {85100#(<= ~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)); {85100#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:13,831 INFO L290 TraceCheckUtils]: 108: Hoare triple {85100#(<= ~counter~0 12)} ~cond := #in~cond; {85100#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:13,831 INFO L290 TraceCheckUtils]: 109: Hoare triple {85100#(<= ~counter~0 12)} assume !(0 == ~cond); {85100#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:13,832 INFO L290 TraceCheckUtils]: 110: Hoare triple {85100#(<= ~counter~0 12)} assume true; {85100#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:13,832 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {85100#(<= ~counter~0 12)} {85100#(<= ~counter~0 12)} #98#return; {85100#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:13,833 INFO L290 TraceCheckUtils]: 112: Hoare triple {85100#(<= ~counter~0 12)} assume !(~r~0 < 0); {85100#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:13,833 INFO L290 TraceCheckUtils]: 113: Hoare triple {85100#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85125#(<= |main_#t~post6| 12)} is VALID [2022-04-15 15:19:13,834 INFO L290 TraceCheckUtils]: 114: Hoare triple {85125#(<= |main_#t~post6| 12)} assume !(#t~post6 < 20);havoc #t~post6; {84769#false} is VALID [2022-04-15 15:19:13,834 INFO L272 TraceCheckUtils]: 115: Hoare triple {84769#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84769#false} is VALID [2022-04-15 15:19:13,834 INFO L290 TraceCheckUtils]: 116: Hoare triple {84769#false} ~cond := #in~cond; {84769#false} is VALID [2022-04-15 15:19:13,834 INFO L290 TraceCheckUtils]: 117: Hoare triple {84769#false} assume 0 == ~cond; {84769#false} is VALID [2022-04-15 15:19:13,834 INFO L290 TraceCheckUtils]: 118: Hoare triple {84769#false} assume !false; {84769#false} is VALID [2022-04-15 15:19:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 356 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:19:13,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:19:14,480 INFO L290 TraceCheckUtils]: 118: Hoare triple {84769#false} assume !false; {84769#false} is VALID [2022-04-15 15:19:14,480 INFO L290 TraceCheckUtils]: 117: Hoare triple {84769#false} assume 0 == ~cond; {84769#false} is VALID [2022-04-15 15:19:14,480 INFO L290 TraceCheckUtils]: 116: Hoare triple {84769#false} ~cond := #in~cond; {84769#false} is VALID [2022-04-15 15:19:14,480 INFO L272 TraceCheckUtils]: 115: Hoare triple {84769#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84769#false} is VALID [2022-04-15 15:19:14,481 INFO L290 TraceCheckUtils]: 114: Hoare triple {85153#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {84769#false} is VALID [2022-04-15 15:19:14,481 INFO L290 TraceCheckUtils]: 113: Hoare triple {85157#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85153#(< |main_#t~post6| 20)} is VALID [2022-04-15 15:19:14,482 INFO L290 TraceCheckUtils]: 112: Hoare triple {85157#(< ~counter~0 20)} assume !(~r~0 < 0); {85157#(< ~counter~0 20)} is VALID [2022-04-15 15:19:14,482 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84768#true} {85157#(< ~counter~0 20)} #98#return; {85157#(< ~counter~0 20)} is VALID [2022-04-15 15:19:14,482 INFO L290 TraceCheckUtils]: 110: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,482 INFO L290 TraceCheckUtils]: 109: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,482 INFO L290 TraceCheckUtils]: 108: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,483 INFO L272 TraceCheckUtils]: 107: Hoare triple {85157#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84768#true} is VALID [2022-04-15 15:19:14,483 INFO L290 TraceCheckUtils]: 106: Hoare triple {85157#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {85157#(< ~counter~0 20)} is VALID [2022-04-15 15:19:14,485 INFO L290 TraceCheckUtils]: 105: Hoare triple {85182#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85157#(< ~counter~0 20)} is VALID [2022-04-15 15:19:14,485 INFO L290 TraceCheckUtils]: 104: Hoare triple {85182#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85182#(< ~counter~0 19)} is VALID [2022-04-15 15:19:14,486 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84768#true} {85182#(< ~counter~0 19)} #98#return; {85182#(< ~counter~0 19)} is VALID [2022-04-15 15:19:14,486 INFO L290 TraceCheckUtils]: 102: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,486 INFO L290 TraceCheckUtils]: 101: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,486 INFO L290 TraceCheckUtils]: 100: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,486 INFO L272 TraceCheckUtils]: 99: Hoare triple {85182#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84768#true} is VALID [2022-04-15 15:19:14,486 INFO L290 TraceCheckUtils]: 98: Hoare triple {85182#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {85182#(< ~counter~0 19)} is VALID [2022-04-15 15:19:14,487 INFO L290 TraceCheckUtils]: 97: Hoare triple {85207#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85182#(< ~counter~0 19)} is VALID [2022-04-15 15:19:14,488 INFO L290 TraceCheckUtils]: 96: Hoare triple {85207#(< ~counter~0 18)} assume !(~r~0 > 0); {85207#(< ~counter~0 18)} is VALID [2022-04-15 15:19:14,488 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84768#true} {85207#(< ~counter~0 18)} #96#return; {85207#(< ~counter~0 18)} is VALID [2022-04-15 15:19:14,489 INFO L290 TraceCheckUtils]: 94: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,489 INFO L290 TraceCheckUtils]: 93: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,489 INFO L290 TraceCheckUtils]: 92: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,489 INFO L272 TraceCheckUtils]: 91: Hoare triple {85207#(< ~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)); {84768#true} is VALID [2022-04-15 15:19:14,489 INFO L290 TraceCheckUtils]: 90: Hoare triple {85207#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {85207#(< ~counter~0 18)} is VALID [2022-04-15 15:19:14,490 INFO L290 TraceCheckUtils]: 89: Hoare triple {85232#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85207#(< ~counter~0 18)} is VALID [2022-04-15 15:19:14,490 INFO L290 TraceCheckUtils]: 88: Hoare triple {85232#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85232#(< ~counter~0 17)} is VALID [2022-04-15 15:19:14,491 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84768#true} {85232#(< ~counter~0 17)} #96#return; {85232#(< ~counter~0 17)} is VALID [2022-04-15 15:19:14,491 INFO L290 TraceCheckUtils]: 86: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,491 INFO L290 TraceCheckUtils]: 85: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,491 INFO L290 TraceCheckUtils]: 84: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,491 INFO L272 TraceCheckUtils]: 83: Hoare triple {85232#(< ~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)); {84768#true} is VALID [2022-04-15 15:19:14,492 INFO L290 TraceCheckUtils]: 82: Hoare triple {85232#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {85232#(< ~counter~0 17)} is VALID [2022-04-15 15:19:14,493 INFO L290 TraceCheckUtils]: 81: Hoare triple {85257#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85232#(< ~counter~0 17)} is VALID [2022-04-15 15:19:14,493 INFO L290 TraceCheckUtils]: 80: Hoare triple {85257#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85257#(< ~counter~0 16)} is VALID [2022-04-15 15:19:14,494 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84768#true} {85257#(< ~counter~0 16)} #96#return; {85257#(< ~counter~0 16)} is VALID [2022-04-15 15:19:14,494 INFO L290 TraceCheckUtils]: 78: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,494 INFO L290 TraceCheckUtils]: 77: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,494 INFO L290 TraceCheckUtils]: 76: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,494 INFO L272 TraceCheckUtils]: 75: Hoare triple {85257#(< ~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)); {84768#true} is VALID [2022-04-15 15:19:14,494 INFO L290 TraceCheckUtils]: 74: Hoare triple {85257#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {85257#(< ~counter~0 16)} is VALID [2022-04-15 15:19:14,495 INFO L290 TraceCheckUtils]: 73: Hoare triple {85282#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85257#(< ~counter~0 16)} is VALID [2022-04-15 15:19:14,496 INFO L290 TraceCheckUtils]: 72: Hoare triple {85282#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85282#(< ~counter~0 15)} is VALID [2022-04-15 15:19:14,496 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84768#true} {85282#(< ~counter~0 15)} #96#return; {85282#(< ~counter~0 15)} is VALID [2022-04-15 15:19:14,496 INFO L290 TraceCheckUtils]: 70: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,497 INFO L290 TraceCheckUtils]: 69: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,497 INFO L290 TraceCheckUtils]: 68: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,497 INFO L272 TraceCheckUtils]: 67: Hoare triple {85282#(< ~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)); {84768#true} is VALID [2022-04-15 15:19:14,497 INFO L290 TraceCheckUtils]: 66: Hoare triple {85282#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {85282#(< ~counter~0 15)} is VALID [2022-04-15 15:19:14,498 INFO L290 TraceCheckUtils]: 65: Hoare triple {85307#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85282#(< ~counter~0 15)} is VALID [2022-04-15 15:19:14,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {85307#(< ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85307#(< ~counter~0 14)} is VALID [2022-04-15 15:19:14,499 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84768#true} {85307#(< ~counter~0 14)} #96#return; {85307#(< ~counter~0 14)} is VALID [2022-04-15 15:19:14,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,499 INFO L272 TraceCheckUtils]: 59: Hoare triple {85307#(< ~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)); {84768#true} is VALID [2022-04-15 15:19:14,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {85307#(< ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {85307#(< ~counter~0 14)} is VALID [2022-04-15 15:19:14,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {85100#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85307#(< ~counter~0 14)} is VALID [2022-04-15 15:19:14,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {85100#(<= ~counter~0 12)} assume !!(0 != ~r~0); {85100#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:14,502 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84768#true} {85100#(<= ~counter~0 12)} #94#return; {85100#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:14,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,502 INFO L272 TraceCheckUtils]: 51: Hoare triple {85100#(<= ~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)); {84768#true} is VALID [2022-04-15 15:19:14,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {85100#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {85100#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:14,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {85075#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85100#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:14,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {85075#(<= ~counter~0 11)} assume !(~r~0 < 0); {85075#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:14,504 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84768#true} {85075#(<= ~counter~0 11)} #98#return; {85075#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:14,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,505 INFO L272 TraceCheckUtils]: 43: Hoare triple {85075#(<= ~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)); {84768#true} is VALID [2022-04-15 15:19:14,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {85075#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {85075#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:14,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {85050#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85075#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:14,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {85050#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85050#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:14,507 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84768#true} {85050#(<= ~counter~0 10)} #98#return; {85050#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:14,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,507 INFO L272 TraceCheckUtils]: 35: Hoare triple {85050#(<= ~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)); {84768#true} is VALID [2022-04-15 15:19:14,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {85050#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {85050#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:14,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {85025#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85050#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:14,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {85025#(<= ~counter~0 9)} assume !(~r~0 > 0); {85025#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:14,510 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84768#true} {85025#(<= ~counter~0 9)} #96#return; {85025#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:14,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,510 INFO L272 TraceCheckUtils]: 27: Hoare triple {85025#(<= ~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)); {84768#true} is VALID [2022-04-15 15:19:14,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {85025#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {85025#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:14,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {85000#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85025#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:14,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {85000#(<= ~counter~0 8)} assume !!(0 != ~r~0); {85000#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:14,513 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84768#true} {85000#(<= ~counter~0 8)} #94#return; {85000#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:14,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,513 INFO L272 TraceCheckUtils]: 19: Hoare triple {85000#(<= ~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)); {84768#true} is VALID [2022-04-15 15:19:14,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {85000#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {85000#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:14,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {84975#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85000#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:14,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {84975#(<= ~counter~0 7)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:14,515 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84768#true} {84975#(<= ~counter~0 7)} #92#return; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:14,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,516 INFO L272 TraceCheckUtils]: 11: Hoare triple {84975#(<= ~counter~0 7)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {84768#true} is VALID [2022-04-15 15:19:14,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84768#true} {84975#(<= ~counter~0 7)} #90#return; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:14,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {84768#true} assume true; {84768#true} is VALID [2022-04-15 15:19:14,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {84768#true} assume !(0 == ~cond); {84768#true} is VALID [2022-04-15 15:19:14,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {84768#true} ~cond := #in~cond; {84768#true} is VALID [2022-04-15 15:19:14,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {84975#(<= ~counter~0 7)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84768#true} is VALID [2022-04-15 15:19:14,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {84975#(<= ~counter~0 7)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:14,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {84975#(<= ~counter~0 7)} call #t~ret9 := main(); {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:14,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84975#(<= ~counter~0 7)} {84768#true} #102#return; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:14,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {84975#(<= ~counter~0 7)} assume true; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:14,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {84768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {84975#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:14,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {84768#true} call ULTIMATE.init(); {84768#true} is VALID [2022-04-15 15:19:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 92 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 15:19:14,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:19:14,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103343515] [2022-04-15 15:19:14,520 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:19:14,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476560170] [2022-04-15 15:19:14,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476560170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:19:14,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:19:14,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-15 15:19:14,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:19:14,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1506062039] [2022-04-15 15:19:14,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1506062039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:19:14,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:19:14,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 15:19:14,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172261709] [2022-04-15 15:19:14,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:19:14,523 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 119 [2022-04-15 15:19:14,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:19:14,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:19:14,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:14,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 15:19:14,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:14,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 15:19:14,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:19:14,648 INFO L87 Difference]: Start difference. First operand 634 states and 836 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:19:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:17,821 INFO L93 Difference]: Finished difference Result 693 states and 916 transitions. [2022-04-15 15:19:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 15:19:17,821 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 119 [2022-04-15 15:19:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:19:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:19:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-15 15:19:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:19:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-15 15:19:17,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 254 transitions. [2022-04-15 15:19:18,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:18,068 INFO L225 Difference]: With dead ends: 693 [2022-04-15 15:19:18,068 INFO L226 Difference]: Without dead ends: 682 [2022-04-15 15:19:18,069 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=419, Invalid=637, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 15:19:18,069 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 233 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:19:18,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 281 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 15:19:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-04-15 15:19:19,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 660. [2022-04-15 15:19:19,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:19:19,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 682 states. Second operand has 660 states, 493 states have (on average 1.208924949290061) internal successors, (596), 503 states have internal predecessors, (596), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:19:19,865 INFO L74 IsIncluded]: Start isIncluded. First operand 682 states. Second operand has 660 states, 493 states have (on average 1.208924949290061) internal successors, (596), 503 states have internal predecessors, (596), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:19:19,865 INFO L87 Difference]: Start difference. First operand 682 states. Second operand has 660 states, 493 states have (on average 1.208924949290061) internal successors, (596), 503 states have internal predecessors, (596), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:19:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:19,881 INFO L93 Difference]: Finished difference Result 682 states and 900 transitions. [2022-04-15 15:19:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 900 transitions. [2022-04-15 15:19:19,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:19,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:19,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 660 states, 493 states have (on average 1.208924949290061) internal successors, (596), 503 states have internal predecessors, (596), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 682 states. [2022-04-15 15:19:19,882 INFO L87 Difference]: Start difference. First operand has 660 states, 493 states have (on average 1.208924949290061) internal successors, (596), 503 states have internal predecessors, (596), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 682 states. [2022-04-15 15:19:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:19,903 INFO L93 Difference]: Finished difference Result 682 states and 900 transitions. [2022-04-15 15:19:19,903 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 900 transitions. [2022-04-15 15:19:19,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:19,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:19,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:19:19,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:19:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 493 states have (on average 1.208924949290061) internal successors, (596), 503 states have internal predecessors, (596), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:19:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 874 transitions. [2022-04-15 15:19:19,925 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 874 transitions. Word has length 119 [2022-04-15 15:19:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:19:19,925 INFO L478 AbstractCegarLoop]: Abstraction has 660 states and 874 transitions. [2022-04-15 15:19:19,925 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:19:19,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 660 states and 874 transitions. [2022-04-15 15:19:39,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 874 edges. 869 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 874 transitions. [2022-04-15 15:19:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 15:19:39,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:19:39,361 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 7, 7, 7, 7, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:19:39,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-04-15 15:19:39,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 15:19:39,564 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:19:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:19:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 17 times [2022-04-15 15:19:39,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:39,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1635456523] [2022-04-15 15:19:39,564 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:19:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 18 times [2022-04-15 15:19:39,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:19:39,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489441778] [2022-04-15 15:19:39,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:19:39,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:19:39,576 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:19:39,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [943672295] [2022-04-15 15:19:39,576 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:19:39,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:19:39,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:19:39,577 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:19:39,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-15 15:19:40,129 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 15:19:40,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:19:40,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 15:19:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:19:40,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:19:40,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {89593#true} call ULTIMATE.init(); {89593#true} is VALID [2022-04-15 15:19:40,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {89593#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {89601#(<= ~counter~0 0)} assume true; {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89601#(<= ~counter~0 0)} {89593#true} #102#return; {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {89601#(<= ~counter~0 0)} call #t~ret9 := main(); {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {89601#(<= ~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; {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {89601#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {89601#(<= ~counter~0 0)} ~cond := #in~cond; {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {89601#(<= ~counter~0 0)} assume !(0 == ~cond); {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {89601#(<= ~counter~0 0)} assume true; {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,786 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89601#(<= ~counter~0 0)} {89601#(<= ~counter~0 0)} #90#return; {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,786 INFO L272 TraceCheckUtils]: 11: Hoare triple {89601#(<= ~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)); {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {89601#(<= ~counter~0 0)} ~cond := #in~cond; {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {89601#(<= ~counter~0 0)} assume !(0 == ~cond); {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {89601#(<= ~counter~0 0)} assume true; {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,787 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89601#(<= ~counter~0 0)} {89601#(<= ~counter~0 0)} #92#return; {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {89601#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89601#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:40,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {89601#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89650#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:40,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {89650#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {89650#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:40,790 INFO L272 TraceCheckUtils]: 19: Hoare triple {89650#(<= ~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)); {89650#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:40,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {89650#(<= ~counter~0 1)} ~cond := #in~cond; {89650#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:40,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {89650#(<= ~counter~0 1)} assume !(0 == ~cond); {89650#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:40,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {89650#(<= ~counter~0 1)} assume true; {89650#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:40,792 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89650#(<= ~counter~0 1)} {89650#(<= ~counter~0 1)} #94#return; {89650#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:40,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {89650#(<= ~counter~0 1)} assume !!(0 != ~r~0); {89650#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:40,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {89650#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89675#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:40,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {89675#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {89675#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:40,794 INFO L272 TraceCheckUtils]: 27: Hoare triple {89675#(<= ~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)); {89675#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:40,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {89675#(<= ~counter~0 2)} ~cond := #in~cond; {89675#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:40,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {89675#(<= ~counter~0 2)} assume !(0 == ~cond); {89675#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:40,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {89675#(<= ~counter~0 2)} assume true; {89675#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:40,795 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89675#(<= ~counter~0 2)} {89675#(<= ~counter~0 2)} #96#return; {89675#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:40,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {89675#(<= ~counter~0 2)} assume !(~r~0 > 0); {89675#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:40,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {89675#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89700#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:40,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {89700#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {89700#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:40,797 INFO L272 TraceCheckUtils]: 35: Hoare triple {89700#(<= ~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)); {89700#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:40,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {89700#(<= ~counter~0 3)} ~cond := #in~cond; {89700#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:40,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {89700#(<= ~counter~0 3)} assume !(0 == ~cond); {89700#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:40,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {89700#(<= ~counter~0 3)} assume true; {89700#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:40,798 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89700#(<= ~counter~0 3)} {89700#(<= ~counter~0 3)} #98#return; {89700#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:40,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {89700#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89700#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:40,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {89700#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89725#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:40,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {89725#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {89725#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:40,800 INFO L272 TraceCheckUtils]: 43: Hoare triple {89725#(<= ~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)); {89725#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:40,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {89725#(<= ~counter~0 4)} ~cond := #in~cond; {89725#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:40,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {89725#(<= ~counter~0 4)} assume !(0 == ~cond); {89725#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:40,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {89725#(<= ~counter~0 4)} assume true; {89725#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:40,801 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89725#(<= ~counter~0 4)} {89725#(<= ~counter~0 4)} #98#return; {89725#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:40,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {89725#(<= ~counter~0 4)} assume !(~r~0 < 0); {89725#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:40,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {89725#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89750#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:40,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {89750#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {89750#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:40,804 INFO L272 TraceCheckUtils]: 51: Hoare triple {89750#(<= ~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)); {89750#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:40,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {89750#(<= ~counter~0 5)} ~cond := #in~cond; {89750#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:40,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {89750#(<= ~counter~0 5)} assume !(0 == ~cond); {89750#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:40,807 INFO L290 TraceCheckUtils]: 54: Hoare triple {89750#(<= ~counter~0 5)} assume true; {89750#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:40,807 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89750#(<= ~counter~0 5)} {89750#(<= ~counter~0 5)} #94#return; {89750#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:40,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {89750#(<= ~counter~0 5)} assume !!(0 != ~r~0); {89750#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:40,809 INFO L290 TraceCheckUtils]: 57: Hoare triple {89750#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89775#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:40,809 INFO L290 TraceCheckUtils]: 58: Hoare triple {89775#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {89775#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:40,809 INFO L272 TraceCheckUtils]: 59: Hoare triple {89775#(<= ~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)); {89775#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:40,810 INFO L290 TraceCheckUtils]: 60: Hoare triple {89775#(<= ~counter~0 6)} ~cond := #in~cond; {89775#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:40,810 INFO L290 TraceCheckUtils]: 61: Hoare triple {89775#(<= ~counter~0 6)} assume !(0 == ~cond); {89775#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:40,810 INFO L290 TraceCheckUtils]: 62: Hoare triple {89775#(<= ~counter~0 6)} assume true; {89775#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:40,811 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89775#(<= ~counter~0 6)} {89775#(<= ~counter~0 6)} #96#return; {89775#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:40,811 INFO L290 TraceCheckUtils]: 64: Hoare triple {89775#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89775#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:40,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {89775#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:40,812 INFO L290 TraceCheckUtils]: 66: Hoare triple {89800#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:40,813 INFO L272 TraceCheckUtils]: 67: Hoare triple {89800#(<= ~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)); {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:40,813 INFO L290 TraceCheckUtils]: 68: Hoare triple {89800#(<= ~counter~0 7)} ~cond := #in~cond; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:40,813 INFO L290 TraceCheckUtils]: 69: Hoare triple {89800#(<= ~counter~0 7)} assume !(0 == ~cond); {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:40,814 INFO L290 TraceCheckUtils]: 70: Hoare triple {89800#(<= ~counter~0 7)} assume true; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:40,814 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89800#(<= ~counter~0 7)} {89800#(<= ~counter~0 7)} #96#return; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:40,814 INFO L290 TraceCheckUtils]: 72: Hoare triple {89800#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:40,815 INFO L290 TraceCheckUtils]: 73: Hoare triple {89800#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89825#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:40,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {89825#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {89825#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:40,816 INFO L272 TraceCheckUtils]: 75: Hoare triple {89825#(<= ~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)); {89825#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:40,816 INFO L290 TraceCheckUtils]: 76: Hoare triple {89825#(<= ~counter~0 8)} ~cond := #in~cond; {89825#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:40,817 INFO L290 TraceCheckUtils]: 77: Hoare triple {89825#(<= ~counter~0 8)} assume !(0 == ~cond); {89825#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:40,817 INFO L290 TraceCheckUtils]: 78: Hoare triple {89825#(<= ~counter~0 8)} assume true; {89825#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:40,817 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89825#(<= ~counter~0 8)} {89825#(<= ~counter~0 8)} #96#return; {89825#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:40,818 INFO L290 TraceCheckUtils]: 80: Hoare triple {89825#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89825#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:40,818 INFO L290 TraceCheckUtils]: 81: Hoare triple {89825#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89850#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:40,819 INFO L290 TraceCheckUtils]: 82: Hoare triple {89850#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {89850#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:40,819 INFO L272 TraceCheckUtils]: 83: Hoare triple {89850#(<= ~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)); {89850#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:40,820 INFO L290 TraceCheckUtils]: 84: Hoare triple {89850#(<= ~counter~0 9)} ~cond := #in~cond; {89850#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:40,820 INFO L290 TraceCheckUtils]: 85: Hoare triple {89850#(<= ~counter~0 9)} assume !(0 == ~cond); {89850#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:40,820 INFO L290 TraceCheckUtils]: 86: Hoare triple {89850#(<= ~counter~0 9)} assume true; {89850#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:40,821 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89850#(<= ~counter~0 9)} {89850#(<= ~counter~0 9)} #96#return; {89850#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:40,821 INFO L290 TraceCheckUtils]: 88: Hoare triple {89850#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89850#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:40,822 INFO L290 TraceCheckUtils]: 89: Hoare triple {89850#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89875#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:40,822 INFO L290 TraceCheckUtils]: 90: Hoare triple {89875#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {89875#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:40,823 INFO L272 TraceCheckUtils]: 91: Hoare triple {89875#(<= ~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)); {89875#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:40,823 INFO L290 TraceCheckUtils]: 92: Hoare triple {89875#(<= ~counter~0 10)} ~cond := #in~cond; {89875#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:40,823 INFO L290 TraceCheckUtils]: 93: Hoare triple {89875#(<= ~counter~0 10)} assume !(0 == ~cond); {89875#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:40,823 INFO L290 TraceCheckUtils]: 94: Hoare triple {89875#(<= ~counter~0 10)} assume true; {89875#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:40,824 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89875#(<= ~counter~0 10)} {89875#(<= ~counter~0 10)} #96#return; {89875#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:40,824 INFO L290 TraceCheckUtils]: 96: Hoare triple {89875#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89875#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:40,825 INFO L290 TraceCheckUtils]: 97: Hoare triple {89875#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89900#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:40,825 INFO L290 TraceCheckUtils]: 98: Hoare triple {89900#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {89900#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:40,826 INFO L272 TraceCheckUtils]: 99: Hoare triple {89900#(<= ~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)); {89900#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:40,826 INFO L290 TraceCheckUtils]: 100: Hoare triple {89900#(<= ~counter~0 11)} ~cond := #in~cond; {89900#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:40,826 INFO L290 TraceCheckUtils]: 101: Hoare triple {89900#(<= ~counter~0 11)} assume !(0 == ~cond); {89900#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:40,827 INFO L290 TraceCheckUtils]: 102: Hoare triple {89900#(<= ~counter~0 11)} assume true; {89900#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:40,827 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89900#(<= ~counter~0 11)} {89900#(<= ~counter~0 11)} #96#return; {89900#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:40,827 INFO L290 TraceCheckUtils]: 104: Hoare triple {89900#(<= ~counter~0 11)} assume !(~r~0 > 0); {89900#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:40,828 INFO L290 TraceCheckUtils]: 105: Hoare triple {89900#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89925#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:40,828 INFO L290 TraceCheckUtils]: 106: Hoare triple {89925#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {89925#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:40,829 INFO L272 TraceCheckUtils]: 107: Hoare triple {89925#(<= ~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)); {89925#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:40,829 INFO L290 TraceCheckUtils]: 108: Hoare triple {89925#(<= ~counter~0 12)} ~cond := #in~cond; {89925#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:40,830 INFO L290 TraceCheckUtils]: 109: Hoare triple {89925#(<= ~counter~0 12)} assume !(0 == ~cond); {89925#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:40,830 INFO L290 TraceCheckUtils]: 110: Hoare triple {89925#(<= ~counter~0 12)} assume true; {89925#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:40,830 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89925#(<= ~counter~0 12)} {89925#(<= ~counter~0 12)} #98#return; {89925#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:40,831 INFO L290 TraceCheckUtils]: 112: Hoare triple {89925#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89925#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:40,831 INFO L290 TraceCheckUtils]: 113: Hoare triple {89925#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89950#(<= |main_#t~post8| 12)} is VALID [2022-04-15 15:19:40,831 INFO L290 TraceCheckUtils]: 114: Hoare triple {89950#(<= |main_#t~post8| 12)} assume !(#t~post8 < 20);havoc #t~post8; {89594#false} is VALID [2022-04-15 15:19:40,831 INFO L290 TraceCheckUtils]: 115: Hoare triple {89594#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89594#false} is VALID [2022-04-15 15:19:40,831 INFO L290 TraceCheckUtils]: 116: Hoare triple {89594#false} assume !(#t~post6 < 20);havoc #t~post6; {89594#false} is VALID [2022-04-15 15:19:40,831 INFO L272 TraceCheckUtils]: 117: Hoare triple {89594#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89594#false} is VALID [2022-04-15 15:19:40,832 INFO L290 TraceCheckUtils]: 118: Hoare triple {89594#false} ~cond := #in~cond; {89594#false} is VALID [2022-04-15 15:19:40,832 INFO L290 TraceCheckUtils]: 119: Hoare triple {89594#false} assume 0 == ~cond; {89594#false} is VALID [2022-04-15 15:19:40,832 INFO L290 TraceCheckUtils]: 120: Hoare triple {89594#false} assume !false; {89594#false} is VALID [2022-04-15 15:19:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 370 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:19:40,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:19:41,436 INFO L290 TraceCheckUtils]: 120: Hoare triple {89594#false} assume !false; {89594#false} is VALID [2022-04-15 15:19:41,436 INFO L290 TraceCheckUtils]: 119: Hoare triple {89594#false} assume 0 == ~cond; {89594#false} is VALID [2022-04-15 15:19:41,436 INFO L290 TraceCheckUtils]: 118: Hoare triple {89594#false} ~cond := #in~cond; {89594#false} is VALID [2022-04-15 15:19:41,436 INFO L272 TraceCheckUtils]: 117: Hoare triple {89594#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89594#false} is VALID [2022-04-15 15:19:41,437 INFO L290 TraceCheckUtils]: 116: Hoare triple {89594#false} assume !(#t~post6 < 20);havoc #t~post6; {89594#false} is VALID [2022-04-15 15:19:41,437 INFO L290 TraceCheckUtils]: 115: Hoare triple {89594#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89594#false} is VALID [2022-04-15 15:19:41,437 INFO L290 TraceCheckUtils]: 114: Hoare triple {89990#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {89594#false} is VALID [2022-04-15 15:19:41,437 INFO L290 TraceCheckUtils]: 113: Hoare triple {89994#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89990#(< |main_#t~post8| 20)} is VALID [2022-04-15 15:19:41,438 INFO L290 TraceCheckUtils]: 112: Hoare triple {89994#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89994#(< ~counter~0 20)} is VALID [2022-04-15 15:19:41,438 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89593#true} {89994#(< ~counter~0 20)} #98#return; {89994#(< ~counter~0 20)} is VALID [2022-04-15 15:19:41,438 INFO L290 TraceCheckUtils]: 110: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,438 INFO L290 TraceCheckUtils]: 109: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,438 INFO L290 TraceCheckUtils]: 108: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,438 INFO L272 TraceCheckUtils]: 107: Hoare triple {89994#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89593#true} is VALID [2022-04-15 15:19:41,439 INFO L290 TraceCheckUtils]: 106: Hoare triple {89994#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {89994#(< ~counter~0 20)} is VALID [2022-04-15 15:19:41,440 INFO L290 TraceCheckUtils]: 105: Hoare triple {90019#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89994#(< ~counter~0 20)} is VALID [2022-04-15 15:19:41,441 INFO L290 TraceCheckUtils]: 104: Hoare triple {90019#(< ~counter~0 19)} assume !(~r~0 > 0); {90019#(< ~counter~0 19)} is VALID [2022-04-15 15:19:41,441 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89593#true} {90019#(< ~counter~0 19)} #96#return; {90019#(< ~counter~0 19)} is VALID [2022-04-15 15:19:41,441 INFO L290 TraceCheckUtils]: 102: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,441 INFO L290 TraceCheckUtils]: 101: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,441 INFO L290 TraceCheckUtils]: 100: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,441 INFO L272 TraceCheckUtils]: 99: Hoare triple {90019#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89593#true} is VALID [2022-04-15 15:19:41,442 INFO L290 TraceCheckUtils]: 98: Hoare triple {90019#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {90019#(< ~counter~0 19)} is VALID [2022-04-15 15:19:41,443 INFO L290 TraceCheckUtils]: 97: Hoare triple {90044#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90019#(< ~counter~0 19)} is VALID [2022-04-15 15:19:41,443 INFO L290 TraceCheckUtils]: 96: Hoare triple {90044#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90044#(< ~counter~0 18)} is VALID [2022-04-15 15:19:41,443 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89593#true} {90044#(< ~counter~0 18)} #96#return; {90044#(< ~counter~0 18)} is VALID [2022-04-15 15:19:41,443 INFO L290 TraceCheckUtils]: 94: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,444 INFO L290 TraceCheckUtils]: 93: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,444 INFO L290 TraceCheckUtils]: 92: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,444 INFO L272 TraceCheckUtils]: 91: Hoare triple {90044#(< ~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)); {89593#true} is VALID [2022-04-15 15:19:41,444 INFO L290 TraceCheckUtils]: 90: Hoare triple {90044#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {90044#(< ~counter~0 18)} is VALID [2022-04-15 15:19:41,445 INFO L290 TraceCheckUtils]: 89: Hoare triple {90069#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90044#(< ~counter~0 18)} is VALID [2022-04-15 15:19:41,445 INFO L290 TraceCheckUtils]: 88: Hoare triple {90069#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90069#(< ~counter~0 17)} is VALID [2022-04-15 15:19:41,446 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89593#true} {90069#(< ~counter~0 17)} #96#return; {90069#(< ~counter~0 17)} is VALID [2022-04-15 15:19:41,446 INFO L290 TraceCheckUtils]: 86: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,446 INFO L290 TraceCheckUtils]: 85: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,446 INFO L290 TraceCheckUtils]: 84: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,446 INFO L272 TraceCheckUtils]: 83: Hoare triple {90069#(< ~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)); {89593#true} is VALID [2022-04-15 15:19:41,446 INFO L290 TraceCheckUtils]: 82: Hoare triple {90069#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {90069#(< ~counter~0 17)} is VALID [2022-04-15 15:19:41,447 INFO L290 TraceCheckUtils]: 81: Hoare triple {90094#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90069#(< ~counter~0 17)} is VALID [2022-04-15 15:19:41,447 INFO L290 TraceCheckUtils]: 80: Hoare triple {90094#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90094#(< ~counter~0 16)} is VALID [2022-04-15 15:19:41,448 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89593#true} {90094#(< ~counter~0 16)} #96#return; {90094#(< ~counter~0 16)} is VALID [2022-04-15 15:19:41,448 INFO L290 TraceCheckUtils]: 78: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,448 INFO L290 TraceCheckUtils]: 77: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,448 INFO L290 TraceCheckUtils]: 76: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,448 INFO L272 TraceCheckUtils]: 75: Hoare triple {90094#(< ~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)); {89593#true} is VALID [2022-04-15 15:19:41,448 INFO L290 TraceCheckUtils]: 74: Hoare triple {90094#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {90094#(< ~counter~0 16)} is VALID [2022-04-15 15:19:41,449 INFO L290 TraceCheckUtils]: 73: Hoare triple {90119#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90094#(< ~counter~0 16)} is VALID [2022-04-15 15:19:41,449 INFO L290 TraceCheckUtils]: 72: Hoare triple {90119#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90119#(< ~counter~0 15)} is VALID [2022-04-15 15:19:41,450 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89593#true} {90119#(< ~counter~0 15)} #96#return; {90119#(< ~counter~0 15)} is VALID [2022-04-15 15:19:41,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,450 INFO L290 TraceCheckUtils]: 69: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,450 INFO L290 TraceCheckUtils]: 68: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,450 INFO L272 TraceCheckUtils]: 67: Hoare triple {90119#(< ~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)); {89593#true} is VALID [2022-04-15 15:19:41,450 INFO L290 TraceCheckUtils]: 66: Hoare triple {90119#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {90119#(< ~counter~0 15)} is VALID [2022-04-15 15:19:41,451 INFO L290 TraceCheckUtils]: 65: Hoare triple {90144#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90119#(< ~counter~0 15)} is VALID [2022-04-15 15:19:41,452 INFO L290 TraceCheckUtils]: 64: Hoare triple {90144#(< ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90144#(< ~counter~0 14)} is VALID [2022-04-15 15:19:41,452 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89593#true} {90144#(< ~counter~0 14)} #96#return; {90144#(< ~counter~0 14)} is VALID [2022-04-15 15:19:41,452 INFO L290 TraceCheckUtils]: 62: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,452 INFO L290 TraceCheckUtils]: 61: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,452 INFO L290 TraceCheckUtils]: 60: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,452 INFO L272 TraceCheckUtils]: 59: Hoare triple {90144#(< ~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)); {89593#true} is VALID [2022-04-15 15:19:41,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {90144#(< ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {90144#(< ~counter~0 14)} is VALID [2022-04-15 15:19:41,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {89925#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90144#(< ~counter~0 14)} is VALID [2022-04-15 15:19:41,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {89925#(<= ~counter~0 12)} assume !!(0 != ~r~0); {89925#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:41,454 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89593#true} {89925#(<= ~counter~0 12)} #94#return; {89925#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:41,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,455 INFO L290 TraceCheckUtils]: 52: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,455 INFO L272 TraceCheckUtils]: 51: Hoare triple {89925#(<= ~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)); {89593#true} is VALID [2022-04-15 15:19:41,455 INFO L290 TraceCheckUtils]: 50: Hoare triple {89925#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {89925#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:41,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {89900#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89925#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:41,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {89900#(<= ~counter~0 11)} assume !(~r~0 < 0); {89900#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:41,456 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89593#true} {89900#(<= ~counter~0 11)} #98#return; {89900#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:41,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,457 INFO L272 TraceCheckUtils]: 43: Hoare triple {89900#(<= ~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)); {89593#true} is VALID [2022-04-15 15:19:41,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {89900#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {89900#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:41,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {89875#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89900#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:41,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {89875#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89875#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:41,459 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89593#true} {89875#(<= ~counter~0 10)} #98#return; {89875#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:41,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,459 INFO L272 TraceCheckUtils]: 35: Hoare triple {89875#(<= ~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)); {89593#true} is VALID [2022-04-15 15:19:41,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {89875#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {89875#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:41,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {89850#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89875#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:41,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {89850#(<= ~counter~0 9)} assume !(~r~0 > 0); {89850#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:41,461 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89593#true} {89850#(<= ~counter~0 9)} #96#return; {89850#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:41,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,461 INFO L272 TraceCheckUtils]: 27: Hoare triple {89850#(<= ~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)); {89593#true} is VALID [2022-04-15 15:19:41,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {89850#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {89850#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:41,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {89825#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89850#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:41,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {89825#(<= ~counter~0 8)} assume !!(0 != ~r~0); {89825#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:41,463 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89593#true} {89825#(<= ~counter~0 8)} #94#return; {89825#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:41,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,463 INFO L272 TraceCheckUtils]: 19: Hoare triple {89825#(<= ~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)); {89593#true} is VALID [2022-04-15 15:19:41,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {89825#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {89825#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:41,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {89800#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89825#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:41,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {89800#(<= ~counter~0 7)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:41,465 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89593#true} {89800#(<= ~counter~0 7)} #92#return; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:41,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,465 INFO L272 TraceCheckUtils]: 11: Hoare triple {89800#(<= ~counter~0 7)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {89593#true} is VALID [2022-04-15 15:19:41,466 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89593#true} {89800#(<= ~counter~0 7)} #90#return; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:41,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {89593#true} assume true; {89593#true} is VALID [2022-04-15 15:19:41,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {89593#true} assume !(0 == ~cond); {89593#true} is VALID [2022-04-15 15:19:41,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {89593#true} ~cond := #in~cond; {89593#true} is VALID [2022-04-15 15:19:41,466 INFO L272 TraceCheckUtils]: 6: Hoare triple {89800#(<= ~counter~0 7)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89593#true} is VALID [2022-04-15 15:19:41,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {89800#(<= ~counter~0 7)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:41,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {89800#(<= ~counter~0 7)} call #t~ret9 := main(); {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:41,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89800#(<= ~counter~0 7)} {89593#true} #102#return; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:41,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {89800#(<= ~counter~0 7)} assume true; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:41,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {89593#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {89800#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:41,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {89593#true} call ULTIMATE.init(); {89593#true} is VALID [2022-04-15 15:19:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 106 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 15:19:41,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:19:41,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489441778] [2022-04-15 15:19:41,468 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:19:41,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943672295] [2022-04-15 15:19:41,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943672295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:19:41,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:19:41,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-15 15:19:41,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:19:41,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1635456523] [2022-04-15 15:19:41,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1635456523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:19:41,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:19:41,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 15:19:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369266992] [2022-04-15 15:19:41,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:19:41,469 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 121 [2022-04-15 15:19:41,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:19:41,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:19:41,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:41,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 15:19:41,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:41,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 15:19:41,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:19:41,568 INFO L87 Difference]: Start difference. First operand 660 states and 874 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:19:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:44,645 INFO L93 Difference]: Finished difference Result 885 states and 1210 transitions. [2022-04-15 15:19:44,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 15:19:44,645 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 121 [2022-04-15 15:19:44,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:19:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:19:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-15 15:19:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:19:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-15 15:19:44,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 276 transitions. [2022-04-15 15:19:44,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:44,937 INFO L225 Difference]: With dead ends: 885 [2022-04-15 15:19:44,937 INFO L226 Difference]: Without dead ends: 688 [2022-04-15 15:19:44,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=446, Invalid=676, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 15:19:44,938 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 152 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:19:44,938 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 314 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:19:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-04-15 15:19:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 678. [2022-04-15 15:19:46,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:19:46,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 688 states. Second operand has 678 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 515 states have internal predecessors, (618), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:19:46,827 INFO L74 IsIncluded]: Start isIncluded. First operand 688 states. Second operand has 678 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 515 states have internal predecessors, (618), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:19:46,828 INFO L87 Difference]: Start difference. First operand 688 states. Second operand has 678 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 515 states have internal predecessors, (618), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:19:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:46,843 INFO L93 Difference]: Finished difference Result 688 states and 906 transitions. [2022-04-15 15:19:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 906 transitions. [2022-04-15 15:19:46,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:46,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:46,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 678 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 515 states have internal predecessors, (618), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 688 states. [2022-04-15 15:19:46,844 INFO L87 Difference]: Start difference. First operand has 678 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 515 states have internal predecessors, (618), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 688 states. [2022-04-15 15:19:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:46,859 INFO L93 Difference]: Finished difference Result 688 states and 906 transitions. [2022-04-15 15:19:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 906 transitions. [2022-04-15 15:19:46,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:46,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:46,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:19:46,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:19:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 515 states have internal predecessors, (618), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:19:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 896 transitions. [2022-04-15 15:19:46,887 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 896 transitions. Word has length 121 [2022-04-15 15:19:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:19:46,887 INFO L478 AbstractCegarLoop]: Abstraction has 678 states and 896 transitions. [2022-04-15 15:19:46,887 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:19:46,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 678 states and 896 transitions. [2022-04-15 15:20:06,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 896 edges. 891 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 896 transitions. [2022-04-15 15:20:06,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 15:20:06,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:20:06,563 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:20:06,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-15 15:20:06,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 15:20:06,764 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:20:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:20:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 15 times [2022-04-15 15:20:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:06,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [214715655] [2022-04-15 15:20:06,764 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:20:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 16 times [2022-04-15 15:20:06,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:20:06,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548400229] [2022-04-15 15:20:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:20:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:20:06,796 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:20:06,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [700333992] [2022-04-15 15:20:06,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:20:06,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:20:06,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:20:06,807 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:20:06,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-15 15:20:06,975 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:20:06,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:20:06,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 15:20:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:20:07,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:20:07,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {94864#true} call ULTIMATE.init(); {94864#true} is VALID [2022-04-15 15:20:07,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {94864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {94872#(<= ~counter~0 0)} assume true; {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94872#(<= ~counter~0 0)} {94864#true} #102#return; {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {94872#(<= ~counter~0 0)} call #t~ret9 := main(); {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {94872#(<= ~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; {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,593 INFO L272 TraceCheckUtils]: 6: Hoare triple {94872#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {94872#(<= ~counter~0 0)} ~cond := #in~cond; {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {94872#(<= ~counter~0 0)} assume !(0 == ~cond); {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {94872#(<= ~counter~0 0)} assume true; {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,595 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94872#(<= ~counter~0 0)} {94872#(<= ~counter~0 0)} #90#return; {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,595 INFO L272 TraceCheckUtils]: 11: Hoare triple {94872#(<= ~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)); {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {94872#(<= ~counter~0 0)} ~cond := #in~cond; {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {94872#(<= ~counter~0 0)} assume !(0 == ~cond); {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {94872#(<= ~counter~0 0)} assume true; {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,596 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94872#(<= ~counter~0 0)} {94872#(<= ~counter~0 0)} #92#return; {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {94872#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {94872#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:07,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {94872#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94921#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:07,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {94921#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {94921#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:07,599 INFO L272 TraceCheckUtils]: 19: Hoare triple {94921#(<= ~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)); {94921#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:07,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {94921#(<= ~counter~0 1)} ~cond := #in~cond; {94921#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:07,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {94921#(<= ~counter~0 1)} assume !(0 == ~cond); {94921#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:07,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {94921#(<= ~counter~0 1)} assume true; {94921#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:07,600 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94921#(<= ~counter~0 1)} {94921#(<= ~counter~0 1)} #94#return; {94921#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:07,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {94921#(<= ~counter~0 1)} assume !!(0 != ~r~0); {94921#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:07,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {94921#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94946#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:07,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {94946#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {94946#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:07,602 INFO L272 TraceCheckUtils]: 27: Hoare triple {94946#(<= ~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)); {94946#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:07,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {94946#(<= ~counter~0 2)} ~cond := #in~cond; {94946#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:07,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {94946#(<= ~counter~0 2)} assume !(0 == ~cond); {94946#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:07,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {94946#(<= ~counter~0 2)} assume true; {94946#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:07,611 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94946#(<= ~counter~0 2)} {94946#(<= ~counter~0 2)} #96#return; {94946#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:07,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {94946#(<= ~counter~0 2)} assume !(~r~0 > 0); {94946#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:07,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {94946#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94971#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:07,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {94971#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {94971#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:07,614 INFO L272 TraceCheckUtils]: 35: Hoare triple {94971#(<= ~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)); {94971#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:07,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {94971#(<= ~counter~0 3)} ~cond := #in~cond; {94971#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:07,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {94971#(<= ~counter~0 3)} assume !(0 == ~cond); {94971#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:07,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {94971#(<= ~counter~0 3)} assume true; {94971#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:07,615 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94971#(<= ~counter~0 3)} {94971#(<= ~counter~0 3)} #98#return; {94971#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:07,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {94971#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94971#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:07,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {94971#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94996#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:07,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {94996#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {94996#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:07,617 INFO L272 TraceCheckUtils]: 43: Hoare triple {94996#(<= ~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)); {94996#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:07,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {94996#(<= ~counter~0 4)} ~cond := #in~cond; {94996#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:07,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {94996#(<= ~counter~0 4)} assume !(0 == ~cond); {94996#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:07,618 INFO L290 TraceCheckUtils]: 46: Hoare triple {94996#(<= ~counter~0 4)} assume true; {94996#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:07,618 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94996#(<= ~counter~0 4)} {94996#(<= ~counter~0 4)} #98#return; {94996#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:07,619 INFO L290 TraceCheckUtils]: 48: Hoare triple {94996#(<= ~counter~0 4)} assume !(~r~0 < 0); {94996#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:07,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {94996#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95021#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:07,620 INFO L290 TraceCheckUtils]: 50: Hoare triple {95021#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {95021#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:07,620 INFO L272 TraceCheckUtils]: 51: Hoare triple {95021#(<= ~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)); {95021#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:07,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {95021#(<= ~counter~0 5)} ~cond := #in~cond; {95021#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:07,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {95021#(<= ~counter~0 5)} assume !(0 == ~cond); {95021#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:07,621 INFO L290 TraceCheckUtils]: 54: Hoare triple {95021#(<= ~counter~0 5)} assume true; {95021#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:07,621 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {95021#(<= ~counter~0 5)} {95021#(<= ~counter~0 5)} #94#return; {95021#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:07,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {95021#(<= ~counter~0 5)} assume !!(0 != ~r~0); {95021#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:07,623 INFO L290 TraceCheckUtils]: 57: Hoare triple {95021#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95046#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:07,623 INFO L290 TraceCheckUtils]: 58: Hoare triple {95046#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {95046#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:07,623 INFO L272 TraceCheckUtils]: 59: Hoare triple {95046#(<= ~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)); {95046#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:07,624 INFO L290 TraceCheckUtils]: 60: Hoare triple {95046#(<= ~counter~0 6)} ~cond := #in~cond; {95046#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:07,624 INFO L290 TraceCheckUtils]: 61: Hoare triple {95046#(<= ~counter~0 6)} assume !(0 == ~cond); {95046#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:07,624 INFO L290 TraceCheckUtils]: 62: Hoare triple {95046#(<= ~counter~0 6)} assume true; {95046#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:07,625 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {95046#(<= ~counter~0 6)} {95046#(<= ~counter~0 6)} #96#return; {95046#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:07,625 INFO L290 TraceCheckUtils]: 64: Hoare triple {95046#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95046#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:07,626 INFO L290 TraceCheckUtils]: 65: Hoare triple {95046#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:07,626 INFO L290 TraceCheckUtils]: 66: Hoare triple {95071#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:07,627 INFO L272 TraceCheckUtils]: 67: Hoare triple {95071#(<= ~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)); {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:07,627 INFO L290 TraceCheckUtils]: 68: Hoare triple {95071#(<= ~counter~0 7)} ~cond := #in~cond; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:07,627 INFO L290 TraceCheckUtils]: 69: Hoare triple {95071#(<= ~counter~0 7)} assume !(0 == ~cond); {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:07,627 INFO L290 TraceCheckUtils]: 70: Hoare triple {95071#(<= ~counter~0 7)} assume true; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:07,628 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {95071#(<= ~counter~0 7)} {95071#(<= ~counter~0 7)} #96#return; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:07,628 INFO L290 TraceCheckUtils]: 72: Hoare triple {95071#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:07,629 INFO L290 TraceCheckUtils]: 73: Hoare triple {95071#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95096#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:07,629 INFO L290 TraceCheckUtils]: 74: Hoare triple {95096#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {95096#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:07,630 INFO L272 TraceCheckUtils]: 75: Hoare triple {95096#(<= ~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)); {95096#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:07,630 INFO L290 TraceCheckUtils]: 76: Hoare triple {95096#(<= ~counter~0 8)} ~cond := #in~cond; {95096#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:07,630 INFO L290 TraceCheckUtils]: 77: Hoare triple {95096#(<= ~counter~0 8)} assume !(0 == ~cond); {95096#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:07,631 INFO L290 TraceCheckUtils]: 78: Hoare triple {95096#(<= ~counter~0 8)} assume true; {95096#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:07,631 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {95096#(<= ~counter~0 8)} {95096#(<= ~counter~0 8)} #96#return; {95096#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:07,631 INFO L290 TraceCheckUtils]: 80: Hoare triple {95096#(<= ~counter~0 8)} assume !(~r~0 > 0); {95096#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:07,632 INFO L290 TraceCheckUtils]: 81: Hoare triple {95096#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95121#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:07,632 INFO L290 TraceCheckUtils]: 82: Hoare triple {95121#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {95121#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:07,633 INFO L272 TraceCheckUtils]: 83: Hoare triple {95121#(<= ~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)); {95121#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:07,633 INFO L290 TraceCheckUtils]: 84: Hoare triple {95121#(<= ~counter~0 9)} ~cond := #in~cond; {95121#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:07,634 INFO L290 TraceCheckUtils]: 85: Hoare triple {95121#(<= ~counter~0 9)} assume !(0 == ~cond); {95121#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:07,634 INFO L290 TraceCheckUtils]: 86: Hoare triple {95121#(<= ~counter~0 9)} assume true; {95121#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:07,634 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {95121#(<= ~counter~0 9)} {95121#(<= ~counter~0 9)} #98#return; {95121#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:07,635 INFO L290 TraceCheckUtils]: 88: Hoare triple {95121#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95121#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:07,635 INFO L290 TraceCheckUtils]: 89: Hoare triple {95121#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95146#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:07,636 INFO L290 TraceCheckUtils]: 90: Hoare triple {95146#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {95146#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:07,636 INFO L272 TraceCheckUtils]: 91: Hoare triple {95146#(<= ~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)); {95146#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:07,636 INFO L290 TraceCheckUtils]: 92: Hoare triple {95146#(<= ~counter~0 10)} ~cond := #in~cond; {95146#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:07,637 INFO L290 TraceCheckUtils]: 93: Hoare triple {95146#(<= ~counter~0 10)} assume !(0 == ~cond); {95146#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:07,637 INFO L290 TraceCheckUtils]: 94: Hoare triple {95146#(<= ~counter~0 10)} assume true; {95146#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:07,637 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {95146#(<= ~counter~0 10)} {95146#(<= ~counter~0 10)} #98#return; {95146#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:07,638 INFO L290 TraceCheckUtils]: 96: Hoare triple {95146#(<= ~counter~0 10)} assume !(~r~0 < 0); {95146#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:07,639 INFO L290 TraceCheckUtils]: 97: Hoare triple {95146#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95171#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:07,639 INFO L290 TraceCheckUtils]: 98: Hoare triple {95171#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {95171#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:07,639 INFO L272 TraceCheckUtils]: 99: Hoare triple {95171#(<= ~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)); {95171#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:07,640 INFO L290 TraceCheckUtils]: 100: Hoare triple {95171#(<= ~counter~0 11)} ~cond := #in~cond; {95171#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:07,640 INFO L290 TraceCheckUtils]: 101: Hoare triple {95171#(<= ~counter~0 11)} assume !(0 == ~cond); {95171#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:07,640 INFO L290 TraceCheckUtils]: 102: Hoare triple {95171#(<= ~counter~0 11)} assume true; {95171#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:07,641 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {95171#(<= ~counter~0 11)} {95171#(<= ~counter~0 11)} #94#return; {95171#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:07,641 INFO L290 TraceCheckUtils]: 104: Hoare triple {95171#(<= ~counter~0 11)} assume !!(0 != ~r~0); {95171#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:07,642 INFO L290 TraceCheckUtils]: 105: Hoare triple {95171#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95196#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:07,642 INFO L290 TraceCheckUtils]: 106: Hoare triple {95196#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {95196#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:07,643 INFO L272 TraceCheckUtils]: 107: Hoare triple {95196#(<= ~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)); {95196#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:07,643 INFO L290 TraceCheckUtils]: 108: Hoare triple {95196#(<= ~counter~0 12)} ~cond := #in~cond; {95196#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:07,643 INFO L290 TraceCheckUtils]: 109: Hoare triple {95196#(<= ~counter~0 12)} assume !(0 == ~cond); {95196#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:07,643 INFO L290 TraceCheckUtils]: 110: Hoare triple {95196#(<= ~counter~0 12)} assume true; {95196#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:07,644 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {95196#(<= ~counter~0 12)} {95196#(<= ~counter~0 12)} #96#return; {95196#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:07,644 INFO L290 TraceCheckUtils]: 112: Hoare triple {95196#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95196#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:07,644 INFO L290 TraceCheckUtils]: 113: Hoare triple {95196#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95221#(<= |main_#t~post7| 12)} is VALID [2022-04-15 15:20:07,645 INFO L290 TraceCheckUtils]: 114: Hoare triple {95221#(<= |main_#t~post7| 12)} assume !(#t~post7 < 20);havoc #t~post7; {94865#false} is VALID [2022-04-15 15:20:07,645 INFO L290 TraceCheckUtils]: 115: Hoare triple {94865#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94865#false} is VALID [2022-04-15 15:20:07,645 INFO L290 TraceCheckUtils]: 116: Hoare triple {94865#false} assume !(#t~post8 < 20);havoc #t~post8; {94865#false} is VALID [2022-04-15 15:20:07,645 INFO L290 TraceCheckUtils]: 117: Hoare triple {94865#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94865#false} is VALID [2022-04-15 15:20:07,645 INFO L290 TraceCheckUtils]: 118: Hoare triple {94865#false} assume !(#t~post6 < 20);havoc #t~post6; {94865#false} is VALID [2022-04-15 15:20:07,645 INFO L272 TraceCheckUtils]: 119: Hoare triple {94865#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94865#false} is VALID [2022-04-15 15:20:07,645 INFO L290 TraceCheckUtils]: 120: Hoare triple {94865#false} ~cond := #in~cond; {94865#false} is VALID [2022-04-15 15:20:07,645 INFO L290 TraceCheckUtils]: 121: Hoare triple {94865#false} assume 0 == ~cond; {94865#false} is VALID [2022-04-15 15:20:07,645 INFO L290 TraceCheckUtils]: 122: Hoare triple {94865#false} assume !false; {94865#false} is VALID [2022-04-15 15:20:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 350 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:20:07,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:20:08,232 INFO L290 TraceCheckUtils]: 122: Hoare triple {94865#false} assume !false; {94865#false} is VALID [2022-04-15 15:20:08,233 INFO L290 TraceCheckUtils]: 121: Hoare triple {94865#false} assume 0 == ~cond; {94865#false} is VALID [2022-04-15 15:20:08,233 INFO L290 TraceCheckUtils]: 120: Hoare triple {94865#false} ~cond := #in~cond; {94865#false} is VALID [2022-04-15 15:20:08,233 INFO L272 TraceCheckUtils]: 119: Hoare triple {94865#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94865#false} is VALID [2022-04-15 15:20:08,233 INFO L290 TraceCheckUtils]: 118: Hoare triple {94865#false} assume !(#t~post6 < 20);havoc #t~post6; {94865#false} is VALID [2022-04-15 15:20:08,233 INFO L290 TraceCheckUtils]: 117: Hoare triple {94865#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94865#false} is VALID [2022-04-15 15:20:08,233 INFO L290 TraceCheckUtils]: 116: Hoare triple {94865#false} assume !(#t~post8 < 20);havoc #t~post8; {94865#false} is VALID [2022-04-15 15:20:08,233 INFO L290 TraceCheckUtils]: 115: Hoare triple {94865#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94865#false} is VALID [2022-04-15 15:20:08,233 INFO L290 TraceCheckUtils]: 114: Hoare triple {95273#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {94865#false} is VALID [2022-04-15 15:20:08,234 INFO L290 TraceCheckUtils]: 113: Hoare triple {95277#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95273#(< |main_#t~post7| 20)} is VALID [2022-04-15 15:20:08,234 INFO L290 TraceCheckUtils]: 112: Hoare triple {95277#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95277#(< ~counter~0 20)} is VALID [2022-04-15 15:20:08,235 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94864#true} {95277#(< ~counter~0 20)} #96#return; {95277#(< ~counter~0 20)} is VALID [2022-04-15 15:20:08,235 INFO L290 TraceCheckUtils]: 110: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,235 INFO L290 TraceCheckUtils]: 109: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,235 INFO L290 TraceCheckUtils]: 108: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,235 INFO L272 TraceCheckUtils]: 107: Hoare triple {95277#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94864#true} is VALID [2022-04-15 15:20:08,235 INFO L290 TraceCheckUtils]: 106: Hoare triple {95277#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {95277#(< ~counter~0 20)} is VALID [2022-04-15 15:20:08,237 INFO L290 TraceCheckUtils]: 105: Hoare triple {95302#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95277#(< ~counter~0 20)} is VALID [2022-04-15 15:20:08,237 INFO L290 TraceCheckUtils]: 104: Hoare triple {95302#(< ~counter~0 19)} assume !!(0 != ~r~0); {95302#(< ~counter~0 19)} is VALID [2022-04-15 15:20:08,238 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94864#true} {95302#(< ~counter~0 19)} #94#return; {95302#(< ~counter~0 19)} is VALID [2022-04-15 15:20:08,238 INFO L290 TraceCheckUtils]: 102: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,238 INFO L290 TraceCheckUtils]: 101: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,238 INFO L290 TraceCheckUtils]: 100: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,238 INFO L272 TraceCheckUtils]: 99: Hoare triple {95302#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94864#true} is VALID [2022-04-15 15:20:08,238 INFO L290 TraceCheckUtils]: 98: Hoare triple {95302#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {95302#(< ~counter~0 19)} is VALID [2022-04-15 15:20:08,239 INFO L290 TraceCheckUtils]: 97: Hoare triple {95327#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95302#(< ~counter~0 19)} is VALID [2022-04-15 15:20:08,239 INFO L290 TraceCheckUtils]: 96: Hoare triple {95327#(< ~counter~0 18)} assume !(~r~0 < 0); {95327#(< ~counter~0 18)} is VALID [2022-04-15 15:20:08,240 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94864#true} {95327#(< ~counter~0 18)} #98#return; {95327#(< ~counter~0 18)} is VALID [2022-04-15 15:20:08,240 INFO L290 TraceCheckUtils]: 94: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,240 INFO L290 TraceCheckUtils]: 93: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,240 INFO L290 TraceCheckUtils]: 92: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,240 INFO L272 TraceCheckUtils]: 91: Hoare triple {95327#(< ~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)); {94864#true} is VALID [2022-04-15 15:20:08,241 INFO L290 TraceCheckUtils]: 90: Hoare triple {95327#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {95327#(< ~counter~0 18)} is VALID [2022-04-15 15:20:08,241 INFO L290 TraceCheckUtils]: 89: Hoare triple {95352#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95327#(< ~counter~0 18)} is VALID [2022-04-15 15:20:08,242 INFO L290 TraceCheckUtils]: 88: Hoare triple {95352#(< ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95352#(< ~counter~0 17)} is VALID [2022-04-15 15:20:08,242 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94864#true} {95352#(< ~counter~0 17)} #98#return; {95352#(< ~counter~0 17)} is VALID [2022-04-15 15:20:08,242 INFO L290 TraceCheckUtils]: 86: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,242 INFO L290 TraceCheckUtils]: 85: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,242 INFO L290 TraceCheckUtils]: 84: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,242 INFO L272 TraceCheckUtils]: 83: Hoare triple {95352#(< ~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)); {94864#true} is VALID [2022-04-15 15:20:08,243 INFO L290 TraceCheckUtils]: 82: Hoare triple {95352#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {95352#(< ~counter~0 17)} is VALID [2022-04-15 15:20:08,244 INFO L290 TraceCheckUtils]: 81: Hoare triple {95377#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95352#(< ~counter~0 17)} is VALID [2022-04-15 15:20:08,244 INFO L290 TraceCheckUtils]: 80: Hoare triple {95377#(< ~counter~0 16)} assume !(~r~0 > 0); {95377#(< ~counter~0 16)} is VALID [2022-04-15 15:20:08,244 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94864#true} {95377#(< ~counter~0 16)} #96#return; {95377#(< ~counter~0 16)} is VALID [2022-04-15 15:20:08,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,245 INFO L290 TraceCheckUtils]: 77: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,245 INFO L290 TraceCheckUtils]: 76: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,245 INFO L272 TraceCheckUtils]: 75: Hoare triple {95377#(< ~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)); {94864#true} is VALID [2022-04-15 15:20:08,245 INFO L290 TraceCheckUtils]: 74: Hoare triple {95377#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {95377#(< ~counter~0 16)} is VALID [2022-04-15 15:20:08,246 INFO L290 TraceCheckUtils]: 73: Hoare triple {95402#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95377#(< ~counter~0 16)} is VALID [2022-04-15 15:20:08,246 INFO L290 TraceCheckUtils]: 72: Hoare triple {95402#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95402#(< ~counter~0 15)} is VALID [2022-04-15 15:20:08,247 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94864#true} {95402#(< ~counter~0 15)} #96#return; {95402#(< ~counter~0 15)} is VALID [2022-04-15 15:20:08,247 INFO L290 TraceCheckUtils]: 70: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,247 INFO L290 TraceCheckUtils]: 69: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,247 INFO L290 TraceCheckUtils]: 68: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,247 INFO L272 TraceCheckUtils]: 67: Hoare triple {95402#(< ~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)); {94864#true} is VALID [2022-04-15 15:20:08,247 INFO L290 TraceCheckUtils]: 66: Hoare triple {95402#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {95402#(< ~counter~0 15)} is VALID [2022-04-15 15:20:08,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {95427#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95402#(< ~counter~0 15)} is VALID [2022-04-15 15:20:08,248 INFO L290 TraceCheckUtils]: 64: Hoare triple {95427#(< ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95427#(< ~counter~0 14)} is VALID [2022-04-15 15:20:08,249 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94864#true} {95427#(< ~counter~0 14)} #96#return; {95427#(< ~counter~0 14)} is VALID [2022-04-15 15:20:08,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,249 INFO L272 TraceCheckUtils]: 59: Hoare triple {95427#(< ~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)); {94864#true} is VALID [2022-04-15 15:20:08,249 INFO L290 TraceCheckUtils]: 58: Hoare triple {95427#(< ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {95427#(< ~counter~0 14)} is VALID [2022-04-15 15:20:08,250 INFO L290 TraceCheckUtils]: 57: Hoare triple {95196#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95427#(< ~counter~0 14)} is VALID [2022-04-15 15:20:08,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {95196#(<= ~counter~0 12)} assume !!(0 != ~r~0); {95196#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:08,251 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94864#true} {95196#(<= ~counter~0 12)} #94#return; {95196#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:08,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,251 INFO L272 TraceCheckUtils]: 51: Hoare triple {95196#(<= ~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)); {94864#true} is VALID [2022-04-15 15:20:08,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {95196#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {95196#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:08,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {95171#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95196#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:08,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {95171#(<= ~counter~0 11)} assume !(~r~0 < 0); {95171#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:08,253 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94864#true} {95171#(<= ~counter~0 11)} #98#return; {95171#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:08,253 INFO L290 TraceCheckUtils]: 46: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,254 INFO L272 TraceCheckUtils]: 43: Hoare triple {95171#(<= ~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)); {94864#true} is VALID [2022-04-15 15:20:08,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {95171#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {95171#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:08,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {95146#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95171#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:08,255 INFO L290 TraceCheckUtils]: 40: Hoare triple {95146#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95146#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:08,255 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94864#true} {95146#(<= ~counter~0 10)} #98#return; {95146#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:08,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,256 INFO L272 TraceCheckUtils]: 35: Hoare triple {95146#(<= ~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)); {94864#true} is VALID [2022-04-15 15:20:08,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {95146#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {95146#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:08,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {95121#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95146#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:08,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {95121#(<= ~counter~0 9)} assume !(~r~0 > 0); {95121#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:08,258 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94864#true} {95121#(<= ~counter~0 9)} #96#return; {95121#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:08,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,258 INFO L272 TraceCheckUtils]: 27: Hoare triple {95121#(<= ~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)); {94864#true} is VALID [2022-04-15 15:20:08,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {95121#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {95121#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:08,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {95096#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95121#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:08,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {95096#(<= ~counter~0 8)} assume !!(0 != ~r~0); {95096#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:08,260 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94864#true} {95096#(<= ~counter~0 8)} #94#return; {95096#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:08,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,260 INFO L272 TraceCheckUtils]: 19: Hoare triple {95096#(<= ~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)); {94864#true} is VALID [2022-04-15 15:20:08,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {95096#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {95096#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:08,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {95071#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95096#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:08,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {95071#(<= ~counter~0 7)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,262 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94864#true} {95071#(<= ~counter~0 7)} #92#return; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,262 INFO L272 TraceCheckUtils]: 11: Hoare triple {95071#(<= ~counter~0 7)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {94864#true} is VALID [2022-04-15 15:20:08,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94864#true} {95071#(<= ~counter~0 7)} #90#return; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {94864#true} assume true; {94864#true} is VALID [2022-04-15 15:20:08,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {94864#true} assume !(0 == ~cond); {94864#true} is VALID [2022-04-15 15:20:08,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {94864#true} ~cond := #in~cond; {94864#true} is VALID [2022-04-15 15:20:08,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {95071#(<= ~counter~0 7)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94864#true} is VALID [2022-04-15 15:20:08,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {95071#(<= ~counter~0 7)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {95071#(<= ~counter~0 7)} call #t~ret9 := main(); {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95071#(<= ~counter~0 7)} {94864#true} #102#return; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {95071#(<= ~counter~0 7)} assume true; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {94864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {95071#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {94864#true} call ULTIMATE.init(); {94864#true} is VALID [2022-04-15 15:20:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 86 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 15:20:08,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:20:08,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548400229] [2022-04-15 15:20:08,265 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:20:08,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700333992] [2022-04-15 15:20:08,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700333992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:20:08,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:20:08,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-15 15:20:08,266 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:20:08,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [214715655] [2022-04-15 15:20:08,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [214715655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:20:08,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:20:08,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 15:20:08,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803842346] [2022-04-15 15:20:08,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:20:08,266 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 123 [2022-04-15 15:20:08,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:20:08,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:20:08,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:08,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 15:20:08,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:08,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 15:20:08,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:20:08,371 INFO L87 Difference]: Start difference. First operand 678 states and 896 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:20:11,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:11,526 INFO L93 Difference]: Finished difference Result 895 states and 1223 transitions. [2022-04-15 15:20:11,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 15:20:11,526 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 123 [2022-04-15 15:20:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:20:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:20:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-15 15:20:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:20:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-15 15:20:11,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 276 transitions. [2022-04-15 15:20:11,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:11,823 INFO L225 Difference]: With dead ends: 895 [2022-04-15 15:20:11,823 INFO L226 Difference]: Without dead ends: 694 [2022-04-15 15:20:11,824 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=478, Invalid=712, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 15:20:11,824 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 184 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:20:11,824 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 294 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 15:20:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-04-15 15:20:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2022-04-15 15:20:13,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:20:13,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 694 states. Second operand has 694 states, 527 states have (on average 1.2030360531309299) internal successors, (634), 527 states have internal predecessors, (634), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:20:13,796 INFO L74 IsIncluded]: Start isIncluded. First operand 694 states. Second operand has 694 states, 527 states have (on average 1.2030360531309299) internal successors, (634), 527 states have internal predecessors, (634), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:20:13,797 INFO L87 Difference]: Start difference. First operand 694 states. Second operand has 694 states, 527 states have (on average 1.2030360531309299) internal successors, (634), 527 states have internal predecessors, (634), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:20:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:13,812 INFO L93 Difference]: Finished difference Result 694 states and 912 transitions. [2022-04-15 15:20:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 912 transitions. [2022-04-15 15:20:13,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:13,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:13,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 694 states, 527 states have (on average 1.2030360531309299) internal successors, (634), 527 states have internal predecessors, (634), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 694 states. [2022-04-15 15:20:13,814 INFO L87 Difference]: Start difference. First operand has 694 states, 527 states have (on average 1.2030360531309299) internal successors, (634), 527 states have internal predecessors, (634), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 694 states. [2022-04-15 15:20:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:13,835 INFO L93 Difference]: Finished difference Result 694 states and 912 transitions. [2022-04-15 15:20:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 912 transitions. [2022-04-15 15:20:13,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:13,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:13,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:20:13,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:20:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 527 states have (on average 1.2030360531309299) internal successors, (634), 527 states have internal predecessors, (634), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:20:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 912 transitions. [2022-04-15 15:20:13,858 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 912 transitions. Word has length 123 [2022-04-15 15:20:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:20:13,859 INFO L478 AbstractCegarLoop]: Abstraction has 694 states and 912 transitions. [2022-04-15 15:20:13,859 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 15:20:13,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 694 states and 912 transitions. [2022-04-15 15:20:31,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 912 edges. 909 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 912 transitions. [2022-04-15 15:20:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 15:20:31,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:20:31,249 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:20:31,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-15 15:20:31,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:20:31,451 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:20:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:20:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 9 times [2022-04-15 15:20:31,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:31,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [958732401] [2022-04-15 15:20:31,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:20:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 10 times [2022-04-15 15:20:31,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:20:31,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500228265] [2022-04-15 15:20:31,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:20:31,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:20:31,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:20:31,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [187283139] [2022-04-15 15:20:31,465 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:20:31,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:20:31,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:20:31,466 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:20:31,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-15 15:20:31,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:20:31,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:20:31,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 15:20:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:20:31,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:20:32,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {100213#true} call ULTIMATE.init(); {100213#true} is VALID [2022-04-15 15:20:32,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {100213#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {100221#(<= ~counter~0 0)} assume true; {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100221#(<= ~counter~0 0)} {100213#true} #102#return; {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {100221#(<= ~counter~0 0)} call #t~ret9 := main(); {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {100221#(<= ~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; {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,194 INFO L272 TraceCheckUtils]: 6: Hoare triple {100221#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {100221#(<= ~counter~0 0)} ~cond := #in~cond; {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {100221#(<= ~counter~0 0)} assume !(0 == ~cond); {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {100221#(<= ~counter~0 0)} assume true; {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,195 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {100221#(<= ~counter~0 0)} {100221#(<= ~counter~0 0)} #90#return; {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,196 INFO L272 TraceCheckUtils]: 11: Hoare triple {100221#(<= ~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)); {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {100221#(<= ~counter~0 0)} ~cond := #in~cond; {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {100221#(<= ~counter~0 0)} assume !(0 == ~cond); {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {100221#(<= ~counter~0 0)} assume true; {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,197 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {100221#(<= ~counter~0 0)} {100221#(<= ~counter~0 0)} #92#return; {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {100221#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {100221#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:32,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {100221#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100270#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:32,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {100270#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {100270#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:32,200 INFO L272 TraceCheckUtils]: 19: Hoare triple {100270#(<= ~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)); {100270#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:32,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {100270#(<= ~counter~0 1)} ~cond := #in~cond; {100270#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:32,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {100270#(<= ~counter~0 1)} assume !(0 == ~cond); {100270#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:32,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {100270#(<= ~counter~0 1)} assume true; {100270#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:32,203 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {100270#(<= ~counter~0 1)} {100270#(<= ~counter~0 1)} #94#return; {100270#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:32,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {100270#(<= ~counter~0 1)} assume !!(0 != ~r~0); {100270#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:32,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {100270#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100295#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:32,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {100295#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {100295#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:32,207 INFO L272 TraceCheckUtils]: 27: Hoare triple {100295#(<= ~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)); {100295#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:32,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {100295#(<= ~counter~0 2)} ~cond := #in~cond; {100295#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:32,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {100295#(<= ~counter~0 2)} assume !(0 == ~cond); {100295#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:32,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {100295#(<= ~counter~0 2)} assume true; {100295#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:32,209 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {100295#(<= ~counter~0 2)} {100295#(<= ~counter~0 2)} #96#return; {100295#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:32,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {100295#(<= ~counter~0 2)} assume !(~r~0 > 0); {100295#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:32,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {100295#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100320#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:32,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {100320#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {100320#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:32,212 INFO L272 TraceCheckUtils]: 35: Hoare triple {100320#(<= ~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)); {100320#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:32,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {100320#(<= ~counter~0 3)} ~cond := #in~cond; {100320#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:32,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {100320#(<= ~counter~0 3)} assume !(0 == ~cond); {100320#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:32,213 INFO L290 TraceCheckUtils]: 38: Hoare triple {100320#(<= ~counter~0 3)} assume true; {100320#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:32,214 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {100320#(<= ~counter~0 3)} {100320#(<= ~counter~0 3)} #98#return; {100320#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:32,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {100320#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100320#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:32,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {100320#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100345#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:32,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {100345#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {100345#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:32,217 INFO L272 TraceCheckUtils]: 43: Hoare triple {100345#(<= ~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)); {100345#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:32,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {100345#(<= ~counter~0 4)} ~cond := #in~cond; {100345#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:32,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {100345#(<= ~counter~0 4)} assume !(0 == ~cond); {100345#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:32,218 INFO L290 TraceCheckUtils]: 46: Hoare triple {100345#(<= ~counter~0 4)} assume true; {100345#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:32,218 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {100345#(<= ~counter~0 4)} {100345#(<= ~counter~0 4)} #98#return; {100345#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:32,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {100345#(<= ~counter~0 4)} assume !(~r~0 < 0); {100345#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:32,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {100345#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100370#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:32,221 INFO L290 TraceCheckUtils]: 50: Hoare triple {100370#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {100370#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:32,221 INFO L272 TraceCheckUtils]: 51: Hoare triple {100370#(<= ~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)); {100370#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:32,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {100370#(<= ~counter~0 5)} ~cond := #in~cond; {100370#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:32,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {100370#(<= ~counter~0 5)} assume !(0 == ~cond); {100370#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:32,222 INFO L290 TraceCheckUtils]: 54: Hoare triple {100370#(<= ~counter~0 5)} assume true; {100370#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:32,223 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {100370#(<= ~counter~0 5)} {100370#(<= ~counter~0 5)} #94#return; {100370#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:32,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {100370#(<= ~counter~0 5)} assume !!(0 != ~r~0); {100370#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:32,225 INFO L290 TraceCheckUtils]: 57: Hoare triple {100370#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {100395#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,226 INFO L272 TraceCheckUtils]: 59: Hoare triple {100395#(<= ~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)); {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,226 INFO L290 TraceCheckUtils]: 60: Hoare triple {100395#(<= ~counter~0 6)} ~cond := #in~cond; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {100395#(<= ~counter~0 6)} assume !(0 == ~cond); {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,227 INFO L290 TraceCheckUtils]: 62: Hoare triple {100395#(<= ~counter~0 6)} assume true; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,228 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {100395#(<= ~counter~0 6)} {100395#(<= ~counter~0 6)} #96#return; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,228 INFO L290 TraceCheckUtils]: 64: Hoare triple {100395#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,229 INFO L290 TraceCheckUtils]: 65: Hoare triple {100395#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100420#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:32,230 INFO L290 TraceCheckUtils]: 66: Hoare triple {100420#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {100420#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:32,231 INFO L272 TraceCheckUtils]: 67: Hoare triple {100420#(<= ~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)); {100420#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:32,231 INFO L290 TraceCheckUtils]: 68: Hoare triple {100420#(<= ~counter~0 7)} ~cond := #in~cond; {100420#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:32,231 INFO L290 TraceCheckUtils]: 69: Hoare triple {100420#(<= ~counter~0 7)} assume !(0 == ~cond); {100420#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:32,232 INFO L290 TraceCheckUtils]: 70: Hoare triple {100420#(<= ~counter~0 7)} assume true; {100420#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:32,232 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {100420#(<= ~counter~0 7)} {100420#(<= ~counter~0 7)} #96#return; {100420#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:32,233 INFO L290 TraceCheckUtils]: 72: Hoare triple {100420#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100420#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:32,234 INFO L290 TraceCheckUtils]: 73: Hoare triple {100420#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100445#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:32,235 INFO L290 TraceCheckUtils]: 74: Hoare triple {100445#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {100445#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:32,235 INFO L272 TraceCheckUtils]: 75: Hoare triple {100445#(<= ~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)); {100445#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:32,236 INFO L290 TraceCheckUtils]: 76: Hoare triple {100445#(<= ~counter~0 8)} ~cond := #in~cond; {100445#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:32,236 INFO L290 TraceCheckUtils]: 77: Hoare triple {100445#(<= ~counter~0 8)} assume !(0 == ~cond); {100445#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:32,236 INFO L290 TraceCheckUtils]: 78: Hoare triple {100445#(<= ~counter~0 8)} assume true; {100445#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:32,237 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {100445#(<= ~counter~0 8)} {100445#(<= ~counter~0 8)} #96#return; {100445#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:32,237 INFO L290 TraceCheckUtils]: 80: Hoare triple {100445#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100445#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:32,239 INFO L290 TraceCheckUtils]: 81: Hoare triple {100445#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100470#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:32,239 INFO L290 TraceCheckUtils]: 82: Hoare triple {100470#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {100470#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:32,240 INFO L272 TraceCheckUtils]: 83: Hoare triple {100470#(<= ~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)); {100470#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:32,240 INFO L290 TraceCheckUtils]: 84: Hoare triple {100470#(<= ~counter~0 9)} ~cond := #in~cond; {100470#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:32,241 INFO L290 TraceCheckUtils]: 85: Hoare triple {100470#(<= ~counter~0 9)} assume !(0 == ~cond); {100470#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:32,241 INFO L290 TraceCheckUtils]: 86: Hoare triple {100470#(<= ~counter~0 9)} assume true; {100470#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:32,242 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {100470#(<= ~counter~0 9)} {100470#(<= ~counter~0 9)} #96#return; {100470#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:32,242 INFO L290 TraceCheckUtils]: 88: Hoare triple {100470#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100470#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:32,243 INFO L290 TraceCheckUtils]: 89: Hoare triple {100470#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100495#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:32,244 INFO L290 TraceCheckUtils]: 90: Hoare triple {100495#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {100495#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:32,244 INFO L272 TraceCheckUtils]: 91: Hoare triple {100495#(<= ~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)); {100495#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:32,245 INFO L290 TraceCheckUtils]: 92: Hoare triple {100495#(<= ~counter~0 10)} ~cond := #in~cond; {100495#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:32,245 INFO L290 TraceCheckUtils]: 93: Hoare triple {100495#(<= ~counter~0 10)} assume !(0 == ~cond); {100495#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:32,246 INFO L290 TraceCheckUtils]: 94: Hoare triple {100495#(<= ~counter~0 10)} assume true; {100495#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:32,246 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {100495#(<= ~counter~0 10)} {100495#(<= ~counter~0 10)} #96#return; {100495#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:32,247 INFO L290 TraceCheckUtils]: 96: Hoare triple {100495#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100495#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:32,249 INFO L290 TraceCheckUtils]: 97: Hoare triple {100495#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100520#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:32,249 INFO L290 TraceCheckUtils]: 98: Hoare triple {100520#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {100520#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:32,249 INFO L272 TraceCheckUtils]: 99: Hoare triple {100520#(<= ~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)); {100520#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:32,250 INFO L290 TraceCheckUtils]: 100: Hoare triple {100520#(<= ~counter~0 11)} ~cond := #in~cond; {100520#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:32,250 INFO L290 TraceCheckUtils]: 101: Hoare triple {100520#(<= ~counter~0 11)} assume !(0 == ~cond); {100520#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:32,250 INFO L290 TraceCheckUtils]: 102: Hoare triple {100520#(<= ~counter~0 11)} assume true; {100520#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:32,251 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {100520#(<= ~counter~0 11)} {100520#(<= ~counter~0 11)} #96#return; {100520#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:32,251 INFO L290 TraceCheckUtils]: 104: Hoare triple {100520#(<= ~counter~0 11)} assume !(~r~0 > 0); {100520#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:32,252 INFO L290 TraceCheckUtils]: 105: Hoare triple {100520#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100545#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:32,252 INFO L290 TraceCheckUtils]: 106: Hoare triple {100545#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {100545#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:32,253 INFO L272 TraceCheckUtils]: 107: Hoare triple {100545#(<= ~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)); {100545#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:32,253 INFO L290 TraceCheckUtils]: 108: Hoare triple {100545#(<= ~counter~0 12)} ~cond := #in~cond; {100545#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:32,253 INFO L290 TraceCheckUtils]: 109: Hoare triple {100545#(<= ~counter~0 12)} assume !(0 == ~cond); {100545#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:32,254 INFO L290 TraceCheckUtils]: 110: Hoare triple {100545#(<= ~counter~0 12)} assume true; {100545#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:32,254 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {100545#(<= ~counter~0 12)} {100545#(<= ~counter~0 12)} #98#return; {100545#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:32,254 INFO L290 TraceCheckUtils]: 112: Hoare triple {100545#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100545#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:32,256 INFO L290 TraceCheckUtils]: 113: Hoare triple {100545#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100570#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:32,256 INFO L290 TraceCheckUtils]: 114: Hoare triple {100570#(<= ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {100570#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:32,256 INFO L272 TraceCheckUtils]: 115: Hoare triple {100570#(<= ~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)); {100570#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:32,257 INFO L290 TraceCheckUtils]: 116: Hoare triple {100570#(<= ~counter~0 13)} ~cond := #in~cond; {100570#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:32,257 INFO L290 TraceCheckUtils]: 117: Hoare triple {100570#(<= ~counter~0 13)} assume !(0 == ~cond); {100570#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:32,257 INFO L290 TraceCheckUtils]: 118: Hoare triple {100570#(<= ~counter~0 13)} assume true; {100570#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:32,258 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {100570#(<= ~counter~0 13)} {100570#(<= ~counter~0 13)} #98#return; {100570#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:32,258 INFO L290 TraceCheckUtils]: 120: Hoare triple {100570#(<= ~counter~0 13)} assume !(~r~0 < 0); {100570#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:32,258 INFO L290 TraceCheckUtils]: 121: Hoare triple {100570#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100595#(<= |main_#t~post6| 13)} is VALID [2022-04-15 15:20:32,259 INFO L290 TraceCheckUtils]: 122: Hoare triple {100595#(<= |main_#t~post6| 13)} assume !(#t~post6 < 20);havoc #t~post6; {100214#false} is VALID [2022-04-15 15:20:32,259 INFO L272 TraceCheckUtils]: 123: Hoare triple {100214#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100214#false} is VALID [2022-04-15 15:20:32,259 INFO L290 TraceCheckUtils]: 124: Hoare triple {100214#false} ~cond := #in~cond; {100214#false} is VALID [2022-04-15 15:20:32,259 INFO L290 TraceCheckUtils]: 125: Hoare triple {100214#false} assume 0 == ~cond; {100214#false} is VALID [2022-04-15 15:20:32,259 INFO L290 TraceCheckUtils]: 126: Hoare triple {100214#false} assume !false; {100214#false} is VALID [2022-04-15 15:20:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 428 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:20:32,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:20:32,909 INFO L290 TraceCheckUtils]: 126: Hoare triple {100214#false} assume !false; {100214#false} is VALID [2022-04-15 15:20:32,909 INFO L290 TraceCheckUtils]: 125: Hoare triple {100214#false} assume 0 == ~cond; {100214#false} is VALID [2022-04-15 15:20:32,909 INFO L290 TraceCheckUtils]: 124: Hoare triple {100214#false} ~cond := #in~cond; {100214#false} is VALID [2022-04-15 15:20:32,909 INFO L272 TraceCheckUtils]: 123: Hoare triple {100214#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100214#false} is VALID [2022-04-15 15:20:32,910 INFO L290 TraceCheckUtils]: 122: Hoare triple {100623#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {100214#false} is VALID [2022-04-15 15:20:32,910 INFO L290 TraceCheckUtils]: 121: Hoare triple {100627#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100623#(< |main_#t~post6| 20)} is VALID [2022-04-15 15:20:32,910 INFO L290 TraceCheckUtils]: 120: Hoare triple {100627#(< ~counter~0 20)} assume !(~r~0 < 0); {100627#(< ~counter~0 20)} is VALID [2022-04-15 15:20:32,911 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {100213#true} {100627#(< ~counter~0 20)} #98#return; {100627#(< ~counter~0 20)} is VALID [2022-04-15 15:20:32,911 INFO L290 TraceCheckUtils]: 118: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,911 INFO L290 TraceCheckUtils]: 117: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,911 INFO L290 TraceCheckUtils]: 116: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,911 INFO L272 TraceCheckUtils]: 115: Hoare triple {100627#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100213#true} is VALID [2022-04-15 15:20:32,911 INFO L290 TraceCheckUtils]: 114: Hoare triple {100627#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {100627#(< ~counter~0 20)} is VALID [2022-04-15 15:20:32,913 INFO L290 TraceCheckUtils]: 113: Hoare triple {100652#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100627#(< ~counter~0 20)} is VALID [2022-04-15 15:20:32,914 INFO L290 TraceCheckUtils]: 112: Hoare triple {100652#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100652#(< ~counter~0 19)} is VALID [2022-04-15 15:20:32,914 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {100213#true} {100652#(< ~counter~0 19)} #98#return; {100652#(< ~counter~0 19)} is VALID [2022-04-15 15:20:32,914 INFO L290 TraceCheckUtils]: 110: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,914 INFO L290 TraceCheckUtils]: 109: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,915 INFO L290 TraceCheckUtils]: 108: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,915 INFO L272 TraceCheckUtils]: 107: Hoare triple {100652#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100213#true} is VALID [2022-04-15 15:20:32,915 INFO L290 TraceCheckUtils]: 106: Hoare triple {100652#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {100652#(< ~counter~0 19)} is VALID [2022-04-15 15:20:32,916 INFO L290 TraceCheckUtils]: 105: Hoare triple {100677#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100652#(< ~counter~0 19)} is VALID [2022-04-15 15:20:32,916 INFO L290 TraceCheckUtils]: 104: Hoare triple {100677#(< ~counter~0 18)} assume !(~r~0 > 0); {100677#(< ~counter~0 18)} is VALID [2022-04-15 15:20:32,917 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {100213#true} {100677#(< ~counter~0 18)} #96#return; {100677#(< ~counter~0 18)} is VALID [2022-04-15 15:20:32,917 INFO L290 TraceCheckUtils]: 102: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,917 INFO L290 TraceCheckUtils]: 101: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,917 INFO L290 TraceCheckUtils]: 100: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,917 INFO L272 TraceCheckUtils]: 99: Hoare triple {100677#(< ~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)); {100213#true} is VALID [2022-04-15 15:20:32,917 INFO L290 TraceCheckUtils]: 98: Hoare triple {100677#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {100677#(< ~counter~0 18)} is VALID [2022-04-15 15:20:32,918 INFO L290 TraceCheckUtils]: 97: Hoare triple {100702#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100677#(< ~counter~0 18)} is VALID [2022-04-15 15:20:32,919 INFO L290 TraceCheckUtils]: 96: Hoare triple {100702#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100702#(< ~counter~0 17)} is VALID [2022-04-15 15:20:32,919 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {100213#true} {100702#(< ~counter~0 17)} #96#return; {100702#(< ~counter~0 17)} is VALID [2022-04-15 15:20:32,919 INFO L290 TraceCheckUtils]: 94: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,920 INFO L290 TraceCheckUtils]: 93: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,920 INFO L290 TraceCheckUtils]: 92: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,920 INFO L272 TraceCheckUtils]: 91: Hoare triple {100702#(< ~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)); {100213#true} is VALID [2022-04-15 15:20:32,920 INFO L290 TraceCheckUtils]: 90: Hoare triple {100702#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {100702#(< ~counter~0 17)} is VALID [2022-04-15 15:20:32,921 INFO L290 TraceCheckUtils]: 89: Hoare triple {100727#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100702#(< ~counter~0 17)} is VALID [2022-04-15 15:20:32,921 INFO L290 TraceCheckUtils]: 88: Hoare triple {100727#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100727#(< ~counter~0 16)} is VALID [2022-04-15 15:20:32,922 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {100213#true} {100727#(< ~counter~0 16)} #96#return; {100727#(< ~counter~0 16)} is VALID [2022-04-15 15:20:32,922 INFO L290 TraceCheckUtils]: 86: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,922 INFO L290 TraceCheckUtils]: 85: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,922 INFO L290 TraceCheckUtils]: 84: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,922 INFO L272 TraceCheckUtils]: 83: Hoare triple {100727#(< ~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)); {100213#true} is VALID [2022-04-15 15:20:32,922 INFO L290 TraceCheckUtils]: 82: Hoare triple {100727#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {100727#(< ~counter~0 16)} is VALID [2022-04-15 15:20:32,923 INFO L290 TraceCheckUtils]: 81: Hoare triple {100752#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100727#(< ~counter~0 16)} is VALID [2022-04-15 15:20:32,924 INFO L290 TraceCheckUtils]: 80: Hoare triple {100752#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100752#(< ~counter~0 15)} is VALID [2022-04-15 15:20:32,924 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {100213#true} {100752#(< ~counter~0 15)} #96#return; {100752#(< ~counter~0 15)} is VALID [2022-04-15 15:20:32,924 INFO L290 TraceCheckUtils]: 78: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,925 INFO L290 TraceCheckUtils]: 77: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,925 INFO L290 TraceCheckUtils]: 76: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,925 INFO L272 TraceCheckUtils]: 75: Hoare triple {100752#(< ~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)); {100213#true} is VALID [2022-04-15 15:20:32,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {100752#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {100752#(< ~counter~0 15)} is VALID [2022-04-15 15:20:32,926 INFO L290 TraceCheckUtils]: 73: Hoare triple {100570#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100752#(< ~counter~0 15)} is VALID [2022-04-15 15:20:32,926 INFO L290 TraceCheckUtils]: 72: Hoare triple {100570#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100570#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:32,927 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {100213#true} {100570#(<= ~counter~0 13)} #96#return; {100570#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:32,927 INFO L290 TraceCheckUtils]: 70: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,927 INFO L290 TraceCheckUtils]: 69: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,927 INFO L290 TraceCheckUtils]: 68: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,927 INFO L272 TraceCheckUtils]: 67: Hoare triple {100570#(<= ~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)); {100213#true} is VALID [2022-04-15 15:20:32,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {100570#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {100570#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:32,928 INFO L290 TraceCheckUtils]: 65: Hoare triple {100545#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100570#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:32,929 INFO L290 TraceCheckUtils]: 64: Hoare triple {100545#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100545#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:32,929 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {100213#true} {100545#(<= ~counter~0 12)} #96#return; {100545#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:32,929 INFO L290 TraceCheckUtils]: 62: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,929 INFO L290 TraceCheckUtils]: 61: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,930 INFO L290 TraceCheckUtils]: 60: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,930 INFO L272 TraceCheckUtils]: 59: Hoare triple {100545#(<= ~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)); {100213#true} is VALID [2022-04-15 15:20:32,930 INFO L290 TraceCheckUtils]: 58: Hoare triple {100545#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {100545#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:32,931 INFO L290 TraceCheckUtils]: 57: Hoare triple {100520#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100545#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:32,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {100520#(<= ~counter~0 11)} assume !!(0 != ~r~0); {100520#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:32,932 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {100213#true} {100520#(<= ~counter~0 11)} #94#return; {100520#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:32,932 INFO L290 TraceCheckUtils]: 54: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,932 INFO L290 TraceCheckUtils]: 53: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,932 INFO L290 TraceCheckUtils]: 52: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,932 INFO L272 TraceCheckUtils]: 51: Hoare triple {100520#(<= ~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)); {100213#true} is VALID [2022-04-15 15:20:32,932 INFO L290 TraceCheckUtils]: 50: Hoare triple {100520#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {100520#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:32,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {100495#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100520#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:32,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {100495#(<= ~counter~0 10)} assume !(~r~0 < 0); {100495#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:32,934 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {100213#true} {100495#(<= ~counter~0 10)} #98#return; {100495#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:32,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,934 INFO L272 TraceCheckUtils]: 43: Hoare triple {100495#(<= ~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)); {100213#true} is VALID [2022-04-15 15:20:32,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {100495#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {100495#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:32,936 INFO L290 TraceCheckUtils]: 41: Hoare triple {100470#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100495#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:32,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {100470#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100470#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:32,937 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {100213#true} {100470#(<= ~counter~0 9)} #98#return; {100470#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:32,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,937 INFO L272 TraceCheckUtils]: 35: Hoare triple {100470#(<= ~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)); {100213#true} is VALID [2022-04-15 15:20:32,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {100470#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {100470#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:32,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {100445#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100470#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:32,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {100445#(<= ~counter~0 8)} assume !(~r~0 > 0); {100445#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:32,939 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {100213#true} {100445#(<= ~counter~0 8)} #96#return; {100445#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:32,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,940 INFO L272 TraceCheckUtils]: 27: Hoare triple {100445#(<= ~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)); {100213#true} is VALID [2022-04-15 15:20:32,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {100445#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {100445#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:32,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {100420#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100445#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:32,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {100420#(<= ~counter~0 7)} assume !!(0 != ~r~0); {100420#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:32,942 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {100213#true} {100420#(<= ~counter~0 7)} #94#return; {100420#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:32,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,942 INFO L272 TraceCheckUtils]: 19: Hoare triple {100420#(<= ~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)); {100213#true} is VALID [2022-04-15 15:20:32,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {100420#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {100420#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:32,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {100395#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100420#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:32,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {100395#(<= ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,944 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {100213#true} {100395#(<= ~counter~0 6)} #92#return; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,944 INFO L272 TraceCheckUtils]: 11: Hoare triple {100395#(<= ~counter~0 6)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {100213#true} is VALID [2022-04-15 15:20:32,945 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {100213#true} {100395#(<= ~counter~0 6)} #90#return; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {100213#true} assume true; {100213#true} is VALID [2022-04-15 15:20:32,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {100213#true} assume !(0 == ~cond); {100213#true} is VALID [2022-04-15 15:20:32,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {100213#true} ~cond := #in~cond; {100213#true} is VALID [2022-04-15 15:20:32,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {100395#(<= ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {100213#true} is VALID [2022-04-15 15:20:32,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {100395#(<= ~counter~0 6)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {100395#(<= ~counter~0 6)} call #t~ret9 := main(); {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100395#(<= ~counter~0 6)} {100213#true} #102#return; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {100395#(<= ~counter~0 6)} assume true; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {100213#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {100395#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:32,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {100213#true} call ULTIMATE.init(); {100213#true} is VALID [2022-04-15 15:20:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 116 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-15 15:20:32,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:20:32,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500228265] [2022-04-15 15:20:32,947 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:20:32,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187283139] [2022-04-15 15:20:32,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187283139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:20:32,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:20:32,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-15 15:20:32,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:20:32,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [958732401] [2022-04-15 15:20:32,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [958732401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:20:32,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:20:32,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 15:20:32,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524213869] [2022-04-15 15:20:32,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:20:32,949 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 127 [2022-04-15 15:20:32,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:20:32,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:20:33,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:33,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 15:20:33,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:33,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 15:20:33,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:20:33,074 INFO L87 Difference]: Start difference. First operand 694 states and 912 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:20:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:36,452 INFO L93 Difference]: Finished difference Result 753 states and 992 transitions. [2022-04-15 15:20:36,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 15:20:36,452 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 127 [2022-04-15 15:20:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:20:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:20:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-15 15:20:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:20:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-15 15:20:36,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 274 transitions. [2022-04-15 15:20:36,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:36,762 INFO L225 Difference]: With dead ends: 753 [2022-04-15 15:20:36,762 INFO L226 Difference]: Without dead ends: 742 [2022-04-15 15:20:36,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=439, Invalid=683, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 15:20:36,763 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 190 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:20:36,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 316 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 15:20:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-04-15 15:20:38,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 720. [2022-04-15 15:20:38,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:20:38,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 742 states. Second operand has 720 states, 538 states have (on average 1.2007434944237918) internal successors, (646), 548 states have internal predecessors, (646), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:20:38,805 INFO L74 IsIncluded]: Start isIncluded. First operand 742 states. Second operand has 720 states, 538 states have (on average 1.2007434944237918) internal successors, (646), 548 states have internal predecessors, (646), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:20:38,805 INFO L87 Difference]: Start difference. First operand 742 states. Second operand has 720 states, 538 states have (on average 1.2007434944237918) internal successors, (646), 548 states have internal predecessors, (646), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:20:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:38,822 INFO L93 Difference]: Finished difference Result 742 states and 976 transitions. [2022-04-15 15:20:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 976 transitions. [2022-04-15 15:20:38,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:38,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:38,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 720 states, 538 states have (on average 1.2007434944237918) internal successors, (646), 548 states have internal predecessors, (646), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 742 states. [2022-04-15 15:20:38,823 INFO L87 Difference]: Start difference. First operand has 720 states, 538 states have (on average 1.2007434944237918) internal successors, (646), 548 states have internal predecessors, (646), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 742 states. [2022-04-15 15:20:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:38,840 INFO L93 Difference]: Finished difference Result 742 states and 976 transitions. [2022-04-15 15:20:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 976 transitions. [2022-04-15 15:20:38,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:38,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:38,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:20:38,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:20:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 538 states have (on average 1.2007434944237918) internal successors, (646), 548 states have internal predecessors, (646), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:20:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 950 transitions. [2022-04-15 15:20:38,864 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 950 transitions. Word has length 127 [2022-04-15 15:20:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:20:38,864 INFO L478 AbstractCegarLoop]: Abstraction has 720 states and 950 transitions. [2022-04-15 15:20:38,864 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:20:38,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 720 states and 950 transitions. [2022-04-15 15:20:57,530 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-15 15:20:57,530 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 950 transitions. [2022-04-15 15:20:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-15 15:20:57,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:20:57,532 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:20:57,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-15 15:20:57,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:20:57,735 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:20:57,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:20:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 19 times [2022-04-15 15:20:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:57,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704394559] [2022-04-15 15:20:57,736 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:20:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 20 times [2022-04-15 15:20:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:20:57,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523225976] [2022-04-15 15:20:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:20:57,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:20:57,758 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:20:57,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2061989820] [2022-04-15 15:20:57,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:20:57,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:20:57,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:20:57,760 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:20:57,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-15 15:20:57,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:20:57,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:20:57,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 15:20:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:20:57,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:20:58,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {105448#true} call ULTIMATE.init(); {105448#true} is VALID [2022-04-15 15:20:58,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {105448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {105456#(<= ~counter~0 0)} assume true; {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105456#(<= ~counter~0 0)} {105448#true} #102#return; {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {105456#(<= ~counter~0 0)} call #t~ret9 := main(); {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {105456#(<= ~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; {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,542 INFO L272 TraceCheckUtils]: 6: Hoare triple {105456#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {105456#(<= ~counter~0 0)} ~cond := #in~cond; {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {105456#(<= ~counter~0 0)} assume !(0 == ~cond); {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {105456#(<= ~counter~0 0)} assume true; {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {105456#(<= ~counter~0 0)} {105456#(<= ~counter~0 0)} #90#return; {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,544 INFO L272 TraceCheckUtils]: 11: Hoare triple {105456#(<= ~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)); {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {105456#(<= ~counter~0 0)} ~cond := #in~cond; {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {105456#(<= ~counter~0 0)} assume !(0 == ~cond); {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {105456#(<= ~counter~0 0)} assume true; {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,545 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {105456#(<= ~counter~0 0)} {105456#(<= ~counter~0 0)} #92#return; {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {105456#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {105456#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:58,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {105456#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105505#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:58,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {105505#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {105505#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:58,548 INFO L272 TraceCheckUtils]: 19: Hoare triple {105505#(<= ~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)); {105505#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:58,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {105505#(<= ~counter~0 1)} ~cond := #in~cond; {105505#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:58,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {105505#(<= ~counter~0 1)} assume !(0 == ~cond); {105505#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:58,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {105505#(<= ~counter~0 1)} assume true; {105505#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:58,549 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {105505#(<= ~counter~0 1)} {105505#(<= ~counter~0 1)} #94#return; {105505#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:58,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {105505#(<= ~counter~0 1)} assume !!(0 != ~r~0); {105505#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:58,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {105505#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105530#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:58,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {105530#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {105530#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:58,551 INFO L272 TraceCheckUtils]: 27: Hoare triple {105530#(<= ~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)); {105530#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:58,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {105530#(<= ~counter~0 2)} ~cond := #in~cond; {105530#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:58,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {105530#(<= ~counter~0 2)} assume !(0 == ~cond); {105530#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:58,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {105530#(<= ~counter~0 2)} assume true; {105530#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:58,552 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {105530#(<= ~counter~0 2)} {105530#(<= ~counter~0 2)} #96#return; {105530#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:58,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {105530#(<= ~counter~0 2)} assume !(~r~0 > 0); {105530#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:58,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {105530#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105555#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:58,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {105555#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {105555#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:58,554 INFO L272 TraceCheckUtils]: 35: Hoare triple {105555#(<= ~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)); {105555#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:58,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {105555#(<= ~counter~0 3)} ~cond := #in~cond; {105555#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:58,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {105555#(<= ~counter~0 3)} assume !(0 == ~cond); {105555#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:58,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {105555#(<= ~counter~0 3)} assume true; {105555#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:58,556 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {105555#(<= ~counter~0 3)} {105555#(<= ~counter~0 3)} #98#return; {105555#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:58,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {105555#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {105555#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:58,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {105555#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105580#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:58,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {105580#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {105580#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:58,558 INFO L272 TraceCheckUtils]: 43: Hoare triple {105580#(<= ~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)); {105580#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:58,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {105580#(<= ~counter~0 4)} ~cond := #in~cond; {105580#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:58,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {105580#(<= ~counter~0 4)} assume !(0 == ~cond); {105580#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:58,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {105580#(<= ~counter~0 4)} assume true; {105580#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:58,559 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {105580#(<= ~counter~0 4)} {105580#(<= ~counter~0 4)} #98#return; {105580#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:58,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {105580#(<= ~counter~0 4)} assume !(~r~0 < 0); {105580#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:58,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {105580#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105605#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:58,560 INFO L290 TraceCheckUtils]: 50: Hoare triple {105605#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {105605#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:58,561 INFO L272 TraceCheckUtils]: 51: Hoare triple {105605#(<= ~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)); {105605#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:58,561 INFO L290 TraceCheckUtils]: 52: Hoare triple {105605#(<= ~counter~0 5)} ~cond := #in~cond; {105605#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:58,561 INFO L290 TraceCheckUtils]: 53: Hoare triple {105605#(<= ~counter~0 5)} assume !(0 == ~cond); {105605#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:58,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {105605#(<= ~counter~0 5)} assume true; {105605#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:58,562 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {105605#(<= ~counter~0 5)} {105605#(<= ~counter~0 5)} #94#return; {105605#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:58,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {105605#(<= ~counter~0 5)} assume !!(0 != ~r~0); {105605#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:58,563 INFO L290 TraceCheckUtils]: 57: Hoare triple {105605#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:58,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {105630#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:58,564 INFO L272 TraceCheckUtils]: 59: Hoare triple {105630#(<= ~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)); {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:58,564 INFO L290 TraceCheckUtils]: 60: Hoare triple {105630#(<= ~counter~0 6)} ~cond := #in~cond; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:58,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {105630#(<= ~counter~0 6)} assume !(0 == ~cond); {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:58,565 INFO L290 TraceCheckUtils]: 62: Hoare triple {105630#(<= ~counter~0 6)} assume true; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:58,565 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {105630#(<= ~counter~0 6)} {105630#(<= ~counter~0 6)} #96#return; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:58,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {105630#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:58,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {105630#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105655#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:58,567 INFO L290 TraceCheckUtils]: 66: Hoare triple {105655#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {105655#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:58,567 INFO L272 TraceCheckUtils]: 67: Hoare triple {105655#(<= ~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)); {105655#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:58,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {105655#(<= ~counter~0 7)} ~cond := #in~cond; {105655#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:58,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {105655#(<= ~counter~0 7)} assume !(0 == ~cond); {105655#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:58,568 INFO L290 TraceCheckUtils]: 70: Hoare triple {105655#(<= ~counter~0 7)} assume true; {105655#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:58,569 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {105655#(<= ~counter~0 7)} {105655#(<= ~counter~0 7)} #96#return; {105655#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:58,569 INFO L290 TraceCheckUtils]: 72: Hoare triple {105655#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105655#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:58,570 INFO L290 TraceCheckUtils]: 73: Hoare triple {105655#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105680#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:58,570 INFO L290 TraceCheckUtils]: 74: Hoare triple {105680#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {105680#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:58,571 INFO L272 TraceCheckUtils]: 75: Hoare triple {105680#(<= ~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)); {105680#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:58,571 INFO L290 TraceCheckUtils]: 76: Hoare triple {105680#(<= ~counter~0 8)} ~cond := #in~cond; {105680#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:58,571 INFO L290 TraceCheckUtils]: 77: Hoare triple {105680#(<= ~counter~0 8)} assume !(0 == ~cond); {105680#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:58,571 INFO L290 TraceCheckUtils]: 78: Hoare triple {105680#(<= ~counter~0 8)} assume true; {105680#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:58,572 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {105680#(<= ~counter~0 8)} {105680#(<= ~counter~0 8)} #96#return; {105680#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:58,572 INFO L290 TraceCheckUtils]: 80: Hoare triple {105680#(<= ~counter~0 8)} assume !(~r~0 > 0); {105680#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:58,573 INFO L290 TraceCheckUtils]: 81: Hoare triple {105680#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105705#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:58,573 INFO L290 TraceCheckUtils]: 82: Hoare triple {105705#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {105705#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:58,574 INFO L272 TraceCheckUtils]: 83: Hoare triple {105705#(<= ~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)); {105705#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:58,574 INFO L290 TraceCheckUtils]: 84: Hoare triple {105705#(<= ~counter~0 9)} ~cond := #in~cond; {105705#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:58,574 INFO L290 TraceCheckUtils]: 85: Hoare triple {105705#(<= ~counter~0 9)} assume !(0 == ~cond); {105705#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:58,575 INFO L290 TraceCheckUtils]: 86: Hoare triple {105705#(<= ~counter~0 9)} assume true; {105705#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:58,575 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {105705#(<= ~counter~0 9)} {105705#(<= ~counter~0 9)} #98#return; {105705#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:58,575 INFO L290 TraceCheckUtils]: 88: Hoare triple {105705#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {105705#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:58,576 INFO L290 TraceCheckUtils]: 89: Hoare triple {105705#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105730#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:58,577 INFO L290 TraceCheckUtils]: 90: Hoare triple {105730#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {105730#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:58,577 INFO L272 TraceCheckUtils]: 91: Hoare triple {105730#(<= ~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)); {105730#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:58,577 INFO L290 TraceCheckUtils]: 92: Hoare triple {105730#(<= ~counter~0 10)} ~cond := #in~cond; {105730#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:58,578 INFO L290 TraceCheckUtils]: 93: Hoare triple {105730#(<= ~counter~0 10)} assume !(0 == ~cond); {105730#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:58,578 INFO L290 TraceCheckUtils]: 94: Hoare triple {105730#(<= ~counter~0 10)} assume true; {105730#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:58,579 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {105730#(<= ~counter~0 10)} {105730#(<= ~counter~0 10)} #98#return; {105730#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:58,579 INFO L290 TraceCheckUtils]: 96: Hoare triple {105730#(<= ~counter~0 10)} assume !(~r~0 < 0); {105730#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:58,580 INFO L290 TraceCheckUtils]: 97: Hoare triple {105730#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105755#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:58,580 INFO L290 TraceCheckUtils]: 98: Hoare triple {105755#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {105755#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:58,581 INFO L272 TraceCheckUtils]: 99: Hoare triple {105755#(<= ~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)); {105755#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:58,581 INFO L290 TraceCheckUtils]: 100: Hoare triple {105755#(<= ~counter~0 11)} ~cond := #in~cond; {105755#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:58,581 INFO L290 TraceCheckUtils]: 101: Hoare triple {105755#(<= ~counter~0 11)} assume !(0 == ~cond); {105755#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:58,581 INFO L290 TraceCheckUtils]: 102: Hoare triple {105755#(<= ~counter~0 11)} assume true; {105755#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:58,582 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {105755#(<= ~counter~0 11)} {105755#(<= ~counter~0 11)} #94#return; {105755#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:58,582 INFO L290 TraceCheckUtils]: 104: Hoare triple {105755#(<= ~counter~0 11)} assume !!(0 != ~r~0); {105755#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:58,583 INFO L290 TraceCheckUtils]: 105: Hoare triple {105755#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105780#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:58,583 INFO L290 TraceCheckUtils]: 106: Hoare triple {105780#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {105780#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:58,584 INFO L272 TraceCheckUtils]: 107: Hoare triple {105780#(<= ~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)); {105780#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:58,584 INFO L290 TraceCheckUtils]: 108: Hoare triple {105780#(<= ~counter~0 12)} ~cond := #in~cond; {105780#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:58,584 INFO L290 TraceCheckUtils]: 109: Hoare triple {105780#(<= ~counter~0 12)} assume !(0 == ~cond); {105780#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:58,585 INFO L290 TraceCheckUtils]: 110: Hoare triple {105780#(<= ~counter~0 12)} assume true; {105780#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:58,585 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {105780#(<= ~counter~0 12)} {105780#(<= ~counter~0 12)} #96#return; {105780#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:58,585 INFO L290 TraceCheckUtils]: 112: Hoare triple {105780#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105780#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:58,586 INFO L290 TraceCheckUtils]: 113: Hoare triple {105780#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105805#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:58,587 INFO L290 TraceCheckUtils]: 114: Hoare triple {105805#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {105805#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:58,587 INFO L272 TraceCheckUtils]: 115: Hoare triple {105805#(<= ~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)); {105805#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:58,587 INFO L290 TraceCheckUtils]: 116: Hoare triple {105805#(<= ~counter~0 13)} ~cond := #in~cond; {105805#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:58,588 INFO L290 TraceCheckUtils]: 117: Hoare triple {105805#(<= ~counter~0 13)} assume !(0 == ~cond); {105805#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:58,588 INFO L290 TraceCheckUtils]: 118: Hoare triple {105805#(<= ~counter~0 13)} assume true; {105805#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:58,588 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {105805#(<= ~counter~0 13)} {105805#(<= ~counter~0 13)} #96#return; {105805#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:58,589 INFO L290 TraceCheckUtils]: 120: Hoare triple {105805#(<= ~counter~0 13)} assume !(~r~0 > 0); {105805#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:58,589 INFO L290 TraceCheckUtils]: 121: Hoare triple {105805#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105830#(<= |main_#t~post8| 13)} is VALID [2022-04-15 15:20:58,589 INFO L290 TraceCheckUtils]: 122: Hoare triple {105830#(<= |main_#t~post8| 13)} assume !(#t~post8 < 20);havoc #t~post8; {105449#false} is VALID [2022-04-15 15:20:58,589 INFO L290 TraceCheckUtils]: 123: Hoare triple {105449#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105449#false} is VALID [2022-04-15 15:20:58,589 INFO L290 TraceCheckUtils]: 124: Hoare triple {105449#false} assume !(#t~post6 < 20);havoc #t~post6; {105449#false} is VALID [2022-04-15 15:20:58,590 INFO L272 TraceCheckUtils]: 125: Hoare triple {105449#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105449#false} is VALID [2022-04-15 15:20:58,590 INFO L290 TraceCheckUtils]: 126: Hoare triple {105449#false} ~cond := #in~cond; {105449#false} is VALID [2022-04-15 15:20:58,590 INFO L290 TraceCheckUtils]: 127: Hoare triple {105449#false} assume 0 == ~cond; {105449#false} is VALID [2022-04-15 15:20:58,590 INFO L290 TraceCheckUtils]: 128: Hoare triple {105449#false} assume !false; {105449#false} is VALID [2022-04-15 15:20:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 416 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:20:58,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:20:59,254 INFO L290 TraceCheckUtils]: 128: Hoare triple {105449#false} assume !false; {105449#false} is VALID [2022-04-15 15:20:59,254 INFO L290 TraceCheckUtils]: 127: Hoare triple {105449#false} assume 0 == ~cond; {105449#false} is VALID [2022-04-15 15:20:59,254 INFO L290 TraceCheckUtils]: 126: Hoare triple {105449#false} ~cond := #in~cond; {105449#false} is VALID [2022-04-15 15:20:59,254 INFO L272 TraceCheckUtils]: 125: Hoare triple {105449#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105449#false} is VALID [2022-04-15 15:20:59,254 INFO L290 TraceCheckUtils]: 124: Hoare triple {105449#false} assume !(#t~post6 < 20);havoc #t~post6; {105449#false} is VALID [2022-04-15 15:20:59,254 INFO L290 TraceCheckUtils]: 123: Hoare triple {105449#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105449#false} is VALID [2022-04-15 15:20:59,254 INFO L290 TraceCheckUtils]: 122: Hoare triple {105870#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {105449#false} is VALID [2022-04-15 15:20:59,255 INFO L290 TraceCheckUtils]: 121: Hoare triple {105874#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105870#(< |main_#t~post8| 20)} is VALID [2022-04-15 15:20:59,255 INFO L290 TraceCheckUtils]: 120: Hoare triple {105874#(< ~counter~0 20)} assume !(~r~0 > 0); {105874#(< ~counter~0 20)} is VALID [2022-04-15 15:20:59,256 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {105448#true} {105874#(< ~counter~0 20)} #96#return; {105874#(< ~counter~0 20)} is VALID [2022-04-15 15:20:59,256 INFO L290 TraceCheckUtils]: 118: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,256 INFO L290 TraceCheckUtils]: 117: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,256 INFO L290 TraceCheckUtils]: 116: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,256 INFO L272 TraceCheckUtils]: 115: Hoare triple {105874#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105448#true} is VALID [2022-04-15 15:20:59,256 INFO L290 TraceCheckUtils]: 114: Hoare triple {105874#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {105874#(< ~counter~0 20)} is VALID [2022-04-15 15:20:59,258 INFO L290 TraceCheckUtils]: 113: Hoare triple {105899#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105874#(< ~counter~0 20)} is VALID [2022-04-15 15:20:59,259 INFO L290 TraceCheckUtils]: 112: Hoare triple {105899#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105899#(< ~counter~0 19)} is VALID [2022-04-15 15:20:59,259 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {105448#true} {105899#(< ~counter~0 19)} #96#return; {105899#(< ~counter~0 19)} is VALID [2022-04-15 15:20:59,259 INFO L290 TraceCheckUtils]: 110: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,259 INFO L290 TraceCheckUtils]: 109: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,259 INFO L290 TraceCheckUtils]: 108: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,260 INFO L272 TraceCheckUtils]: 107: Hoare triple {105899#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105448#true} is VALID [2022-04-15 15:20:59,260 INFO L290 TraceCheckUtils]: 106: Hoare triple {105899#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {105899#(< ~counter~0 19)} is VALID [2022-04-15 15:20:59,265 INFO L290 TraceCheckUtils]: 105: Hoare triple {105924#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105899#(< ~counter~0 19)} is VALID [2022-04-15 15:20:59,265 INFO L290 TraceCheckUtils]: 104: Hoare triple {105924#(< ~counter~0 18)} assume !!(0 != ~r~0); {105924#(< ~counter~0 18)} is VALID [2022-04-15 15:20:59,266 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {105448#true} {105924#(< ~counter~0 18)} #94#return; {105924#(< ~counter~0 18)} is VALID [2022-04-15 15:20:59,266 INFO L290 TraceCheckUtils]: 102: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,266 INFO L290 TraceCheckUtils]: 101: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,266 INFO L290 TraceCheckUtils]: 100: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,266 INFO L272 TraceCheckUtils]: 99: Hoare triple {105924#(< ~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)); {105448#true} is VALID [2022-04-15 15:20:59,267 INFO L290 TraceCheckUtils]: 98: Hoare triple {105924#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {105924#(< ~counter~0 18)} is VALID [2022-04-15 15:20:59,268 INFO L290 TraceCheckUtils]: 97: Hoare triple {105949#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105924#(< ~counter~0 18)} is VALID [2022-04-15 15:20:59,268 INFO L290 TraceCheckUtils]: 96: Hoare triple {105949#(< ~counter~0 17)} assume !(~r~0 < 0); {105949#(< ~counter~0 17)} is VALID [2022-04-15 15:20:59,269 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {105448#true} {105949#(< ~counter~0 17)} #98#return; {105949#(< ~counter~0 17)} is VALID [2022-04-15 15:20:59,269 INFO L290 TraceCheckUtils]: 94: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,269 INFO L290 TraceCheckUtils]: 93: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,269 INFO L290 TraceCheckUtils]: 92: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,269 INFO L272 TraceCheckUtils]: 91: Hoare triple {105949#(< ~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)); {105448#true} is VALID [2022-04-15 15:20:59,270 INFO L290 TraceCheckUtils]: 90: Hoare triple {105949#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {105949#(< ~counter~0 17)} is VALID [2022-04-15 15:20:59,271 INFO L290 TraceCheckUtils]: 89: Hoare triple {105974#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105949#(< ~counter~0 17)} is VALID [2022-04-15 15:20:59,272 INFO L290 TraceCheckUtils]: 88: Hoare triple {105974#(< ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {105974#(< ~counter~0 16)} is VALID [2022-04-15 15:20:59,272 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {105448#true} {105974#(< ~counter~0 16)} #98#return; {105974#(< ~counter~0 16)} is VALID [2022-04-15 15:20:59,272 INFO L290 TraceCheckUtils]: 86: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,273 INFO L290 TraceCheckUtils]: 85: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,273 INFO L290 TraceCheckUtils]: 84: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,273 INFO L272 TraceCheckUtils]: 83: Hoare triple {105974#(< ~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)); {105448#true} is VALID [2022-04-15 15:20:59,273 INFO L290 TraceCheckUtils]: 82: Hoare triple {105974#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {105974#(< ~counter~0 16)} is VALID [2022-04-15 15:20:59,274 INFO L290 TraceCheckUtils]: 81: Hoare triple {105999#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105974#(< ~counter~0 16)} is VALID [2022-04-15 15:20:59,275 INFO L290 TraceCheckUtils]: 80: Hoare triple {105999#(< ~counter~0 15)} assume !(~r~0 > 0); {105999#(< ~counter~0 15)} is VALID [2022-04-15 15:20:59,275 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {105448#true} {105999#(< ~counter~0 15)} #96#return; {105999#(< ~counter~0 15)} is VALID [2022-04-15 15:20:59,276 INFO L290 TraceCheckUtils]: 78: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,276 INFO L290 TraceCheckUtils]: 77: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,276 INFO L290 TraceCheckUtils]: 76: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,276 INFO L272 TraceCheckUtils]: 75: Hoare triple {105999#(< ~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)); {105448#true} is VALID [2022-04-15 15:20:59,276 INFO L290 TraceCheckUtils]: 74: Hoare triple {105999#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {105999#(< ~counter~0 15)} is VALID [2022-04-15 15:20:59,278 INFO L290 TraceCheckUtils]: 73: Hoare triple {105805#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105999#(< ~counter~0 15)} is VALID [2022-04-15 15:20:59,278 INFO L290 TraceCheckUtils]: 72: Hoare triple {105805#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105805#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:59,279 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {105448#true} {105805#(<= ~counter~0 13)} #96#return; {105805#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:59,279 INFO L290 TraceCheckUtils]: 70: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,279 INFO L290 TraceCheckUtils]: 69: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,279 INFO L290 TraceCheckUtils]: 68: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,279 INFO L272 TraceCheckUtils]: 67: Hoare triple {105805#(<= ~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)); {105448#true} is VALID [2022-04-15 15:20:59,279 INFO L290 TraceCheckUtils]: 66: Hoare triple {105805#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {105805#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:59,281 INFO L290 TraceCheckUtils]: 65: Hoare triple {105780#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105805#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:59,281 INFO L290 TraceCheckUtils]: 64: Hoare triple {105780#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105780#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:59,282 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {105448#true} {105780#(<= ~counter~0 12)} #96#return; {105780#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:59,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,282 INFO L272 TraceCheckUtils]: 59: Hoare triple {105780#(<= ~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)); {105448#true} is VALID [2022-04-15 15:20:59,283 INFO L290 TraceCheckUtils]: 58: Hoare triple {105780#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {105780#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:59,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {105755#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105780#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:59,285 INFO L290 TraceCheckUtils]: 56: Hoare triple {105755#(<= ~counter~0 11)} assume !!(0 != ~r~0); {105755#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:59,285 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {105448#true} {105755#(<= ~counter~0 11)} #94#return; {105755#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:59,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,286 INFO L290 TraceCheckUtils]: 52: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,286 INFO L272 TraceCheckUtils]: 51: Hoare triple {105755#(<= ~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)); {105448#true} is VALID [2022-04-15 15:20:59,286 INFO L290 TraceCheckUtils]: 50: Hoare triple {105755#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {105755#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:59,287 INFO L290 TraceCheckUtils]: 49: Hoare triple {105730#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105755#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:59,288 INFO L290 TraceCheckUtils]: 48: Hoare triple {105730#(<= ~counter~0 10)} assume !(~r~0 < 0); {105730#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:59,288 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {105448#true} {105730#(<= ~counter~0 10)} #98#return; {105730#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:59,289 INFO L290 TraceCheckUtils]: 46: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,289 INFO L290 TraceCheckUtils]: 45: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,289 INFO L290 TraceCheckUtils]: 44: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,289 INFO L272 TraceCheckUtils]: 43: Hoare triple {105730#(<= ~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)); {105448#true} is VALID [2022-04-15 15:20:59,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {105730#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {105730#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:59,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {105705#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105730#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:59,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {105705#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {105705#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:59,292 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {105448#true} {105705#(<= ~counter~0 9)} #98#return; {105705#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:59,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,292 INFO L272 TraceCheckUtils]: 35: Hoare triple {105705#(<= ~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)); {105448#true} is VALID [2022-04-15 15:20:59,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {105705#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {105705#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:59,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {105680#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105705#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:59,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {105680#(<= ~counter~0 8)} assume !(~r~0 > 0); {105680#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:59,295 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {105448#true} {105680#(<= ~counter~0 8)} #96#return; {105680#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:59,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,296 INFO L272 TraceCheckUtils]: 27: Hoare triple {105680#(<= ~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)); {105448#true} is VALID [2022-04-15 15:20:59,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {105680#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {105680#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:59,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {105655#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105680#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:59,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {105655#(<= ~counter~0 7)} assume !!(0 != ~r~0); {105655#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:59,298 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {105448#true} {105655#(<= ~counter~0 7)} #94#return; {105655#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:59,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,299 INFO L272 TraceCheckUtils]: 19: Hoare triple {105655#(<= ~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)); {105448#true} is VALID [2022-04-15 15:20:59,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {105655#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {105655#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:59,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {105630#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105655#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:59,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {105630#(<= ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:59,302 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {105448#true} {105630#(<= ~counter~0 6)} #92#return; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:59,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,302 INFO L272 TraceCheckUtils]: 11: Hoare triple {105630#(<= ~counter~0 6)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {105448#true} is VALID [2022-04-15 15:20:59,303 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {105448#true} {105630#(<= ~counter~0 6)} #90#return; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:59,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {105448#true} assume true; {105448#true} is VALID [2022-04-15 15:20:59,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {105448#true} assume !(0 == ~cond); {105448#true} is VALID [2022-04-15 15:20:59,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {105448#true} ~cond := #in~cond; {105448#true} is VALID [2022-04-15 15:20:59,303 INFO L272 TraceCheckUtils]: 6: Hoare triple {105630#(<= ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {105448#true} is VALID [2022-04-15 15:20:59,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {105630#(<= ~counter~0 6)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:59,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {105630#(<= ~counter~0 6)} call #t~ret9 := main(); {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:59,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105630#(<= ~counter~0 6)} {105448#true} #102#return; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:59,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {105630#(<= ~counter~0 6)} assume true; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:59,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {105448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {105630#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:59,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {105448#true} call ULTIMATE.init(); {105448#true} is VALID [2022-04-15 15:20:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-15 15:20:59,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:20:59,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523225976] [2022-04-15 15:20:59,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:20:59,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061989820] [2022-04-15 15:20:59,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061989820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:20:59,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:20:59,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-15 15:20:59,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:20:59,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704394559] [2022-04-15 15:20:59,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704394559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:20:59,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:20:59,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 15:20:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543412972] [2022-04-15 15:20:59,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:20:59,308 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 129 [2022-04-15 15:20:59,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:20:59,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:20:59,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:59,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 15:20:59,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:59,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 15:20:59,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:20:59,439 INFO L87 Difference]: Start difference. First operand 720 states and 950 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:21:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:02,908 INFO L93 Difference]: Finished difference Result 945 states and 1286 transitions. [2022-04-15 15:21:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 15:21:02,909 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 129 [2022-04-15 15:21:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:21:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:21:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-15 15:21:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:21:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-15 15:21:02,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 296 transitions. [2022-04-15 15:21:03,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:03,226 INFO L225 Difference]: With dead ends: 945 [2022-04-15 15:21:03,226 INFO L226 Difference]: Without dead ends: 748 [2022-04-15 15:21:03,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=467, Invalid=723, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 15:21:03,227 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 192 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:21:03,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 318 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 15:21:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-04-15 15:21:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 738. [2022-04-15 15:21:05,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:21:05,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 748 states. Second operand has 738 states, 556 states have (on average 1.2014388489208634) internal successors, (668), 560 states have internal predecessors, (668), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:21:05,382 INFO L74 IsIncluded]: Start isIncluded. First operand 748 states. Second operand has 738 states, 556 states have (on average 1.2014388489208634) internal successors, (668), 560 states have internal predecessors, (668), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:21:05,382 INFO L87 Difference]: Start difference. First operand 748 states. Second operand has 738 states, 556 states have (on average 1.2014388489208634) internal successors, (668), 560 states have internal predecessors, (668), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:21:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:05,400 INFO L93 Difference]: Finished difference Result 748 states and 982 transitions. [2022-04-15 15:21:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 982 transitions. [2022-04-15 15:21:05,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:05,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:05,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 738 states, 556 states have (on average 1.2014388489208634) internal successors, (668), 560 states have internal predecessors, (668), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 748 states. [2022-04-15 15:21:05,402 INFO L87 Difference]: Start difference. First operand has 738 states, 556 states have (on average 1.2014388489208634) internal successors, (668), 560 states have internal predecessors, (668), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 748 states. [2022-04-15 15:21:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:05,420 INFO L93 Difference]: Finished difference Result 748 states and 982 transitions. [2022-04-15 15:21:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 982 transitions. [2022-04-15 15:21:05,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:05,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:05,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:21:05,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:21:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 556 states have (on average 1.2014388489208634) internal successors, (668), 560 states have internal predecessors, (668), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:21:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 972 transitions. [2022-04-15 15:21:05,446 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 972 transitions. Word has length 129 [2022-04-15 15:21:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:21:05,446 INFO L478 AbstractCegarLoop]: Abstraction has 738 states and 972 transitions. [2022-04-15 15:21:05,446 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:21:05,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 738 states and 972 transitions. [2022-04-15 15:21:24,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 972 edges. 967 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 972 transitions. [2022-04-15 15:21:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 15:21:24,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:21:24,280 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:21:24,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-15 15:21:24,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-15 15:21:24,491 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:21:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:21:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 17 times [2022-04-15 15:21:24,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:24,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [551368290] [2022-04-15 15:21:24,492 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:21:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 18 times [2022-04-15 15:21:24,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:21:24,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841032713] [2022-04-15 15:21:24,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:21:24,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:21:24,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:21:24,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593569796] [2022-04-15 15:21:24,506 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:21:24,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:21:24,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:21:24,511 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:21:24,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-15 15:21:24,695 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:21:24,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:21:24,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 15:21:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:21:24,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:21:25,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {111129#true} call ULTIMATE.init(); {111129#true} is VALID [2022-04-15 15:21:25,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {111129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {111137#(<= ~counter~0 0)} assume true; {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111137#(<= ~counter~0 0)} {111129#true} #102#return; {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {111137#(<= ~counter~0 0)} call #t~ret9 := main(); {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {111137#(<= ~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; {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,352 INFO L272 TraceCheckUtils]: 6: Hoare triple {111137#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {111137#(<= ~counter~0 0)} ~cond := #in~cond; {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {111137#(<= ~counter~0 0)} assume !(0 == ~cond); {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {111137#(<= ~counter~0 0)} assume true; {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {111137#(<= ~counter~0 0)} {111137#(<= ~counter~0 0)} #90#return; {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,354 INFO L272 TraceCheckUtils]: 11: Hoare triple {111137#(<= ~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)); {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {111137#(<= ~counter~0 0)} ~cond := #in~cond; {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {111137#(<= ~counter~0 0)} assume !(0 == ~cond); {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {111137#(<= ~counter~0 0)} assume true; {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,355 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {111137#(<= ~counter~0 0)} {111137#(<= ~counter~0 0)} #92#return; {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {111137#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {111137#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:25,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {111137#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111186#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:25,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {111186#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {111186#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:25,359 INFO L272 TraceCheckUtils]: 19: Hoare triple {111186#(<= ~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)); {111186#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:25,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {111186#(<= ~counter~0 1)} ~cond := #in~cond; {111186#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:25,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {111186#(<= ~counter~0 1)} assume !(0 == ~cond); {111186#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:25,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {111186#(<= ~counter~0 1)} assume true; {111186#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:25,360 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {111186#(<= ~counter~0 1)} {111186#(<= ~counter~0 1)} #94#return; {111186#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:25,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {111186#(<= ~counter~0 1)} assume !!(0 != ~r~0); {111186#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:25,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {111186#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111211#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:25,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {111211#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {111211#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:25,363 INFO L272 TraceCheckUtils]: 27: Hoare triple {111211#(<= ~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)); {111211#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:25,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {111211#(<= ~counter~0 2)} ~cond := #in~cond; {111211#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:25,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {111211#(<= ~counter~0 2)} assume !(0 == ~cond); {111211#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:25,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {111211#(<= ~counter~0 2)} assume true; {111211#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:25,364 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {111211#(<= ~counter~0 2)} {111211#(<= ~counter~0 2)} #96#return; {111211#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:25,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {111211#(<= ~counter~0 2)} assume !(~r~0 > 0); {111211#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:25,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {111211#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111236#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:25,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {111236#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {111236#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:25,367 INFO L272 TraceCheckUtils]: 35: Hoare triple {111236#(<= ~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)); {111236#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:25,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {111236#(<= ~counter~0 3)} ~cond := #in~cond; {111236#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:25,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {111236#(<= ~counter~0 3)} assume !(0 == ~cond); {111236#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:25,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {111236#(<= ~counter~0 3)} assume true; {111236#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:25,369 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {111236#(<= ~counter~0 3)} {111236#(<= ~counter~0 3)} #98#return; {111236#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:25,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {111236#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {111236#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:25,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {111236#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111261#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:25,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {111261#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {111261#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:25,371 INFO L272 TraceCheckUtils]: 43: Hoare triple {111261#(<= ~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)); {111261#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:25,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {111261#(<= ~counter~0 4)} ~cond := #in~cond; {111261#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:25,372 INFO L290 TraceCheckUtils]: 45: Hoare triple {111261#(<= ~counter~0 4)} assume !(0 == ~cond); {111261#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:25,372 INFO L290 TraceCheckUtils]: 46: Hoare triple {111261#(<= ~counter~0 4)} assume true; {111261#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:25,373 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {111261#(<= ~counter~0 4)} {111261#(<= ~counter~0 4)} #98#return; {111261#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:25,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {111261#(<= ~counter~0 4)} assume !(~r~0 < 0); {111261#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:25,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {111261#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111286#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:25,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {111286#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {111286#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:25,376 INFO L272 TraceCheckUtils]: 51: Hoare triple {111286#(<= ~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)); {111286#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:25,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {111286#(<= ~counter~0 5)} ~cond := #in~cond; {111286#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:25,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {111286#(<= ~counter~0 5)} assume !(0 == ~cond); {111286#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:25,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {111286#(<= ~counter~0 5)} assume true; {111286#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:25,377 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {111286#(<= ~counter~0 5)} {111286#(<= ~counter~0 5)} #94#return; {111286#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:25,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {111286#(<= ~counter~0 5)} assume !!(0 != ~r~0); {111286#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:25,379 INFO L290 TraceCheckUtils]: 57: Hoare triple {111286#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:25,379 INFO L290 TraceCheckUtils]: 58: Hoare triple {111311#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:25,380 INFO L272 TraceCheckUtils]: 59: Hoare triple {111311#(<= ~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)); {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:25,380 INFO L290 TraceCheckUtils]: 60: Hoare triple {111311#(<= ~counter~0 6)} ~cond := #in~cond; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:25,381 INFO L290 TraceCheckUtils]: 61: Hoare triple {111311#(<= ~counter~0 6)} assume !(0 == ~cond); {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:25,381 INFO L290 TraceCheckUtils]: 62: Hoare triple {111311#(<= ~counter~0 6)} assume true; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:25,382 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {111311#(<= ~counter~0 6)} {111311#(<= ~counter~0 6)} #96#return; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:25,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {111311#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:25,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {111311#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111336#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:25,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {111336#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {111336#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:25,384 INFO L272 TraceCheckUtils]: 67: Hoare triple {111336#(<= ~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)); {111336#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:25,385 INFO L290 TraceCheckUtils]: 68: Hoare triple {111336#(<= ~counter~0 7)} ~cond := #in~cond; {111336#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:25,385 INFO L290 TraceCheckUtils]: 69: Hoare triple {111336#(<= ~counter~0 7)} assume !(0 == ~cond); {111336#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:25,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {111336#(<= ~counter~0 7)} assume true; {111336#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:25,386 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {111336#(<= ~counter~0 7)} {111336#(<= ~counter~0 7)} #96#return; {111336#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:25,386 INFO L290 TraceCheckUtils]: 72: Hoare triple {111336#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111336#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:25,388 INFO L290 TraceCheckUtils]: 73: Hoare triple {111336#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111361#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:25,388 INFO L290 TraceCheckUtils]: 74: Hoare triple {111361#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {111361#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:25,388 INFO L272 TraceCheckUtils]: 75: Hoare triple {111361#(<= ~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)); {111361#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:25,389 INFO L290 TraceCheckUtils]: 76: Hoare triple {111361#(<= ~counter~0 8)} ~cond := #in~cond; {111361#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:25,389 INFO L290 TraceCheckUtils]: 77: Hoare triple {111361#(<= ~counter~0 8)} assume !(0 == ~cond); {111361#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:25,389 INFO L290 TraceCheckUtils]: 78: Hoare triple {111361#(<= ~counter~0 8)} assume true; {111361#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:25,390 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {111361#(<= ~counter~0 8)} {111361#(<= ~counter~0 8)} #96#return; {111361#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:25,390 INFO L290 TraceCheckUtils]: 80: Hoare triple {111361#(<= ~counter~0 8)} assume !(~r~0 > 0); {111361#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:25,392 INFO L290 TraceCheckUtils]: 81: Hoare triple {111361#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111386#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:25,392 INFO L290 TraceCheckUtils]: 82: Hoare triple {111386#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {111386#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:25,393 INFO L272 TraceCheckUtils]: 83: Hoare triple {111386#(<= ~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)); {111386#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:25,393 INFO L290 TraceCheckUtils]: 84: Hoare triple {111386#(<= ~counter~0 9)} ~cond := #in~cond; {111386#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:25,393 INFO L290 TraceCheckUtils]: 85: Hoare triple {111386#(<= ~counter~0 9)} assume !(0 == ~cond); {111386#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:25,394 INFO L290 TraceCheckUtils]: 86: Hoare triple {111386#(<= ~counter~0 9)} assume true; {111386#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:25,394 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {111386#(<= ~counter~0 9)} {111386#(<= ~counter~0 9)} #98#return; {111386#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:25,395 INFO L290 TraceCheckUtils]: 88: Hoare triple {111386#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {111386#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:25,396 INFO L290 TraceCheckUtils]: 89: Hoare triple {111386#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111411#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:25,396 INFO L290 TraceCheckUtils]: 90: Hoare triple {111411#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {111411#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:25,397 INFO L272 TraceCheckUtils]: 91: Hoare triple {111411#(<= ~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)); {111411#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:25,397 INFO L290 TraceCheckUtils]: 92: Hoare triple {111411#(<= ~counter~0 10)} ~cond := #in~cond; {111411#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:25,397 INFO L290 TraceCheckUtils]: 93: Hoare triple {111411#(<= ~counter~0 10)} assume !(0 == ~cond); {111411#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:25,398 INFO L290 TraceCheckUtils]: 94: Hoare triple {111411#(<= ~counter~0 10)} assume true; {111411#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:25,398 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {111411#(<= ~counter~0 10)} {111411#(<= ~counter~0 10)} #98#return; {111411#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:25,399 INFO L290 TraceCheckUtils]: 96: Hoare triple {111411#(<= ~counter~0 10)} assume !(~r~0 < 0); {111411#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:25,400 INFO L290 TraceCheckUtils]: 97: Hoare triple {111411#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111436#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:25,400 INFO L290 TraceCheckUtils]: 98: Hoare triple {111436#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {111436#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:25,401 INFO L272 TraceCheckUtils]: 99: Hoare triple {111436#(<= ~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)); {111436#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:25,401 INFO L290 TraceCheckUtils]: 100: Hoare triple {111436#(<= ~counter~0 11)} ~cond := #in~cond; {111436#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:25,402 INFO L290 TraceCheckUtils]: 101: Hoare triple {111436#(<= ~counter~0 11)} assume !(0 == ~cond); {111436#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:25,402 INFO L290 TraceCheckUtils]: 102: Hoare triple {111436#(<= ~counter~0 11)} assume true; {111436#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:25,403 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {111436#(<= ~counter~0 11)} {111436#(<= ~counter~0 11)} #94#return; {111436#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:25,403 INFO L290 TraceCheckUtils]: 104: Hoare triple {111436#(<= ~counter~0 11)} assume !!(0 != ~r~0); {111436#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:25,405 INFO L290 TraceCheckUtils]: 105: Hoare triple {111436#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111461#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:25,405 INFO L290 TraceCheckUtils]: 106: Hoare triple {111461#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {111461#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:25,406 INFO L272 TraceCheckUtils]: 107: Hoare triple {111461#(<= ~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)); {111461#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:25,406 INFO L290 TraceCheckUtils]: 108: Hoare triple {111461#(<= ~counter~0 12)} ~cond := #in~cond; {111461#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:25,407 INFO L290 TraceCheckUtils]: 109: Hoare triple {111461#(<= ~counter~0 12)} assume !(0 == ~cond); {111461#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:25,407 INFO L290 TraceCheckUtils]: 110: Hoare triple {111461#(<= ~counter~0 12)} assume true; {111461#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:25,408 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {111461#(<= ~counter~0 12)} {111461#(<= ~counter~0 12)} #96#return; {111461#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:25,408 INFO L290 TraceCheckUtils]: 112: Hoare triple {111461#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111461#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:25,409 INFO L290 TraceCheckUtils]: 113: Hoare triple {111461#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111486#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:25,410 INFO L290 TraceCheckUtils]: 114: Hoare triple {111486#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {111486#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:25,410 INFO L272 TraceCheckUtils]: 115: Hoare triple {111486#(<= ~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)); {111486#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:25,411 INFO L290 TraceCheckUtils]: 116: Hoare triple {111486#(<= ~counter~0 13)} ~cond := #in~cond; {111486#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:25,411 INFO L290 TraceCheckUtils]: 117: Hoare triple {111486#(<= ~counter~0 13)} assume !(0 == ~cond); {111486#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:25,411 INFO L290 TraceCheckUtils]: 118: Hoare triple {111486#(<= ~counter~0 13)} assume true; {111486#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:25,412 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {111486#(<= ~counter~0 13)} {111486#(<= ~counter~0 13)} #96#return; {111486#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:25,412 INFO L290 TraceCheckUtils]: 120: Hoare triple {111486#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111486#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:25,413 INFO L290 TraceCheckUtils]: 121: Hoare triple {111486#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111511#(<= |main_#t~post7| 13)} is VALID [2022-04-15 15:21:25,413 INFO L290 TraceCheckUtils]: 122: Hoare triple {111511#(<= |main_#t~post7| 13)} assume !(#t~post7 < 20);havoc #t~post7; {111130#false} is VALID [2022-04-15 15:21:25,413 INFO L290 TraceCheckUtils]: 123: Hoare triple {111130#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111130#false} is VALID [2022-04-15 15:21:25,413 INFO L290 TraceCheckUtils]: 124: Hoare triple {111130#false} assume !(#t~post8 < 20);havoc #t~post8; {111130#false} is VALID [2022-04-15 15:21:25,413 INFO L290 TraceCheckUtils]: 125: Hoare triple {111130#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111130#false} is VALID [2022-04-15 15:21:25,414 INFO L290 TraceCheckUtils]: 126: Hoare triple {111130#false} assume !(#t~post6 < 20);havoc #t~post6; {111130#false} is VALID [2022-04-15 15:21:25,414 INFO L272 TraceCheckUtils]: 127: Hoare triple {111130#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111130#false} is VALID [2022-04-15 15:21:25,414 INFO L290 TraceCheckUtils]: 128: Hoare triple {111130#false} ~cond := #in~cond; {111130#false} is VALID [2022-04-15 15:21:25,414 INFO L290 TraceCheckUtils]: 129: Hoare triple {111130#false} assume 0 == ~cond; {111130#false} is VALID [2022-04-15 15:21:25,414 INFO L290 TraceCheckUtils]: 130: Hoare triple {111130#false} assume !false; {111130#false} is VALID [2022-04-15 15:21:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 420 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:21:25,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:21:26,049 INFO L290 TraceCheckUtils]: 130: Hoare triple {111130#false} assume !false; {111130#false} is VALID [2022-04-15 15:21:26,050 INFO L290 TraceCheckUtils]: 129: Hoare triple {111130#false} assume 0 == ~cond; {111130#false} is VALID [2022-04-15 15:21:26,050 INFO L290 TraceCheckUtils]: 128: Hoare triple {111130#false} ~cond := #in~cond; {111130#false} is VALID [2022-04-15 15:21:26,050 INFO L272 TraceCheckUtils]: 127: Hoare triple {111130#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111130#false} is VALID [2022-04-15 15:21:26,050 INFO L290 TraceCheckUtils]: 126: Hoare triple {111130#false} assume !(#t~post6 < 20);havoc #t~post6; {111130#false} is VALID [2022-04-15 15:21:26,050 INFO L290 TraceCheckUtils]: 125: Hoare triple {111130#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111130#false} is VALID [2022-04-15 15:21:26,050 INFO L290 TraceCheckUtils]: 124: Hoare triple {111130#false} assume !(#t~post8 < 20);havoc #t~post8; {111130#false} is VALID [2022-04-15 15:21:26,050 INFO L290 TraceCheckUtils]: 123: Hoare triple {111130#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111130#false} is VALID [2022-04-15 15:21:26,050 INFO L290 TraceCheckUtils]: 122: Hoare triple {111563#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {111130#false} is VALID [2022-04-15 15:21:26,051 INFO L290 TraceCheckUtils]: 121: Hoare triple {111567#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111563#(< |main_#t~post7| 20)} is VALID [2022-04-15 15:21:26,051 INFO L290 TraceCheckUtils]: 120: Hoare triple {111567#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111567#(< ~counter~0 20)} is VALID [2022-04-15 15:21:26,052 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {111129#true} {111567#(< ~counter~0 20)} #96#return; {111567#(< ~counter~0 20)} is VALID [2022-04-15 15:21:26,052 INFO L290 TraceCheckUtils]: 118: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,052 INFO L290 TraceCheckUtils]: 117: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,052 INFO L290 TraceCheckUtils]: 116: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,052 INFO L272 TraceCheckUtils]: 115: Hoare triple {111567#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111129#true} is VALID [2022-04-15 15:21:26,052 INFO L290 TraceCheckUtils]: 114: Hoare triple {111567#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {111567#(< ~counter~0 20)} is VALID [2022-04-15 15:21:26,054 INFO L290 TraceCheckUtils]: 113: Hoare triple {111592#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111567#(< ~counter~0 20)} is VALID [2022-04-15 15:21:26,055 INFO L290 TraceCheckUtils]: 112: Hoare triple {111592#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111592#(< ~counter~0 19)} is VALID [2022-04-15 15:21:26,055 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {111129#true} {111592#(< ~counter~0 19)} #96#return; {111592#(< ~counter~0 19)} is VALID [2022-04-15 15:21:26,055 INFO L290 TraceCheckUtils]: 110: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,055 INFO L290 TraceCheckUtils]: 109: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,055 INFO L290 TraceCheckUtils]: 108: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,055 INFO L272 TraceCheckUtils]: 107: Hoare triple {111592#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111129#true} is VALID [2022-04-15 15:21:26,056 INFO L290 TraceCheckUtils]: 106: Hoare triple {111592#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {111592#(< ~counter~0 19)} is VALID [2022-04-15 15:21:26,057 INFO L290 TraceCheckUtils]: 105: Hoare triple {111617#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111592#(< ~counter~0 19)} is VALID [2022-04-15 15:21:26,057 INFO L290 TraceCheckUtils]: 104: Hoare triple {111617#(< ~counter~0 18)} assume !!(0 != ~r~0); {111617#(< ~counter~0 18)} is VALID [2022-04-15 15:21:26,057 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {111129#true} {111617#(< ~counter~0 18)} #94#return; {111617#(< ~counter~0 18)} is VALID [2022-04-15 15:21:26,057 INFO L290 TraceCheckUtils]: 102: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,057 INFO L290 TraceCheckUtils]: 101: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,058 INFO L290 TraceCheckUtils]: 100: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,058 INFO L272 TraceCheckUtils]: 99: Hoare triple {111617#(< ~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)); {111129#true} is VALID [2022-04-15 15:21:26,058 INFO L290 TraceCheckUtils]: 98: Hoare triple {111617#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {111617#(< ~counter~0 18)} is VALID [2022-04-15 15:21:26,059 INFO L290 TraceCheckUtils]: 97: Hoare triple {111642#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111617#(< ~counter~0 18)} is VALID [2022-04-15 15:21:26,059 INFO L290 TraceCheckUtils]: 96: Hoare triple {111642#(< ~counter~0 17)} assume !(~r~0 < 0); {111642#(< ~counter~0 17)} is VALID [2022-04-15 15:21:26,060 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {111129#true} {111642#(< ~counter~0 17)} #98#return; {111642#(< ~counter~0 17)} is VALID [2022-04-15 15:21:26,060 INFO L290 TraceCheckUtils]: 94: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,060 INFO L290 TraceCheckUtils]: 93: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,060 INFO L290 TraceCheckUtils]: 92: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,060 INFO L272 TraceCheckUtils]: 91: Hoare triple {111642#(< ~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)); {111129#true} is VALID [2022-04-15 15:21:26,060 INFO L290 TraceCheckUtils]: 90: Hoare triple {111642#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {111642#(< ~counter~0 17)} is VALID [2022-04-15 15:21:26,061 INFO L290 TraceCheckUtils]: 89: Hoare triple {111667#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111642#(< ~counter~0 17)} is VALID [2022-04-15 15:21:26,061 INFO L290 TraceCheckUtils]: 88: Hoare triple {111667#(< ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {111667#(< ~counter~0 16)} is VALID [2022-04-15 15:21:26,062 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {111129#true} {111667#(< ~counter~0 16)} #98#return; {111667#(< ~counter~0 16)} is VALID [2022-04-15 15:21:26,062 INFO L290 TraceCheckUtils]: 86: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,062 INFO L290 TraceCheckUtils]: 85: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,062 INFO L290 TraceCheckUtils]: 84: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,062 INFO L272 TraceCheckUtils]: 83: Hoare triple {111667#(< ~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)); {111129#true} is VALID [2022-04-15 15:21:26,062 INFO L290 TraceCheckUtils]: 82: Hoare triple {111667#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {111667#(< ~counter~0 16)} is VALID [2022-04-15 15:21:26,063 INFO L290 TraceCheckUtils]: 81: Hoare triple {111692#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111667#(< ~counter~0 16)} is VALID [2022-04-15 15:21:26,064 INFO L290 TraceCheckUtils]: 80: Hoare triple {111692#(< ~counter~0 15)} assume !(~r~0 > 0); {111692#(< ~counter~0 15)} is VALID [2022-04-15 15:21:26,064 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {111129#true} {111692#(< ~counter~0 15)} #96#return; {111692#(< ~counter~0 15)} is VALID [2022-04-15 15:21:26,064 INFO L290 TraceCheckUtils]: 78: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,064 INFO L290 TraceCheckUtils]: 77: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,064 INFO L290 TraceCheckUtils]: 76: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,064 INFO L272 TraceCheckUtils]: 75: Hoare triple {111692#(< ~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)); {111129#true} is VALID [2022-04-15 15:21:26,065 INFO L290 TraceCheckUtils]: 74: Hoare triple {111692#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {111692#(< ~counter~0 15)} is VALID [2022-04-15 15:21:26,066 INFO L290 TraceCheckUtils]: 73: Hoare triple {111486#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111692#(< ~counter~0 15)} is VALID [2022-04-15 15:21:26,066 INFO L290 TraceCheckUtils]: 72: Hoare triple {111486#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111486#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:26,066 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {111129#true} {111486#(<= ~counter~0 13)} #96#return; {111486#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:26,066 INFO L290 TraceCheckUtils]: 70: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,067 INFO L290 TraceCheckUtils]: 69: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,067 INFO L290 TraceCheckUtils]: 68: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,067 INFO L272 TraceCheckUtils]: 67: Hoare triple {111486#(<= ~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)); {111129#true} is VALID [2022-04-15 15:21:26,067 INFO L290 TraceCheckUtils]: 66: Hoare triple {111486#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {111486#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:26,068 INFO L290 TraceCheckUtils]: 65: Hoare triple {111461#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111486#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:26,068 INFO L290 TraceCheckUtils]: 64: Hoare triple {111461#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111461#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:26,069 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {111129#true} {111461#(<= ~counter~0 12)} #96#return; {111461#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:26,069 INFO L290 TraceCheckUtils]: 62: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,069 INFO L290 TraceCheckUtils]: 60: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,069 INFO L272 TraceCheckUtils]: 59: Hoare triple {111461#(<= ~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)); {111129#true} is VALID [2022-04-15 15:21:26,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {111461#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {111461#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:26,070 INFO L290 TraceCheckUtils]: 57: Hoare triple {111436#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111461#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:26,070 INFO L290 TraceCheckUtils]: 56: Hoare triple {111436#(<= ~counter~0 11)} assume !!(0 != ~r~0); {111436#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:26,071 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {111129#true} {111436#(<= ~counter~0 11)} #94#return; {111436#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:26,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,071 INFO L272 TraceCheckUtils]: 51: Hoare triple {111436#(<= ~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)); {111129#true} is VALID [2022-04-15 15:21:26,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {111436#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {111436#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:26,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {111411#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111436#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:26,073 INFO L290 TraceCheckUtils]: 48: Hoare triple {111411#(<= ~counter~0 10)} assume !(~r~0 < 0); {111411#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:26,073 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {111129#true} {111411#(<= ~counter~0 10)} #98#return; {111411#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:26,073 INFO L290 TraceCheckUtils]: 46: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,073 INFO L290 TraceCheckUtils]: 45: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,073 INFO L272 TraceCheckUtils]: 43: Hoare triple {111411#(<= ~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)); {111129#true} is VALID [2022-04-15 15:21:26,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {111411#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {111411#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:26,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {111386#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111411#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:26,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {111386#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {111386#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:26,075 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {111129#true} {111386#(<= ~counter~0 9)} #98#return; {111386#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:26,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,076 INFO L272 TraceCheckUtils]: 35: Hoare triple {111386#(<= ~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)); {111129#true} is VALID [2022-04-15 15:21:26,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {111386#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {111386#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:26,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {111361#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111386#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:26,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {111361#(<= ~counter~0 8)} assume !(~r~0 > 0); {111361#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:26,078 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {111129#true} {111361#(<= ~counter~0 8)} #96#return; {111361#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:26,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,078 INFO L272 TraceCheckUtils]: 27: Hoare triple {111361#(<= ~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)); {111129#true} is VALID [2022-04-15 15:21:26,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {111361#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {111361#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:26,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {111336#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111361#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:26,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {111336#(<= ~counter~0 7)} assume !!(0 != ~r~0); {111336#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:26,080 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {111129#true} {111336#(<= ~counter~0 7)} #94#return; {111336#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:26,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,080 INFO L272 TraceCheckUtils]: 19: Hoare triple {111336#(<= ~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)); {111129#true} is VALID [2022-04-15 15:21:26,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {111336#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {111336#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:26,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {111311#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111336#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:26,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {111311#(<= ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:26,082 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {111129#true} {111311#(<= ~counter~0 6)} #92#return; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:26,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,082 INFO L272 TraceCheckUtils]: 11: Hoare triple {111311#(<= ~counter~0 6)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {111129#true} is VALID [2022-04-15 15:21:26,083 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {111129#true} {111311#(<= ~counter~0 6)} #90#return; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:26,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-15 15:21:26,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {111129#true} assume !(0 == ~cond); {111129#true} is VALID [2022-04-15 15:21:26,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {111129#true} ~cond := #in~cond; {111129#true} is VALID [2022-04-15 15:21:26,084 INFO L272 TraceCheckUtils]: 6: Hoare triple {111311#(<= ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {111129#true} is VALID [2022-04-15 15:21:26,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {111311#(<= ~counter~0 6)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:26,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {111311#(<= ~counter~0 6)} call #t~ret9 := main(); {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:26,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111311#(<= ~counter~0 6)} {111129#true} #102#return; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:26,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {111311#(<= ~counter~0 6)} assume true; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:26,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {111129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {111311#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:26,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {111129#true} call ULTIMATE.init(); {111129#true} is VALID [2022-04-15 15:21:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-15 15:21:26,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:21:26,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841032713] [2022-04-15 15:21:26,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:21:26,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593569796] [2022-04-15 15:21:26,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593569796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:21:26,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:21:26,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-15 15:21:26,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:21:26,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [551368290] [2022-04-15 15:21:26,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [551368290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:21:26,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:21:26,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 15:21:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713661192] [2022-04-15 15:21:26,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:21:26,089 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 131 [2022-04-15 15:21:26,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:21:26,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:21:26,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:26,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 15:21:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:26,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 15:21:26,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:21:26,222 INFO L87 Difference]: Start difference. First operand 738 states and 972 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:21:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:29,688 INFO L93 Difference]: Finished difference Result 955 states and 1299 transitions. [2022-04-15 15:21:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 15:21:29,689 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 131 [2022-04-15 15:21:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:21:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:21:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-15 15:21:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:21:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-15 15:21:29,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 296 transitions. [2022-04-15 15:21:30,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:30,042 INFO L225 Difference]: With dead ends: 955 [2022-04-15 15:21:30,042 INFO L226 Difference]: Without dead ends: 754 [2022-04-15 15:21:30,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=500, Invalid=760, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 15:21:30,044 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 177 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:21:30,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 326 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 15:21:30,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-04-15 15:21:32,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2022-04-15 15:21:32,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:21:32,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 754 states. Second operand has 754 states, 572 states have (on average 1.1958041958041958) internal successors, (684), 572 states have internal predecessors, (684), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:21:32,304 INFO L74 IsIncluded]: Start isIncluded. First operand 754 states. Second operand has 754 states, 572 states have (on average 1.1958041958041958) internal successors, (684), 572 states have internal predecessors, (684), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:21:32,305 INFO L87 Difference]: Start difference. First operand 754 states. Second operand has 754 states, 572 states have (on average 1.1958041958041958) internal successors, (684), 572 states have internal predecessors, (684), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:21:32,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:32,322 INFO L93 Difference]: Finished difference Result 754 states and 988 transitions. [2022-04-15 15:21:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 988 transitions. [2022-04-15 15:21:32,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:32,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:32,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 754 states, 572 states have (on average 1.1958041958041958) internal successors, (684), 572 states have internal predecessors, (684), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 754 states. [2022-04-15 15:21:32,325 INFO L87 Difference]: Start difference. First operand has 754 states, 572 states have (on average 1.1958041958041958) internal successors, (684), 572 states have internal predecessors, (684), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 754 states. [2022-04-15 15:21:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:32,342 INFO L93 Difference]: Finished difference Result 754 states and 988 transitions. [2022-04-15 15:21:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 988 transitions. [2022-04-15 15:21:32,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:32,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:32,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:21:32,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:21:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 572 states have (on average 1.1958041958041958) internal successors, (684), 572 states have internal predecessors, (684), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:21:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 988 transitions. [2022-04-15 15:21:32,368 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 988 transitions. Word has length 131 [2022-04-15 15:21:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:21:32,368 INFO L478 AbstractCegarLoop]: Abstraction has 754 states and 988 transitions. [2022-04-15 15:21:32,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 15:21:32,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 754 states and 988 transitions. [2022-04-15 15:21:50,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 988 edges. 984 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 988 transitions. [2022-04-15 15:21:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 15:21:50,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:21:50,683 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:21:50,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-15 15:21:50,884 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:21:50,884 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:21:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:21:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 11 times [2022-04-15 15:21:50,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:50,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690700622] [2022-04-15 15:21:50,885 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:21:50,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 12 times [2022-04-15 15:21:50,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:21:50,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715161488] [2022-04-15 15:21:50,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:21:50,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:21:50,900 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:21:50,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141186945] [2022-04-15 15:21:50,901 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:21:50,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:21:50,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:21:50,902 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:21:50,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-15 15:21:50,986 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 15:21:50,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:21:50,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 15:21:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:21:51,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:21:51,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {116888#true} call ULTIMATE.init(); {116888#true} is VALID [2022-04-15 15:21:51,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {116888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {116888#true} is VALID [2022-04-15 15:21:51,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116888#true} {116888#true} #102#return; {116888#true} is VALID [2022-04-15 15:21:51,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {116888#true} call #t~ret9 := main(); {116888#true} is VALID [2022-04-15 15:21:51,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {116888#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; {116888#true} is VALID [2022-04-15 15:21:51,661 INFO L272 TraceCheckUtils]: 6: Hoare triple {116888#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {116888#true} {116888#true} #90#return; {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L272 TraceCheckUtils]: 11: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {116888#true} {116888#true} #92#return; {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {116888#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {116888#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {116888#true} assume !!(#t~post6 < 20);havoc #t~post6; {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L272 TraceCheckUtils]: 19: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {116888#true} {116888#true} #94#return; {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {116888#true} assume !!(0 != ~r~0); {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {116888#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {116888#true} assume !!(#t~post7 < 20);havoc #t~post7; {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L272 TraceCheckUtils]: 27: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {116888#true} {116888#true} #96#return; {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {116888#true} assume !(~r~0 > 0); {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {116888#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {116888#true} assume !!(#t~post8 < 20);havoc #t~post8; {116888#true} is VALID [2022-04-15 15:21:51,663 INFO L272 TraceCheckUtils]: 35: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L290 TraceCheckUtils]: 38: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {116888#true} {116888#true} #98#return; {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {116888#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {116888#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {116888#true} assume !!(#t~post8 < 20);havoc #t~post8; {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L272 TraceCheckUtils]: 43: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L290 TraceCheckUtils]: 45: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {116888#true} {116888#true} #98#return; {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {116888#true} assume !(~r~0 < 0); {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {116888#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116888#true} is VALID [2022-04-15 15:21:51,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {116888#true} assume !!(#t~post6 < 20);havoc #t~post6; {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L272 TraceCheckUtils]: 51: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {116888#true} {116888#true} #94#return; {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {116888#true} assume !!(0 != ~r~0); {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {116888#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {116888#true} assume !!(#t~post7 < 20);havoc #t~post7; {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L272 TraceCheckUtils]: 59: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L290 TraceCheckUtils]: 60: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L290 TraceCheckUtils]: 61: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L290 TraceCheckUtils]: 62: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {116888#true} {116888#true} #96#return; {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {116888#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {116888#true} is VALID [2022-04-15 15:21:51,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {116888#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L290 TraceCheckUtils]: 66: Hoare triple {116888#true} assume !!(#t~post7 < 20);havoc #t~post7; {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L272 TraceCheckUtils]: 67: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L290 TraceCheckUtils]: 68: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L290 TraceCheckUtils]: 69: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L290 TraceCheckUtils]: 70: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {116888#true} {116888#true} #96#return; {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {116888#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L290 TraceCheckUtils]: 73: Hoare triple {116888#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L290 TraceCheckUtils]: 74: Hoare triple {116888#true} assume !!(#t~post7 < 20);havoc #t~post7; {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L272 TraceCheckUtils]: 75: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L290 TraceCheckUtils]: 76: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L290 TraceCheckUtils]: 77: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L290 TraceCheckUtils]: 78: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {116888#true} {116888#true} #96#return; {116888#true} is VALID [2022-04-15 15:21:51,666 INFO L290 TraceCheckUtils]: 80: Hoare triple {116888#true} assume !(~r~0 > 0); {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L290 TraceCheckUtils]: 81: Hoare triple {116888#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L290 TraceCheckUtils]: 82: Hoare triple {116888#true} assume !!(#t~post8 < 20);havoc #t~post8; {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L272 TraceCheckUtils]: 83: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L290 TraceCheckUtils]: 84: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L290 TraceCheckUtils]: 85: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L290 TraceCheckUtils]: 86: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {116888#true} {116888#true} #98#return; {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L290 TraceCheckUtils]: 88: Hoare triple {116888#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L290 TraceCheckUtils]: 89: Hoare triple {116888#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L290 TraceCheckUtils]: 90: Hoare triple {116888#true} assume !!(#t~post8 < 20);havoc #t~post8; {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L272 TraceCheckUtils]: 91: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L290 TraceCheckUtils]: 92: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L290 TraceCheckUtils]: 93: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L290 TraceCheckUtils]: 94: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,667 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {116888#true} {116888#true} #98#return; {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L290 TraceCheckUtils]: 96: Hoare triple {116888#true} assume !(~r~0 < 0); {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L290 TraceCheckUtils]: 97: Hoare triple {116888#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L290 TraceCheckUtils]: 98: Hoare triple {116888#true} assume !!(#t~post6 < 20);havoc #t~post6; {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L272 TraceCheckUtils]: 99: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L290 TraceCheckUtils]: 100: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L290 TraceCheckUtils]: 101: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L290 TraceCheckUtils]: 102: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {116888#true} {116888#true} #94#return; {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L290 TraceCheckUtils]: 104: Hoare triple {116888#true} assume !!(0 != ~r~0); {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L290 TraceCheckUtils]: 105: Hoare triple {116888#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L290 TraceCheckUtils]: 106: Hoare triple {116888#true} assume !!(#t~post7 < 20);havoc #t~post7; {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L272 TraceCheckUtils]: 107: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L290 TraceCheckUtils]: 108: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L290 TraceCheckUtils]: 109: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,668 INFO L290 TraceCheckUtils]: 110: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,669 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {116888#true} {116888#true} #96#return; {116888#true} is VALID [2022-04-15 15:21:51,669 INFO L290 TraceCheckUtils]: 112: Hoare triple {116888#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {116888#true} is VALID [2022-04-15 15:21:51,669 INFO L290 TraceCheckUtils]: 113: Hoare triple {116888#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116888#true} is VALID [2022-04-15 15:21:51,669 INFO L290 TraceCheckUtils]: 114: Hoare triple {116888#true} assume !!(#t~post7 < 20);havoc #t~post7; {116888#true} is VALID [2022-04-15 15:21:51,669 INFO L272 TraceCheckUtils]: 115: Hoare triple {116888#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)); {116888#true} is VALID [2022-04-15 15:21:51,669 INFO L290 TraceCheckUtils]: 116: Hoare triple {116888#true} ~cond := #in~cond; {116888#true} is VALID [2022-04-15 15:21:51,669 INFO L290 TraceCheckUtils]: 117: Hoare triple {116888#true} assume !(0 == ~cond); {116888#true} is VALID [2022-04-15 15:21:51,669 INFO L290 TraceCheckUtils]: 118: Hoare triple {116888#true} assume true; {116888#true} is VALID [2022-04-15 15:21:51,669 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {116888#true} {116888#true} #96#return; {116888#true} is VALID [2022-04-15 15:21:51,669 INFO L290 TraceCheckUtils]: 120: Hoare triple {116888#true} assume !(~r~0 > 0); {117253#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:21:51,670 INFO L290 TraceCheckUtils]: 121: Hoare triple {117253#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {117253#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:21:51,670 INFO L290 TraceCheckUtils]: 122: Hoare triple {117253#(not (< 0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {117253#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:21:51,670 INFO L272 TraceCheckUtils]: 123: Hoare triple {117253#(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)); {116888#true} is VALID [2022-04-15 15:21:51,670 INFO L290 TraceCheckUtils]: 124: Hoare triple {116888#true} ~cond := #in~cond; {117266#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:21:51,671 INFO L290 TraceCheckUtils]: 125: Hoare triple {117266#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {117270#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:21:51,671 INFO L290 TraceCheckUtils]: 126: Hoare triple {117270#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {117270#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:21:51,672 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {117270#(not (= |__VERIFIER_assert_#in~cond| 0))} {117253#(not (< 0 main_~r~0))} #98#return; {117277#(and (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:21:51,674 INFO L290 TraceCheckUtils]: 128: Hoare triple {117277#(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); {117281#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-15 15:21:51,675 INFO L290 TraceCheckUtils]: 129: Hoare triple {117281#(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; {117281#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-15 15:21:51,675 INFO L290 TraceCheckUtils]: 130: Hoare triple {117281#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} assume !(#t~post6 < 20);havoc #t~post6; {117281#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-15 15:21:51,677 INFO L272 TraceCheckUtils]: 131: Hoare triple {117281#(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)); {117291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:21:51,677 INFO L290 TraceCheckUtils]: 132: Hoare triple {117291#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {117295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:21:51,677 INFO L290 TraceCheckUtils]: 133: Hoare triple {117295#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {116889#false} is VALID [2022-04-15 15:21:51,677 INFO L290 TraceCheckUtils]: 134: Hoare triple {116889#false} assume !false; {116889#false} is VALID [2022-04-15 15:21:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 88 proven. 1 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-15 15:21:51,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:21:54,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:21:54,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715161488] [2022-04-15 15:21:54,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:21:54,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141186945] [2022-04-15 15:21:54,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141186945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 15:21:54,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 15:21:54,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 15:21:54,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:21:54,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690700622] [2022-04-15 15:21:54,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690700622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:21:54,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:21:54,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 15:21:54,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462886465] [2022-04-15 15:21:54,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:21:54,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-15 15:21:54,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:21:54,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 15:21:54,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:54,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 15:21:54,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:54,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 15:21:54,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-04-15 15:21:54,301 INFO L87 Difference]: Start difference. First operand 754 states and 988 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 15:21:56,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:21:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:59,551 INFO L93 Difference]: Finished difference Result 810 states and 1067 transitions. [2022-04-15 15:21:59,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:21:59,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-15 15:21:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:21:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 15:21:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-15 15:21:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 15:21:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-15 15:21:59,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-15 15:21:59,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:59,673 INFO L225 Difference]: With dead ends: 810 [2022-04-15 15:21:59,673 INFO L226 Difference]: Without dead ends: 798 [2022-04-15 15:21:59,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2022-04-15 15:21:59,674 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:21:59,674 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 282 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 15:21:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-04-15 15:22:01,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 735. [2022-04-15 15:22:01,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:22:01,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 798 states. Second operand has 735 states, 554 states have (on average 1.1787003610108304) internal successors, (653), 561 states have internal predecessors, (653), 150 states have call successors, (150), 32 states have call predecessors, (150), 30 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-15 15:22:01,914 INFO L74 IsIncluded]: Start isIncluded. First operand 798 states. Second operand has 735 states, 554 states have (on average 1.1787003610108304) internal successors, (653), 561 states have internal predecessors, (653), 150 states have call successors, (150), 32 states have call predecessors, (150), 30 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-15 15:22:01,915 INFO L87 Difference]: Start difference. First operand 798 states. Second operand has 735 states, 554 states have (on average 1.1787003610108304) internal successors, (653), 561 states have internal predecessors, (653), 150 states have call successors, (150), 32 states have call predecessors, (150), 30 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-15 15:22:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:01,942 INFO L93 Difference]: Finished difference Result 798 states and 1049 transitions. [2022-04-15 15:22:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1049 transitions. [2022-04-15 15:22:01,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:01,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:01,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 735 states, 554 states have (on average 1.1787003610108304) internal successors, (653), 561 states have internal predecessors, (653), 150 states have call successors, (150), 32 states have call predecessors, (150), 30 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 798 states. [2022-04-15 15:22:01,944 INFO L87 Difference]: Start difference. First operand has 735 states, 554 states have (on average 1.1787003610108304) internal successors, (653), 561 states have internal predecessors, (653), 150 states have call successors, (150), 32 states have call predecessors, (150), 30 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 798 states. [2022-04-15 15:22:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:01,965 INFO L93 Difference]: Finished difference Result 798 states and 1049 transitions. [2022-04-15 15:22:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1049 transitions. [2022-04-15 15:22:01,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:01,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:01,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:22:01,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:22:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 554 states have (on average 1.1787003610108304) internal successors, (653), 561 states have internal predecessors, (653), 150 states have call successors, (150), 32 states have call predecessors, (150), 30 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-15 15:22:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 951 transitions. [2022-04-15 15:22:01,990 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 951 transitions. Word has length 135 [2022-04-15 15:22:01,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:22:01,990 INFO L478 AbstractCegarLoop]: Abstraction has 735 states and 951 transitions. [2022-04-15 15:22:01,990 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 15:22:01,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 735 states and 951 transitions. [2022-04-15 15:22:25,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 951 edges. 945 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-15 15:22:25,081 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 951 transitions. [2022-04-15 15:22:25,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 15:22:25,082 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:22:25,082 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 8, 8, 8, 8, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:22:25,088 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-15 15:22:25,282 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-15 15:22:25,283 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:22:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:22:25,283 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 13 times [2022-04-15 15:22:25,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:22:25,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2074519645] [2022-04-15 15:22:25,283 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:22:25,284 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 14 times [2022-04-15 15:22:25,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:22:25,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044302322] [2022-04-15 15:22:25,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:22:25,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:22:25,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:22:25,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531528223] [2022-04-15 15:22:25,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:22:25,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:22:25,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:22:25,304 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:22:25,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-15 15:22:25,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:22:25,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:22:25,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 15:22:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:22:25,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:22:26,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {122020#true} call ULTIMATE.init(); {122020#true} is VALID [2022-04-15 15:22:26,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {122020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {122028#(<= ~counter~0 0)} assume true; {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122028#(<= ~counter~0 0)} {122020#true} #102#return; {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {122028#(<= ~counter~0 0)} call #t~ret9 := main(); {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {122028#(<= ~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; {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,163 INFO L272 TraceCheckUtils]: 6: Hoare triple {122028#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {122028#(<= ~counter~0 0)} ~cond := #in~cond; {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {122028#(<= ~counter~0 0)} assume !(0 == ~cond); {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {122028#(<= ~counter~0 0)} assume true; {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {122028#(<= ~counter~0 0)} {122028#(<= ~counter~0 0)} #90#return; {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,165 INFO L272 TraceCheckUtils]: 11: Hoare triple {122028#(<= ~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)); {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {122028#(<= ~counter~0 0)} ~cond := #in~cond; {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {122028#(<= ~counter~0 0)} assume !(0 == ~cond); {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {122028#(<= ~counter~0 0)} assume true; {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,166 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {122028#(<= ~counter~0 0)} {122028#(<= ~counter~0 0)} #92#return; {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {122028#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {122028#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:26,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {122028#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122077#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:26,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {122077#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {122077#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:26,169 INFO L272 TraceCheckUtils]: 19: Hoare triple {122077#(<= ~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)); {122077#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:26,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {122077#(<= ~counter~0 1)} ~cond := #in~cond; {122077#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:26,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {122077#(<= ~counter~0 1)} assume !(0 == ~cond); {122077#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:26,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {122077#(<= ~counter~0 1)} assume true; {122077#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:26,171 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {122077#(<= ~counter~0 1)} {122077#(<= ~counter~0 1)} #94#return; {122077#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:26,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {122077#(<= ~counter~0 1)} assume !!(0 != ~r~0); {122077#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:26,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {122077#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122102#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:26,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {122102#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {122102#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:26,173 INFO L272 TraceCheckUtils]: 27: Hoare triple {122102#(<= ~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)); {122102#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:26,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {122102#(<= ~counter~0 2)} ~cond := #in~cond; {122102#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:26,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {122102#(<= ~counter~0 2)} assume !(0 == ~cond); {122102#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:26,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {122102#(<= ~counter~0 2)} assume true; {122102#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:26,174 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {122102#(<= ~counter~0 2)} {122102#(<= ~counter~0 2)} #96#return; {122102#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:26,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {122102#(<= ~counter~0 2)} assume !(~r~0 > 0); {122102#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:26,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {122102#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122127#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:26,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {122127#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {122127#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:26,176 INFO L272 TraceCheckUtils]: 35: Hoare triple {122127#(<= ~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)); {122127#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:26,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {122127#(<= ~counter~0 3)} ~cond := #in~cond; {122127#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:26,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {122127#(<= ~counter~0 3)} assume !(0 == ~cond); {122127#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:26,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {122127#(<= ~counter~0 3)} assume true; {122127#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:26,177 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {122127#(<= ~counter~0 3)} {122127#(<= ~counter~0 3)} #98#return; {122127#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:26,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {122127#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {122127#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:26,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {122127#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122152#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:26,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {122152#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {122152#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:26,179 INFO L272 TraceCheckUtils]: 43: Hoare triple {122152#(<= ~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)); {122152#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:26,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {122152#(<= ~counter~0 4)} ~cond := #in~cond; {122152#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:26,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {122152#(<= ~counter~0 4)} assume !(0 == ~cond); {122152#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:26,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {122152#(<= ~counter~0 4)} assume true; {122152#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:26,181 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {122152#(<= ~counter~0 4)} {122152#(<= ~counter~0 4)} #98#return; {122152#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:26,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {122152#(<= ~counter~0 4)} assume !(~r~0 < 0); {122152#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:26,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {122152#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {122177#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,183 INFO L272 TraceCheckUtils]: 51: Hoare triple {122177#(<= ~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)); {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,183 INFO L290 TraceCheckUtils]: 52: Hoare triple {122177#(<= ~counter~0 5)} ~cond := #in~cond; {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,183 INFO L290 TraceCheckUtils]: 53: Hoare triple {122177#(<= ~counter~0 5)} assume !(0 == ~cond); {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {122177#(<= ~counter~0 5)} assume true; {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,184 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {122177#(<= ~counter~0 5)} {122177#(<= ~counter~0 5)} #94#return; {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {122177#(<= ~counter~0 5)} assume !!(0 != ~r~0); {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,185 INFO L290 TraceCheckUtils]: 57: Hoare triple {122177#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122202#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:26,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {122202#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {122202#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:26,186 INFO L272 TraceCheckUtils]: 59: Hoare triple {122202#(<= ~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)); {122202#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:26,187 INFO L290 TraceCheckUtils]: 60: Hoare triple {122202#(<= ~counter~0 6)} ~cond := #in~cond; {122202#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:26,187 INFO L290 TraceCheckUtils]: 61: Hoare triple {122202#(<= ~counter~0 6)} assume !(0 == ~cond); {122202#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:26,187 INFO L290 TraceCheckUtils]: 62: Hoare triple {122202#(<= ~counter~0 6)} assume true; {122202#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:26,188 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {122202#(<= ~counter~0 6)} {122202#(<= ~counter~0 6)} #96#return; {122202#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:26,188 INFO L290 TraceCheckUtils]: 64: Hoare triple {122202#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122202#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:26,189 INFO L290 TraceCheckUtils]: 65: Hoare triple {122202#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122227#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:26,189 INFO L290 TraceCheckUtils]: 66: Hoare triple {122227#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {122227#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:26,190 INFO L272 TraceCheckUtils]: 67: Hoare triple {122227#(<= ~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)); {122227#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:26,190 INFO L290 TraceCheckUtils]: 68: Hoare triple {122227#(<= ~counter~0 7)} ~cond := #in~cond; {122227#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:26,190 INFO L290 TraceCheckUtils]: 69: Hoare triple {122227#(<= ~counter~0 7)} assume !(0 == ~cond); {122227#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:26,190 INFO L290 TraceCheckUtils]: 70: Hoare triple {122227#(<= ~counter~0 7)} assume true; {122227#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:26,191 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {122227#(<= ~counter~0 7)} {122227#(<= ~counter~0 7)} #96#return; {122227#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:26,191 INFO L290 TraceCheckUtils]: 72: Hoare triple {122227#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122227#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:26,192 INFO L290 TraceCheckUtils]: 73: Hoare triple {122227#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122252#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:26,193 INFO L290 TraceCheckUtils]: 74: Hoare triple {122252#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {122252#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:26,193 INFO L272 TraceCheckUtils]: 75: Hoare triple {122252#(<= ~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)); {122252#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:26,193 INFO L290 TraceCheckUtils]: 76: Hoare triple {122252#(<= ~counter~0 8)} ~cond := #in~cond; {122252#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:26,194 INFO L290 TraceCheckUtils]: 77: Hoare triple {122252#(<= ~counter~0 8)} assume !(0 == ~cond); {122252#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:26,194 INFO L290 TraceCheckUtils]: 78: Hoare triple {122252#(<= ~counter~0 8)} assume true; {122252#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:26,194 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {122252#(<= ~counter~0 8)} {122252#(<= ~counter~0 8)} #96#return; {122252#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:26,195 INFO L290 TraceCheckUtils]: 80: Hoare triple {122252#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122252#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:26,196 INFO L290 TraceCheckUtils]: 81: Hoare triple {122252#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122277#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:26,196 INFO L290 TraceCheckUtils]: 82: Hoare triple {122277#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {122277#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:26,196 INFO L272 TraceCheckUtils]: 83: Hoare triple {122277#(<= ~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)); {122277#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:26,197 INFO L290 TraceCheckUtils]: 84: Hoare triple {122277#(<= ~counter~0 9)} ~cond := #in~cond; {122277#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:26,197 INFO L290 TraceCheckUtils]: 85: Hoare triple {122277#(<= ~counter~0 9)} assume !(0 == ~cond); {122277#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:26,197 INFO L290 TraceCheckUtils]: 86: Hoare triple {122277#(<= ~counter~0 9)} assume true; {122277#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:26,198 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {122277#(<= ~counter~0 9)} {122277#(<= ~counter~0 9)} #96#return; {122277#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:26,198 INFO L290 TraceCheckUtils]: 88: Hoare triple {122277#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122277#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:26,199 INFO L290 TraceCheckUtils]: 89: Hoare triple {122277#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122302#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:26,199 INFO L290 TraceCheckUtils]: 90: Hoare triple {122302#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {122302#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:26,200 INFO L272 TraceCheckUtils]: 91: Hoare triple {122302#(<= ~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)); {122302#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:26,200 INFO L290 TraceCheckUtils]: 92: Hoare triple {122302#(<= ~counter~0 10)} ~cond := #in~cond; {122302#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:26,200 INFO L290 TraceCheckUtils]: 93: Hoare triple {122302#(<= ~counter~0 10)} assume !(0 == ~cond); {122302#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:26,201 INFO L290 TraceCheckUtils]: 94: Hoare triple {122302#(<= ~counter~0 10)} assume true; {122302#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:26,201 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {122302#(<= ~counter~0 10)} {122302#(<= ~counter~0 10)} #96#return; {122302#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:26,201 INFO L290 TraceCheckUtils]: 96: Hoare triple {122302#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122302#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:26,203 INFO L290 TraceCheckUtils]: 97: Hoare triple {122302#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122327#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:26,203 INFO L290 TraceCheckUtils]: 98: Hoare triple {122327#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {122327#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:26,203 INFO L272 TraceCheckUtils]: 99: Hoare triple {122327#(<= ~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)); {122327#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:26,204 INFO L290 TraceCheckUtils]: 100: Hoare triple {122327#(<= ~counter~0 11)} ~cond := #in~cond; {122327#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:26,204 INFO L290 TraceCheckUtils]: 101: Hoare triple {122327#(<= ~counter~0 11)} assume !(0 == ~cond); {122327#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:26,204 INFO L290 TraceCheckUtils]: 102: Hoare triple {122327#(<= ~counter~0 11)} assume true; {122327#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:26,205 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {122327#(<= ~counter~0 11)} {122327#(<= ~counter~0 11)} #96#return; {122327#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:26,205 INFO L290 TraceCheckUtils]: 104: Hoare triple {122327#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122327#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:26,206 INFO L290 TraceCheckUtils]: 105: Hoare triple {122327#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122352#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:26,206 INFO L290 TraceCheckUtils]: 106: Hoare triple {122352#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {122352#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:26,207 INFO L272 TraceCheckUtils]: 107: Hoare triple {122352#(<= ~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)); {122352#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:26,207 INFO L290 TraceCheckUtils]: 108: Hoare triple {122352#(<= ~counter~0 12)} ~cond := #in~cond; {122352#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:26,207 INFO L290 TraceCheckUtils]: 109: Hoare triple {122352#(<= ~counter~0 12)} assume !(0 == ~cond); {122352#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:26,207 INFO L290 TraceCheckUtils]: 110: Hoare triple {122352#(<= ~counter~0 12)} assume true; {122352#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:26,208 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {122352#(<= ~counter~0 12)} {122352#(<= ~counter~0 12)} #96#return; {122352#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:26,208 INFO L290 TraceCheckUtils]: 112: Hoare triple {122352#(<= ~counter~0 12)} assume !(~r~0 > 0); {122352#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:26,209 INFO L290 TraceCheckUtils]: 113: Hoare triple {122352#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122377#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:26,210 INFO L290 TraceCheckUtils]: 114: Hoare triple {122377#(<= ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {122377#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:26,210 INFO L272 TraceCheckUtils]: 115: Hoare triple {122377#(<= ~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)); {122377#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:26,210 INFO L290 TraceCheckUtils]: 116: Hoare triple {122377#(<= ~counter~0 13)} ~cond := #in~cond; {122377#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:26,211 INFO L290 TraceCheckUtils]: 117: Hoare triple {122377#(<= ~counter~0 13)} assume !(0 == ~cond); {122377#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:26,211 INFO L290 TraceCheckUtils]: 118: Hoare triple {122377#(<= ~counter~0 13)} assume true; {122377#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:26,211 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {122377#(<= ~counter~0 13)} {122377#(<= ~counter~0 13)} #98#return; {122377#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:26,212 INFO L290 TraceCheckUtils]: 120: Hoare triple {122377#(<= ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {122377#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:26,213 INFO L290 TraceCheckUtils]: 121: Hoare triple {122377#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122402#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:26,213 INFO L290 TraceCheckUtils]: 122: Hoare triple {122402#(<= ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {122402#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:26,213 INFO L272 TraceCheckUtils]: 123: Hoare triple {122402#(<= ~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)); {122402#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:26,214 INFO L290 TraceCheckUtils]: 124: Hoare triple {122402#(<= ~counter~0 14)} ~cond := #in~cond; {122402#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:26,214 INFO L290 TraceCheckUtils]: 125: Hoare triple {122402#(<= ~counter~0 14)} assume !(0 == ~cond); {122402#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:26,214 INFO L290 TraceCheckUtils]: 126: Hoare triple {122402#(<= ~counter~0 14)} assume true; {122402#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:26,215 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {122402#(<= ~counter~0 14)} {122402#(<= ~counter~0 14)} #98#return; {122402#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:26,215 INFO L290 TraceCheckUtils]: 128: Hoare triple {122402#(<= ~counter~0 14)} assume !(~r~0 < 0); {122402#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:26,215 INFO L290 TraceCheckUtils]: 129: Hoare triple {122402#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122427#(<= |main_#t~post6| 14)} is VALID [2022-04-15 15:22:26,216 INFO L290 TraceCheckUtils]: 130: Hoare triple {122427#(<= |main_#t~post6| 14)} assume !(#t~post6 < 20);havoc #t~post6; {122021#false} is VALID [2022-04-15 15:22:26,216 INFO L272 TraceCheckUtils]: 131: Hoare triple {122021#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122021#false} is VALID [2022-04-15 15:22:26,216 INFO L290 TraceCheckUtils]: 132: Hoare triple {122021#false} ~cond := #in~cond; {122021#false} is VALID [2022-04-15 15:22:26,216 INFO L290 TraceCheckUtils]: 133: Hoare triple {122021#false} assume 0 == ~cond; {122021#false} is VALID [2022-04-15 15:22:26,216 INFO L290 TraceCheckUtils]: 134: Hoare triple {122021#false} assume !false; {122021#false} is VALID [2022-04-15 15:22:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 508 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:22:26,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:22:26,888 INFO L290 TraceCheckUtils]: 134: Hoare triple {122021#false} assume !false; {122021#false} is VALID [2022-04-15 15:22:26,888 INFO L290 TraceCheckUtils]: 133: Hoare triple {122021#false} assume 0 == ~cond; {122021#false} is VALID [2022-04-15 15:22:26,888 INFO L290 TraceCheckUtils]: 132: Hoare triple {122021#false} ~cond := #in~cond; {122021#false} is VALID [2022-04-15 15:22:26,888 INFO L272 TraceCheckUtils]: 131: Hoare triple {122021#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122021#false} is VALID [2022-04-15 15:22:26,889 INFO L290 TraceCheckUtils]: 130: Hoare triple {122455#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {122021#false} is VALID [2022-04-15 15:22:26,889 INFO L290 TraceCheckUtils]: 129: Hoare triple {122459#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122455#(< |main_#t~post6| 20)} is VALID [2022-04-15 15:22:26,889 INFO L290 TraceCheckUtils]: 128: Hoare triple {122459#(< ~counter~0 20)} assume !(~r~0 < 0); {122459#(< ~counter~0 20)} is VALID [2022-04-15 15:22:26,890 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {122020#true} {122459#(< ~counter~0 20)} #98#return; {122459#(< ~counter~0 20)} is VALID [2022-04-15 15:22:26,890 INFO L290 TraceCheckUtils]: 126: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,890 INFO L290 TraceCheckUtils]: 125: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,890 INFO L290 TraceCheckUtils]: 124: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,890 INFO L272 TraceCheckUtils]: 123: Hoare triple {122459#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122020#true} is VALID [2022-04-15 15:22:26,890 INFO L290 TraceCheckUtils]: 122: Hoare triple {122459#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {122459#(< ~counter~0 20)} is VALID [2022-04-15 15:22:26,893 INFO L290 TraceCheckUtils]: 121: Hoare triple {122484#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122459#(< ~counter~0 20)} is VALID [2022-04-15 15:22:26,893 INFO L290 TraceCheckUtils]: 120: Hoare triple {122484#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {122484#(< ~counter~0 19)} is VALID [2022-04-15 15:22:26,893 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {122020#true} {122484#(< ~counter~0 19)} #98#return; {122484#(< ~counter~0 19)} is VALID [2022-04-15 15:22:26,894 INFO L290 TraceCheckUtils]: 118: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,894 INFO L290 TraceCheckUtils]: 117: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,894 INFO L290 TraceCheckUtils]: 116: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,894 INFO L272 TraceCheckUtils]: 115: Hoare triple {122484#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122020#true} is VALID [2022-04-15 15:22:26,894 INFO L290 TraceCheckUtils]: 114: Hoare triple {122484#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {122484#(< ~counter~0 19)} is VALID [2022-04-15 15:22:26,895 INFO L290 TraceCheckUtils]: 113: Hoare triple {122509#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122484#(< ~counter~0 19)} is VALID [2022-04-15 15:22:26,895 INFO L290 TraceCheckUtils]: 112: Hoare triple {122509#(< ~counter~0 18)} assume !(~r~0 > 0); {122509#(< ~counter~0 18)} is VALID [2022-04-15 15:22:26,896 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {122020#true} {122509#(< ~counter~0 18)} #96#return; {122509#(< ~counter~0 18)} is VALID [2022-04-15 15:22:26,896 INFO L290 TraceCheckUtils]: 110: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,896 INFO L290 TraceCheckUtils]: 109: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,896 INFO L290 TraceCheckUtils]: 108: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,896 INFO L272 TraceCheckUtils]: 107: Hoare triple {122509#(< ~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)); {122020#true} is VALID [2022-04-15 15:22:26,896 INFO L290 TraceCheckUtils]: 106: Hoare triple {122509#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {122509#(< ~counter~0 18)} is VALID [2022-04-15 15:22:26,897 INFO L290 TraceCheckUtils]: 105: Hoare triple {122534#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122509#(< ~counter~0 18)} is VALID [2022-04-15 15:22:26,898 INFO L290 TraceCheckUtils]: 104: Hoare triple {122534#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122534#(< ~counter~0 17)} is VALID [2022-04-15 15:22:26,898 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {122020#true} {122534#(< ~counter~0 17)} #96#return; {122534#(< ~counter~0 17)} is VALID [2022-04-15 15:22:26,898 INFO L290 TraceCheckUtils]: 102: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,898 INFO L290 TraceCheckUtils]: 101: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,898 INFO L290 TraceCheckUtils]: 100: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,899 INFO L272 TraceCheckUtils]: 99: Hoare triple {122534#(< ~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)); {122020#true} is VALID [2022-04-15 15:22:26,899 INFO L290 TraceCheckUtils]: 98: Hoare triple {122534#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {122534#(< ~counter~0 17)} is VALID [2022-04-15 15:22:26,900 INFO L290 TraceCheckUtils]: 97: Hoare triple {122559#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122534#(< ~counter~0 17)} is VALID [2022-04-15 15:22:26,900 INFO L290 TraceCheckUtils]: 96: Hoare triple {122559#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122559#(< ~counter~0 16)} is VALID [2022-04-15 15:22:26,901 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {122020#true} {122559#(< ~counter~0 16)} #96#return; {122559#(< ~counter~0 16)} is VALID [2022-04-15 15:22:26,901 INFO L290 TraceCheckUtils]: 94: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,901 INFO L290 TraceCheckUtils]: 93: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,901 INFO L290 TraceCheckUtils]: 92: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,901 INFO L272 TraceCheckUtils]: 91: Hoare triple {122559#(< ~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)); {122020#true} is VALID [2022-04-15 15:22:26,901 INFO L290 TraceCheckUtils]: 90: Hoare triple {122559#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {122559#(< ~counter~0 16)} is VALID [2022-04-15 15:22:26,902 INFO L290 TraceCheckUtils]: 89: Hoare triple {122402#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122559#(< ~counter~0 16)} is VALID [2022-04-15 15:22:26,902 INFO L290 TraceCheckUtils]: 88: Hoare triple {122402#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122402#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:26,903 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {122020#true} {122402#(<= ~counter~0 14)} #96#return; {122402#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:26,903 INFO L290 TraceCheckUtils]: 86: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,903 INFO L290 TraceCheckUtils]: 85: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,903 INFO L290 TraceCheckUtils]: 84: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,903 INFO L272 TraceCheckUtils]: 83: Hoare triple {122402#(<= ~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)); {122020#true} is VALID [2022-04-15 15:22:26,904 INFO L290 TraceCheckUtils]: 82: Hoare triple {122402#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {122402#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:26,904 INFO L290 TraceCheckUtils]: 81: Hoare triple {122377#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122402#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:26,905 INFO L290 TraceCheckUtils]: 80: Hoare triple {122377#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122377#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:26,905 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {122020#true} {122377#(<= ~counter~0 13)} #96#return; {122377#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:26,905 INFO L290 TraceCheckUtils]: 78: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,905 INFO L290 TraceCheckUtils]: 77: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,906 INFO L290 TraceCheckUtils]: 76: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,906 INFO L272 TraceCheckUtils]: 75: Hoare triple {122377#(<= ~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)); {122020#true} is VALID [2022-04-15 15:22:26,906 INFO L290 TraceCheckUtils]: 74: Hoare triple {122377#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {122377#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:26,907 INFO L290 TraceCheckUtils]: 73: Hoare triple {122352#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122377#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:26,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {122352#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122352#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:26,908 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {122020#true} {122352#(<= ~counter~0 12)} #96#return; {122352#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:26,908 INFO L290 TraceCheckUtils]: 70: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,908 INFO L290 TraceCheckUtils]: 69: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,908 INFO L290 TraceCheckUtils]: 68: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,914 INFO L272 TraceCheckUtils]: 67: Hoare triple {122352#(<= ~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)); {122020#true} is VALID [2022-04-15 15:22:26,915 INFO L290 TraceCheckUtils]: 66: Hoare triple {122352#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {122352#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:26,917 INFO L290 TraceCheckUtils]: 65: Hoare triple {122327#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122352#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:26,917 INFO L290 TraceCheckUtils]: 64: Hoare triple {122327#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122327#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:26,918 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {122020#true} {122327#(<= ~counter~0 11)} #96#return; {122327#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:26,918 INFO L290 TraceCheckUtils]: 62: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,918 INFO L290 TraceCheckUtils]: 61: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,918 INFO L290 TraceCheckUtils]: 60: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,918 INFO L272 TraceCheckUtils]: 59: Hoare triple {122327#(<= ~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)); {122020#true} is VALID [2022-04-15 15:22:26,919 INFO L290 TraceCheckUtils]: 58: Hoare triple {122327#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {122327#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:26,920 INFO L290 TraceCheckUtils]: 57: Hoare triple {122302#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122327#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:26,920 INFO L290 TraceCheckUtils]: 56: Hoare triple {122302#(<= ~counter~0 10)} assume !!(0 != ~r~0); {122302#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:26,921 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {122020#true} {122302#(<= ~counter~0 10)} #94#return; {122302#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:26,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,921 INFO L272 TraceCheckUtils]: 51: Hoare triple {122302#(<= ~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)); {122020#true} is VALID [2022-04-15 15:22:26,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {122302#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {122302#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:26,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {122277#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122302#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:26,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {122277#(<= ~counter~0 9)} assume !(~r~0 < 0); {122277#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:26,923 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {122020#true} {122277#(<= ~counter~0 9)} #98#return; {122277#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:26,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,924 INFO L272 TraceCheckUtils]: 43: Hoare triple {122277#(<= ~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)); {122020#true} is VALID [2022-04-15 15:22:26,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {122277#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {122277#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:26,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {122252#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122277#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:26,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {122252#(<= ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {122252#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:26,926 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {122020#true} {122252#(<= ~counter~0 8)} #98#return; {122252#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:26,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,926 INFO L272 TraceCheckUtils]: 35: Hoare triple {122252#(<= ~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)); {122020#true} is VALID [2022-04-15 15:22:26,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {122252#(<= ~counter~0 8)} assume !!(#t~post8 < 20);havoc #t~post8; {122252#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:26,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {122227#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122252#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:26,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {122227#(<= ~counter~0 7)} assume !(~r~0 > 0); {122227#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:26,929 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {122020#true} {122227#(<= ~counter~0 7)} #96#return; {122227#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:26,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,929 INFO L272 TraceCheckUtils]: 27: Hoare triple {122227#(<= ~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)); {122020#true} is VALID [2022-04-15 15:22:26,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {122227#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {122227#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:26,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {122202#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122227#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:26,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {122202#(<= ~counter~0 6)} assume !!(0 != ~r~0); {122202#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:26,932 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {122020#true} {122202#(<= ~counter~0 6)} #94#return; {122202#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:26,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,932 INFO L272 TraceCheckUtils]: 19: Hoare triple {122202#(<= ~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)); {122020#true} is VALID [2022-04-15 15:22:26,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {122202#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {122202#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:26,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {122177#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122202#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:26,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {122177#(<= ~counter~0 5)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,934 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {122020#true} {122177#(<= ~counter~0 5)} #92#return; {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,935 INFO L272 TraceCheckUtils]: 11: Hoare triple {122177#(<= ~counter~0 5)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {122020#true} is VALID [2022-04-15 15:22:26,935 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {122020#true} {122177#(<= ~counter~0 5)} #90#return; {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {122020#true} assume true; {122020#true} is VALID [2022-04-15 15:22:26,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {122020#true} assume !(0 == ~cond); {122020#true} is VALID [2022-04-15 15:22:26,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {122020#true} ~cond := #in~cond; {122020#true} is VALID [2022-04-15 15:22:26,935 INFO L272 TraceCheckUtils]: 6: Hoare triple {122177#(<= ~counter~0 5)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {122020#true} is VALID [2022-04-15 15:22:26,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {122177#(<= ~counter~0 5)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {122177#(<= ~counter~0 5)} call #t~ret9 := main(); {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122177#(<= ~counter~0 5)} {122020#true} #102#return; {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {122177#(<= ~counter~0 5)} assume true; {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {122020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {122177#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:26,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {122020#true} call ULTIMATE.init(); {122020#true} is VALID [2022-04-15 15:22:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 144 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-15 15:22:26,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:22:26,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044302322] [2022-04-15 15:22:26,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:22:26,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531528223] [2022-04-15 15:22:26,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531528223] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:22:26,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:22:26,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-15 15:22:26,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:22:26,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2074519645] [2022-04-15 15:22:26,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2074519645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:22:26,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:22:26,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 15:22:26,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582155205] [2022-04-15 15:22:26,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:22:26,939 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 135 [2022-04-15 15:22:26,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:22:26,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-15 15:22:27,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:22:27,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 15:22:27,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:22:27,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 15:22:27,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:22:27,082 INFO L87 Difference]: Start difference. First operand 735 states and 951 transitions. Second operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-15 15:22:31,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:31,180 INFO L93 Difference]: Finished difference Result 790 states and 1024 transitions. [2022-04-15 15:22:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 15:22:31,180 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 135 [2022-04-15 15:22:31,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:22:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-15 15:22:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-15 15:22:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-15 15:22:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-15 15:22:31,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 294 transitions. [2022-04-15 15:22:31,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:22:31,558 INFO L225 Difference]: With dead ends: 790 [2022-04-15 15:22:31,558 INFO L226 Difference]: Without dead ends: 785 [2022-04-15 15:22:31,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 15:22:31,559 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 176 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 15:22:31,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 370 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 15:22:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-04-15 15:22:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 763. [2022-04-15 15:22:33,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:22:33,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 785 states. Second operand has 763 states, 567 states have (on average 1.1781305114638447) internal successors, (668), 584 states have internal predecessors, (668), 163 states have call successors, (163), 34 states have call predecessors, (163), 32 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 15:22:33,865 INFO L74 IsIncluded]: Start isIncluded. First operand 785 states. Second operand has 763 states, 567 states have (on average 1.1781305114638447) internal successors, (668), 584 states have internal predecessors, (668), 163 states have call successors, (163), 34 states have call predecessors, (163), 32 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 15:22:33,866 INFO L87 Difference]: Start difference. First operand 785 states. Second operand has 763 states, 567 states have (on average 1.1781305114638447) internal successors, (668), 584 states have internal predecessors, (668), 163 states have call successors, (163), 34 states have call predecessors, (163), 32 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 15:22:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:33,885 INFO L93 Difference]: Finished difference Result 785 states and 1018 transitions. [2022-04-15 15:22:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1018 transitions. [2022-04-15 15:22:33,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:33,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:33,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 763 states, 567 states have (on average 1.1781305114638447) internal successors, (668), 584 states have internal predecessors, (668), 163 states have call successors, (163), 34 states have call predecessors, (163), 32 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 785 states. [2022-04-15 15:22:33,887 INFO L87 Difference]: Start difference. First operand has 763 states, 567 states have (on average 1.1781305114638447) internal successors, (668), 584 states have internal predecessors, (668), 163 states have call successors, (163), 34 states have call predecessors, (163), 32 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 785 states. [2022-04-15 15:22:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:33,907 INFO L93 Difference]: Finished difference Result 785 states and 1018 transitions. [2022-04-15 15:22:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1018 transitions. [2022-04-15 15:22:33,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:33,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:33,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:22:33,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:22:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 567 states have (on average 1.1781305114638447) internal successors, (668), 584 states have internal predecessors, (668), 163 states have call successors, (163), 34 states have call predecessors, (163), 32 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 15:22:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 992 transitions. [2022-04-15 15:22:33,942 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 992 transitions. Word has length 135 [2022-04-15 15:22:33,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:22:33,942 INFO L478 AbstractCegarLoop]: Abstraction has 763 states and 992 transitions. [2022-04-15 15:22:33,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-15 15:22:33,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 763 states and 992 transitions. [2022-04-15 15:22:56,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 992 edges. 986 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-15 15:22:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 992 transitions. [2022-04-15 15:22:56,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 15:22:56,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:22:56,409 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:22:56,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-15 15:22:56,610 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:22:56,610 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:22:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:22:56,610 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 21 times [2022-04-15 15:22:56,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:22:56,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1642926354] [2022-04-15 15:22:56,611 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:22:56,611 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 22 times [2022-04-15 15:22:56,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:22:56,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249674277] [2022-04-15 15:22:56,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:22:56,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:22:56,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:22:56,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340621067] [2022-04-15 15:22:56,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:22:56,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:22:56,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:22:56,628 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:22:56,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-15 15:22:56,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:22:56,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:22:56,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 15:22:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:22:56,720 INFO L286 TraceCheckSpWp]: Computing forward predicates...