/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:16:43,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:16:43,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:16:43,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:16:43,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:16:43,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:16:43,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:16:43,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:16:43,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:16:43,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:16:43,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:16:43,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:16:43,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:16:43,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:16:43,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:16:43,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:16:43,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:16:43,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:16:43,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:16:43,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:16:43,617 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:16:43,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:16:43,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:16:43,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:16:43,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:16:43,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:16:43,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:16:43,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:16:43,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:16:43,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:16:43,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:16:43,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:16:43,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:16:43,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:16:43,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:16:43,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:16:43,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:16:43,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:16:43,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:16:43,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:16:43,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:16:43,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:16:43,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:16:43,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:16:43,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:16:43,661 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:16:43,662 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:16:43,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:16:43,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:16:43,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:16:43,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:16:43,663 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:16:43,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:16:43,664 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:16:43,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:16:43,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:16:43,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:16:43,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:16:43,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:16:43,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:16:43,665 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:16:43,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:16:43,665 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:16:43,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:16:43,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:16:43,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:16:43,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:16:43,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:16:43,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:16:43,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:16:43,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:16:43,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:16:43,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:16:43,666 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:16:43,666 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:16:43,666 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:16:43,667 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 13:16:43,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:16:43,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:16:43,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:16:43,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:16:43,874 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:16:43,875 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2022-04-27 13:16:43,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb4bc488/d736c160547544a8be4767242998f8b1/FLAGf5de1810f [2022-04-27 13:16:44,247 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:16:44,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2022-04-27 13:16:44,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb4bc488/d736c160547544a8be4767242998f8b1/FLAGf5de1810f [2022-04-27 13:16:44,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb4bc488/d736c160547544a8be4767242998f8b1 [2022-04-27 13:16:44,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:16:44,675 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:16:44,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:16:44,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:16:44,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:16:44,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:16:44" (1/1) ... [2022-04-27 13:16:44,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49fb3ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:44, skipping insertion in model container [2022-04-27 13:16:44,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:16:44" (1/1) ... [2022-04-27 13:16:44,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:16:44,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:16:44,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c[535,548] [2022-04-27 13:16:44,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:16:44,819 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:16:44,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c[535,548] [2022-04-27 13:16:44,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:16:44,845 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:16:44,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:44 WrapperNode [2022-04-27 13:16:44,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:16:44,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:16:44,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:16:44,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:16:44,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:44" (1/1) ... [2022-04-27 13:16:44,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:44" (1/1) ... [2022-04-27 13:16:44,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:44" (1/1) ... [2022-04-27 13:16:44,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:44" (1/1) ... [2022-04-27 13:16:44,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:44" (1/1) ... [2022-04-27 13:16:44,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:44" (1/1) ... [2022-04-27 13:16:44,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:44" (1/1) ... [2022-04-27 13:16:44,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:16:44,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:16:44,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:16:44,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:16:44,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:44" (1/1) ... [2022-04-27 13:16:44,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:16:44,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:44,917 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-27 13:16:44,922 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-27 13:16:44,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:16:44,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:16:44,954 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:16:44,954 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:16:44,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:16:44,954 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:16:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:16:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:16:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:16:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:16:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:16:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:16:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:16:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:16:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:16:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:16:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:16:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:16:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:16:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:16:44,993 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:16:44,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:16:45,170 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:16:45,174 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:16:45,174 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:16:45,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:16:45 BoogieIcfgContainer [2022-04-27 13:16:45,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:16:45,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:16:45,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:16:45,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:16:45,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:16:44" (1/3) ... [2022-04-27 13:16:45,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cc7c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:16:45, skipping insertion in model container [2022-04-27 13:16:45,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:44" (2/3) ... [2022-04-27 13:16:45,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cc7c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:16:45, skipping insertion in model container [2022-04-27 13:16:45,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:16:45" (3/3) ... [2022-04-27 13:16:45,181 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound50.c [2022-04-27 13:16:45,189 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:16:45,189 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:16:45,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:16:45,225 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f7d4ab7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6b443f2d [2022-04-27 13:16:45,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:16:45,231 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-27 13:16:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:16:45,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:45,237 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:16:45,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-27 13:16:45,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:45,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934643208] [2022-04-27 13:16:45,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:45,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:45,359 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:45,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [831223451] [2022-04-27 13:16:45,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:45,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:45,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:45,363 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-27 13:16:45,364 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-27 13:16:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:45,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 13:16:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:45,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:45,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-27 13:16:45,525 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-27 13:16:45,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:16:45,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-27 13:16:45,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-27 13:16:45,526 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-27 13:16:45,527 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-27 13:16:45,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:16:45,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:45,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:45,536 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-27 13:16:45,537 INFO L272 TraceCheckUtils]: 11: Hoare triple {41#false} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {41#false} is VALID [2022-04-27 13:16:45,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:16:45,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:45,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:45,537 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-27 13:16:45,537 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-27 13:16:45,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:16:45,538 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-27 13:16:45,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:16:45,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:16:45,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:16:45,539 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-27 13:16:45,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:45,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:45,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934643208] [2022-04-27 13:16:45,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:45,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831223451] [2022-04-27 13:16:45,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831223451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:45,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:45,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 13:16:45,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971609842] [2022-04-27 13:16:45,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:45,545 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), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:16:45,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:45,551 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), 2 states have call successors, (3) [2022-04-27 13:16:45,581 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-27 13:16:45,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 13:16:45,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:45,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 13:16:45,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:16:45,617 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), 2 states have call successors, (3) [2022-04-27 13:16:45,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:45,686 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-27 13:16:45,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 13:16:45,687 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), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:16:45,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:45,688 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), 2 states have call successors, (3) [2022-04-27 13:16:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-27 13:16:45,701 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), 2 states have call successors, (3) [2022-04-27 13:16:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-27 13:16:45,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-27 13:16:45,796 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-27 13:16:45,805 INFO L225 Difference]: With dead ends: 67 [2022-04-27 13:16:45,805 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:16:45,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:16:45,811 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:45,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:16:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:16:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:16:45,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:45,833 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-27 13:16:45,833 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-27 13:16:45,834 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-27 13:16:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:45,836 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:16:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:16:45,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:45,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:45,837 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-27 13:16:45,838 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-27 13:16:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:45,840 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:16:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:16:45,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:45,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:45,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:45,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:45,851 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-27 13:16:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 13:16:45,857 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-27 13:16:45,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:45,857 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 13:16:45,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:16:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:16:45,858 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:45,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:16:45,874 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-27 13:16:46,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 13:16:46,059 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:46,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:46,060 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-27 13:16:46,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:46,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150641068] [2022-04-27 13:16:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:46,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:46,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919059450] [2022-04-27 13:16:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:46,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:46,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:46,076 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-27 13:16:46,079 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-27 13:16:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:46,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:16:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:46,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:46,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-27 13:16:46,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#(<= ~counter~0 0)} {307#true} #102#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#(<= ~counter~0 0)} call #t~ret9 := main(); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#(<= ~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; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,284 INFO L272 TraceCheckUtils]: 6: Hoare triple {315#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #90#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,286 INFO L272 TraceCheckUtils]: 11: Hoare triple {315#(<= ~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)); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,288 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #92#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:46,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {364#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:16:46,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {308#false} is VALID [2022-04-27 13:16:46,289 INFO L272 TraceCheckUtils]: 19: Hoare triple {308#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {308#false} is VALID [2022-04-27 13:16:46,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-27 13:16:46,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-27 13:16:46,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-27 13:16:46,290 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-27 13:16:46,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:46,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:46,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150641068] [2022-04-27 13:16:46,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:46,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919059450] [2022-04-27 13:16:46,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919059450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:46,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:46,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:16:46,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604497135] [2022-04-27 13:16:46,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:46,295 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-27 13:16:46,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:46,295 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-27 13:16:46,309 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-27 13:16:46,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:16:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:46,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:16:46,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:16:46,310 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-27 13:16:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:46,391 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 13:16:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:16:46,391 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-27 13:16:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:46,391 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-27 13:16:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 13:16:46,393 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-27 13:16:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 13:16:46,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-27 13:16:46,426 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-27 13:16:46,427 INFO L225 Difference]: With dead ends: 41 [2022-04-27 13:16:46,427 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 13:16:46,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:16:46,428 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:46,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:16:46,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 13:16:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 13:16:46,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:46,437 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-27 13:16:46,437 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-27 13:16:46,438 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-27 13:16:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:46,440 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 13:16:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:16:46,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:46,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:46,440 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-27 13:16:46,441 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-27 13:16:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:46,442 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 13:16:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:16:46,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:46,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:46,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:46,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:46,443 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-27 13:16:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-27 13:16:46,445 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-27 13:16:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:46,445 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-27 13:16:46,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:16:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:16:46,446 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:46,446 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:16:46,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:46,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-27 13:16:46,661 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:46,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:46,662 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-27 13:16:46,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:46,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279766916] [2022-04-27 13:16:46,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:46,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:46,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:46,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1693960776] [2022-04-27 13:16:46,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:46,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:46,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:46,674 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-27 13:16:46,675 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-27 13:16:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:46,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:16:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:46,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:47,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-27 13:16:47,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#true} is VALID [2022-04-27 13:16:47,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:47,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #102#return; {554#true} is VALID [2022-04-27 13:16:47,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret9 := main(); {554#true} is VALID [2022-04-27 13:16:47,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#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; {554#true} is VALID [2022-04-27 13:16:47,108 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {554#true} is VALID [2022-04-27 13:16:47,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-27 13:16:47,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-27 13:16:47,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:47,108 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #90#return; {554#true} is VALID [2022-04-27 13:16:47,108 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#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)); {554#true} is VALID [2022-04-27 13:16:47,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-27 13:16:47,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-27 13:16:47,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:47,109 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #92#return; {554#true} is VALID [2022-04-27 13:16:47,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {554#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {607#(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-27 13:16:47,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {607#(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; {607#(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-27 13:16:47,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {607#(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-27 13:16:49,762 WARN L272 TraceCheckUtils]: 19: Hoare triple {607#(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)); {617#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-27 13:16:49,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:16:49,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-27 13:16:49,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-27 13:16:49,764 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-27 13:16:49,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:49,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:49,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279766916] [2022-04-27 13:16:49,765 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:49,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693960776] [2022-04-27 13:16:49,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693960776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:49,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:49,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:16:49,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161847723] [2022-04-27 13:16:49,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:49,766 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-27 13:16:49,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:49,766 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-27 13:16:53,133 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-27 13:16:53,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:16:53,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:53,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:16:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:16:53,134 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-27 13:17:02,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:17:05,262 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-27 13:17:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:05,309 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 13:17:05,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:17:05,309 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-27 13:17:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:05,309 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-27 13:17:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 13:17:05,311 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-27 13:17:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 13:17:05,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-27 13:17:11,154 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-27 13:17:11,155 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:17:11,156 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 13:17:11,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:17:11,157 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:11,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2022-04-27 13:17:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 13:17:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 13:17:11,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:11,189 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-27 13:17:11,189 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-27 13:17:11,189 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-27 13:17:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:11,191 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 13:17:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 13:17:11,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:11,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:11,194 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-27 13:17:11,194 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-27 13:17:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:11,196 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 13:17:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 13:17:11,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:11,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:11,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:11,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:11,197 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-27 13:17:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-27 13:17:11,199 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-27 13:17:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:11,199 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-27 13:17:11,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:17:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-27 13:17:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:17:11,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:11,200 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:11,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:11,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:11,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-27 13:17:11,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:11,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538515152] [2022-04-27 13:17:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:11,427 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:11,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058311656] [2022-04-27 13:17:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:11,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:11,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:11,433 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-27 13:17:11,434 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-27 13:17:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:11,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:17:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:11,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:11,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-27 13:17:11,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {877#true} is VALID [2022-04-27 13:17:11,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:11,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-27 13:17:11,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-27 13:17:11,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#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; {877#true} is VALID [2022-04-27 13:17:11,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {877#true} is VALID [2022-04-27 13:17:11,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:17:11,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:17:11,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:11,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-27 13:17:11,626 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:17:11,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:17:11,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:17:11,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:11,626 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-27 13:17:11,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {877#true} is VALID [2022-04-27 13:17:11,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-27 13:17:11,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 50);havoc #t~post6; {877#true} is VALID [2022-04-27 13:17:11,628 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:17:11,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:11,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:11,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:11,630 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} #94#return; {953#(= (+ (* 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-27 13:17:11,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {953#(= (+ (* 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); {957#(= (+ (* 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-27 13:17:11,631 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* 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)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:11,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:11,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-27 13:17:11,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 13:17:11,632 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-27 13:17:11,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:12,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 13:17:12,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-27 13:17:12,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:12,015 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* 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)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:12,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {984#(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); {957#(= (+ (* 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-27 13:17:12,016 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} #94#return; {984#(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-27 13:17:12,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:12,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:12,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:17:12,017 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:17:12,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 50);havoc #t~post6; {877#true} is VALID [2022-04-27 13:17:12,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-27 13:17:12,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {877#true} is VALID [2022-04-27 13:17:12,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-27 13:17:12,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:12,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:17:12,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:17:12,018 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:17:12,018 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-27 13:17:12,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:12,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:17:12,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:17:12,019 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {877#true} is VALID [2022-04-27 13:17:12,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#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; {877#true} is VALID [2022-04-27 13:17:12,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-27 13:17:12,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-27 13:17:12,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:12,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {877#true} is VALID [2022-04-27 13:17:12,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-27 13:17:12,051 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-27 13:17:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:12,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538515152] [2022-04-27 13:17:12,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:12,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058311656] [2022-04-27 13:17:12,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058311656] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:12,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:12,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:17:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945785055] [2022-04-27 13:17:12,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:12,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:17:12,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:12,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:12,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:12,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:17:12,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:12,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:17:12,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:17:12,076 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:12,518 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-27 13:17:12,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:17:12,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:17:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 13:17:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 13:17:12,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-27 13:17:12,559 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-27 13:17:12,560 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:17:12,561 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 13:17:12,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:17:12,561 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:12,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 171 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:17:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 13:17:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-27 13:17:12,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:12,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:12,571 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:12,571 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:12,573 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:17:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:17:12,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:12,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:12,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-27 13:17:12,574 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-27 13:17:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:12,575 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:17:12,575 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:17:12,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:12,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:12,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:12,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-27 13:17:12,577 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-27 13:17:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:12,577 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-27 13:17:12,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 13:17:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 13:17:12,578 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:12,578 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:12,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:12,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:12,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:12,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:12,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-27 13:17:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:12,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721952693] [2022-04-27 13:17:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:12,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:12,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478680852] [2022-04-27 13:17:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:12,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:12,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:12,810 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-27 13:17:12,811 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-27 13:17:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:12,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:17:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:12,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:13,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {1302#true} call ULTIMATE.init(); {1302#true} is VALID [2022-04-27 13:17:13,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {1302#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1310#(<= ~counter~0 0)} {1302#true} #102#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {1310#(<= ~counter~0 0)} call #t~ret9 := main(); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {1310#(<= ~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; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {1310#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#(<= ~counter~0 0)} ~cond := #in~cond; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#(<= ~counter~0 0)} assume !(0 == ~cond); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,019 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1310#(<= ~counter~0 0)} {1310#(<= ~counter~0 0)} #90#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,019 INFO L272 TraceCheckUtils]: 11: Hoare triple {1310#(<= ~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)); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {1310#(<= ~counter~0 0)} ~cond := #in~cond; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {1310#(<= ~counter~0 0)} assume !(0 == ~cond); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,020 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1310#(<= ~counter~0 0)} {1310#(<= ~counter~0 0)} #92#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {1310#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {1310#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {1359#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,022 INFO L272 TraceCheckUtils]: 19: Hoare triple {1359#(<= ~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)); {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {1359#(<= ~counter~0 1)} ~cond := #in~cond; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {1359#(<= ~counter~0 1)} assume !(0 == ~cond); {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {1359#(<= ~counter~0 1)} assume true; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,024 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1359#(<= ~counter~0 1)} {1359#(<= ~counter~0 1)} #94#return; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {1359#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {1359#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1384#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:17:13,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {1384#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {1303#false} is VALID [2022-04-27 13:17:13,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {1303#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1303#false} is VALID [2022-04-27 13:17:13,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {1303#false} assume !(#t~post8 < 50);havoc #t~post8; {1303#false} is VALID [2022-04-27 13:17:13,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {1303#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1303#false} is VALID [2022-04-27 13:17:13,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {1303#false} assume !(#t~post6 < 50);havoc #t~post6; {1303#false} is VALID [2022-04-27 13:17:13,026 INFO L272 TraceCheckUtils]: 31: Hoare triple {1303#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1303#false} is VALID [2022-04-27 13:17:13,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {1303#false} ~cond := #in~cond; {1303#false} is VALID [2022-04-27 13:17:13,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {1303#false} assume 0 == ~cond; {1303#false} is VALID [2022-04-27 13:17:13,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {1303#false} assume !false; {1303#false} is VALID [2022-04-27 13:17:13,026 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-27 13:17:13,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:13,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:13,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721952693] [2022-04-27 13:17:13,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:13,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478680852] [2022-04-27 13:17:13,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478680852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:13,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:13,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:17:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238130848] [2022-04-27 13:17:13,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:13,027 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-27 13:17:13,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:13,028 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-27 13:17:13,050 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-27 13:17:13,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:17:13,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:17:13,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:17:13,051 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:17:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:13,157 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-27 13:17:13,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:17:13,157 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-27 13:17:13,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:13,157 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-27 13:17:13,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 13:17:13,159 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-27 13:17:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 13:17:13,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-27 13:17:13,209 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-27 13:17:13,210 INFO L225 Difference]: With dead ends: 65 [2022-04-27 13:17:13,210 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:17:13,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:17:13,211 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:13,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 120 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:17:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 13:17:13,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:13,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:17:13,222 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:17:13,223 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:17:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:13,225 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 13:17:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 13:17:13,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:13,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:13,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-27 13:17:13,226 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-27 13:17:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:13,229 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 13:17:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 13:17:13,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:13,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:13,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:13,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:17:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-27 13:17:13,231 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-27 13:17:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:13,231 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-27 13:17:13,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:17:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 13:17:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 13:17:13,232 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:13,233 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:13,251 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-27 13:17:13,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:13,446 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:13,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-27 13:17:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:13,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966045459] [2022-04-27 13:17:13,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:13,457 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:13,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864674876] [2022-04-27 13:17:13,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:13,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:13,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:13,459 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-27 13:17:13,459 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-27 13:17:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:13,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:17:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:13,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:13,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-27 13:17:13,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1662#(<= ~counter~0 0)} {1654#true} #102#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {1662#(<= ~counter~0 0)} call #t~ret9 := main(); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {1662#(<= ~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; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,665 INFO L272 TraceCheckUtils]: 6: Hoare triple {1662#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#(<= ~counter~0 0)} ~cond := #in~cond; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#(<= ~counter~0 0)} assume !(0 == ~cond); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1662#(<= ~counter~0 0)} {1662#(<= ~counter~0 0)} #90#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,677 INFO L272 TraceCheckUtils]: 11: Hoare triple {1662#(<= ~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)); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {1662#(<= ~counter~0 0)} ~cond := #in~cond; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {1662#(<= ~counter~0 0)} assume !(0 == ~cond); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,678 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1662#(<= ~counter~0 0)} {1662#(<= ~counter~0 0)} #92#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {1662#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:13,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {1662#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {1711#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,680 INFO L272 TraceCheckUtils]: 19: Hoare triple {1711#(<= ~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)); {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {1711#(<= ~counter~0 1)} ~cond := #in~cond; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {1711#(<= ~counter~0 1)} assume !(0 == ~cond); {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {1711#(<= ~counter~0 1)} assume true; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,681 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1711#(<= ~counter~0 1)} {1711#(<= ~counter~0 1)} #94#return; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {1711#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:13,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {1711#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:13,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {1736#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:13,686 INFO L272 TraceCheckUtils]: 27: Hoare triple {1736#(<= ~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)); {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:13,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {1736#(<= ~counter~0 2)} ~cond := #in~cond; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:13,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {1736#(<= ~counter~0 2)} assume !(0 == ~cond); {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:13,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {1736#(<= ~counter~0 2)} assume true; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:13,688 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1736#(<= ~counter~0 2)} {1736#(<= ~counter~0 2)} #96#return; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:13,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {1736#(<= ~counter~0 2)} assume !(~r~0 > 0); {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:13,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {1736#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1761#(<= |main_#t~post8| 2)} is VALID [2022-04-27 13:17:13,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {1761#(<= |main_#t~post8| 2)} assume !(#t~post8 < 50);havoc #t~post8; {1655#false} is VALID [2022-04-27 13:17:13,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {1655#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#false} is VALID [2022-04-27 13:17:13,689 INFO L290 TraceCheckUtils]: 36: Hoare triple {1655#false} assume !(#t~post6 < 50);havoc #t~post6; {1655#false} is VALID [2022-04-27 13:17:13,689 INFO L272 TraceCheckUtils]: 37: Hoare triple {1655#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1655#false} is VALID [2022-04-27 13:17:13,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-27 13:17:13,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-27 13:17:13,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-27 13:17:13,689 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-27 13:17:13,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:13,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-27 13:17:13,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-27 13:17:13,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-27 13:17:13,879 INFO L272 TraceCheckUtils]: 37: Hoare triple {1655#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1655#false} is VALID [2022-04-27 13:17:13,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {1655#false} assume !(#t~post6 < 50);havoc #t~post6; {1655#false} is VALID [2022-04-27 13:17:13,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {1655#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#false} is VALID [2022-04-27 13:17:13,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {1801#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {1655#false} is VALID [2022-04-27 13:17:13,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {1805#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1801#(< |main_#t~post8| 50)} is VALID [2022-04-27 13:17:13,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {1805#(< ~counter~0 50)} assume !(~r~0 > 0); {1805#(< ~counter~0 50)} is VALID [2022-04-27 13:17:13,880 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1654#true} {1805#(< ~counter~0 50)} #96#return; {1805#(< ~counter~0 50)} is VALID [2022-04-27 13:17:13,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:17:13,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:17:13,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:17:13,881 INFO L272 TraceCheckUtils]: 27: Hoare triple {1805#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1654#true} is VALID [2022-04-27 13:17:13,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {1805#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {1805#(< ~counter~0 50)} is VALID [2022-04-27 13:17:13,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {1830#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1805#(< ~counter~0 50)} is VALID [2022-04-27 13:17:13,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {1830#(< ~counter~0 49)} assume !!(0 != ~r~0); {1830#(< ~counter~0 49)} is VALID [2022-04-27 13:17:13,882 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1654#true} {1830#(< ~counter~0 49)} #94#return; {1830#(< ~counter~0 49)} is VALID [2022-04-27 13:17:13,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:17:13,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:17:13,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:17:13,883 INFO L272 TraceCheckUtils]: 19: Hoare triple {1830#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1654#true} is VALID [2022-04-27 13:17:13,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {1830#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {1830#(< ~counter~0 49)} is VALID [2022-04-27 13:17:13,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {1855#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1830#(< ~counter~0 49)} is VALID [2022-04-27 13:17:13,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {1855#(< ~counter~0 48)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1855#(< ~counter~0 48)} is VALID [2022-04-27 13:17:13,884 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1654#true} {1855#(< ~counter~0 48)} #92#return; {1855#(< ~counter~0 48)} is VALID [2022-04-27 13:17:13,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:17:13,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:17:13,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:17:13,884 INFO L272 TraceCheckUtils]: 11: Hoare triple {1855#(< ~counter~0 48)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1654#true} is VALID [2022-04-27 13:17:13,885 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1654#true} {1855#(< ~counter~0 48)} #90#return; {1855#(< ~counter~0 48)} is VALID [2022-04-27 13:17:13,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:17:13,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:17:13,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:17:13,885 INFO L272 TraceCheckUtils]: 6: Hoare triple {1855#(< ~counter~0 48)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1654#true} is VALID [2022-04-27 13:17:13,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#(< ~counter~0 48)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1855#(< ~counter~0 48)} is VALID [2022-04-27 13:17:13,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#(< ~counter~0 48)} call #t~ret9 := main(); {1855#(< ~counter~0 48)} is VALID [2022-04-27 13:17:13,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#(< ~counter~0 48)} {1654#true} #102#return; {1855#(< ~counter~0 48)} is VALID [2022-04-27 13:17:13,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#(< ~counter~0 48)} assume true; {1855#(< ~counter~0 48)} is VALID [2022-04-27 13:17:13,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1855#(< ~counter~0 48)} is VALID [2022-04-27 13:17:13,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-27 13:17:13,887 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-27 13:17:13,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:13,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966045459] [2022-04-27 13:17:13,887 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:13,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864674876] [2022-04-27 13:17:13,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864674876] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:17:13,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:17:13,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-27 13:17:13,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221301484] [2022-04-27 13:17:13,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:13,888 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-27 13:17:13,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:13,889 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-27 13:17:13,909 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-27 13:17:13,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:17:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:13,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:17:13,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:17:13,910 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:17:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:14,038 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-27 13:17:14,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:17:14,038 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-27 13:17:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:14,038 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-27 13:17:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-27 13:17:14,040 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-27 13:17:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-27 13:17:14,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-27 13:17:14,092 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-27 13:17:14,093 INFO L225 Difference]: With dead ends: 74 [2022-04-27 13:17:14,093 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 13:17:14,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:17:14,094 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:14,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:14,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 13:17:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-27 13:17:14,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:14,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:17:14,109 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:17:14,109 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:17:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:14,111 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 13:17:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 13:17:14,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:14,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:14,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 13:17:14,111 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 13:17:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:14,113 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 13:17:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 13:17:14,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:14,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:14,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:14,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:17:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-27 13:17:14,115 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-27 13:17:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:14,115 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-27 13:17:14,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:17:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-27 13:17:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 13:17:14,115 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:14,115 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:14,136 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-27 13:17:14,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:14,336 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:14,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-27 13:17:14,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:14,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669125453] [2022-04-27 13:17:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:14,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:14,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:14,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362958357] [2022-04-27 13:17:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:14,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:14,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:14,348 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-27 13:17:14,348 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-27 13:17:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:14,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:17:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:14,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:14,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2022-04-27 13:17:14,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {2192#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {2200#(<= ~counter~0 0)} assume true; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2200#(<= ~counter~0 0)} {2192#true} #102#return; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {2200#(<= ~counter~0 0)} call #t~ret9 := main(); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {2200#(<= ~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; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,597 INFO L272 TraceCheckUtils]: 6: Hoare triple {2200#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {2200#(<= ~counter~0 0)} ~cond := #in~cond; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {2200#(<= ~counter~0 0)} assume !(0 == ~cond); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {2200#(<= ~counter~0 0)} assume true; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2200#(<= ~counter~0 0)} {2200#(<= ~counter~0 0)} #90#return; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,600 INFO L272 TraceCheckUtils]: 11: Hoare triple {2200#(<= ~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)); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {2200#(<= ~counter~0 0)} ~cond := #in~cond; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {2200#(<= ~counter~0 0)} assume !(0 == ~cond); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {2200#(<= ~counter~0 0)} assume true; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,603 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2200#(<= ~counter~0 0)} {2200#(<= ~counter~0 0)} #92#return; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {2200#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {2200#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {2249#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,605 INFO L272 TraceCheckUtils]: 19: Hoare triple {2249#(<= ~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)); {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {2249#(<= ~counter~0 1)} ~cond := #in~cond; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {2249#(<= ~counter~0 1)} assume !(0 == ~cond); {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {2249#(<= ~counter~0 1)} assume true; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,607 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2249#(<= ~counter~0 1)} {2249#(<= ~counter~0 1)} #94#return; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {2249#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {2249#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {2274#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,609 INFO L272 TraceCheckUtils]: 27: Hoare triple {2274#(<= ~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)); {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {2274#(<= ~counter~0 2)} ~cond := #in~cond; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {2274#(<= ~counter~0 2)} assume !(0 == ~cond); {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {2274#(<= ~counter~0 2)} assume true; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,610 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2274#(<= ~counter~0 2)} {2274#(<= ~counter~0 2)} #96#return; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {2274#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {2274#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2299#(<= |main_#t~post7| 2)} is VALID [2022-04-27 13:17:14,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {2299#(<= |main_#t~post7| 2)} assume !(#t~post7 < 50);havoc #t~post7; {2193#false} is VALID [2022-04-27 13:17:14,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {2193#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2193#false} is VALID [2022-04-27 13:17:14,611 INFO L290 TraceCheckUtils]: 36: Hoare triple {2193#false} assume !(#t~post8 < 50);havoc #t~post8; {2193#false} is VALID [2022-04-27 13:17:14,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {2193#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2193#false} is VALID [2022-04-27 13:17:14,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {2193#false} assume !(#t~post6 < 50);havoc #t~post6; {2193#false} is VALID [2022-04-27 13:17:14,612 INFO L272 TraceCheckUtils]: 39: Hoare triple {2193#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2193#false} is VALID [2022-04-27 13:17:14,612 INFO L290 TraceCheckUtils]: 40: Hoare triple {2193#false} ~cond := #in~cond; {2193#false} is VALID [2022-04-27 13:17:14,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {2193#false} assume 0 == ~cond; {2193#false} is VALID [2022-04-27 13:17:14,612 INFO L290 TraceCheckUtils]: 42: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2022-04-27 13:17:14,612 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-27 13:17:14,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:14,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2022-04-27 13:17:14,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {2193#false} assume 0 == ~cond; {2193#false} is VALID [2022-04-27 13:17:14,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {2193#false} ~cond := #in~cond; {2193#false} is VALID [2022-04-27 13:17:14,813 INFO L272 TraceCheckUtils]: 39: Hoare triple {2193#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2193#false} is VALID [2022-04-27 13:17:14,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {2193#false} assume !(#t~post6 < 50);havoc #t~post6; {2193#false} is VALID [2022-04-27 13:17:14,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {2193#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2193#false} is VALID [2022-04-27 13:17:14,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {2193#false} assume !(#t~post8 < 50);havoc #t~post8; {2193#false} is VALID [2022-04-27 13:17:14,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {2193#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2193#false} is VALID [2022-04-27 13:17:14,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {2351#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {2193#false} is VALID [2022-04-27 13:17:14,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {2355#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2351#(< |main_#t~post7| 50)} is VALID [2022-04-27 13:17:14,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {2355#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2355#(< ~counter~0 50)} is VALID [2022-04-27 13:17:14,815 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2192#true} {2355#(< ~counter~0 50)} #96#return; {2355#(< ~counter~0 50)} is VALID [2022-04-27 13:17:14,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-27 13:17:14,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-27 13:17:14,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-27 13:17:14,815 INFO L272 TraceCheckUtils]: 27: Hoare triple {2355#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2192#true} is VALID [2022-04-27 13:17:14,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {2355#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {2355#(< ~counter~0 50)} is VALID [2022-04-27 13:17:14,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {2380#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2355#(< ~counter~0 50)} is VALID [2022-04-27 13:17:14,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {2380#(< ~counter~0 49)} assume !!(0 != ~r~0); {2380#(< ~counter~0 49)} is VALID [2022-04-27 13:17:14,817 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2192#true} {2380#(< ~counter~0 49)} #94#return; {2380#(< ~counter~0 49)} is VALID [2022-04-27 13:17:14,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-27 13:17:14,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-27 13:17:14,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-27 13:17:14,818 INFO L272 TraceCheckUtils]: 19: Hoare triple {2380#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2192#true} is VALID [2022-04-27 13:17:14,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {2380#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {2380#(< ~counter~0 49)} is VALID [2022-04-27 13:17:14,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {2405#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2380#(< ~counter~0 49)} is VALID [2022-04-27 13:17:14,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {2405#(< ~counter~0 48)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2405#(< ~counter~0 48)} is VALID [2022-04-27 13:17:14,819 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2192#true} {2405#(< ~counter~0 48)} #92#return; {2405#(< ~counter~0 48)} is VALID [2022-04-27 13:17:14,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-27 13:17:14,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-27 13:17:14,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-27 13:17:14,819 INFO L272 TraceCheckUtils]: 11: Hoare triple {2405#(< ~counter~0 48)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2192#true} is VALID [2022-04-27 13:17:14,820 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2192#true} {2405#(< ~counter~0 48)} #90#return; {2405#(< ~counter~0 48)} is VALID [2022-04-27 13:17:14,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-27 13:17:14,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-27 13:17:14,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-27 13:17:14,821 INFO L272 TraceCheckUtils]: 6: Hoare triple {2405#(< ~counter~0 48)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2192#true} is VALID [2022-04-27 13:17:14,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {2405#(< ~counter~0 48)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2405#(< ~counter~0 48)} is VALID [2022-04-27 13:17:14,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {2405#(< ~counter~0 48)} call #t~ret9 := main(); {2405#(< ~counter~0 48)} is VALID [2022-04-27 13:17:14,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2405#(< ~counter~0 48)} {2192#true} #102#return; {2405#(< ~counter~0 48)} is VALID [2022-04-27 13:17:14,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {2405#(< ~counter~0 48)} assume true; {2405#(< ~counter~0 48)} is VALID [2022-04-27 13:17:14,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {2192#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2405#(< ~counter~0 48)} is VALID [2022-04-27 13:17:14,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2022-04-27 13:17:14,823 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-27 13:17:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:14,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669125453] [2022-04-27 13:17:14,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:14,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362958357] [2022-04-27 13:17:14,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362958357] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:14,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:14,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:17:14,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206038112] [2022-04-27 13:17:14,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:14,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2022-04-27 13:17:14,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:14,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:17:14,871 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-27 13:17:14,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:17:14,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:17:14,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:17:14,872 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:17:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:15,284 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-04-27 13:17:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:17:15,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2022-04-27 13:17:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:17:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-27 13:17:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:17:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-27 13:17:15,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 156 transitions. [2022-04-27 13:17:15,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:15,393 INFO L225 Difference]: With dead ends: 129 [2022-04-27 13:17:15,393 INFO L226 Difference]: Without dead ends: 108 [2022-04-27 13:17:15,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:17:15,394 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 106 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:15,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 213 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:17:15,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-27 13:17:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2022-04-27 13:17:15,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:15,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:15,431 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:15,432 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:15,435 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-04-27 13:17:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-04-27 13:17:15,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:15,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:15,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 108 states. [2022-04-27 13:17:15,436 INFO L87 Difference]: Start difference. First operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 108 states. [2022-04-27 13:17:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:15,439 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-04-27 13:17:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-04-27 13:17:15,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:15,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:15,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:15,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2022-04-27 13:17:15,442 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 43 [2022-04-27 13:17:15,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:15,442 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2022-04-27 13:17:15,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:17:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-27 13:17:15,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 13:17:15,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:15,443 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:15,460 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-27 13:17:15,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:15,660 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:15,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-27 13:17:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:15,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442375297] [2022-04-27 13:17:15,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:15,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:15,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:15,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384485968] [2022-04-27 13:17:15,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:15,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:15,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:15,677 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-27 13:17:15,678 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-27 13:17:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:15,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 13:17:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:15,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:15,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {2996#true} call ULTIMATE.init(); {2996#true} is VALID [2022-04-27 13:17:15,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {2996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2996#true} is VALID [2022-04-27 13:17:15,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:17:15,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2996#true} {2996#true} #102#return; {2996#true} is VALID [2022-04-27 13:17:15,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {2996#true} call #t~ret9 := main(); {2996#true} is VALID [2022-04-27 13:17:15,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {2996#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; {2996#true} is VALID [2022-04-27 13:17:15,873 INFO L272 TraceCheckUtils]: 6: Hoare triple {2996#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2996#true} is VALID [2022-04-27 13:17:15,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:17:15,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:17:15,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:17:15,873 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2996#true} {2996#true} #90#return; {2996#true} is VALID [2022-04-27 13:17:15,873 INFO L272 TraceCheckUtils]: 11: Hoare triple {2996#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)); {2996#true} is VALID [2022-04-27 13:17:15,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:17:15,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:17:15,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:17:15,874 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2996#true} {2996#true} #92#return; {2996#true} is VALID [2022-04-27 13:17:15,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {2996#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2996#true} is VALID [2022-04-27 13:17:15,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {2996#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2996#true} is VALID [2022-04-27 13:17:15,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {2996#true} assume !!(#t~post6 < 50);havoc #t~post6; {2996#true} is VALID [2022-04-27 13:17:15,874 INFO L272 TraceCheckUtils]: 19: Hoare triple {2996#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)); {2996#true} is VALID [2022-04-27 13:17:15,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:17:15,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:17:15,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:17:15,874 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2996#true} {2996#true} #94#return; {2996#true} is VALID [2022-04-27 13:17:15,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {2996#true} assume !!(0 != ~r~0); {3073#(not (= main_~r~0 0))} is VALID [2022-04-27 13:17:15,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {3073#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3073#(not (= main_~r~0 0))} is VALID [2022-04-27 13:17:15,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {3073#(not (= main_~r~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {3073#(not (= main_~r~0 0))} is VALID [2022-04-27 13:17:15,875 INFO L272 TraceCheckUtils]: 27: Hoare triple {3073#(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)); {2996#true} is VALID [2022-04-27 13:17:15,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:17:15,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:17:15,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:17:15,876 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2996#true} {3073#(not (= main_~r~0 0))} #96#return; {3073#(not (= main_~r~0 0))} is VALID [2022-04-27 13:17:15,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {3073#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:17:15,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:17:15,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 50);havoc #t~post8; {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:17:15,881 INFO L272 TraceCheckUtils]: 35: Hoare triple {3098#(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)); {2996#true} is VALID [2022-04-27 13:17:15,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:17:15,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:17:15,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:17:15,882 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2996#true} {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:17:15,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {2997#false} is VALID [2022-04-27 13:17:15,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {2997#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2997#false} is VALID [2022-04-27 13:17:15,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {2997#false} assume !(#t~post6 < 50);havoc #t~post6; {2997#false} is VALID [2022-04-27 13:17:15,883 INFO L272 TraceCheckUtils]: 43: Hoare triple {2997#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2997#false} is VALID [2022-04-27 13:17:15,883 INFO L290 TraceCheckUtils]: 44: Hoare triple {2997#false} ~cond := #in~cond; {2997#false} is VALID [2022-04-27 13:17:15,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {2997#false} assume 0 == ~cond; {2997#false} is VALID [2022-04-27 13:17:15,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {2997#false} assume !false; {2997#false} is VALID [2022-04-27 13:17:15,886 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-27 13:17:15,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:15,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:15,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442375297] [2022-04-27 13:17:15,886 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:15,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384485968] [2022-04-27 13:17:15,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384485968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:15,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:15,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:17:15,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352969248] [2022-04-27 13:17:15,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:15,887 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-27 13:17:15,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:15,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:17:15,909 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-27 13:17:15,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:17:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:15,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:17:15,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:17:15,910 INFO L87 Difference]: Start difference. First operand 95 states and 117 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-27 13:17:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:16,037 INFO L93 Difference]: Finished difference Result 158 states and 202 transitions. [2022-04-27 13:17:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:17:16,037 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-27 13:17:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:16,037 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-27 13:17:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 13:17:16,039 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-27 13:17:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 13:17:16,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-27 13:17:16,107 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-27 13:17:16,110 INFO L225 Difference]: With dead ends: 158 [2022-04-27 13:17:16,110 INFO L226 Difference]: Without dead ends: 119 [2022-04-27 13:17:16,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:17:16,111 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:16,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 93 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-27 13:17:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2022-04-27 13:17:16,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:16,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 109 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:17:16,163 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 109 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:17:16,169 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 109 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:17:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:16,173 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2022-04-27 13:17:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2022-04-27 13:17:16,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:16,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:16,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 119 states. [2022-04-27 13:17:16,176 INFO L87 Difference]: Start difference. First operand has 109 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 119 states. [2022-04-27 13:17:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:16,180 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2022-04-27 13:17:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2022-04-27 13:17:16,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:16,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:16,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:16,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:17:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 137 transitions. [2022-04-27 13:17:16,183 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 137 transitions. Word has length 47 [2022-04-27 13:17:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:16,184 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 137 transitions. [2022-04-27 13:17:16,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:17:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-27 13:17:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 13:17:16,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:16,185 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:16,203 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-27 13:17:16,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-27 13:17:16,400 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:16,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-27 13:17:16,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:16,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611726141] [2022-04-27 13:17:16,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:16,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:16,412 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:16,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672636214] [2022-04-27 13:17:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:16,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:16,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:16,418 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-27 13:17:16,419 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-27 13:17:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:16,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:17:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:16,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:16,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {3753#true} call ULTIMATE.init(); {3753#true} is VALID [2022-04-27 13:17:16,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {3753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {3761#(<= ~counter~0 0)} assume true; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3761#(<= ~counter~0 0)} {3753#true} #102#return; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {3761#(<= ~counter~0 0)} call #t~ret9 := main(); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {3761#(<= ~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; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,664 INFO L272 TraceCheckUtils]: 6: Hoare triple {3761#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {3761#(<= ~counter~0 0)} ~cond := #in~cond; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {3761#(<= ~counter~0 0)} assume !(0 == ~cond); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {3761#(<= ~counter~0 0)} assume true; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,665 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3761#(<= ~counter~0 0)} {3761#(<= ~counter~0 0)} #90#return; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,665 INFO L272 TraceCheckUtils]: 11: Hoare triple {3761#(<= ~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)); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {3761#(<= ~counter~0 0)} ~cond := #in~cond; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {3761#(<= ~counter~0 0)} assume !(0 == ~cond); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {3761#(<= ~counter~0 0)} assume true; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,667 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3761#(<= ~counter~0 0)} {3761#(<= ~counter~0 0)} #92#return; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {3761#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:16,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {3761#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:16,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {3810#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:16,668 INFO L272 TraceCheckUtils]: 19: Hoare triple {3810#(<= ~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)); {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:16,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {3810#(<= ~counter~0 1)} ~cond := #in~cond; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:16,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {3810#(<= ~counter~0 1)} assume !(0 == ~cond); {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:16,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {3810#(<= ~counter~0 1)} assume true; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:16,670 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3810#(<= ~counter~0 1)} {3810#(<= ~counter~0 1)} #94#return; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:16,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {3810#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:16,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {3810#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:16,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {3835#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:16,671 INFO L272 TraceCheckUtils]: 27: Hoare triple {3835#(<= ~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)); {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:16,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {3835#(<= ~counter~0 2)} ~cond := #in~cond; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:16,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {3835#(<= ~counter~0 2)} assume !(0 == ~cond); {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:16,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {3835#(<= ~counter~0 2)} assume true; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:16,673 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3835#(<= ~counter~0 2)} {3835#(<= ~counter~0 2)} #96#return; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:16,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {3835#(<= ~counter~0 2)} assume !(~r~0 > 0); {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:16,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {3835#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:16,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {3860#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:16,674 INFO L272 TraceCheckUtils]: 35: Hoare triple {3860#(<= ~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)); {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:16,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {3860#(<= ~counter~0 3)} ~cond := #in~cond; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:16,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {3860#(<= ~counter~0 3)} assume !(0 == ~cond); {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:16,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {3860#(<= ~counter~0 3)} assume true; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:16,676 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3860#(<= ~counter~0 3)} {3860#(<= ~counter~0 3)} #98#return; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:16,676 INFO L290 TraceCheckUtils]: 40: Hoare triple {3860#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:16,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {3860#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3885#(<= |main_#t~post8| 3)} is VALID [2022-04-27 13:17:16,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {3885#(<= |main_#t~post8| 3)} assume !(#t~post8 < 50);havoc #t~post8; {3754#false} is VALID [2022-04-27 13:17:16,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {3754#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3754#false} is VALID [2022-04-27 13:17:16,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {3754#false} assume !(#t~post6 < 50);havoc #t~post6; {3754#false} is VALID [2022-04-27 13:17:16,677 INFO L272 TraceCheckUtils]: 45: Hoare triple {3754#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3754#false} is VALID [2022-04-27 13:17:16,677 INFO L290 TraceCheckUtils]: 46: Hoare triple {3754#false} ~cond := #in~cond; {3754#false} is VALID [2022-04-27 13:17:16,677 INFO L290 TraceCheckUtils]: 47: Hoare triple {3754#false} assume 0 == ~cond; {3754#false} is VALID [2022-04-27 13:17:16,677 INFO L290 TraceCheckUtils]: 48: Hoare triple {3754#false} assume !false; {3754#false} is VALID [2022-04-27 13:17:16,677 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-27 13:17:16,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:16,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {3754#false} assume !false; {3754#false} is VALID [2022-04-27 13:17:16,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {3754#false} assume 0 == ~cond; {3754#false} is VALID [2022-04-27 13:17:16,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {3754#false} ~cond := #in~cond; {3754#false} is VALID [2022-04-27 13:17:16,909 INFO L272 TraceCheckUtils]: 45: Hoare triple {3754#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3754#false} is VALID [2022-04-27 13:17:16,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {3754#false} assume !(#t~post6 < 50);havoc #t~post6; {3754#false} is VALID [2022-04-27 13:17:16,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {3754#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3754#false} is VALID [2022-04-27 13:17:16,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {3925#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {3754#false} is VALID [2022-04-27 13:17:16,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {3929#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3925#(< |main_#t~post8| 50)} is VALID [2022-04-27 13:17:16,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {3929#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3929#(< ~counter~0 50)} is VALID [2022-04-27 13:17:16,911 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3753#true} {3929#(< ~counter~0 50)} #98#return; {3929#(< ~counter~0 50)} is VALID [2022-04-27 13:17:16,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:17:16,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:17:16,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:17:16,911 INFO L272 TraceCheckUtils]: 35: Hoare triple {3929#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3753#true} is VALID [2022-04-27 13:17:16,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {3929#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {3929#(< ~counter~0 50)} is VALID [2022-04-27 13:17:16,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {3954#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3929#(< ~counter~0 50)} is VALID [2022-04-27 13:17:16,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {3954#(< ~counter~0 49)} assume !(~r~0 > 0); {3954#(< ~counter~0 49)} is VALID [2022-04-27 13:17:16,912 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3753#true} {3954#(< ~counter~0 49)} #96#return; {3954#(< ~counter~0 49)} is VALID [2022-04-27 13:17:16,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:17:16,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:17:16,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:17:16,913 INFO L272 TraceCheckUtils]: 27: Hoare triple {3954#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3753#true} is VALID [2022-04-27 13:17:16,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {3954#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {3954#(< ~counter~0 49)} is VALID [2022-04-27 13:17:16,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {3979#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3954#(< ~counter~0 49)} is VALID [2022-04-27 13:17:16,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {3979#(< ~counter~0 48)} assume !!(0 != ~r~0); {3979#(< ~counter~0 48)} is VALID [2022-04-27 13:17:16,914 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3753#true} {3979#(< ~counter~0 48)} #94#return; {3979#(< ~counter~0 48)} is VALID [2022-04-27 13:17:16,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:17:16,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:17:16,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:17:16,914 INFO L272 TraceCheckUtils]: 19: Hoare triple {3979#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3753#true} is VALID [2022-04-27 13:17:16,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {3979#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {3979#(< ~counter~0 48)} is VALID [2022-04-27 13:17:16,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {4004#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3979#(< ~counter~0 48)} is VALID [2022-04-27 13:17:16,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {4004#(< ~counter~0 47)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4004#(< ~counter~0 47)} is VALID [2022-04-27 13:17:16,916 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3753#true} {4004#(< ~counter~0 47)} #92#return; {4004#(< ~counter~0 47)} is VALID [2022-04-27 13:17:16,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:17:16,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:17:16,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:17:16,916 INFO L272 TraceCheckUtils]: 11: Hoare triple {4004#(< ~counter~0 47)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3753#true} is VALID [2022-04-27 13:17:16,916 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3753#true} {4004#(< ~counter~0 47)} #90#return; {4004#(< ~counter~0 47)} is VALID [2022-04-27 13:17:16,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:17:16,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:17:16,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:17:16,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {4004#(< ~counter~0 47)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3753#true} is VALID [2022-04-27 13:17:16,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {4004#(< ~counter~0 47)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4004#(< ~counter~0 47)} is VALID [2022-04-27 13:17:16,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {4004#(< ~counter~0 47)} call #t~ret9 := main(); {4004#(< ~counter~0 47)} is VALID [2022-04-27 13:17:16,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4004#(< ~counter~0 47)} {3753#true} #102#return; {4004#(< ~counter~0 47)} is VALID [2022-04-27 13:17:16,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {4004#(< ~counter~0 47)} assume true; {4004#(< ~counter~0 47)} is VALID [2022-04-27 13:17:16,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {3753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4004#(< ~counter~0 47)} is VALID [2022-04-27 13:17:16,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {3753#true} call ULTIMATE.init(); {3753#true} is VALID [2022-04-27 13:17:16,918 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-27 13:17:16,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:16,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611726141] [2022-04-27 13:17:16,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:16,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672636214] [2022-04-27 13:17:16,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672636214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:16,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:16,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-27 13:17:16,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663238842] [2022-04-27 13:17:16,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:16,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 49 [2022-04-27 13:17:16,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:16,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:17:16,974 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-27 13:17:16,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 13:17:16,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:16,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 13:17:16,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:17:16,975 INFO L87 Difference]: Start difference. First operand 109 states and 137 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:17:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:17,604 INFO L93 Difference]: Finished difference Result 219 states and 283 transitions. [2022-04-27 13:17:17,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 13:17:17,604 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 49 [2022-04-27 13:17:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:17:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-27 13:17:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:17:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-27 13:17:17,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 194 transitions. [2022-04-27 13:17:17,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:17,749 INFO L225 Difference]: With dead ends: 219 [2022-04-27 13:17:17,749 INFO L226 Difference]: Without dead ends: 172 [2022-04-27 13:17:17,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-04-27 13:17:17,750 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 180 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:17,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 200 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:17:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-27 13:17:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 153. [2022-04-27 13:17:17,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:17,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 153 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:17:17,802 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 153 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:17:17,802 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 153 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:17:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:17,805 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-27 13:17:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-27 13:17:17,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:17,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:17,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-27 13:17:17,806 INFO L87 Difference]: Start difference. First operand has 153 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-27 13:17:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:17,809 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-27 13:17:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-27 13:17:17,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:17,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:17,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:17,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:17:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2022-04-27 13:17:17,813 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 49 [2022-04-27 13:17:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:17,813 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2022-04-27 13:17:17,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:17:17,814 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2022-04-27 13:17:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 13:17:17,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:17,814 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:17,833 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-27 13:17:18,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:18,033 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-27 13:17:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:18,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917981470] [2022-04-27 13:17:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:18,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:18,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921660605] [2022-04-27 13:17:18,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:18,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:18,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:18,058 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-27 13:17:18,075 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-27 13:17:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:18,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:17:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:18,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:18,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {4930#true} call ULTIMATE.init(); {4930#true} is VALID [2022-04-27 13:17:18,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {4930#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {4938#(<= ~counter~0 0)} assume true; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4938#(<= ~counter~0 0)} {4930#true} #102#return; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {4938#(<= ~counter~0 0)} call #t~ret9 := main(); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {4938#(<= ~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; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,376 INFO L272 TraceCheckUtils]: 6: Hoare triple {4938#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {4938#(<= ~counter~0 0)} ~cond := #in~cond; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {4938#(<= ~counter~0 0)} assume !(0 == ~cond); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {4938#(<= ~counter~0 0)} assume true; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4938#(<= ~counter~0 0)} {4938#(<= ~counter~0 0)} #90#return; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,378 INFO L272 TraceCheckUtils]: 11: Hoare triple {4938#(<= ~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)); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {4938#(<= ~counter~0 0)} ~cond := #in~cond; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {4938#(<= ~counter~0 0)} assume !(0 == ~cond); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {4938#(<= ~counter~0 0)} assume true; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,379 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4938#(<= ~counter~0 0)} {4938#(<= ~counter~0 0)} #92#return; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {4938#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {4938#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {4987#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,380 INFO L272 TraceCheckUtils]: 19: Hoare triple {4987#(<= ~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)); {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {4987#(<= ~counter~0 1)} ~cond := #in~cond; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {4987#(<= ~counter~0 1)} assume !(0 == ~cond); {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {4987#(<= ~counter~0 1)} assume true; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,381 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4987#(<= ~counter~0 1)} {4987#(<= ~counter~0 1)} #94#return; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {4987#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {4987#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {5012#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,383 INFO L272 TraceCheckUtils]: 27: Hoare triple {5012#(<= ~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)); {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {5012#(<= ~counter~0 2)} ~cond := #in~cond; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {5012#(<= ~counter~0 2)} assume !(0 == ~cond); {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {5012#(<= ~counter~0 2)} assume true; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,386 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5012#(<= ~counter~0 2)} {5012#(<= ~counter~0 2)} #96#return; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {5012#(<= ~counter~0 2)} assume !(~r~0 > 0); {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {5012#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {5037#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,387 INFO L272 TraceCheckUtils]: 35: Hoare triple {5037#(<= ~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)); {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {5037#(<= ~counter~0 3)} ~cond := #in~cond; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {5037#(<= ~counter~0 3)} assume !(0 == ~cond); {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {5037#(<= ~counter~0 3)} assume true; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,388 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5037#(<= ~counter~0 3)} {5037#(<= ~counter~0 3)} #98#return; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {5037#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {5037#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {5062#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,390 INFO L272 TraceCheckUtils]: 43: Hoare triple {5062#(<= ~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)); {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {5062#(<= ~counter~0 4)} ~cond := #in~cond; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {5062#(<= ~counter~0 4)} assume !(0 == ~cond); {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {5062#(<= ~counter~0 4)} assume true; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,391 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5062#(<= ~counter~0 4)} {5062#(<= ~counter~0 4)} #98#return; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {5062#(<= ~counter~0 4)} assume !(~r~0 < 0); {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {5062#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5087#(<= |main_#t~post6| 4)} is VALID [2022-04-27 13:17:18,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {5087#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {4931#false} is VALID [2022-04-27 13:17:18,392 INFO L272 TraceCheckUtils]: 51: Hoare triple {4931#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4931#false} is VALID [2022-04-27 13:17:18,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {4931#false} ~cond := #in~cond; {4931#false} is VALID [2022-04-27 13:17:18,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {4931#false} assume 0 == ~cond; {4931#false} is VALID [2022-04-27 13:17:18,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {4931#false} assume !false; {4931#false} is VALID [2022-04-27 13:17:18,392 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-27 13:17:18,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:18,674 INFO L290 TraceCheckUtils]: 54: Hoare triple {4931#false} assume !false; {4931#false} is VALID [2022-04-27 13:17:18,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {4931#false} assume 0 == ~cond; {4931#false} is VALID [2022-04-27 13:17:18,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {4931#false} ~cond := #in~cond; {4931#false} is VALID [2022-04-27 13:17:18,675 INFO L272 TraceCheckUtils]: 51: Hoare triple {4931#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4931#false} is VALID [2022-04-27 13:17:18,675 INFO L290 TraceCheckUtils]: 50: Hoare triple {5115#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {4931#false} is VALID [2022-04-27 13:17:18,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {5119#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5115#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:17:18,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {5119#(< ~counter~0 50)} assume !(~r~0 < 0); {5119#(< ~counter~0 50)} is VALID [2022-04-27 13:17:18,676 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {4930#true} {5119#(< ~counter~0 50)} #98#return; {5119#(< ~counter~0 50)} is VALID [2022-04-27 13:17:18,677 INFO L290 TraceCheckUtils]: 46: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:17:18,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:17:18,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:17:18,677 INFO L272 TraceCheckUtils]: 43: Hoare triple {5119#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:17:18,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {5119#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {5119#(< ~counter~0 50)} is VALID [2022-04-27 13:17:18,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5119#(< ~counter~0 50)} is VALID [2022-04-27 13:17:18,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5144#(< ~counter~0 49)} is VALID [2022-04-27 13:17:18,678 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4930#true} {5144#(< ~counter~0 49)} #98#return; {5144#(< ~counter~0 49)} is VALID [2022-04-27 13:17:18,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:17:18,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:17:18,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:17:18,679 INFO L272 TraceCheckUtils]: 35: Hoare triple {5144#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:17:18,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {5144#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {5144#(< ~counter~0 49)} is VALID [2022-04-27 13:17:18,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {5169#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5144#(< ~counter~0 49)} is VALID [2022-04-27 13:17:18,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {5169#(< ~counter~0 48)} assume !(~r~0 > 0); {5169#(< ~counter~0 48)} is VALID [2022-04-27 13:17:18,681 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4930#true} {5169#(< ~counter~0 48)} #96#return; {5169#(< ~counter~0 48)} is VALID [2022-04-27 13:17:18,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:17:18,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:17:18,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:17:18,681 INFO L272 TraceCheckUtils]: 27: Hoare triple {5169#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:17:18,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {5169#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {5169#(< ~counter~0 48)} is VALID [2022-04-27 13:17:18,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {5194#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5169#(< ~counter~0 48)} is VALID [2022-04-27 13:17:18,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {5194#(< ~counter~0 47)} assume !!(0 != ~r~0); {5194#(< ~counter~0 47)} is VALID [2022-04-27 13:17:18,682 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4930#true} {5194#(< ~counter~0 47)} #94#return; {5194#(< ~counter~0 47)} is VALID [2022-04-27 13:17:18,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:17:18,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:17:18,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:17:18,683 INFO L272 TraceCheckUtils]: 19: Hoare triple {5194#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:17:18,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {5194#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {5194#(< ~counter~0 47)} is VALID [2022-04-27 13:17:18,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {5219#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5194#(< ~counter~0 47)} is VALID [2022-04-27 13:17:18,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {5219#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5219#(< ~counter~0 46)} is VALID [2022-04-27 13:17:18,684 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4930#true} {5219#(< ~counter~0 46)} #92#return; {5219#(< ~counter~0 46)} is VALID [2022-04-27 13:17:18,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:17:18,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:17:18,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:17:18,685 INFO L272 TraceCheckUtils]: 11: Hoare triple {5219#(< ~counter~0 46)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4930#true} is VALID [2022-04-27 13:17:18,685 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4930#true} {5219#(< ~counter~0 46)} #90#return; {5219#(< ~counter~0 46)} is VALID [2022-04-27 13:17:18,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:17:18,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:17:18,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:17:18,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {5219#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:17:18,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#(< ~counter~0 46)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5219#(< ~counter~0 46)} is VALID [2022-04-27 13:17:18,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#(< ~counter~0 46)} call #t~ret9 := main(); {5219#(< ~counter~0 46)} is VALID [2022-04-27 13:17:18,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#(< ~counter~0 46)} {4930#true} #102#return; {5219#(< ~counter~0 46)} is VALID [2022-04-27 13:17:18,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#(< ~counter~0 46)} assume true; {5219#(< ~counter~0 46)} is VALID [2022-04-27 13:17:18,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {4930#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5219#(< ~counter~0 46)} is VALID [2022-04-27 13:17:18,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {4930#true} call ULTIMATE.init(); {4930#true} is VALID [2022-04-27 13:17:18,687 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-27 13:17:18,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:18,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917981470] [2022-04-27 13:17:18,687 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:18,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921660605] [2022-04-27 13:17:18,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921660605] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:18,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:18,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 13:17:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32107701] [2022-04-27 13:17:18,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:18,688 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 55 [2022-04-27 13:17:18,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:18,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:17:18,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:18,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:17:18,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:18,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:17:18,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:17:18,746 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:17:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:19,475 INFO L93 Difference]: Finished difference Result 211 states and 278 transitions. [2022-04-27 13:17:19,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 13:17:19,476 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 55 [2022-04-27 13:17:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:17:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-27 13:17:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:17:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-27 13:17:19,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 204 transitions. [2022-04-27 13:17:19,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:19,621 INFO L225 Difference]: With dead ends: 211 [2022-04-27 13:17:19,622 INFO L226 Difference]: Without dead ends: 206 [2022-04-27 13:17:19,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:17:19,622 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 191 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:19,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 291 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:17:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-27 13:17:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2022-04-27 13:17:19,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:19,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 198 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 40 states have call successors, (40), 14 states have call predecessors, (40), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:17:19,702 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 198 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 40 states have call successors, (40), 14 states have call predecessors, (40), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:17:19,703 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 198 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 40 states have call successors, (40), 14 states have call predecessors, (40), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:17:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:19,706 INFO L93 Difference]: Finished difference Result 206 states and 267 transitions. [2022-04-27 13:17:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2022-04-27 13:17:19,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:19,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:19,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 40 states have call successors, (40), 14 states have call predecessors, (40), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 206 states. [2022-04-27 13:17:19,708 INFO L87 Difference]: Start difference. First operand has 198 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 40 states have call successors, (40), 14 states have call predecessors, (40), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 206 states. [2022-04-27 13:17:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:19,711 INFO L93 Difference]: Finished difference Result 206 states and 267 transitions. [2022-04-27 13:17:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2022-04-27 13:17:19,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:19,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:19,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:19,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 40 states have call successors, (40), 14 states have call predecessors, (40), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:17:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 257 transitions. [2022-04-27 13:17:19,716 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 257 transitions. Word has length 55 [2022-04-27 13:17:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:19,716 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 257 transitions. [2022-04-27 13:17:19,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:17:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 257 transitions. [2022-04-27 13:17:19,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 13:17:19,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:19,718 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:19,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-27 13:17:19,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 13:17:19,934 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash -304792209, now seen corresponding path program 1 times [2022-04-27 13:17:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:19,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490998874] [2022-04-27 13:17:19,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:19,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:19,946 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:19,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706561332] [2022-04-27 13:17:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:19,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:19,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:19,947 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-27 13:17:19,948 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-27 13:17:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:19,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:17:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:20,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:20,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {6268#true} call ULTIMATE.init(); {6268#true} is VALID [2022-04-27 13:17:20,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {6268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6268#true} is VALID [2022-04-27 13:17:20,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6268#true} {6268#true} #102#return; {6268#true} is VALID [2022-04-27 13:17:20,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {6268#true} call #t~ret9 := main(); {6268#true} is VALID [2022-04-27 13:17:20,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {6268#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; {6268#true} is VALID [2022-04-27 13:17:20,239 INFO L272 TraceCheckUtils]: 6: Hoare triple {6268#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6268#true} is VALID [2022-04-27 13:17:20,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,239 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6268#true} {6268#true} #90#return; {6268#true} is VALID [2022-04-27 13:17:20,240 INFO L272 TraceCheckUtils]: 11: Hoare triple {6268#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)); {6268#true} is VALID [2022-04-27 13:17:20,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,240 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6268#true} {6268#true} #92#return; {6268#true} is VALID [2022-04-27 13:17:20,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {6268#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {6321#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,241 INFO L272 TraceCheckUtils]: 19: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:20,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,242 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #94#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {6321#(<= main_~v~0 1)} assume !!(0 != ~r~0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {6321#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,242 INFO L272 TraceCheckUtils]: 27: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:20,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,243 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #96#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {6321#(<= main_~v~0 1)} assume !(~r~0 > 0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {6321#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,244 INFO L272 TraceCheckUtils]: 35: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:20,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,244 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #98#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {6321#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {6321#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,245 INFO L272 TraceCheckUtils]: 43: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:20,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,246 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #98#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {6321#(<= main_~v~0 1)} assume !(~r~0 < 0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {6321#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,246 INFO L272 TraceCheckUtils]: 51: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:20,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,247 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #94#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {6321#(<= main_~v~0 1)} assume !!(0 != ~r~0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {6321#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,248 INFO L272 TraceCheckUtils]: 59: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:20,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,249 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #96#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,249 INFO L290 TraceCheckUtils]: 64: Hoare triple {6321#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:20,249 INFO L290 TraceCheckUtils]: 65: Hoare triple {6466#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:20,250 INFO L290 TraceCheckUtils]: 66: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !(#t~post7 < 50);havoc #t~post7; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:20,250 INFO L290 TraceCheckUtils]: 67: Hoare triple {6466#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:20,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:20,250 INFO L272 TraceCheckUtils]: 69: Hoare triple {6466#(< 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)); {6268#true} is VALID [2022-04-27 13:17:20,250 INFO L290 TraceCheckUtils]: 70: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,250 INFO L290 TraceCheckUtils]: 71: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,250 INFO L290 TraceCheckUtils]: 72: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,251 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6268#true} {6466#(< 0 (+ main_~r~0 1))} #98#return; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:20,251 INFO L290 TraceCheckUtils]: 74: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6269#false} is VALID [2022-04-27 13:17:20,251 INFO L290 TraceCheckUtils]: 75: Hoare triple {6269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#false} is VALID [2022-04-27 13:17:20,251 INFO L290 TraceCheckUtils]: 76: Hoare triple {6269#false} assume !!(#t~post8 < 50);havoc #t~post8; {6269#false} is VALID [2022-04-27 13:17:20,251 INFO L272 TraceCheckUtils]: 77: Hoare triple {6269#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L290 TraceCheckUtils]: 78: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L290 TraceCheckUtils]: 79: Hoare triple {6269#false} assume !(0 == ~cond); {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L290 TraceCheckUtils]: 80: Hoare triple {6269#false} assume true; {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6269#false} {6269#false} #98#return; {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L290 TraceCheckUtils]: 82: Hoare triple {6269#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L290 TraceCheckUtils]: 83: Hoare triple {6269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L290 TraceCheckUtils]: 84: Hoare triple {6269#false} assume !(#t~post8 < 50);havoc #t~post8; {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L290 TraceCheckUtils]: 85: Hoare triple {6269#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L290 TraceCheckUtils]: 86: Hoare triple {6269#false} assume !(#t~post6 < 50);havoc #t~post6; {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L272 TraceCheckUtils]: 87: Hoare triple {6269#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L290 TraceCheckUtils]: 88: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L290 TraceCheckUtils]: 89: Hoare triple {6269#false} assume 0 == ~cond; {6269#false} is VALID [2022-04-27 13:17:20,252 INFO L290 TraceCheckUtils]: 90: Hoare triple {6269#false} assume !false; {6269#false} is VALID [2022-04-27 13:17:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-04-27 13:17:20,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:20,471 INFO L290 TraceCheckUtils]: 90: Hoare triple {6269#false} assume !false; {6269#false} is VALID [2022-04-27 13:17:20,471 INFO L290 TraceCheckUtils]: 89: Hoare triple {6269#false} assume 0 == ~cond; {6269#false} is VALID [2022-04-27 13:17:20,471 INFO L290 TraceCheckUtils]: 88: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-27 13:17:20,471 INFO L272 TraceCheckUtils]: 87: Hoare triple {6269#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6269#false} is VALID [2022-04-27 13:17:20,471 INFO L290 TraceCheckUtils]: 86: Hoare triple {6269#false} assume !(#t~post6 < 50);havoc #t~post6; {6269#false} is VALID [2022-04-27 13:17:20,472 INFO L290 TraceCheckUtils]: 85: Hoare triple {6269#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6269#false} is VALID [2022-04-27 13:17:20,472 INFO L290 TraceCheckUtils]: 84: Hoare triple {6269#false} assume !(#t~post8 < 50);havoc #t~post8; {6269#false} is VALID [2022-04-27 13:17:20,472 INFO L290 TraceCheckUtils]: 83: Hoare triple {6269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#false} is VALID [2022-04-27 13:17:20,472 INFO L290 TraceCheckUtils]: 82: Hoare triple {6269#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6269#false} is VALID [2022-04-27 13:17:20,472 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6268#true} {6269#false} #98#return; {6269#false} is VALID [2022-04-27 13:17:20,472 INFO L290 TraceCheckUtils]: 80: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,472 INFO L290 TraceCheckUtils]: 79: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,472 INFO L290 TraceCheckUtils]: 78: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,472 INFO L272 TraceCheckUtils]: 77: Hoare triple {6269#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6268#true} is VALID [2022-04-27 13:17:20,472 INFO L290 TraceCheckUtils]: 76: Hoare triple {6269#false} assume !!(#t~post8 < 50);havoc #t~post8; {6269#false} is VALID [2022-04-27 13:17:20,472 INFO L290 TraceCheckUtils]: 75: Hoare triple {6269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#false} is VALID [2022-04-27 13:17:20,473 INFO L290 TraceCheckUtils]: 74: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6269#false} is VALID [2022-04-27 13:17:20,486 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6268#true} {6466#(< 0 (+ main_~r~0 1))} #98#return; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:20,486 INFO L290 TraceCheckUtils]: 72: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,486 INFO L290 TraceCheckUtils]: 71: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,486 INFO L290 TraceCheckUtils]: 70: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,486 INFO L272 TraceCheckUtils]: 69: Hoare triple {6466#(< 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)); {6268#true} is VALID [2022-04-27 13:17:20,486 INFO L290 TraceCheckUtils]: 68: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:20,487 INFO L290 TraceCheckUtils]: 67: Hoare triple {6466#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:20,487 INFO L290 TraceCheckUtils]: 66: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !(#t~post7 < 50);havoc #t~post7; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:20,487 INFO L290 TraceCheckUtils]: 65: Hoare triple {6466#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:20,488 INFO L290 TraceCheckUtils]: 64: Hoare triple {6321#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:20,488 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #96#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,488 INFO L290 TraceCheckUtils]: 62: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,488 INFO L290 TraceCheckUtils]: 61: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,488 INFO L272 TraceCheckUtils]: 59: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:20,489 INFO L290 TraceCheckUtils]: 58: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,489 INFO L290 TraceCheckUtils]: 57: Hoare triple {6321#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {6321#(<= main_~v~0 1)} assume !!(0 != ~r~0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,489 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #94#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,489 INFO L290 TraceCheckUtils]: 54: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,489 INFO L290 TraceCheckUtils]: 53: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,490 INFO L272 TraceCheckUtils]: 51: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:20,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {6321#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,490 INFO L290 TraceCheckUtils]: 48: Hoare triple {6321#(<= main_~v~0 1)} assume !(~r~0 < 0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,491 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #98#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,491 INFO L272 TraceCheckUtils]: 43: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:20,491 INFO L290 TraceCheckUtils]: 42: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,491 INFO L290 TraceCheckUtils]: 41: Hoare triple {6321#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {6321#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,492 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #98#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,492 INFO L272 TraceCheckUtils]: 35: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:20,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {6321#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {6321#(<= main_~v~0 1)} assume !(~r~0 > 0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,493 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #96#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,494 INFO L272 TraceCheckUtils]: 27: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:20,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {6321#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {6321#(<= main_~v~0 1)} assume !!(0 != ~r~0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,495 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #94#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,495 INFO L272 TraceCheckUtils]: 19: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:20,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {6321#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {6268#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:20,496 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6268#true} {6268#true} #92#return; {6268#true} is VALID [2022-04-27 13:17:20,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,496 INFO L272 TraceCheckUtils]: 11: Hoare triple {6268#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)); {6268#true} is VALID [2022-04-27 13:17:20,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6268#true} {6268#true} #90#return; {6268#true} is VALID [2022-04-27 13:17:20,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:20,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:20,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {6268#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6268#true} is VALID [2022-04-27 13:17:20,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {6268#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; {6268#true} is VALID [2022-04-27 13:17:20,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {6268#true} call #t~ret9 := main(); {6268#true} is VALID [2022-04-27 13:17:20,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6268#true} {6268#true} #102#return; {6268#true} is VALID [2022-04-27 13:17:20,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:20,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {6268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6268#true} is VALID [2022-04-27 13:17:20,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {6268#true} call ULTIMATE.init(); {6268#true} is VALID [2022-04-27 13:17:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-04-27 13:17:20,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:20,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490998874] [2022-04-27 13:17:20,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:20,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706561332] [2022-04-27 13:17:20,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706561332] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:20,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:20,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-27 13:17:20,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063458196] [2022-04-27 13:17:20,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:20,499 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 91 [2022-04-27 13:17:20,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:20,499 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:17:20,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:20,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:17:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:20,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:17:20,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:17:20,529 INFO L87 Difference]: Start difference. First operand 198 states and 257 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:17:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:20,948 INFO L93 Difference]: Finished difference Result 502 states and 697 transitions. [2022-04-27 13:17:20,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:17:20,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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 91 [2022-04-27 13:17:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:20,948 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:17:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-27 13:17:20,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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:17:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-27 13:17:20,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-27 13:17:21,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:21,044 INFO L225 Difference]: With dead ends: 502 [2022-04-27 13:17:21,044 INFO L226 Difference]: Without dead ends: 359 [2022-04-27 13:17:21,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 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-27 13:17:21,045 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 17 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:21,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 141 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:21,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-27 13:17:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2022-04-27 13:17:21,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:21,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 342 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 261 states have internal predecessors, (323), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:17:21,213 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 342 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 261 states have internal predecessors, (323), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:17:21,214 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 342 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 261 states have internal predecessors, (323), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:17:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:21,221 INFO L93 Difference]: Finished difference Result 359 states and 490 transitions. [2022-04-27 13:17:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 490 transitions. [2022-04-27 13:17:21,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:21,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:21,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 261 states have internal predecessors, (323), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 359 states. [2022-04-27 13:17:21,223 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 261 states have internal predecessors, (323), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 359 states. [2022-04-27 13:17:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:21,231 INFO L93 Difference]: Finished difference Result 359 states and 490 transitions. [2022-04-27 13:17:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 490 transitions. [2022-04-27 13:17:21,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:21,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:21,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:21,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 261 states have internal predecessors, (323), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:17:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 469 transitions. [2022-04-27 13:17:21,241 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 469 transitions. Word has length 91 [2022-04-27 13:17:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:21,241 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 469 transitions. [2022-04-27 13:17:21,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:17:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 469 transitions. [2022-04-27 13:17:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 13:17:21,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:21,242 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 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, 1] [2022-04-27 13:17:21,261 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-27 13:17:21,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 13:17:21,459 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:21,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:21,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1103092705, now seen corresponding path program 2 times [2022-04-27 13:17:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:21,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120245191] [2022-04-27 13:17:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:21,471 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:21,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783879487] [2022-04-27 13:17:21,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:17:21,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:21,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:21,472 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-27 13:17:21,473 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-27 13:17:21,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:17:21,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:21,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 13:17:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:21,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:21,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {8722#true} call ULTIMATE.init(); {8722#true} is VALID [2022-04-27 13:17:21,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {8722#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#(<= ~counter~0 0)} assume true; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8730#(<= ~counter~0 0)} {8722#true} #102#return; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {8730#(<= ~counter~0 0)} call #t~ret9 := main(); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {8730#(<= ~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; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,950 INFO L272 TraceCheckUtils]: 6: Hoare triple {8730#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {8730#(<= ~counter~0 0)} ~cond := #in~cond; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {8730#(<= ~counter~0 0)} assume !(0 == ~cond); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {8730#(<= ~counter~0 0)} assume true; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,952 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8730#(<= ~counter~0 0)} {8730#(<= ~counter~0 0)} #90#return; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,952 INFO L272 TraceCheckUtils]: 11: Hoare triple {8730#(<= ~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)); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {8730#(<= ~counter~0 0)} ~cond := #in~cond; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {8730#(<= ~counter~0 0)} assume !(0 == ~cond); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {8730#(<= ~counter~0 0)} assume true; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,953 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8730#(<= ~counter~0 0)} {8730#(<= ~counter~0 0)} #92#return; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {8730#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:21,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {8730#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:21,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {8779#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:21,955 INFO L272 TraceCheckUtils]: 19: Hoare triple {8779#(<= ~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)); {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:21,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {8779#(<= ~counter~0 1)} ~cond := #in~cond; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:21,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {8779#(<= ~counter~0 1)} assume !(0 == ~cond); {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:21,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {8779#(<= ~counter~0 1)} assume true; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:21,956 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8779#(<= ~counter~0 1)} {8779#(<= ~counter~0 1)} #94#return; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:21,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {8779#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:21,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {8779#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:21,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {8804#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:21,958 INFO L272 TraceCheckUtils]: 27: Hoare triple {8804#(<= ~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)); {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:21,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {8804#(<= ~counter~0 2)} ~cond := #in~cond; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:21,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {8804#(<= ~counter~0 2)} assume !(0 == ~cond); {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:21,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {8804#(<= ~counter~0 2)} assume true; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:21,959 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8804#(<= ~counter~0 2)} {8804#(<= ~counter~0 2)} #96#return; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:21,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {8804#(<= ~counter~0 2)} assume !(~r~0 > 0); {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:21,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {8804#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:21,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {8829#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:21,961 INFO L272 TraceCheckUtils]: 35: Hoare triple {8829#(<= ~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)); {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:21,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {8829#(<= ~counter~0 3)} ~cond := #in~cond; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:21,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {8829#(<= ~counter~0 3)} assume !(0 == ~cond); {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:21,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {8829#(<= ~counter~0 3)} assume true; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:21,962 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8829#(<= ~counter~0 3)} {8829#(<= ~counter~0 3)} #98#return; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:21,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {8829#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:21,963 INFO L290 TraceCheckUtils]: 41: Hoare triple {8829#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:21,963 INFO L290 TraceCheckUtils]: 42: Hoare triple {8854#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:21,964 INFO L272 TraceCheckUtils]: 43: Hoare triple {8854#(<= ~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)); {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:21,964 INFO L290 TraceCheckUtils]: 44: Hoare triple {8854#(<= ~counter~0 4)} ~cond := #in~cond; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:21,964 INFO L290 TraceCheckUtils]: 45: Hoare triple {8854#(<= ~counter~0 4)} assume !(0 == ~cond); {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:21,965 INFO L290 TraceCheckUtils]: 46: Hoare triple {8854#(<= ~counter~0 4)} assume true; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:21,965 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8854#(<= ~counter~0 4)} {8854#(<= ~counter~0 4)} #98#return; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:21,965 INFO L290 TraceCheckUtils]: 48: Hoare triple {8854#(<= ~counter~0 4)} assume !(~r~0 < 0); {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:21,966 INFO L290 TraceCheckUtils]: 49: Hoare triple {8854#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:21,966 INFO L290 TraceCheckUtils]: 50: Hoare triple {8879#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:21,967 INFO L272 TraceCheckUtils]: 51: Hoare triple {8879#(<= ~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)); {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:21,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {8879#(<= ~counter~0 5)} ~cond := #in~cond; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:21,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {8879#(<= ~counter~0 5)} assume !(0 == ~cond); {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:21,967 INFO L290 TraceCheckUtils]: 54: Hoare triple {8879#(<= ~counter~0 5)} assume true; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:21,968 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8879#(<= ~counter~0 5)} {8879#(<= ~counter~0 5)} #94#return; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:21,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {8879#(<= ~counter~0 5)} assume !!(0 != ~r~0); {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:21,969 INFO L290 TraceCheckUtils]: 57: Hoare triple {8879#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:21,969 INFO L290 TraceCheckUtils]: 58: Hoare triple {8904#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:21,970 INFO L272 TraceCheckUtils]: 59: Hoare triple {8904#(<= ~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)); {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:21,970 INFO L290 TraceCheckUtils]: 60: Hoare triple {8904#(<= ~counter~0 6)} ~cond := #in~cond; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:21,970 INFO L290 TraceCheckUtils]: 61: Hoare triple {8904#(<= ~counter~0 6)} assume !(0 == ~cond); {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:21,970 INFO L290 TraceCheckUtils]: 62: Hoare triple {8904#(<= ~counter~0 6)} assume true; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:21,971 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8904#(<= ~counter~0 6)} {8904#(<= ~counter~0 6)} #96#return; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:21,971 INFO L290 TraceCheckUtils]: 64: Hoare triple {8904#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:21,972 INFO L290 TraceCheckUtils]: 65: Hoare triple {8904#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:21,972 INFO L290 TraceCheckUtils]: 66: Hoare triple {8929#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:21,972 INFO L272 TraceCheckUtils]: 67: Hoare triple {8929#(<= ~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)); {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:21,973 INFO L290 TraceCheckUtils]: 68: Hoare triple {8929#(<= ~counter~0 7)} ~cond := #in~cond; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:21,973 INFO L290 TraceCheckUtils]: 69: Hoare triple {8929#(<= ~counter~0 7)} assume !(0 == ~cond); {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:21,973 INFO L290 TraceCheckUtils]: 70: Hoare triple {8929#(<= ~counter~0 7)} assume true; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:21,974 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8929#(<= ~counter~0 7)} {8929#(<= ~counter~0 7)} #96#return; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:21,974 INFO L290 TraceCheckUtils]: 72: Hoare triple {8929#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:21,974 INFO L290 TraceCheckUtils]: 73: Hoare triple {8929#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8954#(<= |main_#t~post7| 7)} is VALID [2022-04-27 13:17:21,975 INFO L290 TraceCheckUtils]: 74: Hoare triple {8954#(<= |main_#t~post7| 7)} assume !(#t~post7 < 50);havoc #t~post7; {8723#false} is VALID [2022-04-27 13:17:21,975 INFO L290 TraceCheckUtils]: 75: Hoare triple {8723#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8723#false} is VALID [2022-04-27 13:17:21,975 INFO L290 TraceCheckUtils]: 76: Hoare triple {8723#false} assume !!(#t~post8 < 50);havoc #t~post8; {8723#false} is VALID [2022-04-27 13:17:21,975 INFO L272 TraceCheckUtils]: 77: Hoare triple {8723#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8723#false} is VALID [2022-04-27 13:17:21,975 INFO L290 TraceCheckUtils]: 78: Hoare triple {8723#false} ~cond := #in~cond; {8723#false} is VALID [2022-04-27 13:17:21,975 INFO L290 TraceCheckUtils]: 79: Hoare triple {8723#false} assume !(0 == ~cond); {8723#false} is VALID [2022-04-27 13:17:21,975 INFO L290 TraceCheckUtils]: 80: Hoare triple {8723#false} assume true; {8723#false} is VALID [2022-04-27 13:17:21,975 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8723#false} {8723#false} #98#return; {8723#false} is VALID [2022-04-27 13:17:21,975 INFO L290 TraceCheckUtils]: 82: Hoare triple {8723#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8723#false} is VALID [2022-04-27 13:17:21,975 INFO L290 TraceCheckUtils]: 83: Hoare triple {8723#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8723#false} is VALID [2022-04-27 13:17:21,975 INFO L290 TraceCheckUtils]: 84: Hoare triple {8723#false} assume !(#t~post8 < 50);havoc #t~post8; {8723#false} is VALID [2022-04-27 13:17:21,975 INFO L290 TraceCheckUtils]: 85: Hoare triple {8723#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8723#false} is VALID [2022-04-27 13:17:21,976 INFO L290 TraceCheckUtils]: 86: Hoare triple {8723#false} assume !(#t~post6 < 50);havoc #t~post6; {8723#false} is VALID [2022-04-27 13:17:21,976 INFO L272 TraceCheckUtils]: 87: Hoare triple {8723#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8723#false} is VALID [2022-04-27 13:17:21,976 INFO L290 TraceCheckUtils]: 88: Hoare triple {8723#false} ~cond := #in~cond; {8723#false} is VALID [2022-04-27 13:17:21,976 INFO L290 TraceCheckUtils]: 89: Hoare triple {8723#false} assume 0 == ~cond; {8723#false} is VALID [2022-04-27 13:17:21,976 INFO L290 TraceCheckUtils]: 90: Hoare triple {8723#false} assume !false; {8723#false} is VALID [2022-04-27 13:17:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 58 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 13:17:21,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:22,441 INFO L290 TraceCheckUtils]: 90: Hoare triple {8723#false} assume !false; {8723#false} is VALID [2022-04-27 13:17:22,441 INFO L290 TraceCheckUtils]: 89: Hoare triple {8723#false} assume 0 == ~cond; {8723#false} is VALID [2022-04-27 13:17:22,441 INFO L290 TraceCheckUtils]: 88: Hoare triple {8723#false} ~cond := #in~cond; {8723#false} is VALID [2022-04-27 13:17:22,442 INFO L272 TraceCheckUtils]: 87: Hoare triple {8723#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8723#false} is VALID [2022-04-27 13:17:22,442 INFO L290 TraceCheckUtils]: 86: Hoare triple {8723#false} assume !(#t~post6 < 50);havoc #t~post6; {8723#false} is VALID [2022-04-27 13:17:22,442 INFO L290 TraceCheckUtils]: 85: Hoare triple {8723#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8723#false} is VALID [2022-04-27 13:17:22,442 INFO L290 TraceCheckUtils]: 84: Hoare triple {8723#false} assume !(#t~post8 < 50);havoc #t~post8; {8723#false} is VALID [2022-04-27 13:17:22,442 INFO L290 TraceCheckUtils]: 83: Hoare triple {8723#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8723#false} is VALID [2022-04-27 13:17:22,442 INFO L290 TraceCheckUtils]: 82: Hoare triple {8723#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8723#false} is VALID [2022-04-27 13:17:22,442 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8722#true} {8723#false} #98#return; {8723#false} is VALID [2022-04-27 13:17:22,442 INFO L290 TraceCheckUtils]: 80: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:22,442 INFO L290 TraceCheckUtils]: 79: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:22,442 INFO L290 TraceCheckUtils]: 78: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:22,442 INFO L272 TraceCheckUtils]: 77: Hoare triple {8723#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:22,442 INFO L290 TraceCheckUtils]: 76: Hoare triple {8723#false} assume !!(#t~post8 < 50);havoc #t~post8; {8723#false} is VALID [2022-04-27 13:17:22,442 INFO L290 TraceCheckUtils]: 75: Hoare triple {8723#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8723#false} is VALID [2022-04-27 13:17:22,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {9054#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {8723#false} is VALID [2022-04-27 13:17:22,456 INFO L290 TraceCheckUtils]: 73: Hoare triple {9058#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9054#(< |main_#t~post7| 50)} is VALID [2022-04-27 13:17:22,456 INFO L290 TraceCheckUtils]: 72: Hoare triple {9058#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9058#(< ~counter~0 50)} is VALID [2022-04-27 13:17:22,457 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8722#true} {9058#(< ~counter~0 50)} #96#return; {9058#(< ~counter~0 50)} is VALID [2022-04-27 13:17:22,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:22,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:22,457 INFO L290 TraceCheckUtils]: 68: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:22,457 INFO L272 TraceCheckUtils]: 67: Hoare triple {9058#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:22,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {9058#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {9058#(< ~counter~0 50)} is VALID [2022-04-27 13:17:22,458 INFO L290 TraceCheckUtils]: 65: Hoare triple {9083#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9058#(< ~counter~0 50)} is VALID [2022-04-27 13:17:22,458 INFO L290 TraceCheckUtils]: 64: Hoare triple {9083#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9083#(< ~counter~0 49)} is VALID [2022-04-27 13:17:22,458 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8722#true} {9083#(< ~counter~0 49)} #96#return; {9083#(< ~counter~0 49)} is VALID [2022-04-27 13:17:22,459 INFO L290 TraceCheckUtils]: 62: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:22,459 INFO L290 TraceCheckUtils]: 61: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:22,459 INFO L290 TraceCheckUtils]: 60: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:22,459 INFO L272 TraceCheckUtils]: 59: Hoare triple {9083#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:22,459 INFO L290 TraceCheckUtils]: 58: Hoare triple {9083#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {9083#(< ~counter~0 49)} is VALID [2022-04-27 13:17:22,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {9108#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9083#(< ~counter~0 49)} is VALID [2022-04-27 13:17:22,460 INFO L290 TraceCheckUtils]: 56: Hoare triple {9108#(< ~counter~0 48)} assume !!(0 != ~r~0); {9108#(< ~counter~0 48)} is VALID [2022-04-27 13:17:22,460 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8722#true} {9108#(< ~counter~0 48)} #94#return; {9108#(< ~counter~0 48)} is VALID [2022-04-27 13:17:22,460 INFO L290 TraceCheckUtils]: 54: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:22,460 INFO L290 TraceCheckUtils]: 53: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:22,460 INFO L290 TraceCheckUtils]: 52: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:22,461 INFO L272 TraceCheckUtils]: 51: Hoare triple {9108#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:22,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {9108#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {9108#(< ~counter~0 48)} is VALID [2022-04-27 13:17:22,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {9133#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9108#(< ~counter~0 48)} is VALID [2022-04-27 13:17:22,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {9133#(< ~counter~0 47)} assume !(~r~0 < 0); {9133#(< ~counter~0 47)} is VALID [2022-04-27 13:17:22,462 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8722#true} {9133#(< ~counter~0 47)} #98#return; {9133#(< ~counter~0 47)} is VALID [2022-04-27 13:17:22,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:22,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:22,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:22,462 INFO L272 TraceCheckUtils]: 43: Hoare triple {9133#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:22,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {9133#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {9133#(< ~counter~0 47)} is VALID [2022-04-27 13:17:22,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {9158#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9133#(< ~counter~0 47)} is VALID [2022-04-27 13:17:22,463 INFO L290 TraceCheckUtils]: 40: Hoare triple {9158#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9158#(< ~counter~0 46)} is VALID [2022-04-27 13:17:22,464 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8722#true} {9158#(< ~counter~0 46)} #98#return; {9158#(< ~counter~0 46)} is VALID [2022-04-27 13:17:22,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:22,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:22,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:22,464 INFO L272 TraceCheckUtils]: 35: Hoare triple {9158#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:22,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {9158#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {9158#(< ~counter~0 46)} is VALID [2022-04-27 13:17:22,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {9183#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9158#(< ~counter~0 46)} is VALID [2022-04-27 13:17:22,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {9183#(< ~counter~0 45)} assume !(~r~0 > 0); {9183#(< ~counter~0 45)} is VALID [2022-04-27 13:17:22,466 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8722#true} {9183#(< ~counter~0 45)} #96#return; {9183#(< ~counter~0 45)} is VALID [2022-04-27 13:17:22,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:22,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:22,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:22,466 INFO L272 TraceCheckUtils]: 27: Hoare triple {9183#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:22,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {9183#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {9183#(< ~counter~0 45)} is VALID [2022-04-27 13:17:22,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {9208#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9183#(< ~counter~0 45)} is VALID [2022-04-27 13:17:22,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {9208#(< ~counter~0 44)} assume !!(0 != ~r~0); {9208#(< ~counter~0 44)} is VALID [2022-04-27 13:17:22,467 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8722#true} {9208#(< ~counter~0 44)} #94#return; {9208#(< ~counter~0 44)} is VALID [2022-04-27 13:17:22,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:22,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:22,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:22,468 INFO L272 TraceCheckUtils]: 19: Hoare triple {9208#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:22,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {9208#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {9208#(< ~counter~0 44)} is VALID [2022-04-27 13:17:22,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {9233#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9208#(< ~counter~0 44)} is VALID [2022-04-27 13:17:22,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {9233#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9233#(< ~counter~0 43)} is VALID [2022-04-27 13:17:22,469 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8722#true} {9233#(< ~counter~0 43)} #92#return; {9233#(< ~counter~0 43)} is VALID [2022-04-27 13:17:22,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:22,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:22,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:22,469 INFO L272 TraceCheckUtils]: 11: Hoare triple {9233#(< ~counter~0 43)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:22,470 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8722#true} {9233#(< ~counter~0 43)} #90#return; {9233#(< ~counter~0 43)} is VALID [2022-04-27 13:17:22,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:22,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:22,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:22,470 INFO L272 TraceCheckUtils]: 6: Hoare triple {9233#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:22,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {9233#(< ~counter~0 43)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {9233#(< ~counter~0 43)} is VALID [2022-04-27 13:17:22,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {9233#(< ~counter~0 43)} call #t~ret9 := main(); {9233#(< ~counter~0 43)} is VALID [2022-04-27 13:17:22,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9233#(< ~counter~0 43)} {8722#true} #102#return; {9233#(< ~counter~0 43)} is VALID [2022-04-27 13:17:22,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {9233#(< ~counter~0 43)} assume true; {9233#(< ~counter~0 43)} is VALID [2022-04-27 13:17:22,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {8722#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9233#(< ~counter~0 43)} is VALID [2022-04-27 13:17:22,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {8722#true} call ULTIMATE.init(); {8722#true} is VALID [2022-04-27 13:17:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-04-27 13:17:22,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:22,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120245191] [2022-04-27 13:17:22,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:22,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783879487] [2022-04-27 13:17:22,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783879487] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:22,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:22,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-27 13:17:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347369908] [2022-04-27 13:17:22,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:22,473 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) Word has length 91 [2022-04-27 13:17:22,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:22,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-27 13:17:22,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:22,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 13:17:22,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:22,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 13:17:22,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:17:22,569 INFO L87 Difference]: Start difference. First operand 342 states and 469 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-27 13:17:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:24,226 INFO L93 Difference]: Finished difference Result 985 states and 1423 transitions. [2022-04-27 13:17:24,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 13:17:24,226 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) Word has length 91 [2022-04-27 13:17:24,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-27 13:17:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 373 transitions. [2022-04-27 13:17:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-27 13:17:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 373 transitions. [2022-04-27 13:17:24,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 373 transitions. [2022-04-27 13:17:24,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 373 edges. 373 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:24,514 INFO L225 Difference]: With dead ends: 985 [2022-04-27 13:17:24,515 INFO L226 Difference]: Without dead ends: 842 [2022-04-27 13:17:24,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=403, Invalid=719, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 13:17:24,516 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 352 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:24,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 364 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:17:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-04-27 13:17:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 793. [2022-04-27 13:17:24,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:24,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 842 states. Second operand has 793 states, 597 states have (on average 1.2680067001675042) internal successors, (757), 606 states have internal predecessors, (757), 177 states have call successors, (177), 20 states have call predecessors, (177), 18 states have return successors, (175), 166 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:17:24,977 INFO L74 IsIncluded]: Start isIncluded. First operand 842 states. Second operand has 793 states, 597 states have (on average 1.2680067001675042) internal successors, (757), 606 states have internal predecessors, (757), 177 states have call successors, (177), 20 states have call predecessors, (177), 18 states have return successors, (175), 166 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:17:24,978 INFO L87 Difference]: Start difference. First operand 842 states. Second operand has 793 states, 597 states have (on average 1.2680067001675042) internal successors, (757), 606 states have internal predecessors, (757), 177 states have call successors, (177), 20 states have call predecessors, (177), 18 states have return successors, (175), 166 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:17:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:25,008 INFO L93 Difference]: Finished difference Result 842 states and 1155 transitions. [2022-04-27 13:17:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1155 transitions. [2022-04-27 13:17:25,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:25,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:25,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 597 states have (on average 1.2680067001675042) internal successors, (757), 606 states have internal predecessors, (757), 177 states have call successors, (177), 20 states have call predecessors, (177), 18 states have return successors, (175), 166 states have call predecessors, (175), 175 states have call successors, (175) Second operand 842 states. [2022-04-27 13:17:25,026 INFO L87 Difference]: Start difference. First operand has 793 states, 597 states have (on average 1.2680067001675042) internal successors, (757), 606 states have internal predecessors, (757), 177 states have call successors, (177), 20 states have call predecessors, (177), 18 states have return successors, (175), 166 states have call predecessors, (175), 175 states have call successors, (175) Second operand 842 states. [2022-04-27 13:17:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:25,054 INFO L93 Difference]: Finished difference Result 842 states and 1155 transitions. [2022-04-27 13:17:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1155 transitions. [2022-04-27 13:17:25,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:25,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:25,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:25,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 597 states have (on average 1.2680067001675042) internal successors, (757), 606 states have internal predecessors, (757), 177 states have call successors, (177), 20 states have call predecessors, (177), 18 states have return successors, (175), 166 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:17:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1109 transitions. [2022-04-27 13:17:25,094 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1109 transitions. Word has length 91 [2022-04-27 13:17:25,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:25,094 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1109 transitions. [2022-04-27 13:17:25,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-27 13:17:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1109 transitions. [2022-04-27 13:17:25,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-27 13:17:25,098 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:25,098 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:25,127 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-27 13:17:25,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 13:17:25,315 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:25,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:25,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 1 times [2022-04-27 13:17:25,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:25,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064109991] [2022-04-27 13:17:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:25,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:25,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:25,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829375131] [2022-04-27 13:17:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:25,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:25,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:25,341 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-27 13:17:25,342 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-27 13:17:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:25,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 13:17:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:25,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:25,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {13512#true} call ULTIMATE.init(); {13512#true} is VALID [2022-04-27 13:17:25,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {13512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {13520#(<= ~counter~0 0)} assume true; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13520#(<= ~counter~0 0)} {13512#true} #102#return; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {13520#(<= ~counter~0 0)} call #t~ret9 := main(); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {13520#(<= ~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; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {13520#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {13520#(<= ~counter~0 0)} ~cond := #in~cond; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {13520#(<= ~counter~0 0)} assume !(0 == ~cond); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {13520#(<= ~counter~0 0)} assume true; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,834 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13520#(<= ~counter~0 0)} {13520#(<= ~counter~0 0)} #90#return; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,835 INFO L272 TraceCheckUtils]: 11: Hoare triple {13520#(<= ~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)); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {13520#(<= ~counter~0 0)} ~cond := #in~cond; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {13520#(<= ~counter~0 0)} assume !(0 == ~cond); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {13520#(<= ~counter~0 0)} assume true; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,836 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13520#(<= ~counter~0 0)} {13520#(<= ~counter~0 0)} #92#return; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {13520#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:25,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {13520#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:25,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {13569#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:25,837 INFO L272 TraceCheckUtils]: 19: Hoare triple {13569#(<= ~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)); {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:25,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {13569#(<= ~counter~0 1)} ~cond := #in~cond; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:25,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {13569#(<= ~counter~0 1)} assume !(0 == ~cond); {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:25,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {13569#(<= ~counter~0 1)} assume true; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:25,839 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13569#(<= ~counter~0 1)} {13569#(<= ~counter~0 1)} #94#return; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:25,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {13569#(<= ~counter~0 1)} assume !!(0 != ~r~0); {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:25,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {13569#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:25,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {13594#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:25,840 INFO L272 TraceCheckUtils]: 27: Hoare triple {13594#(<= ~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)); {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:25,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {13594#(<= ~counter~0 2)} ~cond := #in~cond; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:25,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {13594#(<= ~counter~0 2)} assume !(0 == ~cond); {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:25,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {13594#(<= ~counter~0 2)} assume true; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:25,841 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13594#(<= ~counter~0 2)} {13594#(<= ~counter~0 2)} #96#return; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:25,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {13594#(<= ~counter~0 2)} assume !(~r~0 > 0); {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:25,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {13594#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:25,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {13619#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:25,843 INFO L272 TraceCheckUtils]: 35: Hoare triple {13619#(<= ~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)); {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:25,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {13619#(<= ~counter~0 3)} ~cond := #in~cond; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:25,843 INFO L290 TraceCheckUtils]: 37: Hoare triple {13619#(<= ~counter~0 3)} assume !(0 == ~cond); {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:25,843 INFO L290 TraceCheckUtils]: 38: Hoare triple {13619#(<= ~counter~0 3)} assume true; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:25,844 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13619#(<= ~counter~0 3)} {13619#(<= ~counter~0 3)} #98#return; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:25,844 INFO L290 TraceCheckUtils]: 40: Hoare triple {13619#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:25,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {13619#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:25,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {13644#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:25,845 INFO L272 TraceCheckUtils]: 43: Hoare triple {13644#(<= ~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)); {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:25,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {13644#(<= ~counter~0 4)} ~cond := #in~cond; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:25,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {13644#(<= ~counter~0 4)} assume !(0 == ~cond); {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:25,846 INFO L290 TraceCheckUtils]: 46: Hoare triple {13644#(<= ~counter~0 4)} assume true; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:25,846 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13644#(<= ~counter~0 4)} {13644#(<= ~counter~0 4)} #98#return; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:25,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {13644#(<= ~counter~0 4)} assume !(~r~0 < 0); {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:25,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {13644#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:25,851 INFO L290 TraceCheckUtils]: 50: Hoare triple {13669#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:25,851 INFO L272 TraceCheckUtils]: 51: Hoare triple {13669#(<= ~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)); {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:25,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {13669#(<= ~counter~0 5)} ~cond := #in~cond; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:25,852 INFO L290 TraceCheckUtils]: 53: Hoare triple {13669#(<= ~counter~0 5)} assume !(0 == ~cond); {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:25,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {13669#(<= ~counter~0 5)} assume true; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:25,852 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13669#(<= ~counter~0 5)} {13669#(<= ~counter~0 5)} #94#return; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:25,853 INFO L290 TraceCheckUtils]: 56: Hoare triple {13669#(<= ~counter~0 5)} assume !!(0 != ~r~0); {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:25,853 INFO L290 TraceCheckUtils]: 57: Hoare triple {13669#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:25,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {13694#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:25,854 INFO L272 TraceCheckUtils]: 59: Hoare triple {13694#(<= ~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)); {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:25,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {13694#(<= ~counter~0 6)} ~cond := #in~cond; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:25,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {13694#(<= ~counter~0 6)} assume !(0 == ~cond); {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:25,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {13694#(<= ~counter~0 6)} assume true; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:25,855 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13694#(<= ~counter~0 6)} {13694#(<= ~counter~0 6)} #96#return; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:25,855 INFO L290 TraceCheckUtils]: 64: Hoare triple {13694#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:25,856 INFO L290 TraceCheckUtils]: 65: Hoare triple {13694#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:25,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {13719#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:25,856 INFO L272 TraceCheckUtils]: 67: Hoare triple {13719#(<= ~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)); {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:25,858 INFO L290 TraceCheckUtils]: 68: Hoare triple {13719#(<= ~counter~0 7)} ~cond := #in~cond; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:25,858 INFO L290 TraceCheckUtils]: 69: Hoare triple {13719#(<= ~counter~0 7)} assume !(0 == ~cond); {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:25,859 INFO L290 TraceCheckUtils]: 70: Hoare triple {13719#(<= ~counter~0 7)} assume true; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:25,859 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13719#(<= ~counter~0 7)} {13719#(<= ~counter~0 7)} #96#return; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:25,859 INFO L290 TraceCheckUtils]: 72: Hoare triple {13719#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:25,860 INFO L290 TraceCheckUtils]: 73: Hoare triple {13719#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:25,860 INFO L290 TraceCheckUtils]: 74: Hoare triple {13744#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:25,861 INFO L272 TraceCheckUtils]: 75: Hoare triple {13744#(<= ~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)); {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:25,861 INFO L290 TraceCheckUtils]: 76: Hoare triple {13744#(<= ~counter~0 8)} ~cond := #in~cond; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:25,861 INFO L290 TraceCheckUtils]: 77: Hoare triple {13744#(<= ~counter~0 8)} assume !(0 == ~cond); {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:25,861 INFO L290 TraceCheckUtils]: 78: Hoare triple {13744#(<= ~counter~0 8)} assume true; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:25,862 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13744#(<= ~counter~0 8)} {13744#(<= ~counter~0 8)} #96#return; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:25,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {13744#(<= ~counter~0 8)} assume !(~r~0 > 0); {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:25,863 INFO L290 TraceCheckUtils]: 81: Hoare triple {13744#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:25,863 INFO L290 TraceCheckUtils]: 82: Hoare triple {13769#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:25,863 INFO L272 TraceCheckUtils]: 83: Hoare triple {13769#(<= ~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)); {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:25,864 INFO L290 TraceCheckUtils]: 84: Hoare triple {13769#(<= ~counter~0 9)} ~cond := #in~cond; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:25,864 INFO L290 TraceCheckUtils]: 85: Hoare triple {13769#(<= ~counter~0 9)} assume !(0 == ~cond); {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:25,864 INFO L290 TraceCheckUtils]: 86: Hoare triple {13769#(<= ~counter~0 9)} assume true; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:25,865 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13769#(<= ~counter~0 9)} {13769#(<= ~counter~0 9)} #98#return; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:25,865 INFO L290 TraceCheckUtils]: 88: Hoare triple {13769#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:25,865 INFO L290 TraceCheckUtils]: 89: Hoare triple {13769#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13794#(<= |main_#t~post8| 9)} is VALID [2022-04-27 13:17:25,865 INFO L290 TraceCheckUtils]: 90: Hoare triple {13794#(<= |main_#t~post8| 9)} assume !(#t~post8 < 50);havoc #t~post8; {13513#false} is VALID [2022-04-27 13:17:25,866 INFO L290 TraceCheckUtils]: 91: Hoare triple {13513#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13513#false} is VALID [2022-04-27 13:17:25,866 INFO L290 TraceCheckUtils]: 92: Hoare triple {13513#false} assume !(#t~post6 < 50);havoc #t~post6; {13513#false} is VALID [2022-04-27 13:17:25,866 INFO L272 TraceCheckUtils]: 93: Hoare triple {13513#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13513#false} is VALID [2022-04-27 13:17:25,866 INFO L290 TraceCheckUtils]: 94: Hoare triple {13513#false} ~cond := #in~cond; {13513#false} is VALID [2022-04-27 13:17:25,866 INFO L290 TraceCheckUtils]: 95: Hoare triple {13513#false} assume 0 == ~cond; {13513#false} is VALID [2022-04-27 13:17:25,866 INFO L290 TraceCheckUtils]: 96: Hoare triple {13513#false} assume !false; {13513#false} is VALID [2022-04-27 13:17:25,866 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-27 13:17:25,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:26,395 INFO L290 TraceCheckUtils]: 96: Hoare triple {13513#false} assume !false; {13513#false} is VALID [2022-04-27 13:17:26,396 INFO L290 TraceCheckUtils]: 95: Hoare triple {13513#false} assume 0 == ~cond; {13513#false} is VALID [2022-04-27 13:17:26,396 INFO L290 TraceCheckUtils]: 94: Hoare triple {13513#false} ~cond := #in~cond; {13513#false} is VALID [2022-04-27 13:17:26,396 INFO L272 TraceCheckUtils]: 93: Hoare triple {13513#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13513#false} is VALID [2022-04-27 13:17:26,396 INFO L290 TraceCheckUtils]: 92: Hoare triple {13513#false} assume !(#t~post6 < 50);havoc #t~post6; {13513#false} is VALID [2022-04-27 13:17:26,396 INFO L290 TraceCheckUtils]: 91: Hoare triple {13513#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13513#false} is VALID [2022-04-27 13:17:26,396 INFO L290 TraceCheckUtils]: 90: Hoare triple {13834#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {13513#false} is VALID [2022-04-27 13:17:26,396 INFO L290 TraceCheckUtils]: 89: Hoare triple {13838#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13834#(< |main_#t~post8| 50)} is VALID [2022-04-27 13:17:26,397 INFO L290 TraceCheckUtils]: 88: Hoare triple {13838#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13838#(< ~counter~0 50)} is VALID [2022-04-27 13:17:26,397 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13512#true} {13838#(< ~counter~0 50)} #98#return; {13838#(< ~counter~0 50)} is VALID [2022-04-27 13:17:26,397 INFO L290 TraceCheckUtils]: 86: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:26,397 INFO L290 TraceCheckUtils]: 85: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:26,397 INFO L290 TraceCheckUtils]: 84: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:26,397 INFO L272 TraceCheckUtils]: 83: Hoare triple {13838#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:26,398 INFO L290 TraceCheckUtils]: 82: Hoare triple {13838#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {13838#(< ~counter~0 50)} is VALID [2022-04-27 13:17:26,398 INFO L290 TraceCheckUtils]: 81: Hoare triple {13863#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13838#(< ~counter~0 50)} is VALID [2022-04-27 13:17:26,399 INFO L290 TraceCheckUtils]: 80: Hoare triple {13863#(< ~counter~0 49)} assume !(~r~0 > 0); {13863#(< ~counter~0 49)} is VALID [2022-04-27 13:17:26,399 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13512#true} {13863#(< ~counter~0 49)} #96#return; {13863#(< ~counter~0 49)} is VALID [2022-04-27 13:17:26,399 INFO L290 TraceCheckUtils]: 78: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:26,399 INFO L290 TraceCheckUtils]: 77: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:26,399 INFO L290 TraceCheckUtils]: 76: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:26,399 INFO L272 TraceCheckUtils]: 75: Hoare triple {13863#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:26,400 INFO L290 TraceCheckUtils]: 74: Hoare triple {13863#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {13863#(< ~counter~0 49)} is VALID [2022-04-27 13:17:26,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {13888#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13863#(< ~counter~0 49)} is VALID [2022-04-27 13:17:26,400 INFO L290 TraceCheckUtils]: 72: Hoare triple {13888#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13888#(< ~counter~0 48)} is VALID [2022-04-27 13:17:26,401 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13512#true} {13888#(< ~counter~0 48)} #96#return; {13888#(< ~counter~0 48)} is VALID [2022-04-27 13:17:26,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:26,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:26,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:26,401 INFO L272 TraceCheckUtils]: 67: Hoare triple {13888#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:26,407 INFO L290 TraceCheckUtils]: 66: Hoare triple {13888#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {13888#(< ~counter~0 48)} is VALID [2022-04-27 13:17:26,431 INFO L290 TraceCheckUtils]: 65: Hoare triple {13913#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13888#(< ~counter~0 48)} is VALID [2022-04-27 13:17:26,431 INFO L290 TraceCheckUtils]: 64: Hoare triple {13913#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13913#(< ~counter~0 47)} is VALID [2022-04-27 13:17:26,432 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13512#true} {13913#(< ~counter~0 47)} #96#return; {13913#(< ~counter~0 47)} is VALID [2022-04-27 13:17:26,432 INFO L290 TraceCheckUtils]: 62: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:26,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:26,432 INFO L290 TraceCheckUtils]: 60: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:26,432 INFO L272 TraceCheckUtils]: 59: Hoare triple {13913#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:26,433 INFO L290 TraceCheckUtils]: 58: Hoare triple {13913#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {13913#(< ~counter~0 47)} is VALID [2022-04-27 13:17:26,433 INFO L290 TraceCheckUtils]: 57: Hoare triple {13938#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13913#(< ~counter~0 47)} is VALID [2022-04-27 13:17:26,434 INFO L290 TraceCheckUtils]: 56: Hoare triple {13938#(< ~counter~0 46)} assume !!(0 != ~r~0); {13938#(< ~counter~0 46)} is VALID [2022-04-27 13:17:26,434 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13512#true} {13938#(< ~counter~0 46)} #94#return; {13938#(< ~counter~0 46)} is VALID [2022-04-27 13:17:26,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:26,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:26,434 INFO L290 TraceCheckUtils]: 52: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:26,434 INFO L272 TraceCheckUtils]: 51: Hoare triple {13938#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:26,435 INFO L290 TraceCheckUtils]: 50: Hoare triple {13938#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {13938#(< ~counter~0 46)} is VALID [2022-04-27 13:17:26,435 INFO L290 TraceCheckUtils]: 49: Hoare triple {13963#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13938#(< ~counter~0 46)} is VALID [2022-04-27 13:17:26,436 INFO L290 TraceCheckUtils]: 48: Hoare triple {13963#(< ~counter~0 45)} assume !(~r~0 < 0); {13963#(< ~counter~0 45)} is VALID [2022-04-27 13:17:26,436 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13512#true} {13963#(< ~counter~0 45)} #98#return; {13963#(< ~counter~0 45)} is VALID [2022-04-27 13:17:26,436 INFO L290 TraceCheckUtils]: 46: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:26,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:26,436 INFO L290 TraceCheckUtils]: 44: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:26,436 INFO L272 TraceCheckUtils]: 43: Hoare triple {13963#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:26,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {13963#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {13963#(< ~counter~0 45)} is VALID [2022-04-27 13:17:26,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {13988#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13963#(< ~counter~0 45)} is VALID [2022-04-27 13:17:26,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {13988#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13988#(< ~counter~0 44)} is VALID [2022-04-27 13:17:26,438 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13512#true} {13988#(< ~counter~0 44)} #98#return; {13988#(< ~counter~0 44)} is VALID [2022-04-27 13:17:26,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:26,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:26,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:26,438 INFO L272 TraceCheckUtils]: 35: Hoare triple {13988#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:26,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {13988#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {13988#(< ~counter~0 44)} is VALID [2022-04-27 13:17:26,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {14013#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13988#(< ~counter~0 44)} is VALID [2022-04-27 13:17:26,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {14013#(< ~counter~0 43)} assume !(~r~0 > 0); {14013#(< ~counter~0 43)} is VALID [2022-04-27 13:17:26,440 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13512#true} {14013#(< ~counter~0 43)} #96#return; {14013#(< ~counter~0 43)} is VALID [2022-04-27 13:17:26,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:26,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:26,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:26,440 INFO L272 TraceCheckUtils]: 27: Hoare triple {14013#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:26,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {14013#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {14013#(< ~counter~0 43)} is VALID [2022-04-27 13:17:26,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {14038#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14013#(< ~counter~0 43)} is VALID [2022-04-27 13:17:26,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {14038#(< ~counter~0 42)} assume !!(0 != ~r~0); {14038#(< ~counter~0 42)} is VALID [2022-04-27 13:17:26,442 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13512#true} {14038#(< ~counter~0 42)} #94#return; {14038#(< ~counter~0 42)} is VALID [2022-04-27 13:17:26,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:26,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:26,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:26,442 INFO L272 TraceCheckUtils]: 19: Hoare triple {14038#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:26,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {14038#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {14038#(< ~counter~0 42)} is VALID [2022-04-27 13:17:26,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {14063#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14038#(< ~counter~0 42)} is VALID [2022-04-27 13:17:26,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {14063#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14063#(< ~counter~0 41)} is VALID [2022-04-27 13:17:26,444 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13512#true} {14063#(< ~counter~0 41)} #92#return; {14063#(< ~counter~0 41)} is VALID [2022-04-27 13:17:26,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:26,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:26,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:26,444 INFO L272 TraceCheckUtils]: 11: Hoare triple {14063#(< ~counter~0 41)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:26,445 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13512#true} {14063#(< ~counter~0 41)} #90#return; {14063#(< ~counter~0 41)} is VALID [2022-04-27 13:17:26,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:26,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:26,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:26,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {14063#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:26,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {14063#(< ~counter~0 41)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {14063#(< ~counter~0 41)} is VALID [2022-04-27 13:17:26,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {14063#(< ~counter~0 41)} call #t~ret9 := main(); {14063#(< ~counter~0 41)} is VALID [2022-04-27 13:17:26,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14063#(< ~counter~0 41)} {13512#true} #102#return; {14063#(< ~counter~0 41)} is VALID [2022-04-27 13:17:26,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {14063#(< ~counter~0 41)} assume true; {14063#(< ~counter~0 41)} is VALID [2022-04-27 13:17:26,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {13512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14063#(< ~counter~0 41)} is VALID [2022-04-27 13:17:26,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {13512#true} call ULTIMATE.init(); {13512#true} is VALID [2022-04-27 13:17:26,447 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-27 13:17:26,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:26,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064109991] [2022-04-27 13:17:26,448 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:26,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829375131] [2022-04-27 13:17:26,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829375131] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:26,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:26,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-27 13:17:26,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185758076] [2022-04-27 13:17:26,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:26,449 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) Word has length 97 [2022-04-27 13:17:26,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:26,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-27 13:17:26,554 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-27 13:17:26,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 13:17:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:26,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 13:17:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-27 13:17:26,555 INFO L87 Difference]: Start difference. First operand 793 states and 1109 transitions. Second operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-27 13:17:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:28,845 INFO L93 Difference]: Finished difference Result 1285 states and 1799 transitions. [2022-04-27 13:17:28,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-27 13:17:28,846 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) Word has length 97 [2022-04-27 13:17:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-27 13:17:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-27 13:17:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-27 13:17:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-27 13:17:28,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 467 transitions. [2022-04-27 13:17:29,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:29,226 INFO L225 Difference]: With dead ends: 1285 [2022-04-27 13:17:29,226 INFO L226 Difference]: Without dead ends: 795 [2022-04-27 13:17:29,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=584, Invalid=1056, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 13:17:29,228 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 597 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:29,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 507 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 13:17:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-27 13:17:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 740. [2022-04-27 13:17:29,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:29,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 740 states, 553 states have (on average 1.2206148282097649) internal successors, (675), 557 states have internal predecessors, (675), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 158 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:29,633 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 740 states, 553 states have (on average 1.2206148282097649) internal successors, (675), 557 states have internal predecessors, (675), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 158 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:29,633 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 740 states, 553 states have (on average 1.2206148282097649) internal successors, (675), 557 states have internal predecessors, (675), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 158 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:29,661 INFO L93 Difference]: Finished difference Result 795 states and 1047 transitions. [2022-04-27 13:17:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1047 transitions. [2022-04-27 13:17:29,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:29,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:29,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 740 states, 553 states have (on average 1.2206148282097649) internal successors, (675), 557 states have internal predecessors, (675), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 158 states have call predecessors, (162), 162 states have call successors, (162) Second operand 795 states. [2022-04-27 13:17:29,664 INFO L87 Difference]: Start difference. First operand has 740 states, 553 states have (on average 1.2206148282097649) internal successors, (675), 557 states have internal predecessors, (675), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 158 states have call predecessors, (162), 162 states have call successors, (162) Second operand 795 states. [2022-04-27 13:17:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:29,691 INFO L93 Difference]: Finished difference Result 795 states and 1047 transitions. [2022-04-27 13:17:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1047 transitions. [2022-04-27 13:17:29,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:29,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:29,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:29,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 553 states have (on average 1.2206148282097649) internal successors, (675), 557 states have internal predecessors, (675), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 158 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1001 transitions. [2022-04-27 13:17:29,748 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1001 transitions. Word has length 97 [2022-04-27 13:17:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:29,748 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1001 transitions. [2022-04-27 13:17:29,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-27 13:17:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1001 transitions. [2022-04-27 13:17:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-27 13:17:29,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:29,750 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:29,781 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-27 13:17:29,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 13:17:29,967 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:29,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 1 times [2022-04-27 13:17:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:29,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716200832] [2022-04-27 13:17:29,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:29,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:29,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075272858] [2022-04-27 13:17:29,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:29,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:29,986 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-27 13:17:29,987 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-27 13:17:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:30,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 13:17:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:30,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:30,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {18581#true} call ULTIMATE.init(); {18581#true} is VALID [2022-04-27 13:17:30,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {18581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {18589#(<= ~counter~0 0)} assume true; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18589#(<= ~counter~0 0)} {18581#true} #102#return; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {18589#(<= ~counter~0 0)} call #t~ret9 := main(); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {18589#(<= ~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; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {18589#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {18589#(<= ~counter~0 0)} ~cond := #in~cond; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {18589#(<= ~counter~0 0)} assume !(0 == ~cond); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {18589#(<= ~counter~0 0)} assume true; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18589#(<= ~counter~0 0)} {18589#(<= ~counter~0 0)} #90#return; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,524 INFO L272 TraceCheckUtils]: 11: Hoare triple {18589#(<= ~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)); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {18589#(<= ~counter~0 0)} ~cond := #in~cond; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {18589#(<= ~counter~0 0)} assume !(0 == ~cond); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {18589#(<= ~counter~0 0)} assume true; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,525 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18589#(<= ~counter~0 0)} {18589#(<= ~counter~0 0)} #92#return; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {18589#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:30,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {18589#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:30,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {18638#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:30,526 INFO L272 TraceCheckUtils]: 19: Hoare triple {18638#(<= ~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)); {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:30,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {18638#(<= ~counter~0 1)} ~cond := #in~cond; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:30,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {18638#(<= ~counter~0 1)} assume !(0 == ~cond); {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:30,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {18638#(<= ~counter~0 1)} assume true; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:30,527 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18638#(<= ~counter~0 1)} {18638#(<= ~counter~0 1)} #94#return; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:30,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {18638#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:30,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {18638#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:30,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {18663#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:30,529 INFO L272 TraceCheckUtils]: 27: Hoare triple {18663#(<= ~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)); {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:30,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {18663#(<= ~counter~0 2)} ~cond := #in~cond; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:30,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {18663#(<= ~counter~0 2)} assume !(0 == ~cond); {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:30,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {18663#(<= ~counter~0 2)} assume true; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:30,530 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18663#(<= ~counter~0 2)} {18663#(<= ~counter~0 2)} #96#return; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:30,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {18663#(<= ~counter~0 2)} assume !(~r~0 > 0); {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:30,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {18663#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:30,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {18688#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:30,531 INFO L272 TraceCheckUtils]: 35: Hoare triple {18688#(<= ~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)); {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:30,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {18688#(<= ~counter~0 3)} ~cond := #in~cond; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:30,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {18688#(<= ~counter~0 3)} assume !(0 == ~cond); {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:30,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {18688#(<= ~counter~0 3)} assume true; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:30,533 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18688#(<= ~counter~0 3)} {18688#(<= ~counter~0 3)} #98#return; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:30,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {18688#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:30,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {18688#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:30,534 INFO L290 TraceCheckUtils]: 42: Hoare triple {18713#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:30,534 INFO L272 TraceCheckUtils]: 43: Hoare triple {18713#(<= ~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)); {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:30,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {18713#(<= ~counter~0 4)} ~cond := #in~cond; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:30,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {18713#(<= ~counter~0 4)} assume !(0 == ~cond); {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:30,535 INFO L290 TraceCheckUtils]: 46: Hoare triple {18713#(<= ~counter~0 4)} assume true; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:30,535 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18713#(<= ~counter~0 4)} {18713#(<= ~counter~0 4)} #98#return; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:30,536 INFO L290 TraceCheckUtils]: 48: Hoare triple {18713#(<= ~counter~0 4)} assume !(~r~0 < 0); {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:30,536 INFO L290 TraceCheckUtils]: 49: Hoare triple {18713#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:30,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {18738#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:30,537 INFO L272 TraceCheckUtils]: 51: Hoare triple {18738#(<= ~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)); {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:30,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {18738#(<= ~counter~0 5)} ~cond := #in~cond; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:30,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {18738#(<= ~counter~0 5)} assume !(0 == ~cond); {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:30,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {18738#(<= ~counter~0 5)} assume true; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:30,538 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18738#(<= ~counter~0 5)} {18738#(<= ~counter~0 5)} #94#return; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:30,538 INFO L290 TraceCheckUtils]: 56: Hoare triple {18738#(<= ~counter~0 5)} assume !!(0 != ~r~0); {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:30,539 INFO L290 TraceCheckUtils]: 57: Hoare triple {18738#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:30,539 INFO L290 TraceCheckUtils]: 58: Hoare triple {18763#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:30,539 INFO L272 TraceCheckUtils]: 59: Hoare triple {18763#(<= ~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)); {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:30,540 INFO L290 TraceCheckUtils]: 60: Hoare triple {18763#(<= ~counter~0 6)} ~cond := #in~cond; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:30,540 INFO L290 TraceCheckUtils]: 61: Hoare triple {18763#(<= ~counter~0 6)} assume !(0 == ~cond); {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:30,540 INFO L290 TraceCheckUtils]: 62: Hoare triple {18763#(<= ~counter~0 6)} assume true; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:30,540 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18763#(<= ~counter~0 6)} {18763#(<= ~counter~0 6)} #96#return; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:30,541 INFO L290 TraceCheckUtils]: 64: Hoare triple {18763#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:30,541 INFO L290 TraceCheckUtils]: 65: Hoare triple {18763#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:30,541 INFO L290 TraceCheckUtils]: 66: Hoare triple {18788#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:30,542 INFO L272 TraceCheckUtils]: 67: Hoare triple {18788#(<= ~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)); {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:30,542 INFO L290 TraceCheckUtils]: 68: Hoare triple {18788#(<= ~counter~0 7)} ~cond := #in~cond; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:30,542 INFO L290 TraceCheckUtils]: 69: Hoare triple {18788#(<= ~counter~0 7)} assume !(0 == ~cond); {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:30,543 INFO L290 TraceCheckUtils]: 70: Hoare triple {18788#(<= ~counter~0 7)} assume true; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:30,543 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18788#(<= ~counter~0 7)} {18788#(<= ~counter~0 7)} #96#return; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:30,543 INFO L290 TraceCheckUtils]: 72: Hoare triple {18788#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:30,544 INFO L290 TraceCheckUtils]: 73: Hoare triple {18788#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:30,544 INFO L290 TraceCheckUtils]: 74: Hoare triple {18813#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:30,544 INFO L272 TraceCheckUtils]: 75: Hoare triple {18813#(<= ~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)); {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:30,545 INFO L290 TraceCheckUtils]: 76: Hoare triple {18813#(<= ~counter~0 8)} ~cond := #in~cond; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:30,545 INFO L290 TraceCheckUtils]: 77: Hoare triple {18813#(<= ~counter~0 8)} assume !(0 == ~cond); {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:30,545 INFO L290 TraceCheckUtils]: 78: Hoare triple {18813#(<= ~counter~0 8)} assume true; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:30,546 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18813#(<= ~counter~0 8)} {18813#(<= ~counter~0 8)} #96#return; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:30,546 INFO L290 TraceCheckUtils]: 80: Hoare triple {18813#(<= ~counter~0 8)} assume !(~r~0 > 0); {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:30,546 INFO L290 TraceCheckUtils]: 81: Hoare triple {18813#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:30,547 INFO L290 TraceCheckUtils]: 82: Hoare triple {18838#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:30,547 INFO L272 TraceCheckUtils]: 83: Hoare triple {18838#(<= ~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)); {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:30,547 INFO L290 TraceCheckUtils]: 84: Hoare triple {18838#(<= ~counter~0 9)} ~cond := #in~cond; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:30,548 INFO L290 TraceCheckUtils]: 85: Hoare triple {18838#(<= ~counter~0 9)} assume !(0 == ~cond); {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:30,548 INFO L290 TraceCheckUtils]: 86: Hoare triple {18838#(<= ~counter~0 9)} assume true; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:30,548 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18838#(<= ~counter~0 9)} {18838#(<= ~counter~0 9)} #98#return; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:30,549 INFO L290 TraceCheckUtils]: 88: Hoare triple {18838#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:30,549 INFO L290 TraceCheckUtils]: 89: Hoare triple {18838#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:30,549 INFO L290 TraceCheckUtils]: 90: Hoare triple {18863#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:30,550 INFO L272 TraceCheckUtils]: 91: Hoare triple {18863#(<= ~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)); {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:30,550 INFO L290 TraceCheckUtils]: 92: Hoare triple {18863#(<= ~counter~0 10)} ~cond := #in~cond; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:30,550 INFO L290 TraceCheckUtils]: 93: Hoare triple {18863#(<= ~counter~0 10)} assume !(0 == ~cond); {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:30,550 INFO L290 TraceCheckUtils]: 94: Hoare triple {18863#(<= ~counter~0 10)} assume true; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:30,551 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18863#(<= ~counter~0 10)} {18863#(<= ~counter~0 10)} #98#return; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:30,551 INFO L290 TraceCheckUtils]: 96: Hoare triple {18863#(<= ~counter~0 10)} assume !(~r~0 < 0); {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:30,551 INFO L290 TraceCheckUtils]: 97: Hoare triple {18863#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18888#(<= |main_#t~post6| 10)} is VALID [2022-04-27 13:17:30,552 INFO L290 TraceCheckUtils]: 98: Hoare triple {18888#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {18582#false} is VALID [2022-04-27 13:17:30,552 INFO L272 TraceCheckUtils]: 99: Hoare triple {18582#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18582#false} is VALID [2022-04-27 13:17:30,552 INFO L290 TraceCheckUtils]: 100: Hoare triple {18582#false} ~cond := #in~cond; {18582#false} is VALID [2022-04-27 13:17:30,552 INFO L290 TraceCheckUtils]: 101: Hoare triple {18582#false} assume 0 == ~cond; {18582#false} is VALID [2022-04-27 13:17:30,552 INFO L290 TraceCheckUtils]: 102: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-27 13:17:30,552 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-27 13:17:30,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:31,086 INFO L290 TraceCheckUtils]: 102: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-27 13:17:31,087 INFO L290 TraceCheckUtils]: 101: Hoare triple {18582#false} assume 0 == ~cond; {18582#false} is VALID [2022-04-27 13:17:31,087 INFO L290 TraceCheckUtils]: 100: Hoare triple {18582#false} ~cond := #in~cond; {18582#false} is VALID [2022-04-27 13:17:31,087 INFO L272 TraceCheckUtils]: 99: Hoare triple {18582#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18582#false} is VALID [2022-04-27 13:17:31,087 INFO L290 TraceCheckUtils]: 98: Hoare triple {18916#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {18582#false} is VALID [2022-04-27 13:17:31,087 INFO L290 TraceCheckUtils]: 97: Hoare triple {18920#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18916#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:17:31,088 INFO L290 TraceCheckUtils]: 96: Hoare triple {18920#(< ~counter~0 50)} assume !(~r~0 < 0); {18920#(< ~counter~0 50)} is VALID [2022-04-27 13:17:31,088 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18581#true} {18920#(< ~counter~0 50)} #98#return; {18920#(< ~counter~0 50)} is VALID [2022-04-27 13:17:31,088 INFO L290 TraceCheckUtils]: 94: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:31,088 INFO L290 TraceCheckUtils]: 93: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:31,088 INFO L290 TraceCheckUtils]: 92: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:31,088 INFO L272 TraceCheckUtils]: 91: Hoare triple {18920#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:31,089 INFO L290 TraceCheckUtils]: 90: Hoare triple {18920#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {18920#(< ~counter~0 50)} is VALID [2022-04-27 13:17:31,089 INFO L290 TraceCheckUtils]: 89: Hoare triple {18945#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18920#(< ~counter~0 50)} is VALID [2022-04-27 13:17:31,089 INFO L290 TraceCheckUtils]: 88: Hoare triple {18945#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18945#(< ~counter~0 49)} is VALID [2022-04-27 13:17:31,090 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18581#true} {18945#(< ~counter~0 49)} #98#return; {18945#(< ~counter~0 49)} is VALID [2022-04-27 13:17:31,090 INFO L290 TraceCheckUtils]: 86: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:31,090 INFO L290 TraceCheckUtils]: 85: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:31,090 INFO L290 TraceCheckUtils]: 84: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:31,090 INFO L272 TraceCheckUtils]: 83: Hoare triple {18945#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:31,090 INFO L290 TraceCheckUtils]: 82: Hoare triple {18945#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {18945#(< ~counter~0 49)} is VALID [2022-04-27 13:17:31,091 INFO L290 TraceCheckUtils]: 81: Hoare triple {18970#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18945#(< ~counter~0 49)} is VALID [2022-04-27 13:17:31,091 INFO L290 TraceCheckUtils]: 80: Hoare triple {18970#(< ~counter~0 48)} assume !(~r~0 > 0); {18970#(< ~counter~0 48)} is VALID [2022-04-27 13:17:31,092 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18581#true} {18970#(< ~counter~0 48)} #96#return; {18970#(< ~counter~0 48)} is VALID [2022-04-27 13:17:31,092 INFO L290 TraceCheckUtils]: 78: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:31,092 INFO L290 TraceCheckUtils]: 77: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:31,092 INFO L290 TraceCheckUtils]: 76: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:31,092 INFO L272 TraceCheckUtils]: 75: Hoare triple {18970#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:31,092 INFO L290 TraceCheckUtils]: 74: Hoare triple {18970#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {18970#(< ~counter~0 48)} is VALID [2022-04-27 13:17:31,092 INFO L290 TraceCheckUtils]: 73: Hoare triple {18995#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18970#(< ~counter~0 48)} is VALID [2022-04-27 13:17:31,093 INFO L290 TraceCheckUtils]: 72: Hoare triple {18995#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18995#(< ~counter~0 47)} is VALID [2022-04-27 13:17:31,093 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18581#true} {18995#(< ~counter~0 47)} #96#return; {18995#(< ~counter~0 47)} is VALID [2022-04-27 13:17:31,093 INFO L290 TraceCheckUtils]: 70: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:31,093 INFO L290 TraceCheckUtils]: 69: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:31,093 INFO L290 TraceCheckUtils]: 68: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:31,093 INFO L272 TraceCheckUtils]: 67: Hoare triple {18995#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:31,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {18995#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {18995#(< ~counter~0 47)} is VALID [2022-04-27 13:17:31,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {19020#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18995#(< ~counter~0 47)} is VALID [2022-04-27 13:17:31,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {19020#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19020#(< ~counter~0 46)} is VALID [2022-04-27 13:17:31,095 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18581#true} {19020#(< ~counter~0 46)} #96#return; {19020#(< ~counter~0 46)} is VALID [2022-04-27 13:17:31,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:31,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:31,095 INFO L290 TraceCheckUtils]: 60: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:31,095 INFO L272 TraceCheckUtils]: 59: Hoare triple {19020#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:31,095 INFO L290 TraceCheckUtils]: 58: Hoare triple {19020#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {19020#(< ~counter~0 46)} is VALID [2022-04-27 13:17:31,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {19045#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19020#(< ~counter~0 46)} is VALID [2022-04-27 13:17:31,096 INFO L290 TraceCheckUtils]: 56: Hoare triple {19045#(< ~counter~0 45)} assume !!(0 != ~r~0); {19045#(< ~counter~0 45)} is VALID [2022-04-27 13:17:31,096 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18581#true} {19045#(< ~counter~0 45)} #94#return; {19045#(< ~counter~0 45)} is VALID [2022-04-27 13:17:31,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:31,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:31,097 INFO L290 TraceCheckUtils]: 52: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:31,097 INFO L272 TraceCheckUtils]: 51: Hoare triple {19045#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:31,097 INFO L290 TraceCheckUtils]: 50: Hoare triple {19045#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {19045#(< ~counter~0 45)} is VALID [2022-04-27 13:17:31,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {19070#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19045#(< ~counter~0 45)} is VALID [2022-04-27 13:17:31,098 INFO L290 TraceCheckUtils]: 48: Hoare triple {19070#(< ~counter~0 44)} assume !(~r~0 < 0); {19070#(< ~counter~0 44)} is VALID [2022-04-27 13:17:31,098 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18581#true} {19070#(< ~counter~0 44)} #98#return; {19070#(< ~counter~0 44)} is VALID [2022-04-27 13:17:31,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:31,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:31,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:31,098 INFO L272 TraceCheckUtils]: 43: Hoare triple {19070#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:31,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {19070#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {19070#(< ~counter~0 44)} is VALID [2022-04-27 13:17:31,102 INFO L290 TraceCheckUtils]: 41: Hoare triple {19095#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19070#(< ~counter~0 44)} is VALID [2022-04-27 13:17:31,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {19095#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19095#(< ~counter~0 43)} is VALID [2022-04-27 13:17:31,102 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18581#true} {19095#(< ~counter~0 43)} #98#return; {19095#(< ~counter~0 43)} is VALID [2022-04-27 13:17:31,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:31,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:31,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:31,103 INFO L272 TraceCheckUtils]: 35: Hoare triple {19095#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:31,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {19095#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {19095#(< ~counter~0 43)} is VALID [2022-04-27 13:17:31,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {19120#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19095#(< ~counter~0 43)} is VALID [2022-04-27 13:17:31,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {19120#(< ~counter~0 42)} assume !(~r~0 > 0); {19120#(< ~counter~0 42)} is VALID [2022-04-27 13:17:31,104 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18581#true} {19120#(< ~counter~0 42)} #96#return; {19120#(< ~counter~0 42)} is VALID [2022-04-27 13:17:31,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:31,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:31,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:31,104 INFO L272 TraceCheckUtils]: 27: Hoare triple {19120#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:31,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {19120#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {19120#(< ~counter~0 42)} is VALID [2022-04-27 13:17:31,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {19145#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19120#(< ~counter~0 42)} is VALID [2022-04-27 13:17:31,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {19145#(< ~counter~0 41)} assume !!(0 != ~r~0); {19145#(< ~counter~0 41)} is VALID [2022-04-27 13:17:31,106 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18581#true} {19145#(< ~counter~0 41)} #94#return; {19145#(< ~counter~0 41)} is VALID [2022-04-27 13:17:31,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:31,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:31,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:31,106 INFO L272 TraceCheckUtils]: 19: Hoare triple {19145#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:31,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {19145#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {19145#(< ~counter~0 41)} is VALID [2022-04-27 13:17:31,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {19170#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19145#(< ~counter~0 41)} is VALID [2022-04-27 13:17:31,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {19170#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19170#(< ~counter~0 40)} is VALID [2022-04-27 13:17:31,107 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18581#true} {19170#(< ~counter~0 40)} #92#return; {19170#(< ~counter~0 40)} is VALID [2022-04-27 13:17:31,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:31,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:31,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:31,108 INFO L272 TraceCheckUtils]: 11: Hoare triple {19170#(< ~counter~0 40)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:31,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18581#true} {19170#(< ~counter~0 40)} #90#return; {19170#(< ~counter~0 40)} is VALID [2022-04-27 13:17:31,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:31,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:31,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:31,112 INFO L272 TraceCheckUtils]: 6: Hoare triple {19170#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:31,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {19170#(< ~counter~0 40)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {19170#(< ~counter~0 40)} is VALID [2022-04-27 13:17:31,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {19170#(< ~counter~0 40)} call #t~ret9 := main(); {19170#(< ~counter~0 40)} is VALID [2022-04-27 13:17:31,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19170#(< ~counter~0 40)} {18581#true} #102#return; {19170#(< ~counter~0 40)} is VALID [2022-04-27 13:17:31,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {19170#(< ~counter~0 40)} assume true; {19170#(< ~counter~0 40)} is VALID [2022-04-27 13:17:31,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {18581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19170#(< ~counter~0 40)} is VALID [2022-04-27 13:17:31,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {18581#true} call ULTIMATE.init(); {18581#true} is VALID [2022-04-27 13:17:31,113 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-27 13:17:31,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:31,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716200832] [2022-04-27 13:17:31,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:31,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075272858] [2022-04-27 13:17:31,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075272858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:31,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:31,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-27 13:17:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397637909] [2022-04-27 13:17:31,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:31,115 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 103 [2022-04-27 13:17:31,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:31,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:17:31,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:31,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 13:17:31,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:31,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 13:17:31,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-27 13:17:31,242 INFO L87 Difference]: Start difference. First operand 740 states and 1001 transitions. Second operand has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:17:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:33,559 INFO L93 Difference]: Finished difference Result 850 states and 1161 transitions. [2022-04-27 13:17:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 13:17:33,559 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 103 [2022-04-27 13:17:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:17:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 452 transitions. [2022-04-27 13:17:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:17:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 452 transitions. [2022-04-27 13:17:33,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 452 transitions. [2022-04-27 13:17:33,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:33,929 INFO L225 Difference]: With dead ends: 850 [2022-04-27 13:17:33,929 INFO L226 Difference]: Without dead ends: 845 [2022-04-27 13:17:33,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=670, Invalid=1222, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 13:17:33,930 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 485 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:33,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 549 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 13:17:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-04-27 13:17:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 830. [2022-04-27 13:17:34,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:34,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 830 states, 621 states have (on average 1.1996779388083736) internal successors, (745), 627 states have internal predecessors, (745), 184 states have call successors, (184), 26 states have call predecessors, (184), 24 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2022-04-27 13:17:34,418 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 830 states, 621 states have (on average 1.1996779388083736) internal successors, (745), 627 states have internal predecessors, (745), 184 states have call successors, (184), 26 states have call predecessors, (184), 24 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2022-04-27 13:17:34,419 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 830 states, 621 states have (on average 1.1996779388083736) internal successors, (745), 627 states have internal predecessors, (745), 184 states have call successors, (184), 26 states have call predecessors, (184), 24 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2022-04-27 13:17:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:34,444 INFO L93 Difference]: Finished difference Result 845 states and 1130 transitions. [2022-04-27 13:17:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1130 transitions. [2022-04-27 13:17:34,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:34,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:34,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 830 states, 621 states have (on average 1.1996779388083736) internal successors, (745), 627 states have internal predecessors, (745), 184 states have call successors, (184), 26 states have call predecessors, (184), 24 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) Second operand 845 states. [2022-04-27 13:17:34,448 INFO L87 Difference]: Start difference. First operand has 830 states, 621 states have (on average 1.1996779388083736) internal successors, (745), 627 states have internal predecessors, (745), 184 states have call successors, (184), 26 states have call predecessors, (184), 24 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) Second operand 845 states. [2022-04-27 13:17:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:34,472 INFO L93 Difference]: Finished difference Result 845 states and 1130 transitions. [2022-04-27 13:17:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1130 transitions. [2022-04-27 13:17:34,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:34,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:34,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:34,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 621 states have (on average 1.1996779388083736) internal successors, (745), 627 states have internal predecessors, (745), 184 states have call successors, (184), 26 states have call predecessors, (184), 24 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2022-04-27 13:17:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1111 transitions. [2022-04-27 13:17:34,506 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1111 transitions. Word has length 103 [2022-04-27 13:17:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:34,506 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1111 transitions. [2022-04-27 13:17:34,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:17:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1111 transitions. [2022-04-27 13:17:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-27 13:17:34,509 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:34,509 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 9, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:34,543 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-27 13:17:34,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:34,740 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:34,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:34,740 INFO L85 PathProgramCache]: Analyzing trace with hash -599363247, now seen corresponding path program 3 times [2022-04-27 13:17:34,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:34,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675330932] [2022-04-27 13:17:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:34,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:34,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:34,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156795090] [2022-04-27 13:17:34,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:17:34,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:34,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:34,767 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-27 13:17:34,768 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-27 13:17:34,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 13:17:34,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:34,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 13:17:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:34,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:35,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {23302#true} call ULTIMATE.init(); {23302#true} is VALID [2022-04-27 13:17:35,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {23302#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23302#true} is VALID [2022-04-27 13:17:35,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23302#true} {23302#true} #102#return; {23302#true} is VALID [2022-04-27 13:17:35,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {23302#true} call #t~ret9 := main(); {23302#true} is VALID [2022-04-27 13:17:35,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {23302#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; {23302#true} is VALID [2022-04-27 13:17:35,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {23302#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23302#true} is VALID [2022-04-27 13:17:35,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,155 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23302#true} {23302#true} #90#return; {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L272 TraceCheckUtils]: 11: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23302#true} {23302#true} #92#return; {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {23302#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {23302#true} assume !!(#t~post6 < 50);havoc #t~post6; {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L272 TraceCheckUtils]: 19: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {23302#true} assume !!(#t~post7 < 50);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L272 TraceCheckUtils]: 27: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {23302#true} assume !(~r~0 > 0); {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {23302#true} assume !!(#t~post8 < 50);havoc #t~post8; {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L272 TraceCheckUtils]: 35: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {23302#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {23302#true} assume !!(#t~post8 < 50);havoc #t~post8; {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L272 TraceCheckUtils]: 43: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,157 INFO L290 TraceCheckUtils]: 45: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {23302#true} assume !(~r~0 < 0); {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 50: Hoare triple {23302#true} assume !!(#t~post6 < 50);havoc #t~post6; {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L272 TraceCheckUtils]: 51: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 58: Hoare triple {23302#true} assume !!(#t~post7 < 50);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L272 TraceCheckUtils]: 59: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 60: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L290 TraceCheckUtils]: 64: Hoare triple {23302#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L290 TraceCheckUtils]: 66: Hoare triple {23302#true} assume !!(#t~post7 < 50);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L272 TraceCheckUtils]: 67: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L290 TraceCheckUtils]: 68: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L290 TraceCheckUtils]: 69: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L290 TraceCheckUtils]: 70: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L290 TraceCheckUtils]: 72: Hoare triple {23302#true} assume !(~r~0 > 0); {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L290 TraceCheckUtils]: 73: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L290 TraceCheckUtils]: 74: Hoare triple {23302#true} assume !!(#t~post8 < 50);havoc #t~post8; {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L272 TraceCheckUtils]: 75: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L290 TraceCheckUtils]: 76: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,159 INFO L290 TraceCheckUtils]: 77: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L290 TraceCheckUtils]: 78: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L290 TraceCheckUtils]: 80: Hoare triple {23302#true} assume !(~r~0 < 0); {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L290 TraceCheckUtils]: 81: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L290 TraceCheckUtils]: 82: Hoare triple {23302#true} assume !!(#t~post6 < 50);havoc #t~post6; {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L272 TraceCheckUtils]: 83: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L290 TraceCheckUtils]: 84: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L290 TraceCheckUtils]: 85: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L290 TraceCheckUtils]: 86: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L290 TraceCheckUtils]: 88: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L290 TraceCheckUtils]: 89: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L290 TraceCheckUtils]: 90: Hoare triple {23302#true} assume !!(#t~post7 < 50);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L272 TraceCheckUtils]: 91: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,160 INFO L290 TraceCheckUtils]: 92: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 93: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 94: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 96: Hoare triple {23302#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 97: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 98: Hoare triple {23302#true} assume !!(#t~post7 < 50);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L272 TraceCheckUtils]: 99: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 100: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 101: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 102: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 104: Hoare triple {23302#true} assume !(~r~0 > 0); {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 105: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 106: Hoare triple {23302#true} assume !!(#t~post8 < 50);havoc #t~post8; {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L272 TraceCheckUtils]: 107: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 108: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 109: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,161 INFO L290 TraceCheckUtils]: 110: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L290 TraceCheckUtils]: 112: Hoare triple {23302#true} assume !(~r~0 < 0); {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L290 TraceCheckUtils]: 113: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L290 TraceCheckUtils]: 114: Hoare triple {23302#true} assume !!(#t~post6 < 50);havoc #t~post6; {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L272 TraceCheckUtils]: 115: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L290 TraceCheckUtils]: 116: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L290 TraceCheckUtils]: 117: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L290 TraceCheckUtils]: 118: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L290 TraceCheckUtils]: 120: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L290 TraceCheckUtils]: 121: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L290 TraceCheckUtils]: 122: Hoare triple {23302#true} assume !!(#t~post7 < 50);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L272 TraceCheckUtils]: 123: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L290 TraceCheckUtils]: 124: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L290 TraceCheckUtils]: 125: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L290 TraceCheckUtils]: 126: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,162 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 128: Hoare triple {23302#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 129: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 130: Hoare triple {23302#true} assume !!(#t~post7 < 50);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L272 TraceCheckUtils]: 131: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 132: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 133: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 134: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 136: Hoare triple {23302#true} assume !(~r~0 > 0); {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 137: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 138: Hoare triple {23302#true} assume !!(#t~post8 < 50);havoc #t~post8; {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L272 TraceCheckUtils]: 139: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 140: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 141: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 142: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-27 13:17:35,163 INFO L290 TraceCheckUtils]: 144: Hoare triple {23302#true} assume !(~r~0 < 0); {23302#true} is VALID [2022-04-27 13:17:35,164 INFO L290 TraceCheckUtils]: 145: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-27 13:17:35,164 INFO L290 TraceCheckUtils]: 146: Hoare triple {23302#true} assume !!(#t~post6 < 50);havoc #t~post6; {23302#true} is VALID [2022-04-27 13:17:35,164 INFO L272 TraceCheckUtils]: 147: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:17:35,164 INFO L290 TraceCheckUtils]: 148: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:17:35,164 INFO L290 TraceCheckUtils]: 149: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:17:35,164 INFO L290 TraceCheckUtils]: 150: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:17:35,164 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-27 13:17:35,164 INFO L290 TraceCheckUtils]: 152: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-27 13:17:35,164 INFO L290 TraceCheckUtils]: 153: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23766#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-27 13:17:35,165 INFO L290 TraceCheckUtils]: 154: Hoare triple {23766#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 50);havoc #t~post7; {23770#(<= 51 ~counter~0)} is VALID [2022-04-27 13:17:35,165 INFO L290 TraceCheckUtils]: 155: Hoare triple {23770#(<= 51 ~counter~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23774#(<= 52 ~counter~0)} is VALID [2022-04-27 13:17:35,166 INFO L290 TraceCheckUtils]: 156: Hoare triple {23774#(<= 52 ~counter~0)} assume !!(#t~post8 < 50);havoc #t~post8; {23774#(<= 52 ~counter~0)} is VALID [2022-04-27 13:17:35,166 INFO L272 TraceCheckUtils]: 157: Hoare triple {23774#(<= 52 ~counter~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)); {23774#(<= 52 ~counter~0)} is VALID [2022-04-27 13:17:35,166 INFO L290 TraceCheckUtils]: 158: Hoare triple {23774#(<= 52 ~counter~0)} ~cond := #in~cond; {23774#(<= 52 ~counter~0)} is VALID [2022-04-27 13:17:35,167 INFO L290 TraceCheckUtils]: 159: Hoare triple {23774#(<= 52 ~counter~0)} assume !(0 == ~cond); {23774#(<= 52 ~counter~0)} is VALID [2022-04-27 13:17:35,167 INFO L290 TraceCheckUtils]: 160: Hoare triple {23774#(<= 52 ~counter~0)} assume true; {23774#(<= 52 ~counter~0)} is VALID [2022-04-27 13:17:35,167 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {23774#(<= 52 ~counter~0)} {23774#(<= 52 ~counter~0)} #98#return; {23774#(<= 52 ~counter~0)} is VALID [2022-04-27 13:17:35,168 INFO L290 TraceCheckUtils]: 162: Hoare triple {23774#(<= 52 ~counter~0)} assume !(~r~0 < 0); {23774#(<= 52 ~counter~0)} is VALID [2022-04-27 13:17:35,168 INFO L290 TraceCheckUtils]: 163: Hoare triple {23774#(<= 52 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23799#(<= 52 |main_#t~post6|)} is VALID [2022-04-27 13:17:35,168 INFO L290 TraceCheckUtils]: 164: Hoare triple {23799#(<= 52 |main_#t~post6|)} assume !!(#t~post6 < 50);havoc #t~post6; {23303#false} is VALID [2022-04-27 13:17:35,168 INFO L272 TraceCheckUtils]: 165: Hoare triple {23303#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23303#false} is VALID [2022-04-27 13:17:35,168 INFO L290 TraceCheckUtils]: 166: Hoare triple {23303#false} ~cond := #in~cond; {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L290 TraceCheckUtils]: 167: Hoare triple {23303#false} assume !(0 == ~cond); {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L290 TraceCheckUtils]: 168: Hoare triple {23303#false} assume true; {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {23303#false} {23303#false} #94#return; {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L290 TraceCheckUtils]: 170: Hoare triple {23303#false} assume !!(0 != ~r~0); {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L290 TraceCheckUtils]: 171: Hoare triple {23303#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L290 TraceCheckUtils]: 172: Hoare triple {23303#false} assume !(#t~post7 < 50);havoc #t~post7; {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L290 TraceCheckUtils]: 173: Hoare triple {23303#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L290 TraceCheckUtils]: 174: Hoare triple {23303#false} assume !(#t~post8 < 50);havoc #t~post8; {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L290 TraceCheckUtils]: 175: Hoare triple {23303#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L290 TraceCheckUtils]: 176: Hoare triple {23303#false} assume !(#t~post6 < 50);havoc #t~post6; {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L272 TraceCheckUtils]: 177: Hoare triple {23303#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L290 TraceCheckUtils]: 178: Hoare triple {23303#false} ~cond := #in~cond; {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L290 TraceCheckUtils]: 179: Hoare triple {23303#false} assume 0 == ~cond; {23303#false} is VALID [2022-04-27 13:17:35,169 INFO L290 TraceCheckUtils]: 180: Hoare triple {23303#false} assume !false; {23303#false} is VALID [2022-04-27 13:17:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2022-04-27 13:17:35,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:35,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:35,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675330932] [2022-04-27 13:17:35,170 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:35,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156795090] [2022-04-27 13:17:35,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156795090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:35,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:35,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:17:35,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981355130] [2022-04-27 13:17:35,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:35,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 181 [2022-04-27 13:17:35,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:35,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:17:35,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:35,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:17:35,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:35,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:17:35,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:17:35,208 INFO L87 Difference]: Start difference. First operand 830 states and 1111 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:17:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:35,947 INFO L93 Difference]: Finished difference Result 1103 states and 1482 transitions. [2022-04-27 13:17:35,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:17:35,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 181 [2022-04-27 13:17:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:17:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-27 13:17:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:17:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-27 13:17:35,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2022-04-27 13:17:35,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:36,029 INFO L225 Difference]: With dead ends: 1103 [2022-04-27 13:17:36,030 INFO L226 Difference]: Without dead ends: 896 [2022-04-27 13:17:36,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 13:17:36,031 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:36,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 160 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-04-27 13:17:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 861. [2022-04-27 13:17:36,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:36,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 896 states. Second operand has 861 states, 645 states have (on average 1.1767441860465115) internal successors, (759), 652 states have internal predecessors, (759), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 177 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:17:36,503 INFO L74 IsIncluded]: Start isIncluded. First operand 896 states. Second operand has 861 states, 645 states have (on average 1.1767441860465115) internal successors, (759), 652 states have internal predecessors, (759), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 177 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:17:36,503 INFO L87 Difference]: Start difference. First operand 896 states. Second operand has 861 states, 645 states have (on average 1.1767441860465115) internal successors, (759), 652 states have internal predecessors, (759), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 177 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:17:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:36,531 INFO L93 Difference]: Finished difference Result 896 states and 1170 transitions. [2022-04-27 13:17:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1170 transitions. [2022-04-27 13:17:36,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:36,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:36,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 861 states, 645 states have (on average 1.1767441860465115) internal successors, (759), 652 states have internal predecessors, (759), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 177 states have call predecessors, (184), 184 states have call successors, (184) Second operand 896 states. [2022-04-27 13:17:36,536 INFO L87 Difference]: Start difference. First operand has 861 states, 645 states have (on average 1.1767441860465115) internal successors, (759), 652 states have internal predecessors, (759), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 177 states have call predecessors, (184), 184 states have call successors, (184) Second operand 896 states. [2022-04-27 13:17:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:36,562 INFO L93 Difference]: Finished difference Result 896 states and 1170 transitions. [2022-04-27 13:17:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1170 transitions. [2022-04-27 13:17:36,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:36,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:36,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:36,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 645 states have (on average 1.1767441860465115) internal successors, (759), 652 states have internal predecessors, (759), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 177 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:17:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1129 transitions. [2022-04-27 13:17:36,599 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1129 transitions. Word has length 181 [2022-04-27 13:17:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:36,599 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 1129 transitions. [2022-04-27 13:17:36,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:17:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1129 transitions. [2022-04-27 13:17:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:17:36,603 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:36,603 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 9, 8, 8, 8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:36,622 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-27 13:17:36,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 13:17:36,819 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1408642227, now seen corresponding path program 4 times [2022-04-27 13:17:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:36,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129090521] [2022-04-27 13:17:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:36,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:36,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1993394519] [2022-04-27 13:17:36,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 13:17:36,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:36,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:36,841 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-27 13:17:36,842 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-27 13:17:36,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 13:17:36,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:36,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2022-04-27 13:17:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:36,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:37,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {28385#true} call ULTIMATE.init(); {28385#true} is VALID [2022-04-27 13:17:37,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {28385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28385#true} is VALID [2022-04-27 13:17:37,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28385#true} {28385#true} #102#return; {28385#true} is VALID [2022-04-27 13:17:37,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {28385#true} call #t~ret9 := main(); {28385#true} is VALID [2022-04-27 13:17:37,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {28385#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; {28385#true} is VALID [2022-04-27 13:17:37,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {28385#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28385#true} is VALID [2022-04-27 13:17:37,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:17:37,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:17:37,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28385#true} {28385#true} #90#return; {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L272 TraceCheckUtils]: 11: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28385#true} {28385#true} #92#return; {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {28385#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {28385#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {28385#true} assume !!(#t~post6 < 50);havoc #t~post6; {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L272 TraceCheckUtils]: 19: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28385#true} {28385#true} #94#return; {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {28385#true} assume !!(0 != ~r~0); {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {28385#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {28385#true} assume !!(#t~post7 < 50);havoc #t~post7; {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L272 TraceCheckUtils]: 27: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:17:37,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28385#true} {28385#true} #96#return; {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {28385#true} assume !(~r~0 > 0); {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {28385#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {28385#true} assume !!(#t~post8 < 50);havoc #t~post8; {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L272 TraceCheckUtils]: 35: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28385#true} {28385#true} #98#return; {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {28385#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {28385#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {28385#true} assume !!(#t~post8 < 50);havoc #t~post8; {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L272 TraceCheckUtils]: 43: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:17:37,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28385#true} {28385#true} #98#return; {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 48: Hoare triple {28385#true} assume !(~r~0 < 0); {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {28385#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {28385#true} assume !!(#t~post6 < 50);havoc #t~post6; {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L272 TraceCheckUtils]: 51: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 54: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28385#true} {28385#true} #94#return; {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 56: Hoare triple {28385#true} assume !!(0 != ~r~0); {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {28385#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 58: Hoare triple {28385#true} assume !!(#t~post7 < 50);havoc #t~post7; {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L272 TraceCheckUtils]: 59: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 60: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 61: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L290 TraceCheckUtils]: 62: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,266 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28385#true} {28385#true} #96#return; {28385#true} is VALID [2022-04-27 13:17:37,267 INFO L290 TraceCheckUtils]: 64: Hoare triple {28385#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28385#true} is VALID [2022-04-27 13:17:37,267 INFO L290 TraceCheckUtils]: 65: Hoare triple {28385#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28385#true} is VALID [2022-04-27 13:17:37,267 INFO L290 TraceCheckUtils]: 66: Hoare triple {28385#true} assume !!(#t~post7 < 50);havoc #t~post7; {28385#true} is VALID [2022-04-27 13:17:37,267 INFO L272 TraceCheckUtils]: 67: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:17:37,267 INFO L290 TraceCheckUtils]: 68: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:17:37,267 INFO L290 TraceCheckUtils]: 69: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:17:37,267 INFO L290 TraceCheckUtils]: 70: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,267 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28385#true} {28385#true} #96#return; {28385#true} is VALID [2022-04-27 13:17:37,267 INFO L290 TraceCheckUtils]: 72: Hoare triple {28385#true} assume !(~r~0 > 0); {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:37,267 INFO L290 TraceCheckUtils]: 73: Hoare triple {28606#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:37,268 INFO L290 TraceCheckUtils]: 74: Hoare triple {28606#(not (< 0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:37,268 INFO L272 TraceCheckUtils]: 75: Hoare triple {28606#(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)); {28385#true} is VALID [2022-04-27 13:17:37,268 INFO L290 TraceCheckUtils]: 76: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:17:37,268 INFO L290 TraceCheckUtils]: 77: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:17:37,268 INFO L290 TraceCheckUtils]: 78: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,268 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28385#true} {28606#(not (< 0 main_~r~0))} #98#return; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:37,269 INFO L290 TraceCheckUtils]: 80: Hoare triple {28606#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:37,269 INFO L290 TraceCheckUtils]: 81: Hoare triple {28606#(not (< 0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:37,269 INFO L290 TraceCheckUtils]: 82: Hoare triple {28606#(not (< 0 main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:37,269 INFO L272 TraceCheckUtils]: 83: Hoare triple {28606#(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)); {28385#true} is VALID [2022-04-27 13:17:37,269 INFO L290 TraceCheckUtils]: 84: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:17:37,269 INFO L290 TraceCheckUtils]: 85: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:17:37,269 INFO L290 TraceCheckUtils]: 86: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,270 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {28385#true} {28606#(not (< 0 main_~r~0))} #94#return; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:37,270 INFO L290 TraceCheckUtils]: 88: Hoare triple {28606#(not (< 0 main_~r~0))} assume !!(0 != ~r~0); {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:37,270 INFO L290 TraceCheckUtils]: 89: Hoare triple {28606#(not (< 0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:37,270 INFO L290 TraceCheckUtils]: 90: Hoare triple {28606#(not (< 0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:37,271 INFO L272 TraceCheckUtils]: 91: Hoare triple {28606#(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)); {28385#true} is VALID [2022-04-27 13:17:37,271 INFO L290 TraceCheckUtils]: 92: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:17:37,271 INFO L290 TraceCheckUtils]: 93: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:17:37,271 INFO L290 TraceCheckUtils]: 94: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:17:37,271 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {28385#true} {28606#(not (< 0 main_~r~0))} #96#return; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:37,271 INFO L290 TraceCheckUtils]: 96: Hoare triple {28606#(not (< 0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28386#false} is VALID [2022-04-27 13:17:37,271 INFO L290 TraceCheckUtils]: 97: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 98: Hoare triple {28386#false} assume !!(#t~post7 < 50);havoc #t~post7; {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L272 TraceCheckUtils]: 99: Hoare triple {28386#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 100: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 101: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 102: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {28386#false} {28386#false} #96#return; {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 104: Hoare triple {28386#false} assume !(~r~0 > 0); {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 105: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 106: Hoare triple {28386#false} assume !!(#t~post8 < 50);havoc #t~post8; {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L272 TraceCheckUtils]: 107: Hoare triple {28386#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 108: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 109: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 110: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {28386#false} {28386#false} #98#return; {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 112: Hoare triple {28386#false} assume !(~r~0 < 0); {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 113: Hoare triple {28386#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L290 TraceCheckUtils]: 114: Hoare triple {28386#false} assume !!(#t~post6 < 50);havoc #t~post6; {28386#false} is VALID [2022-04-27 13:17:37,272 INFO L272 TraceCheckUtils]: 115: Hoare triple {28386#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 116: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 117: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 118: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {28386#false} {28386#false} #94#return; {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 120: Hoare triple {28386#false} assume !!(0 != ~r~0); {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 121: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 122: Hoare triple {28386#false} assume !!(#t~post7 < 50);havoc #t~post7; {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L272 TraceCheckUtils]: 123: Hoare triple {28386#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 124: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 125: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 126: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {28386#false} {28386#false} #96#return; {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 128: Hoare triple {28386#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 129: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 130: Hoare triple {28386#false} assume !!(#t~post7 < 50);havoc #t~post7; {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L272 TraceCheckUtils]: 131: Hoare triple {28386#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28386#false} is VALID [2022-04-27 13:17:37,273 INFO L290 TraceCheckUtils]: 132: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L290 TraceCheckUtils]: 133: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L290 TraceCheckUtils]: 134: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {28386#false} {28386#false} #96#return; {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L290 TraceCheckUtils]: 136: Hoare triple {28386#false} assume !(~r~0 > 0); {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L290 TraceCheckUtils]: 137: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L290 TraceCheckUtils]: 138: Hoare triple {28386#false} assume !!(#t~post8 < 50);havoc #t~post8; {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L272 TraceCheckUtils]: 139: Hoare triple {28386#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L290 TraceCheckUtils]: 140: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L290 TraceCheckUtils]: 141: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L290 TraceCheckUtils]: 142: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {28386#false} {28386#false} #98#return; {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L290 TraceCheckUtils]: 144: Hoare triple {28386#false} assume !(~r~0 < 0); {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L290 TraceCheckUtils]: 145: Hoare triple {28386#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L290 TraceCheckUtils]: 146: Hoare triple {28386#false} assume !!(#t~post6 < 50);havoc #t~post6; {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L272 TraceCheckUtils]: 147: Hoare triple {28386#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28386#false} is VALID [2022-04-27 13:17:37,274 INFO L290 TraceCheckUtils]: 148: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L290 TraceCheckUtils]: 149: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L290 TraceCheckUtils]: 150: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {28386#false} {28386#false} #94#return; {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L290 TraceCheckUtils]: 152: Hoare triple {28386#false} assume !!(0 != ~r~0); {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L290 TraceCheckUtils]: 153: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L290 TraceCheckUtils]: 154: Hoare triple {28386#false} assume !!(#t~post7 < 50);havoc #t~post7; {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L272 TraceCheckUtils]: 155: Hoare triple {28386#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L290 TraceCheckUtils]: 156: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L290 TraceCheckUtils]: 157: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L290 TraceCheckUtils]: 158: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {28386#false} {28386#false} #96#return; {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L290 TraceCheckUtils]: 160: Hoare triple {28386#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L290 TraceCheckUtils]: 161: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-27 13:17:37,275 INFO L290 TraceCheckUtils]: 162: Hoare triple {28386#false} assume !(#t~post7 < 50);havoc #t~post7; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 163: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 164: Hoare triple {28386#false} assume !!(#t~post8 < 50);havoc #t~post8; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L272 TraceCheckUtils]: 165: Hoare triple {28386#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 166: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 167: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 168: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {28386#false} {28386#false} #98#return; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 170: Hoare triple {28386#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 171: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 172: Hoare triple {28386#false} assume !!(#t~post8 < 50);havoc #t~post8; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L272 TraceCheckUtils]: 173: Hoare triple {28386#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 174: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 175: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 176: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L284 TraceCheckUtils]: 177: Hoare quadruple {28386#false} {28386#false} #98#return; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 178: Hoare triple {28386#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28386#false} is VALID [2022-04-27 13:17:37,276 INFO L290 TraceCheckUtils]: 179: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-27 13:17:37,277 INFO L290 TraceCheckUtils]: 180: Hoare triple {28386#false} assume !(#t~post8 < 50);havoc #t~post8; {28386#false} is VALID [2022-04-27 13:17:37,277 INFO L290 TraceCheckUtils]: 181: Hoare triple {28386#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28386#false} is VALID [2022-04-27 13:17:37,277 INFO L290 TraceCheckUtils]: 182: Hoare triple {28386#false} assume !(#t~post6 < 50);havoc #t~post6; {28386#false} is VALID [2022-04-27 13:17:37,277 INFO L272 TraceCheckUtils]: 183: Hoare triple {28386#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28386#false} is VALID [2022-04-27 13:17:37,277 INFO L290 TraceCheckUtils]: 184: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:17:37,277 INFO L290 TraceCheckUtils]: 185: Hoare triple {28386#false} assume 0 == ~cond; {28386#false} is VALID [2022-04-27 13:17:37,277 INFO L290 TraceCheckUtils]: 186: Hoare triple {28386#false} assume !false; {28386#false} is VALID [2022-04-27 13:17:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2022-04-27 13:17:37,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:37,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:37,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129090521] [2022-04-27 13:17:37,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:37,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993394519] [2022-04-27 13:17:37,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993394519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:37,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:37,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:17:37,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924395897] [2022-04-27 13:17:37,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:37,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 187 [2022-04-27 13:17:37,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:37,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 13:17:37,327 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-27 13:17:37,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:17:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:17:37,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:17:37,328 INFO L87 Difference]: Start difference. First operand 861 states and 1129 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 13:17:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:38,139 INFO L93 Difference]: Finished difference Result 1462 states and 1917 transitions. [2022-04-27 13:17:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:17:38,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 187 [2022-04-27 13:17:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 13:17:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-04-27 13:17:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 13:17:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-04-27 13:17:38,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2022-04-27 13:17:38,200 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-27 13:17:38,236 INFO L225 Difference]: With dead ends: 1462 [2022-04-27 13:17:38,236 INFO L226 Difference]: Without dead ends: 919 [2022-04-27 13:17:38,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:17:38,238 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:38,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-04-27 13:17:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 867. [2022-04-27 13:17:38,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:38,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 919 states. Second operand has 867 states, 651 states have (on average 1.1751152073732718) internal successors, (765), 660 states have internal predecessors, (765), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 175 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:17:38,759 INFO L74 IsIncluded]: Start isIncluded. First operand 919 states. Second operand has 867 states, 651 states have (on average 1.1751152073732718) internal successors, (765), 660 states have internal predecessors, (765), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 175 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:17:38,760 INFO L87 Difference]: Start difference. First operand 919 states. Second operand has 867 states, 651 states have (on average 1.1751152073732718) internal successors, (765), 660 states have internal predecessors, (765), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 175 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:17:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:38,786 INFO L93 Difference]: Finished difference Result 919 states and 1203 transitions. [2022-04-27 13:17:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1203 transitions. [2022-04-27 13:17:38,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:38,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:38,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 651 states have (on average 1.1751152073732718) internal successors, (765), 660 states have internal predecessors, (765), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 175 states have call predecessors, (184), 184 states have call successors, (184) Second operand 919 states. [2022-04-27 13:17:38,790 INFO L87 Difference]: Start difference. First operand has 867 states, 651 states have (on average 1.1751152073732718) internal successors, (765), 660 states have internal predecessors, (765), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 175 states have call predecessors, (184), 184 states have call successors, (184) Second operand 919 states. [2022-04-27 13:17:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:38,819 INFO L93 Difference]: Finished difference Result 919 states and 1203 transitions. [2022-04-27 13:17:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1203 transitions. [2022-04-27 13:17:38,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:38,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:38,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:38,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 651 states have (on average 1.1751152073732718) internal successors, (765), 660 states have internal predecessors, (765), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 175 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:17:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1135 transitions. [2022-04-27 13:17:38,852 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1135 transitions. Word has length 187 [2022-04-27 13:17:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:38,853 INFO L495 AbstractCegarLoop]: Abstraction has 867 states and 1135 transitions. [2022-04-27 13:17:38,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 13:17:38,853 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1135 transitions. [2022-04-27 13:17:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:17:38,856 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:38,856 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 10, 9, 9, 9, 8, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:38,874 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-27 13:17:39,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 13:17:39,071 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:39,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash -464040263, now seen corresponding path program 5 times [2022-04-27 13:17:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:39,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294407097] [2022-04-27 13:17:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:39,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:39,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334053704] [2022-04-27 13:17:39,090 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 13:17:39,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:39,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:39,091 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-27 13:17:39,092 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-27 13:17:39,425 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-04-27 13:17:39,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:39,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:17:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:39,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:39,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {34032#true} call ULTIMATE.init(); {34032#true} is VALID [2022-04-27 13:17:39,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {34032#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34032#true} is VALID [2022-04-27 13:17:39,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34032#true} {34032#true} #102#return; {34032#true} is VALID [2022-04-27 13:17:39,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {34032#true} call #t~ret9 := main(); {34032#true} is VALID [2022-04-27 13:17:39,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {34032#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; {34032#true} is VALID [2022-04-27 13:17:39,759 INFO L272 TraceCheckUtils]: 6: Hoare triple {34032#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {34032#true} is VALID [2022-04-27 13:17:39,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,759 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34032#true} {34032#true} #90#return; {34032#true} is VALID [2022-04-27 13:17:39,759 INFO L272 TraceCheckUtils]: 11: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34032#true} {34032#true} #92#return; {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {34032#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {34032#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {34032#true} assume !!(#t~post6 < 50);havoc #t~post6; {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L272 TraceCheckUtils]: 19: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34032#true} {34032#true} #94#return; {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {34032#true} assume !!(0 != ~r~0); {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {34032#true} assume !!(#t~post7 < 50);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L272 TraceCheckUtils]: 27: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {34032#true} assume !(~r~0 > 0); {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {34032#true} assume !!(#t~post8 < 50);havoc #t~post8; {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L272 TraceCheckUtils]: 35: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {34032#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 41: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {34032#true} assume !!(#t~post8 < 50);havoc #t~post8; {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L272 TraceCheckUtils]: 43: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {34032#true} assume !(~r~0 < 0); {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {34032#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 50: Hoare triple {34032#true} assume !!(#t~post6 < 50);havoc #t~post6; {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L272 TraceCheckUtils]: 51: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 52: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 53: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 54: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34032#true} {34032#true} #94#return; {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 56: Hoare triple {34032#true} assume !!(0 != ~r~0); {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 57: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 58: Hoare triple {34032#true} assume !!(#t~post7 < 50);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L272 TraceCheckUtils]: 59: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L290 TraceCheckUtils]: 62: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,762 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 64: Hoare triple {34032#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 65: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 66: Hoare triple {34032#true} assume !!(#t~post7 < 50);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L272 TraceCheckUtils]: 67: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 69: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 70: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 72: Hoare triple {34032#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 73: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 74: Hoare triple {34032#true} assume !!(#t~post7 < 50);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L272 TraceCheckUtils]: 75: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 76: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 77: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 78: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:17:39,763 INFO L290 TraceCheckUtils]: 80: Hoare triple {34032#true} assume !(~r~0 > 0); {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 81: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 82: Hoare triple {34032#true} assume !!(#t~post8 < 50);havoc #t~post8; {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L272 TraceCheckUtils]: 83: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 84: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 85: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 86: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 88: Hoare triple {34032#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 89: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 90: Hoare triple {34032#true} assume !!(#t~post8 < 50);havoc #t~post8; {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L272 TraceCheckUtils]: 91: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 92: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 93: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 94: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 96: Hoare triple {34032#true} assume !(~r~0 < 0); {34032#true} is VALID [2022-04-27 13:17:39,764 INFO L290 TraceCheckUtils]: 97: Hoare triple {34032#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 98: Hoare triple {34032#true} assume !!(#t~post6 < 50);havoc #t~post6; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L272 TraceCheckUtils]: 99: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 100: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 101: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 102: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {34032#true} {34032#true} #94#return; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 104: Hoare triple {34032#true} assume !!(0 != ~r~0); {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 105: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 106: Hoare triple {34032#true} assume !!(#t~post7 < 50);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L272 TraceCheckUtils]: 107: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 108: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 109: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 110: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 112: Hoare triple {34032#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 113: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L290 TraceCheckUtils]: 114: Hoare triple {34032#true} assume !!(#t~post7 < 50);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,765 INFO L272 TraceCheckUtils]: 115: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L290 TraceCheckUtils]: 116: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L290 TraceCheckUtils]: 117: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L290 TraceCheckUtils]: 118: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L290 TraceCheckUtils]: 120: Hoare triple {34032#true} assume !(~r~0 > 0); {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L290 TraceCheckUtils]: 121: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L290 TraceCheckUtils]: 122: Hoare triple {34032#true} assume !!(#t~post8 < 50);havoc #t~post8; {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L272 TraceCheckUtils]: 123: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L290 TraceCheckUtils]: 124: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L290 TraceCheckUtils]: 125: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L290 TraceCheckUtils]: 126: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L290 TraceCheckUtils]: 128: Hoare triple {34032#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L290 TraceCheckUtils]: 129: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L290 TraceCheckUtils]: 130: Hoare triple {34032#true} assume !!(#t~post8 < 50);havoc #t~post8; {34032#true} is VALID [2022-04-27 13:17:39,766 INFO L272 TraceCheckUtils]: 131: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 132: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 133: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 134: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 136: Hoare triple {34032#true} assume !(~r~0 < 0); {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 137: Hoare triple {34032#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 138: Hoare triple {34032#true} assume !!(#t~post6 < 50);havoc #t~post6; {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L272 TraceCheckUtils]: 139: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 140: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 141: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 142: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {34032#true} {34032#true} #94#return; {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 144: Hoare triple {34032#true} assume !!(0 != ~r~0); {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 145: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 146: Hoare triple {34032#true} assume !!(#t~post7 < 50);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L272 TraceCheckUtils]: 147: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 148: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:17:39,767 INFO L290 TraceCheckUtils]: 149: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:17:39,768 INFO L290 TraceCheckUtils]: 150: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:17:39,768 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:17:39,768 INFO L290 TraceCheckUtils]: 152: Hoare triple {34032#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34032#true} is VALID [2022-04-27 13:17:39,768 INFO L290 TraceCheckUtils]: 153: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34496#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-27 13:17:39,769 INFO L290 TraceCheckUtils]: 154: Hoare triple {34496#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 50);havoc #t~post7; {34500#(<= 51 ~counter~0)} is VALID [2022-04-27 13:17:39,769 INFO L290 TraceCheckUtils]: 155: Hoare triple {34500#(<= 51 ~counter~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34504#(<= 51 |main_#t~post8|)} is VALID [2022-04-27 13:17:39,769 INFO L290 TraceCheckUtils]: 156: Hoare triple {34504#(<= 51 |main_#t~post8|)} assume !!(#t~post8 < 50);havoc #t~post8; {34033#false} is VALID [2022-04-27 13:17:39,769 INFO L272 TraceCheckUtils]: 157: Hoare triple {34033#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 158: Hoare triple {34033#false} ~cond := #in~cond; {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 159: Hoare triple {34033#false} assume !(0 == ~cond); {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 160: Hoare triple {34033#false} assume true; {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {34033#false} {34033#false} #98#return; {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 162: Hoare triple {34033#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 163: Hoare triple {34033#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 164: Hoare triple {34033#false} assume !!(#t~post8 < 50);havoc #t~post8; {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L272 TraceCheckUtils]: 165: Hoare triple {34033#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 166: Hoare triple {34033#false} ~cond := #in~cond; {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 167: Hoare triple {34033#false} assume !(0 == ~cond); {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 168: Hoare triple {34033#false} assume true; {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {34033#false} {34033#false} #98#return; {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 170: Hoare triple {34033#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 171: Hoare triple {34033#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 172: Hoare triple {34033#false} assume !!(#t~post8 < 50);havoc #t~post8; {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L272 TraceCheckUtils]: 173: Hoare triple {34033#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34033#false} is VALID [2022-04-27 13:17:39,770 INFO L290 TraceCheckUtils]: 174: Hoare triple {34033#false} ~cond := #in~cond; {34033#false} is VALID [2022-04-27 13:17:39,771 INFO L290 TraceCheckUtils]: 175: Hoare triple {34033#false} assume !(0 == ~cond); {34033#false} is VALID [2022-04-27 13:17:39,771 INFO L290 TraceCheckUtils]: 176: Hoare triple {34033#false} assume true; {34033#false} is VALID [2022-04-27 13:17:39,771 INFO L284 TraceCheckUtils]: 177: Hoare quadruple {34033#false} {34033#false} #98#return; {34033#false} is VALID [2022-04-27 13:17:39,771 INFO L290 TraceCheckUtils]: 178: Hoare triple {34033#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34033#false} is VALID [2022-04-27 13:17:39,771 INFO L290 TraceCheckUtils]: 179: Hoare triple {34033#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34033#false} is VALID [2022-04-27 13:17:39,771 INFO L290 TraceCheckUtils]: 180: Hoare triple {34033#false} assume !(#t~post8 < 50);havoc #t~post8; {34033#false} is VALID [2022-04-27 13:17:39,771 INFO L290 TraceCheckUtils]: 181: Hoare triple {34033#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34033#false} is VALID [2022-04-27 13:17:39,771 INFO L290 TraceCheckUtils]: 182: Hoare triple {34033#false} assume !(#t~post6 < 50);havoc #t~post6; {34033#false} is VALID [2022-04-27 13:17:39,771 INFO L272 TraceCheckUtils]: 183: Hoare triple {34033#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34033#false} is VALID [2022-04-27 13:17:39,771 INFO L290 TraceCheckUtils]: 184: Hoare triple {34033#false} ~cond := #in~cond; {34033#false} is VALID [2022-04-27 13:17:39,771 INFO L290 TraceCheckUtils]: 185: Hoare triple {34033#false} assume 0 == ~cond; {34033#false} is VALID [2022-04-27 13:17:39,771 INFO L290 TraceCheckUtils]: 186: Hoare triple {34033#false} assume !false; {34033#false} is VALID [2022-04-27 13:17:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2022-04-27 13:17:39,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:39,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:39,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294407097] [2022-04-27 13:17:39,772 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:39,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334053704] [2022-04-27 13:17:39,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334053704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:39,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:39,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:17:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935132011] [2022-04-27 13:17:39,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:39,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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 187 [2022-04-27 13:17:39,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:39,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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-27 13:17:39,825 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-27 13:17:39,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:17:39,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:39,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:17:39,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:17:39,826 INFO L87 Difference]: Start difference. First operand 867 states and 1135 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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-27 13:17:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:40,483 INFO L93 Difference]: Finished difference Result 887 states and 1154 transitions. [2022-04-27 13:17:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:17:40,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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 187 [2022-04-27 13:17:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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-27 13:17:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 13:17:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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-27 13:17:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 13:17:40,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 13:17:40,523 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-27 13:17:40,549 INFO L225 Difference]: With dead ends: 887 [2022-04-27 13:17:40,549 INFO L226 Difference]: Without dead ends: 831 [2022-04-27 13:17:40,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 183 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-27 13:17:40,550 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:40,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 143 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-04-27 13:17:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 806. [2022-04-27 13:17:41,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:41,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 831 states. Second operand has 806 states, 604 states have (on average 1.1688741721854305) internal successors, (706), 612 states have internal predecessors, (706), 177 states have call successors, (177), 26 states have call predecessors, (177), 24 states have return successors, (175), 167 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:17:41,045 INFO L74 IsIncluded]: Start isIncluded. First operand 831 states. Second operand has 806 states, 604 states have (on average 1.1688741721854305) internal successors, (706), 612 states have internal predecessors, (706), 177 states have call successors, (177), 26 states have call predecessors, (177), 24 states have return successors, (175), 167 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:17:41,045 INFO L87 Difference]: Start difference. First operand 831 states. Second operand has 806 states, 604 states have (on average 1.1688741721854305) internal successors, (706), 612 states have internal predecessors, (706), 177 states have call successors, (177), 26 states have call predecessors, (177), 24 states have return successors, (175), 167 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:17:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:41,067 INFO L93 Difference]: Finished difference Result 831 states and 1088 transitions. [2022-04-27 13:17:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1088 transitions. [2022-04-27 13:17:41,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:41,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:41,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 806 states, 604 states have (on average 1.1688741721854305) internal successors, (706), 612 states have internal predecessors, (706), 177 states have call successors, (177), 26 states have call predecessors, (177), 24 states have return successors, (175), 167 states have call predecessors, (175), 175 states have call successors, (175) Second operand 831 states. [2022-04-27 13:17:41,070 INFO L87 Difference]: Start difference. First operand has 806 states, 604 states have (on average 1.1688741721854305) internal successors, (706), 612 states have internal predecessors, (706), 177 states have call successors, (177), 26 states have call predecessors, (177), 24 states have return successors, (175), 167 states have call predecessors, (175), 175 states have call successors, (175) Second operand 831 states. [2022-04-27 13:17:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:41,092 INFO L93 Difference]: Finished difference Result 831 states and 1088 transitions. [2022-04-27 13:17:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1088 transitions. [2022-04-27 13:17:41,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:41,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:41,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:41,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 604 states have (on average 1.1688741721854305) internal successors, (706), 612 states have internal predecessors, (706), 177 states have call successors, (177), 26 states have call predecessors, (177), 24 states have return successors, (175), 167 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:17:41,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1058 transitions. [2022-04-27 13:17:41,121 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1058 transitions. Word has length 187 [2022-04-27 13:17:41,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:41,121 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1058 transitions. [2022-04-27 13:17:41,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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-27 13:17:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1058 transitions. [2022-04-27 13:17:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:17:41,124 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:41,124 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 9, 8, 8, 8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:41,131 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-27 13:17:41,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 13:17:41,329 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:41,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash 372440269, now seen corresponding path program 6 times [2022-04-27 13:17:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:41,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122795527] [2022-04-27 13:17:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:41,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:41,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918674574] [2022-04-27 13:17:41,352 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 13:17:41,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:41,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:41,353 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-27 13:17:41,354 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-27 13:17:41,508 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 13:17:41,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:41,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 13:17:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:41,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:41,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {38618#true} call ULTIMATE.init(); {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {38618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38618#true} {38618#true} #102#return; {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {38618#true} call #t~ret9 := main(); {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {38618#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; {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L272 TraceCheckUtils]: 6: Hoare triple {38618#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38618#true} {38618#true} #90#return; {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L272 TraceCheckUtils]: 11: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38618#true} {38618#true} #92#return; {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {38618#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {38618#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {38618#true} assume !!(#t~post6 < 50);havoc #t~post6; {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L272 TraceCheckUtils]: 19: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {38618#true} {38618#true} #94#return; {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {38618#true} assume !!(0 != ~r~0); {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {38618#true} assume !!(#t~post7 < 50);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L272 TraceCheckUtils]: 27: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,888 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {38618#true} assume !(~r~0 > 0); {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 34: Hoare triple {38618#true} assume !!(#t~post8 < 50);havoc #t~post8; {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L272 TraceCheckUtils]: 35: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 40: Hoare triple {38618#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {38618#true} assume !!(#t~post8 < 50);havoc #t~post8; {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L272 TraceCheckUtils]: 43: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {38618#true} assume !(~r~0 < 0); {38618#true} is VALID [2022-04-27 13:17:41,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {38618#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {38618#true} assume !!(#t~post6 < 50);havoc #t~post6; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L272 TraceCheckUtils]: 51: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 52: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {38618#true} {38618#true} #94#return; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {38618#true} assume !!(0 != ~r~0); {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 57: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {38618#true} assume !!(#t~post7 < 50);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L272 TraceCheckUtils]: 59: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 60: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 62: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 64: Hoare triple {38618#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 65: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L290 TraceCheckUtils]: 66: Hoare triple {38618#true} assume !!(#t~post7 < 50);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,890 INFO L272 TraceCheckUtils]: 67: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 68: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 69: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 70: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 72: Hoare triple {38618#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 73: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 74: Hoare triple {38618#true} assume !!(#t~post7 < 50);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L272 TraceCheckUtils]: 75: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 76: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 77: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 78: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 80: Hoare triple {38618#true} assume !(~r~0 > 0); {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 81: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 82: Hoare triple {38618#true} assume !!(#t~post8 < 50);havoc #t~post8; {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L272 TraceCheckUtils]: 83: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,891 INFO L290 TraceCheckUtils]: 84: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 85: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 86: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 88: Hoare triple {38618#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 89: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 90: Hoare triple {38618#true} assume !!(#t~post8 < 50);havoc #t~post8; {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L272 TraceCheckUtils]: 91: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 92: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 93: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 94: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 96: Hoare triple {38618#true} assume !(~r~0 < 0); {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 97: Hoare triple {38618#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 98: Hoare triple {38618#true} assume !!(#t~post6 < 50);havoc #t~post6; {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L272 TraceCheckUtils]: 99: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 100: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 101: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,892 INFO L290 TraceCheckUtils]: 102: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {38618#true} {38618#true} #94#return; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 104: Hoare triple {38618#true} assume !!(0 != ~r~0); {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 105: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 106: Hoare triple {38618#true} assume !!(#t~post7 < 50);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L272 TraceCheckUtils]: 107: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 108: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 109: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 110: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 112: Hoare triple {38618#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 113: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 114: Hoare triple {38618#true} assume !!(#t~post7 < 50);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L272 TraceCheckUtils]: 115: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 116: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 117: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 118: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:17:41,893 INFO L290 TraceCheckUtils]: 120: Hoare triple {38618#true} assume !(~r~0 > 0); {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 121: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 122: Hoare triple {38618#true} assume !!(#t~post8 < 50);havoc #t~post8; {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L272 TraceCheckUtils]: 123: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 124: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 125: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 126: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 128: Hoare triple {38618#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 129: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 130: Hoare triple {38618#true} assume !!(#t~post8 < 50);havoc #t~post8; {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L272 TraceCheckUtils]: 131: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 132: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 133: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 134: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 136: Hoare triple {38618#true} assume !(~r~0 < 0); {38618#true} is VALID [2022-04-27 13:17:41,894 INFO L290 TraceCheckUtils]: 137: Hoare triple {38618#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L290 TraceCheckUtils]: 138: Hoare triple {38618#true} assume !!(#t~post6 < 50);havoc #t~post6; {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L272 TraceCheckUtils]: 139: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L290 TraceCheckUtils]: 140: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L290 TraceCheckUtils]: 141: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L290 TraceCheckUtils]: 142: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {38618#true} {38618#true} #94#return; {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L290 TraceCheckUtils]: 144: Hoare triple {38618#true} assume !!(0 != ~r~0); {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L290 TraceCheckUtils]: 145: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L290 TraceCheckUtils]: 146: Hoare triple {38618#true} assume !!(#t~post7 < 50);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L272 TraceCheckUtils]: 147: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L290 TraceCheckUtils]: 148: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L290 TraceCheckUtils]: 149: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L290 TraceCheckUtils]: 150: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L290 TraceCheckUtils]: 152: Hoare triple {38618#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38618#true} is VALID [2022-04-27 13:17:41,895 INFO L290 TraceCheckUtils]: 153: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,896 INFO L290 TraceCheckUtils]: 154: Hoare triple {38618#true} assume !!(#t~post7 < 50);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:17:41,896 INFO L272 TraceCheckUtils]: 155: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:17:41,896 INFO L290 TraceCheckUtils]: 156: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,896 INFO L290 TraceCheckUtils]: 157: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,896 INFO L290 TraceCheckUtils]: 158: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,896 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:17:41,900 INFO L290 TraceCheckUtils]: 160: Hoare triple {38618#true} assume !(~r~0 > 0); {39103#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:41,901 INFO L290 TraceCheckUtils]: 161: Hoare triple {39103#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39103#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:41,901 INFO L290 TraceCheckUtils]: 162: Hoare triple {39103#(not (< 0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {39103#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:41,901 INFO L272 TraceCheckUtils]: 163: Hoare triple {39103#(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)); {38618#true} is VALID [2022-04-27 13:17:41,901 INFO L290 TraceCheckUtils]: 164: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,901 INFO L290 TraceCheckUtils]: 165: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,901 INFO L290 TraceCheckUtils]: 166: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,902 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {38618#true} {39103#(not (< 0 main_~r~0))} #98#return; {39103#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:41,902 INFO L290 TraceCheckUtils]: 168: Hoare triple {39103#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:17:41,902 INFO L290 TraceCheckUtils]: 169: Hoare triple {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:17:41,903 INFO L290 TraceCheckUtils]: 170: Hoare triple {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 50);havoc #t~post6; {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:17:41,903 INFO L272 TraceCheckUtils]: 171: Hoare triple {39128#(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)); {38618#true} is VALID [2022-04-27 13:17:41,903 INFO L290 TraceCheckUtils]: 172: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:17:41,903 INFO L290 TraceCheckUtils]: 173: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:17:41,903 INFO L290 TraceCheckUtils]: 174: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:17:41,903 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {38618#true} {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:17:41,903 INFO L290 TraceCheckUtils]: 176: Hoare triple {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {38619#false} is VALID [2022-04-27 13:17:41,904 INFO L290 TraceCheckUtils]: 177: Hoare triple {38619#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38619#false} is VALID [2022-04-27 13:17:41,904 INFO L290 TraceCheckUtils]: 178: Hoare triple {38619#false} assume !(#t~post7 < 50);havoc #t~post7; {38619#false} is VALID [2022-04-27 13:17:41,904 INFO L290 TraceCheckUtils]: 179: Hoare triple {38619#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38619#false} is VALID [2022-04-27 13:17:41,904 INFO L290 TraceCheckUtils]: 180: Hoare triple {38619#false} assume !(#t~post8 < 50);havoc #t~post8; {38619#false} is VALID [2022-04-27 13:17:41,904 INFO L290 TraceCheckUtils]: 181: Hoare triple {38619#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38619#false} is VALID [2022-04-27 13:17:41,904 INFO L290 TraceCheckUtils]: 182: Hoare triple {38619#false} assume !(#t~post6 < 50);havoc #t~post6; {38619#false} is VALID [2022-04-27 13:17:41,904 INFO L272 TraceCheckUtils]: 183: Hoare triple {38619#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38619#false} is VALID [2022-04-27 13:17:41,904 INFO L290 TraceCheckUtils]: 184: Hoare triple {38619#false} ~cond := #in~cond; {38619#false} is VALID [2022-04-27 13:17:41,904 INFO L290 TraceCheckUtils]: 185: Hoare triple {38619#false} assume 0 == ~cond; {38619#false} is VALID [2022-04-27 13:17:41,904 INFO L290 TraceCheckUtils]: 186: Hoare triple {38619#false} assume !false; {38619#false} is VALID [2022-04-27 13:17:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2022-04-27 13:17:41,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:41,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:41,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122795527] [2022-04-27 13:17:41,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:41,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918674574] [2022-04-27 13:17:41,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918674574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:41,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:41,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:17:41,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936386456] [2022-04-27 13:17:41,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:41,906 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 187 [2022-04-27 13:17:41,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:41,906 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-27 13:17:41,947 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-27 13:17:41,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:17:41,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:41,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:17:41,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:17:41,948 INFO L87 Difference]: Start difference. First operand 806 states and 1058 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-27 13:17:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:42,552 INFO L93 Difference]: Finished difference Result 853 states and 1107 transitions. [2022-04-27 13:17:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:17:42,552 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 187 [2022-04-27 13:17:42,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:42,552 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-27 13:17:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-27 13:17:42,553 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-27 13:17:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-27 13:17:42,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-27 13:17:42,610 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-27 13:17:42,634 INFO L225 Difference]: With dead ends: 853 [2022-04-27 13:17:42,634 INFO L226 Difference]: Without dead ends: 782 [2022-04-27 13:17:42,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 184 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-27 13:17:42,635 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 12 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:42,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-04-27 13:17:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 755. [2022-04-27 13:17:43,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:43,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 782 states. Second operand has 755 states, 566 states have (on average 1.1625441696113075) internal successors, (658), 573 states have internal predecessors, (658), 164 states have call successors, (164), 26 states have call predecessors, (164), 24 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:43,133 INFO L74 IsIncluded]: Start isIncluded. First operand 782 states. Second operand has 755 states, 566 states have (on average 1.1625441696113075) internal successors, (658), 573 states have internal predecessors, (658), 164 states have call successors, (164), 26 states have call predecessors, (164), 24 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:43,134 INFO L87 Difference]: Start difference. First operand 782 states. Second operand has 755 states, 566 states have (on average 1.1625441696113075) internal successors, (658), 573 states have internal predecessors, (658), 164 states have call successors, (164), 26 states have call predecessors, (164), 24 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:43,153 INFO L93 Difference]: Finished difference Result 782 states and 1016 transitions. [2022-04-27 13:17:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1016 transitions. [2022-04-27 13:17:43,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:43,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:43,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 755 states, 566 states have (on average 1.1625441696113075) internal successors, (658), 573 states have internal predecessors, (658), 164 states have call successors, (164), 26 states have call predecessors, (164), 24 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) Second operand 782 states. [2022-04-27 13:17:43,157 INFO L87 Difference]: Start difference. First operand has 755 states, 566 states have (on average 1.1625441696113075) internal successors, (658), 573 states have internal predecessors, (658), 164 states have call successors, (164), 26 states have call predecessors, (164), 24 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) Second operand 782 states. [2022-04-27 13:17:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:43,176 INFO L93 Difference]: Finished difference Result 782 states and 1016 transitions. [2022-04-27 13:17:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1016 transitions. [2022-04-27 13:17:43,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:43,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:43,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:43,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 566 states have (on average 1.1625441696113075) internal successors, (658), 573 states have internal predecessors, (658), 164 states have call successors, (164), 26 states have call predecessors, (164), 24 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 984 transitions. [2022-04-27 13:17:43,201 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 984 transitions. Word has length 187 [2022-04-27 13:17:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:43,201 INFO L495 AbstractCegarLoop]: Abstraction has 755 states and 984 transitions. [2022-04-27 13:17:43,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:17:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 984 transitions. [2022-04-27 13:17:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:17:43,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:43,203 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:43,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-27 13:17:43,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 13:17:43,408 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:43,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:43,408 INFO L85 PathProgramCache]: Analyzing trace with hash -288806385, now seen corresponding path program 7 times [2022-04-27 13:17:43,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:43,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649019849] [2022-04-27 13:17:43,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:43,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:43,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:43,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137495904] [2022-04-27 13:17:43,431 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 13:17:43,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:43,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:43,432 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-27 13:17:43,441 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-27 13:17:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:43,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 13:17:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:43,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:44,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {42989#true} call ULTIMATE.init(); {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {42989#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42989#true} {42989#true} #102#return; {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {42989#true} call #t~ret9 := main(); {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {42989#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; {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {42989#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42989#true} {42989#true} #90#return; {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {42989#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)); {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,102 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42989#true} {42989#true} #92#return; {42989#true} is VALID [2022-04-27 13:17:44,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {42989#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {43042#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,103 INFO L272 TraceCheckUtils]: 19: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,103 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #94#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {43042#(<= main_~v~0 1)} assume !!(0 != ~r~0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {43042#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,104 INFO L272 TraceCheckUtils]: 27: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,105 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #96#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {43042#(<= main_~v~0 1)} assume !(~r~0 > 0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {43042#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,105 INFO L272 TraceCheckUtils]: 35: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,106 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #98#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {43042#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {43042#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,107 INFO L272 TraceCheckUtils]: 43: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,108 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #98#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {43042#(<= main_~v~0 1)} assume !(~r~0 < 0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {43042#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,108 INFO L272 TraceCheckUtils]: 51: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,108 INFO L290 TraceCheckUtils]: 52: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,109 INFO L290 TraceCheckUtils]: 53: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,109 INFO L290 TraceCheckUtils]: 54: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,109 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #94#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {43042#(<= main_~v~0 1)} assume !!(0 != ~r~0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,110 INFO L290 TraceCheckUtils]: 57: Hoare triple {43042#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,110 INFO L290 TraceCheckUtils]: 58: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,110 INFO L272 TraceCheckUtils]: 59: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,110 INFO L290 TraceCheckUtils]: 60: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,110 INFO L290 TraceCheckUtils]: 61: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,110 INFO L290 TraceCheckUtils]: 62: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,110 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #96#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,111 INFO L290 TraceCheckUtils]: 64: Hoare triple {43042#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:44,111 INFO L290 TraceCheckUtils]: 65: Hoare triple {43187#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:44,111 INFO L290 TraceCheckUtils]: 66: Hoare triple {43187#(<= main_~v~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:44,111 INFO L272 TraceCheckUtils]: 67: Hoare triple {43187#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,112 INFO L290 TraceCheckUtils]: 69: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,112 INFO L290 TraceCheckUtils]: 70: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,112 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42989#true} {43187#(<= main_~v~0 3)} #96#return; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:44,112 INFO L290 TraceCheckUtils]: 72: Hoare triple {43187#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,113 INFO L290 TraceCheckUtils]: 73: Hoare triple {43212#(< 0 (+ main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,113 INFO L290 TraceCheckUtils]: 74: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !!(#t~post7 < 50);havoc #t~post7; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,113 INFO L272 TraceCheckUtils]: 75: Hoare triple {43212#(< 0 (+ main_~r~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,113 INFO L290 TraceCheckUtils]: 76: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,113 INFO L290 TraceCheckUtils]: 77: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,113 INFO L290 TraceCheckUtils]: 78: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,114 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {42989#true} {43212#(< 0 (+ main_~r~0 3))} #96#return; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,114 INFO L290 TraceCheckUtils]: 80: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !(~r~0 > 0); {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,114 INFO L290 TraceCheckUtils]: 81: Hoare triple {43212#(< 0 (+ main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,114 INFO L290 TraceCheckUtils]: 82: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !!(#t~post8 < 50);havoc #t~post8; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,115 INFO L272 TraceCheckUtils]: 83: Hoare triple {43212#(< 0 (+ main_~r~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,115 INFO L290 TraceCheckUtils]: 84: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,115 INFO L290 TraceCheckUtils]: 85: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,115 INFO L290 TraceCheckUtils]: 86: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,115 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {42989#true} {43212#(< 0 (+ main_~r~0 3))} #98#return; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,116 INFO L290 TraceCheckUtils]: 88: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,116 INFO L290 TraceCheckUtils]: 89: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,116 INFO L290 TraceCheckUtils]: 90: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,116 INFO L272 TraceCheckUtils]: 91: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,117 INFO L290 TraceCheckUtils]: 94: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,117 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {42989#true} {43261#(< main_~u~0 (+ 5 main_~r~0))} #98#return; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,117 INFO L290 TraceCheckUtils]: 96: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !(~r~0 < 0); {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,117 INFO L290 TraceCheckUtils]: 97: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,118 INFO L290 TraceCheckUtils]: 98: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,118 INFO L272 TraceCheckUtils]: 99: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,118 INFO L290 TraceCheckUtils]: 100: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,118 INFO L290 TraceCheckUtils]: 101: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,118 INFO L290 TraceCheckUtils]: 102: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,118 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {42989#true} {43261#(< main_~u~0 (+ 5 main_~r~0))} #94#return; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,119 INFO L290 TraceCheckUtils]: 104: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(0 != ~r~0); {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,119 INFO L290 TraceCheckUtils]: 105: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,119 INFO L290 TraceCheckUtils]: 106: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,119 INFO L272 TraceCheckUtils]: 107: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,119 INFO L290 TraceCheckUtils]: 108: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,119 INFO L290 TraceCheckUtils]: 109: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,119 INFO L290 TraceCheckUtils]: 110: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,120 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {42989#true} {43261#(< main_~u~0 (+ 5 main_~r~0))} #96#return; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,120 INFO L290 TraceCheckUtils]: 112: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:44,120 INFO L290 TraceCheckUtils]: 113: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:44,121 INFO L290 TraceCheckUtils]: 114: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(#t~post7 < 50);havoc #t~post7; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:44,121 INFO L272 TraceCheckUtils]: 115: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,121 INFO L290 TraceCheckUtils]: 116: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,121 INFO L290 TraceCheckUtils]: 117: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,121 INFO L290 TraceCheckUtils]: 118: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,121 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {42989#true} {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #96#return; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:44,122 INFO L290 TraceCheckUtils]: 120: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !(~r~0 > 0); {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:44,122 INFO L290 TraceCheckUtils]: 121: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:44,122 INFO L290 TraceCheckUtils]: 122: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(#t~post8 < 50);havoc #t~post8; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:44,122 INFO L272 TraceCheckUtils]: 123: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,122 INFO L290 TraceCheckUtils]: 124: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,122 INFO L290 TraceCheckUtils]: 125: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,122 INFO L290 TraceCheckUtils]: 126: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,123 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {42989#true} {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #98#return; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:44,123 INFO L290 TraceCheckUtils]: 128: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,124 INFO L290 TraceCheckUtils]: 129: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,124 INFO L290 TraceCheckUtils]: 130: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,124 INFO L272 TraceCheckUtils]: 131: Hoare triple {43383#(< main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:44,124 INFO L290 TraceCheckUtils]: 132: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,124 INFO L290 TraceCheckUtils]: 133: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,124 INFO L290 TraceCheckUtils]: 134: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,125 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {42989#true} {43383#(< main_~r~0 (+ main_~v~0 1))} #98#return; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,125 INFO L290 TraceCheckUtils]: 136: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !(~r~0 < 0); {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,125 INFO L290 TraceCheckUtils]: 137: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,125 INFO L290 TraceCheckUtils]: 138: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,125 INFO L272 TraceCheckUtils]: 139: Hoare triple {43383#(< main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:44,125 INFO L290 TraceCheckUtils]: 140: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,125 INFO L290 TraceCheckUtils]: 141: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,126 INFO L290 TraceCheckUtils]: 142: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,126 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {42989#true} {43383#(< main_~r~0 (+ main_~v~0 1))} #94#return; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,126 INFO L290 TraceCheckUtils]: 144: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(0 != ~r~0); {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,126 INFO L290 TraceCheckUtils]: 145: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,127 INFO L290 TraceCheckUtils]: 146: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,127 INFO L272 TraceCheckUtils]: 147: Hoare triple {43383#(< main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:44,127 INFO L290 TraceCheckUtils]: 148: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,127 INFO L290 TraceCheckUtils]: 149: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,127 INFO L290 TraceCheckUtils]: 150: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,127 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {42989#true} {43383#(< main_~r~0 (+ main_~v~0 1))} #96#return; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,128 INFO L290 TraceCheckUtils]: 152: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:44,128 INFO L290 TraceCheckUtils]: 153: Hoare triple {43456#(< main_~r~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:44,128 INFO L290 TraceCheckUtils]: 154: Hoare triple {43456#(< main_~r~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:44,128 INFO L272 TraceCheckUtils]: 155: Hoare triple {43456#(< 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)); {42989#true} is VALID [2022-04-27 13:17:44,128 INFO L290 TraceCheckUtils]: 156: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,128 INFO L290 TraceCheckUtils]: 157: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,129 INFO L290 TraceCheckUtils]: 158: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,129 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {42989#true} {43456#(< main_~r~0 1)} #96#return; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:44,129 INFO L290 TraceCheckUtils]: 160: Hoare triple {43456#(< main_~r~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42990#false} is VALID [2022-04-27 13:17:44,129 INFO L290 TraceCheckUtils]: 161: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-27 13:17:44,130 INFO L290 TraceCheckUtils]: 162: Hoare triple {42990#false} assume !!(#t~post7 < 50);havoc #t~post7; {42990#false} is VALID [2022-04-27 13:17:44,130 INFO L272 TraceCheckUtils]: 163: Hoare triple {42990#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42990#false} is VALID [2022-04-27 13:17:44,130 INFO L290 TraceCheckUtils]: 164: Hoare triple {42990#false} ~cond := #in~cond; {42990#false} is VALID [2022-04-27 13:17:44,130 INFO L290 TraceCheckUtils]: 165: Hoare triple {42990#false} assume !(0 == ~cond); {42990#false} is VALID [2022-04-27 13:17:44,130 INFO L290 TraceCheckUtils]: 166: Hoare triple {42990#false} assume true; {42990#false} is VALID [2022-04-27 13:17:44,130 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {42990#false} {42990#false} #96#return; {42990#false} is VALID [2022-04-27 13:17:44,130 INFO L290 TraceCheckUtils]: 168: Hoare triple {42990#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42990#false} is VALID [2022-04-27 13:17:44,130 INFO L290 TraceCheckUtils]: 169: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-27 13:17:44,130 INFO L290 TraceCheckUtils]: 170: Hoare triple {42990#false} assume !!(#t~post7 < 50);havoc #t~post7; {42990#false} is VALID [2022-04-27 13:17:44,130 INFO L272 TraceCheckUtils]: 171: Hoare triple {42990#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42990#false} is VALID [2022-04-27 13:17:44,130 INFO L290 TraceCheckUtils]: 172: Hoare triple {42990#false} ~cond := #in~cond; {42990#false} is VALID [2022-04-27 13:17:44,131 INFO L290 TraceCheckUtils]: 173: Hoare triple {42990#false} assume !(0 == ~cond); {42990#false} is VALID [2022-04-27 13:17:44,131 INFO L290 TraceCheckUtils]: 174: Hoare triple {42990#false} assume true; {42990#false} is VALID [2022-04-27 13:17:44,131 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {42990#false} {42990#false} #96#return; {42990#false} is VALID [2022-04-27 13:17:44,131 INFO L290 TraceCheckUtils]: 176: Hoare triple {42990#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42990#false} is VALID [2022-04-27 13:17:44,131 INFO L290 TraceCheckUtils]: 177: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-27 13:17:44,131 INFO L290 TraceCheckUtils]: 178: Hoare triple {42990#false} assume !(#t~post7 < 50);havoc #t~post7; {42990#false} is VALID [2022-04-27 13:17:44,131 INFO L290 TraceCheckUtils]: 179: Hoare triple {42990#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42990#false} is VALID [2022-04-27 13:17:44,131 INFO L290 TraceCheckUtils]: 180: Hoare triple {42990#false} assume !(#t~post8 < 50);havoc #t~post8; {42990#false} is VALID [2022-04-27 13:17:44,131 INFO L290 TraceCheckUtils]: 181: Hoare triple {42990#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42990#false} is VALID [2022-04-27 13:17:44,131 INFO L290 TraceCheckUtils]: 182: Hoare triple {42990#false} assume !(#t~post6 < 50);havoc #t~post6; {42990#false} is VALID [2022-04-27 13:17:44,132 INFO L272 TraceCheckUtils]: 183: Hoare triple {42990#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42990#false} is VALID [2022-04-27 13:17:44,132 INFO L290 TraceCheckUtils]: 184: Hoare triple {42990#false} ~cond := #in~cond; {42990#false} is VALID [2022-04-27 13:17:44,132 INFO L290 TraceCheckUtils]: 185: Hoare triple {42990#false} assume 0 == ~cond; {42990#false} is VALID [2022-04-27 13:17:44,132 INFO L290 TraceCheckUtils]: 186: Hoare triple {42990#false} assume !false; {42990#false} is VALID [2022-04-27 13:17:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 280 proven. 184 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2022-04-27 13:17:44,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:44,784 INFO L290 TraceCheckUtils]: 186: Hoare triple {42990#false} assume !false; {42990#false} is VALID [2022-04-27 13:17:44,784 INFO L290 TraceCheckUtils]: 185: Hoare triple {42990#false} assume 0 == ~cond; {42990#false} is VALID [2022-04-27 13:17:44,784 INFO L290 TraceCheckUtils]: 184: Hoare triple {42990#false} ~cond := #in~cond; {42990#false} is VALID [2022-04-27 13:17:44,784 INFO L272 TraceCheckUtils]: 183: Hoare triple {42990#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42990#false} is VALID [2022-04-27 13:17:44,784 INFO L290 TraceCheckUtils]: 182: Hoare triple {42990#false} assume !(#t~post6 < 50);havoc #t~post6; {42990#false} is VALID [2022-04-27 13:17:44,784 INFO L290 TraceCheckUtils]: 181: Hoare triple {42990#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42990#false} is VALID [2022-04-27 13:17:44,784 INFO L290 TraceCheckUtils]: 180: Hoare triple {42990#false} assume !(#t~post8 < 50);havoc #t~post8; {42990#false} is VALID [2022-04-27 13:17:44,784 INFO L290 TraceCheckUtils]: 179: Hoare triple {42990#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42990#false} is VALID [2022-04-27 13:17:44,784 INFO L290 TraceCheckUtils]: 178: Hoare triple {42990#false} assume !(#t~post7 < 50);havoc #t~post7; {42990#false} is VALID [2022-04-27 13:17:44,784 INFO L290 TraceCheckUtils]: 177: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-27 13:17:44,784 INFO L290 TraceCheckUtils]: 176: Hoare triple {42990#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42990#false} is VALID [2022-04-27 13:17:44,784 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {42989#true} {42990#false} #96#return; {42990#false} is VALID [2022-04-27 13:17:44,785 INFO L290 TraceCheckUtils]: 174: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,785 INFO L290 TraceCheckUtils]: 173: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,785 INFO L290 TraceCheckUtils]: 172: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,785 INFO L272 TraceCheckUtils]: 171: Hoare triple {42990#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,785 INFO L290 TraceCheckUtils]: 170: Hoare triple {42990#false} assume !!(#t~post7 < 50);havoc #t~post7; {42990#false} is VALID [2022-04-27 13:17:44,785 INFO L290 TraceCheckUtils]: 169: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-27 13:17:44,785 INFO L290 TraceCheckUtils]: 168: Hoare triple {42990#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42990#false} is VALID [2022-04-27 13:17:44,785 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {42989#true} {42990#false} #96#return; {42990#false} is VALID [2022-04-27 13:17:44,785 INFO L290 TraceCheckUtils]: 166: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,785 INFO L290 TraceCheckUtils]: 165: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,785 INFO L290 TraceCheckUtils]: 164: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,785 INFO L272 TraceCheckUtils]: 163: Hoare triple {42990#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,785 INFO L290 TraceCheckUtils]: 162: Hoare triple {42990#false} assume !!(#t~post7 < 50);havoc #t~post7; {42990#false} is VALID [2022-04-27 13:17:44,785 INFO L290 TraceCheckUtils]: 161: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-27 13:17:44,786 INFO L290 TraceCheckUtils]: 160: Hoare triple {43456#(< main_~r~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42990#false} is VALID [2022-04-27 13:17:44,787 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {42989#true} {43456#(< main_~r~0 1)} #96#return; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:44,787 INFO L290 TraceCheckUtils]: 158: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,787 INFO L290 TraceCheckUtils]: 157: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,787 INFO L290 TraceCheckUtils]: 156: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,787 INFO L272 TraceCheckUtils]: 155: Hoare triple {43456#(< 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)); {42989#true} is VALID [2022-04-27 13:17:44,787 INFO L290 TraceCheckUtils]: 154: Hoare triple {43456#(< main_~r~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:44,787 INFO L290 TraceCheckUtils]: 153: Hoare triple {43456#(< main_~r~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:44,788 INFO L290 TraceCheckUtils]: 152: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:44,789 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {42989#true} {43383#(< main_~r~0 (+ main_~v~0 1))} #96#return; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,789 INFO L290 TraceCheckUtils]: 150: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,789 INFO L290 TraceCheckUtils]: 149: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,789 INFO L290 TraceCheckUtils]: 148: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,789 INFO L272 TraceCheckUtils]: 147: Hoare triple {43383#(< main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:44,789 INFO L290 TraceCheckUtils]: 146: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,789 INFO L290 TraceCheckUtils]: 145: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,790 INFO L290 TraceCheckUtils]: 144: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(0 != ~r~0); {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,790 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {42989#true} {43383#(< main_~r~0 (+ main_~v~0 1))} #94#return; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,790 INFO L290 TraceCheckUtils]: 142: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,790 INFO L290 TraceCheckUtils]: 141: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,790 INFO L290 TraceCheckUtils]: 140: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,790 INFO L272 TraceCheckUtils]: 139: Hoare triple {43383#(< main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:44,791 INFO L290 TraceCheckUtils]: 138: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,791 INFO L290 TraceCheckUtils]: 137: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,791 INFO L290 TraceCheckUtils]: 136: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !(~r~0 < 0); {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,792 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {42989#true} {43383#(< main_~r~0 (+ main_~v~0 1))} #98#return; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,792 INFO L290 TraceCheckUtils]: 134: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,792 INFO L290 TraceCheckUtils]: 133: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,792 INFO L290 TraceCheckUtils]: 132: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,792 INFO L272 TraceCheckUtils]: 131: Hoare triple {43383#(< main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:44,792 INFO L290 TraceCheckUtils]: 130: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,792 INFO L290 TraceCheckUtils]: 129: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,793 INFO L290 TraceCheckUtils]: 128: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:44,794 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {42989#true} {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #98#return; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:44,794 INFO L290 TraceCheckUtils]: 126: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,794 INFO L290 TraceCheckUtils]: 125: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,794 INFO L290 TraceCheckUtils]: 124: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,794 INFO L272 TraceCheckUtils]: 123: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:44,794 INFO L290 TraceCheckUtils]: 122: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !!(#t~post8 < 50);havoc #t~post8; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:44,794 INFO L290 TraceCheckUtils]: 121: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:44,795 INFO L290 TraceCheckUtils]: 120: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !(~r~0 > 0); {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:44,795 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {42989#true} {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #96#return; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:44,795 INFO L290 TraceCheckUtils]: 118: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,795 INFO L290 TraceCheckUtils]: 117: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,795 INFO L290 TraceCheckUtils]: 116: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,795 INFO L272 TraceCheckUtils]: 115: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:44,796 INFO L290 TraceCheckUtils]: 114: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !!(#t~post7 < 50);havoc #t~post7; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:44,796 INFO L290 TraceCheckUtils]: 113: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:44,797 INFO L290 TraceCheckUtils]: 112: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:44,797 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {42989#true} {43261#(< main_~u~0 (+ 5 main_~r~0))} #96#return; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,797 INFO L290 TraceCheckUtils]: 110: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,797 INFO L290 TraceCheckUtils]: 109: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,797 INFO L290 TraceCheckUtils]: 108: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,797 INFO L272 TraceCheckUtils]: 107: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,798 INFO L290 TraceCheckUtils]: 106: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,798 INFO L290 TraceCheckUtils]: 105: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,798 INFO L290 TraceCheckUtils]: 104: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(0 != ~r~0); {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,798 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {42989#true} {43261#(< main_~u~0 (+ 5 main_~r~0))} #94#return; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,799 INFO L290 TraceCheckUtils]: 102: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,799 INFO L290 TraceCheckUtils]: 101: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,799 INFO L290 TraceCheckUtils]: 100: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,799 INFO L272 TraceCheckUtils]: 99: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,799 INFO L290 TraceCheckUtils]: 98: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,799 INFO L290 TraceCheckUtils]: 97: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,800 INFO L290 TraceCheckUtils]: 96: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !(~r~0 < 0); {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,800 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {42989#true} {43261#(< main_~u~0 (+ 5 main_~r~0))} #98#return; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,800 INFO L290 TraceCheckUtils]: 94: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,800 INFO L290 TraceCheckUtils]: 93: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,800 INFO L290 TraceCheckUtils]: 92: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,800 INFO L272 TraceCheckUtils]: 91: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,800 INFO L290 TraceCheckUtils]: 90: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,801 INFO L290 TraceCheckUtils]: 89: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,801 INFO L290 TraceCheckUtils]: 88: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:44,802 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {42989#true} {43212#(< 0 (+ main_~r~0 3))} #98#return; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,802 INFO L290 TraceCheckUtils]: 86: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,802 INFO L290 TraceCheckUtils]: 85: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,802 INFO L290 TraceCheckUtils]: 84: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,802 INFO L272 TraceCheckUtils]: 83: Hoare triple {43212#(< 0 (+ main_~r~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,802 INFO L290 TraceCheckUtils]: 82: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !!(#t~post8 < 50);havoc #t~post8; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,803 INFO L290 TraceCheckUtils]: 81: Hoare triple {43212#(< 0 (+ main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,803 INFO L290 TraceCheckUtils]: 80: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !(~r~0 > 0); {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,804 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {42989#true} {43212#(< 0 (+ main_~r~0 3))} #96#return; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,804 INFO L290 TraceCheckUtils]: 78: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,804 INFO L290 TraceCheckUtils]: 77: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,804 INFO L290 TraceCheckUtils]: 76: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,804 INFO L272 TraceCheckUtils]: 75: Hoare triple {43212#(< 0 (+ main_~r~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,804 INFO L290 TraceCheckUtils]: 74: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !!(#t~post7 < 50);havoc #t~post7; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,804 INFO L290 TraceCheckUtils]: 73: Hoare triple {43212#(< 0 (+ main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {43187#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:44,805 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42989#true} {43187#(<= main_~v~0 3)} #96#return; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:44,805 INFO L290 TraceCheckUtils]: 70: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,805 INFO L290 TraceCheckUtils]: 69: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,806 INFO L290 TraceCheckUtils]: 68: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,806 INFO L272 TraceCheckUtils]: 67: Hoare triple {43187#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,806 INFO L290 TraceCheckUtils]: 66: Hoare triple {43187#(<= main_~v~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:44,806 INFO L290 TraceCheckUtils]: 65: Hoare triple {43187#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:44,807 INFO L290 TraceCheckUtils]: 64: Hoare triple {43042#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:44,807 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #96#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,807 INFO L290 TraceCheckUtils]: 62: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,807 INFO L290 TraceCheckUtils]: 61: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,807 INFO L290 TraceCheckUtils]: 60: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,807 INFO L272 TraceCheckUtils]: 59: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,807 INFO L290 TraceCheckUtils]: 58: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {43042#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {43042#(<= main_~v~0 1)} assume !!(0 != ~r~0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,808 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #94#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,809 INFO L290 TraceCheckUtils]: 54: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,809 INFO L272 TraceCheckUtils]: 51: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {43042#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {43042#(<= main_~v~0 1)} assume !(~r~0 < 0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,810 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #98#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,810 INFO L272 TraceCheckUtils]: 43: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {43042#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {43042#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,811 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #98#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,812 INFO L272 TraceCheckUtils]: 35: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {43042#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {43042#(<= main_~v~0 1)} assume !(~r~0 > 0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,813 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #96#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,813 INFO L272 TraceCheckUtils]: 27: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {43042#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {43042#(<= main_~v~0 1)} assume !!(0 != ~r~0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,814 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #94#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,815 INFO L272 TraceCheckUtils]: 19: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:44,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {43042#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {42989#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:44,816 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42989#true} {42989#true} #92#return; {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L272 TraceCheckUtils]: 11: Hoare triple {42989#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)); {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42989#true} {42989#true} #90#return; {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L272 TraceCheckUtils]: 6: Hoare triple {42989#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {42989#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; {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {42989#true} call #t~ret9 := main(); {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42989#true} {42989#true} #102#return; {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {42989#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42989#true} is VALID [2022-04-27 13:17:44,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {42989#true} call ULTIMATE.init(); {42989#true} is VALID [2022-04-27 13:17:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 140 proven. 184 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-27 13:17:44,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:44,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649019849] [2022-04-27 13:17:44,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:44,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137495904] [2022-04-27 13:17:44,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137495904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:44,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:44,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2022-04-27 13:17:44,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640563386] [2022-04-27 13:17:44,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:44,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 187 [2022-04-27 13:17:44,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:44,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-27 13:17:44,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:44,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:17:44,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:44,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:17:44,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:17:44,908 INFO L87 Difference]: Start difference. First operand 755 states and 984 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-27 13:17:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:49,121 INFO L93 Difference]: Finished difference Result 1720 states and 2275 transitions. [2022-04-27 13:17:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 13:17:49,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 187 [2022-04-27 13:17:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-27 13:17:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 430 transitions. [2022-04-27 13:17:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-27 13:17:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 430 transitions. [2022-04-27 13:17:49,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 430 transitions. [2022-04-27 13:17:49,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:49,551 INFO L225 Difference]: With dead ends: 1720 [2022-04-27 13:17:49,551 INFO L226 Difference]: Without dead ends: 1523 [2022-04-27 13:17:49,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2022-04-27 13:17:49,552 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 147 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:49,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 810 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 13:17:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-04-27 13:17:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1314. [2022-04-27 13:17:50,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:50,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1523 states. Second operand has 1314 states, 986 states have (on average 1.1795131845841784) internal successors, (1163), 1002 states have internal predecessors, (1163), 303 states have call successors, (303), 26 states have call predecessors, (303), 24 states have return successors, (301), 285 states have call predecessors, (301), 301 states have call successors, (301) [2022-04-27 13:17:50,783 INFO L74 IsIncluded]: Start isIncluded. First operand 1523 states. Second operand has 1314 states, 986 states have (on average 1.1795131845841784) internal successors, (1163), 1002 states have internal predecessors, (1163), 303 states have call successors, (303), 26 states have call predecessors, (303), 24 states have return successors, (301), 285 states have call predecessors, (301), 301 states have call successors, (301) [2022-04-27 13:17:50,784 INFO L87 Difference]: Start difference. First operand 1523 states. Second operand has 1314 states, 986 states have (on average 1.1795131845841784) internal successors, (1163), 1002 states have internal predecessors, (1163), 303 states have call successors, (303), 26 states have call predecessors, (303), 24 states have return successors, (301), 285 states have call predecessors, (301), 301 states have call successors, (301) [2022-04-27 13:17:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:50,845 INFO L93 Difference]: Finished difference Result 1523 states and 2012 transitions. [2022-04-27 13:17:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2012 transitions. [2022-04-27 13:17:50,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:50,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:50,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 1314 states, 986 states have (on average 1.1795131845841784) internal successors, (1163), 1002 states have internal predecessors, (1163), 303 states have call successors, (303), 26 states have call predecessors, (303), 24 states have return successors, (301), 285 states have call predecessors, (301), 301 states have call successors, (301) Second operand 1523 states. [2022-04-27 13:17:50,850 INFO L87 Difference]: Start difference. First operand has 1314 states, 986 states have (on average 1.1795131845841784) internal successors, (1163), 1002 states have internal predecessors, (1163), 303 states have call successors, (303), 26 states have call predecessors, (303), 24 states have return successors, (301), 285 states have call predecessors, (301), 301 states have call successors, (301) Second operand 1523 states. [2022-04-27 13:17:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:50,915 INFO L93 Difference]: Finished difference Result 1523 states and 2012 transitions. [2022-04-27 13:17:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2012 transitions. [2022-04-27 13:17:50,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:50,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:50,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:50,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 986 states have (on average 1.1795131845841784) internal successors, (1163), 1002 states have internal predecessors, (1163), 303 states have call successors, (303), 26 states have call predecessors, (303), 24 states have return successors, (301), 285 states have call predecessors, (301), 301 states have call successors, (301) [2022-04-27 13:17:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1767 transitions. [2022-04-27 13:17:50,988 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1767 transitions. Word has length 187 [2022-04-27 13:17:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:50,988 INFO L495 AbstractCegarLoop]: Abstraction has 1314 states and 1767 transitions. [2022-04-27 13:17:50,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-27 13:17:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1767 transitions. [2022-04-27 13:17:50,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:17:50,992 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:50,992 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 10, 9, 9, 9, 8, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:51,035 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-27 13:17:51,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:51,206 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:51,206 INFO L85 PathProgramCache]: Analyzing trace with hash -719610275, now seen corresponding path program 8 times [2022-04-27 13:17:51,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:51,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58564371] [2022-04-27 13:17:51,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:51,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:51,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:51,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596745838] [2022-04-27 13:17:51,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:17:51,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:51,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:51,224 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-27 13:17:51,225 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-27 13:17:51,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:17:51,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:51,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:17:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:51,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:51,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {51455#true} call ULTIMATE.init(); {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {51455#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51455#true} {51455#true} #102#return; {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {51455#true} call #t~ret9 := main(); {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {51455#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; {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L272 TraceCheckUtils]: 6: Hoare triple {51455#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51455#true} {51455#true} #90#return; {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L272 TraceCheckUtils]: 11: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51455#true} {51455#true} #92#return; {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {51455#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {51455#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {51455#true} assume !!(#t~post6 < 50);havoc #t~post6; {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L272 TraceCheckUtils]: 19: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51455#true} {51455#true} #94#return; {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {51455#true} assume !!(0 != ~r~0); {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {51455#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {51455#true} assume !!(#t~post7 < 50);havoc #t~post7; {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L272 TraceCheckUtils]: 27: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,967 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51455#true} {51455#true} #96#return; {51455#true} is VALID [2022-04-27 13:17:51,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {51455#true} assume !(~r~0 > 0); {51455#true} is VALID [2022-04-27 13:17:51,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {51455#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51455#true} is VALID [2022-04-27 13:17:51,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {51455#true} assume !!(#t~post8 < 50);havoc #t~post8; {51455#true} is VALID [2022-04-27 13:17:51,967 INFO L272 TraceCheckUtils]: 35: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:51,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,967 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51455#true} {51455#true} #98#return; {51455#true} is VALID [2022-04-27 13:17:51,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {51455#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:51,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:51,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 50);havoc #t~post8; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:51,969 INFO L272 TraceCheckUtils]: 43: Hoare triple {51580#(< (+ 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)); {51455#true} is VALID [2022-04-27 13:17:51,969 INFO L290 TraceCheckUtils]: 44: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,969 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51455#true} {51580#(< (+ main_~r~0 2) main_~u~0)} #98#return; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:51,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:51,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:51,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 50);havoc #t~post6; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:51,970 INFO L272 TraceCheckUtils]: 51: Hoare triple {51580#(< (+ 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)); {51455#true} is VALID [2022-04-27 13:17:51,970 INFO L290 TraceCheckUtils]: 52: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,970 INFO L290 TraceCheckUtils]: 53: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,970 INFO L290 TraceCheckUtils]: 54: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,971 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51455#true} {51580#(< (+ main_~r~0 2) main_~u~0)} #94#return; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:51,971 INFO L290 TraceCheckUtils]: 56: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:51,971 INFO L290 TraceCheckUtils]: 57: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:51,972 INFO L290 TraceCheckUtils]: 58: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:51,972 INFO L272 TraceCheckUtils]: 59: Hoare triple {51580#(< (+ 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)); {51455#true} is VALID [2022-04-27 13:17:51,972 INFO L290 TraceCheckUtils]: 60: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,972 INFO L290 TraceCheckUtils]: 61: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,972 INFO L290 TraceCheckUtils]: 62: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,972 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51455#true} {51580#(< (+ main_~r~0 2) main_~u~0)} #96#return; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:51,973 INFO L290 TraceCheckUtils]: 64: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-27 13:17:51,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-27 13:17:51,974 INFO L290 TraceCheckUtils]: 66: Hoare triple {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-27 13:17:51,974 INFO L272 TraceCheckUtils]: 67: Hoare triple {51653#(< (+ 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)); {51455#true} is VALID [2022-04-27 13:17:51,974 INFO L290 TraceCheckUtils]: 68: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,974 INFO L290 TraceCheckUtils]: 69: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,974 INFO L290 TraceCheckUtils]: 70: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,974 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51455#true} {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-27 13:17:51,975 INFO L290 TraceCheckUtils]: 72: Hoare triple {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:51,975 INFO L290 TraceCheckUtils]: 73: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:51,976 INFO L290 TraceCheckUtils]: 74: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !!(#t~post7 < 50);havoc #t~post7; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:51,976 INFO L272 TraceCheckUtils]: 75: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:51,976 INFO L290 TraceCheckUtils]: 76: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,976 INFO L290 TraceCheckUtils]: 77: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,976 INFO L290 TraceCheckUtils]: 78: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,976 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51455#true} {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #96#return; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:51,977 INFO L290 TraceCheckUtils]: 80: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !(~r~0 > 0); {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:51,977 INFO L290 TraceCheckUtils]: 81: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:51,977 INFO L290 TraceCheckUtils]: 82: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !!(#t~post8 < 50);havoc #t~post8; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:51,977 INFO L272 TraceCheckUtils]: 83: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:51,978 INFO L290 TraceCheckUtils]: 84: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,978 INFO L290 TraceCheckUtils]: 85: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,978 INFO L290 TraceCheckUtils]: 86: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,978 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51455#true} {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #98#return; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:51,993 INFO L290 TraceCheckUtils]: 88: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:51,994 INFO L290 TraceCheckUtils]: 89: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:51,994 INFO L290 TraceCheckUtils]: 90: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(#t~post8 < 50);havoc #t~post8; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:51,994 INFO L272 TraceCheckUtils]: 91: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~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)); {51455#true} is VALID [2022-04-27 13:17:51,994 INFO L290 TraceCheckUtils]: 92: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,994 INFO L290 TraceCheckUtils]: 93: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,994 INFO L290 TraceCheckUtils]: 94: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,995 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51455#true} {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #98#return; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:51,995 INFO L290 TraceCheckUtils]: 96: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !(~r~0 < 0); {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:51,995 INFO L290 TraceCheckUtils]: 97: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:51,996 INFO L290 TraceCheckUtils]: 98: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(#t~post6 < 50);havoc #t~post6; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:51,996 INFO L272 TraceCheckUtils]: 99: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~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)); {51455#true} is VALID [2022-04-27 13:17:51,996 INFO L290 TraceCheckUtils]: 100: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,996 INFO L290 TraceCheckUtils]: 101: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,996 INFO L290 TraceCheckUtils]: 102: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,996 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {51455#true} {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #94#return; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:51,997 INFO L290 TraceCheckUtils]: 104: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(0 != ~r~0); {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:51,997 INFO L290 TraceCheckUtils]: 105: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:51,997 INFO L290 TraceCheckUtils]: 106: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(#t~post7 < 50);havoc #t~post7; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:51,997 INFO L272 TraceCheckUtils]: 107: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~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)); {51455#true} is VALID [2022-04-27 13:17:51,997 INFO L290 TraceCheckUtils]: 108: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,997 INFO L290 TraceCheckUtils]: 109: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,997 INFO L290 TraceCheckUtils]: 110: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:51,998 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {51455#true} {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #96#return; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:51,999 INFO L290 TraceCheckUtils]: 112: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:51,999 INFO L290 TraceCheckUtils]: 113: Hoare triple {51800#(< 4 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:51,999 INFO L290 TraceCheckUtils]: 114: Hoare triple {51800#(< 4 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:51,999 INFO L272 TraceCheckUtils]: 115: Hoare triple {51800#(< 4 (+ 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)); {51455#true} is VALID [2022-04-27 13:17:51,999 INFO L290 TraceCheckUtils]: 116: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:51,999 INFO L290 TraceCheckUtils]: 117: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:51,999 INFO L290 TraceCheckUtils]: 118: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,000 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {51455#true} {51800#(< 4 (+ main_~u~0 main_~r~0))} #96#return; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,000 INFO L290 TraceCheckUtils]: 120: Hoare triple {51800#(< 4 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,000 INFO L290 TraceCheckUtils]: 121: Hoare triple {51800#(< 4 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,000 INFO L290 TraceCheckUtils]: 122: Hoare triple {51800#(< 4 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,001 INFO L272 TraceCheckUtils]: 123: Hoare triple {51800#(< 4 (+ 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)); {51455#true} is VALID [2022-04-27 13:17:52,001 INFO L290 TraceCheckUtils]: 124: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,001 INFO L290 TraceCheckUtils]: 125: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,001 INFO L290 TraceCheckUtils]: 126: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,001 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {51455#true} {51800#(< 4 (+ main_~u~0 main_~r~0))} #98#return; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,011 INFO L290 TraceCheckUtils]: 128: Hoare triple {51800#(< 4 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51849#(< 4 main_~r~0)} is VALID [2022-04-27 13:17:52,012 INFO L290 TraceCheckUtils]: 129: Hoare triple {51849#(< 4 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51849#(< 4 main_~r~0)} is VALID [2022-04-27 13:17:52,012 INFO L290 TraceCheckUtils]: 130: Hoare triple {51849#(< 4 main_~r~0)} assume !!(#t~post8 < 50);havoc #t~post8; {51849#(< 4 main_~r~0)} is VALID [2022-04-27 13:17:52,012 INFO L272 TraceCheckUtils]: 131: Hoare triple {51849#(< 4 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)); {51455#true} is VALID [2022-04-27 13:17:52,012 INFO L290 TraceCheckUtils]: 132: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,012 INFO L290 TraceCheckUtils]: 133: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,012 INFO L290 TraceCheckUtils]: 134: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,013 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {51455#true} {51849#(< 4 main_~r~0)} #98#return; {51849#(< 4 main_~r~0)} is VALID [2022-04-27 13:17:52,014 INFO L290 TraceCheckUtils]: 136: Hoare triple {51849#(< 4 main_~r~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51456#false} is VALID [2022-04-27 13:17:52,014 INFO L290 TraceCheckUtils]: 137: Hoare triple {51456#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51456#false} is VALID [2022-04-27 13:17:52,014 INFO L290 TraceCheckUtils]: 138: Hoare triple {51456#false} assume !!(#t~post8 < 50);havoc #t~post8; {51456#false} is VALID [2022-04-27 13:17:52,014 INFO L272 TraceCheckUtils]: 139: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51456#false} is VALID [2022-04-27 13:17:52,014 INFO L290 TraceCheckUtils]: 140: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:52,014 INFO L290 TraceCheckUtils]: 141: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-27 13:17:52,014 INFO L290 TraceCheckUtils]: 142: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-27 13:17:52,014 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {51456#false} {51456#false} #98#return; {51456#false} is VALID [2022-04-27 13:17:52,014 INFO L290 TraceCheckUtils]: 144: Hoare triple {51456#false} assume !(~r~0 < 0); {51456#false} is VALID [2022-04-27 13:17:52,014 INFO L290 TraceCheckUtils]: 145: Hoare triple {51456#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51456#false} is VALID [2022-04-27 13:17:52,014 INFO L290 TraceCheckUtils]: 146: Hoare triple {51456#false} assume !!(#t~post6 < 50);havoc #t~post6; {51456#false} is VALID [2022-04-27 13:17:52,014 INFO L272 TraceCheckUtils]: 147: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 148: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 149: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 150: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {51456#false} {51456#false} #94#return; {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 152: Hoare triple {51456#false} assume !!(0 != ~r~0); {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 153: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 154: Hoare triple {51456#false} assume !!(#t~post7 < 50);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L272 TraceCheckUtils]: 155: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 156: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 157: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 158: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {51456#false} {51456#false} #96#return; {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 160: Hoare triple {51456#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 161: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 162: Hoare triple {51456#false} assume !!(#t~post7 < 50);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L272 TraceCheckUtils]: 163: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51456#false} is VALID [2022-04-27 13:17:52,015 INFO L290 TraceCheckUtils]: 164: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 165: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 166: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {51456#false} {51456#false} #96#return; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 168: Hoare triple {51456#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 169: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 170: Hoare triple {51456#false} assume !!(#t~post7 < 50);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L272 TraceCheckUtils]: 171: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 172: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 173: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 174: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {51456#false} {51456#false} #96#return; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 176: Hoare triple {51456#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 177: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 178: Hoare triple {51456#false} assume !(#t~post7 < 50);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 179: Hoare triple {51456#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 180: Hoare triple {51456#false} assume !(#t~post8 < 50);havoc #t~post8; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 181: Hoare triple {51456#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51456#false} is VALID [2022-04-27 13:17:52,016 INFO L290 TraceCheckUtils]: 182: Hoare triple {51456#false} assume !(#t~post6 < 50);havoc #t~post6; {51456#false} is VALID [2022-04-27 13:17:52,017 INFO L272 TraceCheckUtils]: 183: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51456#false} is VALID [2022-04-27 13:17:52,017 INFO L290 TraceCheckUtils]: 184: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:52,017 INFO L290 TraceCheckUtils]: 185: Hoare triple {51456#false} assume 0 == ~cond; {51456#false} is VALID [2022-04-27 13:17:52,017 INFO L290 TraceCheckUtils]: 186: Hoare triple {51456#false} assume !false; {51456#false} is VALID [2022-04-27 13:17:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 516 proven. 84 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-27 13:17:52,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:52,591 INFO L290 TraceCheckUtils]: 186: Hoare triple {51456#false} assume !false; {51456#false} is VALID [2022-04-27 13:17:52,591 INFO L290 TraceCheckUtils]: 185: Hoare triple {51456#false} assume 0 == ~cond; {51456#false} is VALID [2022-04-27 13:17:52,591 INFO L290 TraceCheckUtils]: 184: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L272 TraceCheckUtils]: 183: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 182: Hoare triple {51456#false} assume !(#t~post6 < 50);havoc #t~post6; {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 181: Hoare triple {51456#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 180: Hoare triple {51456#false} assume !(#t~post8 < 50);havoc #t~post8; {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 179: Hoare triple {51456#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 178: Hoare triple {51456#false} assume !(#t~post7 < 50);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 177: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 176: Hoare triple {51456#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {51455#true} {51456#false} #96#return; {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 174: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 173: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 172: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,592 INFO L272 TraceCheckUtils]: 171: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 170: Hoare triple {51456#false} assume !!(#t~post7 < 50);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 169: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L290 TraceCheckUtils]: 168: Hoare triple {51456#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51456#false} is VALID [2022-04-27 13:17:52,592 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {51455#true} {51456#false} #96#return; {51456#false} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 166: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 165: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 164: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,593 INFO L272 TraceCheckUtils]: 163: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 162: Hoare triple {51456#false} assume !!(#t~post7 < 50);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 161: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 160: Hoare triple {51456#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51456#false} is VALID [2022-04-27 13:17:52,593 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {51455#true} {51456#false} #96#return; {51456#false} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 158: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 157: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 156: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,593 INFO L272 TraceCheckUtils]: 155: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 154: Hoare triple {51456#false} assume !!(#t~post7 < 50);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 153: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 152: Hoare triple {51456#false} assume !!(0 != ~r~0); {51456#false} is VALID [2022-04-27 13:17:52,593 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {51455#true} {51456#false} #94#return; {51456#false} is VALID [2022-04-27 13:17:52,593 INFO L290 TraceCheckUtils]: 150: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,594 INFO L290 TraceCheckUtils]: 149: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,594 INFO L290 TraceCheckUtils]: 148: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,594 INFO L272 TraceCheckUtils]: 147: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:52,594 INFO L290 TraceCheckUtils]: 146: Hoare triple {51456#false} assume !!(#t~post6 < 50);havoc #t~post6; {51456#false} is VALID [2022-04-27 13:17:52,594 INFO L290 TraceCheckUtils]: 145: Hoare triple {51456#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51456#false} is VALID [2022-04-27 13:17:52,594 INFO L290 TraceCheckUtils]: 144: Hoare triple {51456#false} assume !(~r~0 < 0); {51456#false} is VALID [2022-04-27 13:17:52,594 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {51455#true} {51456#false} #98#return; {51456#false} is VALID [2022-04-27 13:17:52,594 INFO L290 TraceCheckUtils]: 142: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,594 INFO L290 TraceCheckUtils]: 141: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,594 INFO L290 TraceCheckUtils]: 140: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,594 INFO L272 TraceCheckUtils]: 139: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:52,594 INFO L290 TraceCheckUtils]: 138: Hoare triple {51456#false} assume !!(#t~post8 < 50);havoc #t~post8; {51456#false} is VALID [2022-04-27 13:17:52,594 INFO L290 TraceCheckUtils]: 137: Hoare triple {51456#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51456#false} is VALID [2022-04-27 13:17:52,598 INFO L290 TraceCheckUtils]: 136: Hoare triple {52174#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51456#false} is VALID [2022-04-27 13:17:52,599 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {51455#true} {52174#(not (< main_~r~0 0))} #98#return; {52174#(not (< main_~r~0 0))} is VALID [2022-04-27 13:17:52,599 INFO L290 TraceCheckUtils]: 134: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,599 INFO L290 TraceCheckUtils]: 133: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,599 INFO L290 TraceCheckUtils]: 132: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,599 INFO L272 TraceCheckUtils]: 131: Hoare triple {52174#(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)); {51455#true} is VALID [2022-04-27 13:17:52,599 INFO L290 TraceCheckUtils]: 130: Hoare triple {52174#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {52174#(not (< main_~r~0 0))} is VALID [2022-04-27 13:17:52,600 INFO L290 TraceCheckUtils]: 129: Hoare triple {52174#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52174#(not (< main_~r~0 0))} is VALID [2022-04-27 13:17:52,600 INFO L290 TraceCheckUtils]: 128: Hoare triple {52199#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52174#(not (< main_~r~0 0))} is VALID [2022-04-27 13:17:52,601 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {51455#true} {52199#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,601 INFO L290 TraceCheckUtils]: 126: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,601 INFO L290 TraceCheckUtils]: 125: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,601 INFO L290 TraceCheckUtils]: 124: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,601 INFO L272 TraceCheckUtils]: 123: Hoare triple {52199#(<= 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)); {51455#true} is VALID [2022-04-27 13:17:52,601 INFO L290 TraceCheckUtils]: 122: Hoare triple {52199#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,601 INFO L290 TraceCheckUtils]: 121: Hoare triple {52199#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,601 INFO L290 TraceCheckUtils]: 120: Hoare triple {52199#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,602 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {51455#true} {52199#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,602 INFO L290 TraceCheckUtils]: 118: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,602 INFO L290 TraceCheckUtils]: 117: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,602 INFO L290 TraceCheckUtils]: 116: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,602 INFO L272 TraceCheckUtils]: 115: Hoare triple {52199#(<= 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)); {51455#true} is VALID [2022-04-27 13:17:52,602 INFO L290 TraceCheckUtils]: 114: Hoare triple {52199#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,603 INFO L290 TraceCheckUtils]: 113: Hoare triple {52199#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,603 INFO L290 TraceCheckUtils]: 112: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,604 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {51455#true} {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,604 INFO L290 TraceCheckUtils]: 110: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,604 INFO L290 TraceCheckUtils]: 109: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,604 INFO L290 TraceCheckUtils]: 108: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,604 INFO L272 TraceCheckUtils]: 107: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:52,604 INFO L290 TraceCheckUtils]: 106: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,604 INFO L290 TraceCheckUtils]: 105: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,605 INFO L290 TraceCheckUtils]: 104: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(0 != ~r~0); {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,605 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {51455#true} {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #94#return; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,605 INFO L290 TraceCheckUtils]: 102: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,605 INFO L290 TraceCheckUtils]: 101: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,605 INFO L290 TraceCheckUtils]: 100: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,605 INFO L272 TraceCheckUtils]: 99: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:52,606 INFO L290 TraceCheckUtils]: 98: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,606 INFO L290 TraceCheckUtils]: 97: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,606 INFO L290 TraceCheckUtils]: 96: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 < 0); {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,607 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51455#true} {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,607 INFO L290 TraceCheckUtils]: 94: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,607 INFO L290 TraceCheckUtils]: 93: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,607 INFO L290 TraceCheckUtils]: 92: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,607 INFO L272 TraceCheckUtils]: 91: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:52,608 INFO L290 TraceCheckUtils]: 90: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,609 INFO L290 TraceCheckUtils]: 89: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,609 INFO L290 TraceCheckUtils]: 88: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:52,610 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51455#true} {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #98#return; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:52,610 INFO L290 TraceCheckUtils]: 86: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,610 INFO L290 TraceCheckUtils]: 85: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,610 INFO L290 TraceCheckUtils]: 84: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,610 INFO L272 TraceCheckUtils]: 83: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:52,610 INFO L290 TraceCheckUtils]: 82: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !!(#t~post8 < 50);havoc #t~post8; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:52,611 INFO L290 TraceCheckUtils]: 81: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:52,611 INFO L290 TraceCheckUtils]: 80: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !(~r~0 > 0); {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:52,611 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51455#true} {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #96#return; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:52,612 INFO L290 TraceCheckUtils]: 78: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,612 INFO L290 TraceCheckUtils]: 77: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,612 INFO L290 TraceCheckUtils]: 76: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,612 INFO L272 TraceCheckUtils]: 75: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:52,612 INFO L290 TraceCheckUtils]: 74: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !!(#t~post7 < 50);havoc #t~post7; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:52,612 INFO L290 TraceCheckUtils]: 73: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:52,613 INFO L290 TraceCheckUtils]: 72: Hoare triple {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:52,613 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51455#true} {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} #96#return; {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-27 13:17:52,614 INFO L290 TraceCheckUtils]: 70: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,614 INFO L290 TraceCheckUtils]: 69: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,614 INFO L290 TraceCheckUtils]: 68: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,614 INFO L272 TraceCheckUtils]: 67: Hoare triple {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:52,616 INFO L290 TraceCheckUtils]: 66: Hoare triple {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} assume !!(#t~post7 < 50);havoc #t~post7; {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-27 13:17:52,616 INFO L290 TraceCheckUtils]: 65: Hoare triple {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-27 13:17:52,617 INFO L290 TraceCheckUtils]: 64: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-27 13:17:52,618 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51455#true} {52395#(<= (+ main_~r~0 1) main_~u~0)} #96#return; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:52,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,618 INFO L290 TraceCheckUtils]: 60: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,618 INFO L272 TraceCheckUtils]: 59: Hoare triple {52395#(<= (+ 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)); {51455#true} is VALID [2022-04-27 13:17:52,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:52,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:52,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} assume !!(0 != ~r~0); {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:52,619 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51455#true} {52395#(<= (+ main_~r~0 1) main_~u~0)} #94#return; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:52,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,619 INFO L272 TraceCheckUtils]: 51: Hoare triple {52395#(<= (+ 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)); {51455#true} is VALID [2022-04-27 13:17:52,619 INFO L290 TraceCheckUtils]: 50: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} assume !!(#t~post6 < 50);havoc #t~post6; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:52,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:52,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} assume !(~r~0 < 0); {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:52,620 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51455#true} {52395#(<= (+ main_~r~0 1) main_~u~0)} #98#return; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:52,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,621 INFO L272 TraceCheckUtils]: 43: Hoare triple {52395#(<= (+ 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)); {51455#true} is VALID [2022-04-27 13:17:52,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} assume !!(#t~post8 < 50);havoc #t~post8; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:52,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:52,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {51455#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:52,633 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51455#true} {51455#true} #98#return; {51455#true} is VALID [2022-04-27 13:17:52,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,633 INFO L272 TraceCheckUtils]: 35: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:52,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {51455#true} assume !!(#t~post8 < 50);havoc #t~post8; {51455#true} is VALID [2022-04-27 13:17:52,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {51455#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51455#true} is VALID [2022-04-27 13:17:52,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {51455#true} assume !(~r~0 > 0); {51455#true} is VALID [2022-04-27 13:17:52,633 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51455#true} {51455#true} #96#return; {51455#true} is VALID [2022-04-27 13:17:52,633 INFO L290 TraceCheckUtils]: 30: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L272 TraceCheckUtils]: 27: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {51455#true} assume !!(#t~post7 < 50);havoc #t~post7; {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {51455#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {51455#true} assume !!(0 != ~r~0); {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51455#true} {51455#true} #94#return; {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L272 TraceCheckUtils]: 19: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {51455#true} assume !!(#t~post6 < 50);havoc #t~post6; {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {51455#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {51455#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51455#true} {51455#true} #92#return; {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,635 INFO L272 TraceCheckUtils]: 11: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:52,635 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51455#true} {51455#true} #90#return; {51455#true} is VALID [2022-04-27 13:17:52,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:52,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:52,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {51455#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:52,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {51455#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; {51455#true} is VALID [2022-04-27 13:17:52,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {51455#true} call #t~ret9 := main(); {51455#true} is VALID [2022-04-27 13:17:52,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51455#true} {51455#true} #102#return; {51455#true} is VALID [2022-04-27 13:17:52,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:52,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {51455#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51455#true} is VALID [2022-04-27 13:17:52,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {51455#true} call ULTIMATE.init(); {51455#true} is VALID [2022-04-27 13:17:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 226 proven. 84 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2022-04-27 13:17:52,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:52,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58564371] [2022-04-27 13:17:52,636 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:52,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596745838] [2022-04-27 13:17:52,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596745838] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:52,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:52,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 13:17:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604086422] [2022-04-27 13:17:52,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:52,637 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) Word has length 187 [2022-04-27 13:17:52,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:52,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-27 13:17:52,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:52,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:17:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:52,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:17:52,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:17:52,776 INFO L87 Difference]: Start difference. First operand 1314 states and 1767 transitions. Second operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-27 13:17:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:59,260 INFO L93 Difference]: Finished difference Result 2714 states and 3675 transitions. [2022-04-27 13:17:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 13:17:59,261 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) Word has length 187 [2022-04-27 13:17:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-27 13:17:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 442 transitions. [2022-04-27 13:17:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-27 13:17:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 442 transitions. [2022-04-27 13:17:59,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 442 transitions. [2022-04-27 13:17:59,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:59,856 INFO L225 Difference]: With dead ends: 2714 [2022-04-27 13:17:59,857 INFO L226 Difference]: Without dead ends: 2417 [2022-04-27 13:17:59,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=1097, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 13:17:59,858 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 182 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:59,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 969 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 13:17:59,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2022-04-27 13:18:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1968. [2022-04-27 13:18:02,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:02,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2417 states. Second operand has 1968 states, 1475 states have (on average 1.1627118644067798) internal successors, (1715), 1503 states have internal predecessors, (1715), 468 states have call successors, (468), 26 states have call predecessors, (468), 24 states have return successors, (466), 438 states have call predecessors, (466), 466 states have call successors, (466) [2022-04-27 13:18:02,171 INFO L74 IsIncluded]: Start isIncluded. First operand 2417 states. Second operand has 1968 states, 1475 states have (on average 1.1627118644067798) internal successors, (1715), 1503 states have internal predecessors, (1715), 468 states have call successors, (468), 26 states have call predecessors, (468), 24 states have return successors, (466), 438 states have call predecessors, (466), 466 states have call successors, (466) [2022-04-27 13:18:02,172 INFO L87 Difference]: Start difference. First operand 2417 states. Second operand has 1968 states, 1475 states have (on average 1.1627118644067798) internal successors, (1715), 1503 states have internal predecessors, (1715), 468 states have call successors, (468), 26 states have call predecessors, (468), 24 states have return successors, (466), 438 states have call predecessors, (466), 466 states have call successors, (466) [2022-04-27 13:18:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:02,326 INFO L93 Difference]: Finished difference Result 2417 states and 3221 transitions. [2022-04-27 13:18:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3221 transitions. [2022-04-27 13:18:02,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:02,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:02,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 1968 states, 1475 states have (on average 1.1627118644067798) internal successors, (1715), 1503 states have internal predecessors, (1715), 468 states have call successors, (468), 26 states have call predecessors, (468), 24 states have return successors, (466), 438 states have call predecessors, (466), 466 states have call successors, (466) Second operand 2417 states. [2022-04-27 13:18:02,332 INFO L87 Difference]: Start difference. First operand has 1968 states, 1475 states have (on average 1.1627118644067798) internal successors, (1715), 1503 states have internal predecessors, (1715), 468 states have call successors, (468), 26 states have call predecessors, (468), 24 states have return successors, (466), 438 states have call predecessors, (466), 466 states have call successors, (466) Second operand 2417 states. [2022-04-27 13:18:02,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:02,490 INFO L93 Difference]: Finished difference Result 2417 states and 3221 transitions. [2022-04-27 13:18:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3221 transitions. [2022-04-27 13:18:02,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:02,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:02,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:02,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1475 states have (on average 1.1627118644067798) internal successors, (1715), 1503 states have internal predecessors, (1715), 468 states have call successors, (468), 26 states have call predecessors, (468), 24 states have return successors, (466), 438 states have call predecessors, (466), 466 states have call successors, (466) [2022-04-27 13:18:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2649 transitions. [2022-04-27 13:18:02,639 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2649 transitions. Word has length 187 [2022-04-27 13:18:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:02,639 INFO L495 AbstractCegarLoop]: Abstraction has 1968 states and 2649 transitions. [2022-04-27 13:18:02,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-27 13:18:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2649 transitions. [2022-04-27 13:18:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:18:02,644 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:02,644 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:02,661 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-27 13:18:02,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:02,859 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:02,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:02,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1188230671, now seen corresponding path program 9 times [2022-04-27 13:18:02,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:02,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118531535] [2022-04-27 13:18:02,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:02,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:02,878 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:02,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [870182865] [2022-04-27 13:18:02,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:18:02,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:02,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:02,892 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-27 13:18:02,893 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-27 13:18:03,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-04-27 13:18:03,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:18:03,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 13:18:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:03,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:04,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {64085#true} call ULTIMATE.init(); {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {64085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64085#true} {64085#true} #102#return; {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {64085#true} call #t~ret9 := main(); {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {64085#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; {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L272 TraceCheckUtils]: 6: Hoare triple {64085#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {64085#true} {64085#true} #90#return; {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L272 TraceCheckUtils]: 11: Hoare triple {64085#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)); {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,370 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {64085#true} {64085#true} #92#return; {64085#true} is VALID [2022-04-27 13:18:04,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {64085#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {64138#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,371 INFO L272 TraceCheckUtils]: 19: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:04,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,372 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #94#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {64138#(<= main_~v~0 1)} assume !!(0 != ~r~0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {64138#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,373 INFO L272 TraceCheckUtils]: 27: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:04,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,373 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #96#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {64138#(<= main_~v~0 1)} assume !(~r~0 > 0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {64138#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,374 INFO L272 TraceCheckUtils]: 35: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:04,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,375 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #98#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {64138#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {64138#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,376 INFO L272 TraceCheckUtils]: 43: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:04,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,376 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #98#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {64138#(<= main_~v~0 1)} assume !(~r~0 < 0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {64138#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,377 INFO L272 TraceCheckUtils]: 51: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:04,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,378 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #94#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {64138#(<= main_~v~0 1)} assume !!(0 != ~r~0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {64138#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,378 INFO L272 TraceCheckUtils]: 59: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:04,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,378 INFO L290 TraceCheckUtils]: 62: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,379 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #96#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:04,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {64138#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:18:04,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {64283#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:18:04,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {64283#(<= main_~v~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:18:04,380 INFO L272 TraceCheckUtils]: 67: Hoare triple {64283#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:04,380 INFO L290 TraceCheckUtils]: 68: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,380 INFO L290 TraceCheckUtils]: 70: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,381 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {64085#true} {64283#(<= main_~v~0 3)} #96#return; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:18:04,381 INFO L290 TraceCheckUtils]: 72: Hoare triple {64283#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:18:04,382 INFO L290 TraceCheckUtils]: 73: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:18:04,382 INFO L290 TraceCheckUtils]: 74: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post7 < 50);havoc #t~post7; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:18:04,382 INFO L272 TraceCheckUtils]: 75: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:04,382 INFO L290 TraceCheckUtils]: 76: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,382 INFO L290 TraceCheckUtils]: 77: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,382 INFO L290 TraceCheckUtils]: 78: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,383 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {64085#true} {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #96#return; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:18:04,383 INFO L290 TraceCheckUtils]: 80: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !(~r~0 > 0); {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:18:04,383 INFO L290 TraceCheckUtils]: 81: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:18:04,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post8 < 50);havoc #t~post8; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:18:04,384 INFO L272 TraceCheckUtils]: 83: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:04,384 INFO L290 TraceCheckUtils]: 84: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,384 INFO L290 TraceCheckUtils]: 85: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,384 INFO L290 TraceCheckUtils]: 86: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,384 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {64085#true} {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #98#return; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:18:04,386 INFO L290 TraceCheckUtils]: 88: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:18:04,386 INFO L290 TraceCheckUtils]: 89: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:18:04,386 INFO L290 TraceCheckUtils]: 90: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(#t~post8 < 50);havoc #t~post8; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:18:04,386 INFO L272 TraceCheckUtils]: 91: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:04,386 INFO L290 TraceCheckUtils]: 92: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,386 INFO L290 TraceCheckUtils]: 93: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,386 INFO L290 TraceCheckUtils]: 94: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,387 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {64085#true} {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #98#return; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:18:04,387 INFO L290 TraceCheckUtils]: 96: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !(~r~0 < 0); {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:18:04,388 INFO L290 TraceCheckUtils]: 97: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:18:04,388 INFO L290 TraceCheckUtils]: 98: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:18:04,388 INFO L272 TraceCheckUtils]: 99: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:04,388 INFO L290 TraceCheckUtils]: 100: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,388 INFO L290 TraceCheckUtils]: 101: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,388 INFO L290 TraceCheckUtils]: 102: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,388 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {64085#true} {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #94#return; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:18:04,389 INFO L290 TraceCheckUtils]: 104: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(0 != ~r~0); {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:18:04,389 INFO L290 TraceCheckUtils]: 105: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:18:04,389 INFO L290 TraceCheckUtils]: 106: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:18:04,390 INFO L272 TraceCheckUtils]: 107: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:04,390 INFO L290 TraceCheckUtils]: 108: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,390 INFO L290 TraceCheckUtils]: 109: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,390 INFO L290 TraceCheckUtils]: 110: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,390 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {64085#true} {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #96#return; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:18:04,391 INFO L290 TraceCheckUtils]: 112: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64430#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-27 13:18:04,391 INFO L290 TraceCheckUtils]: 113: Hoare triple {64430#(< main_~u~0 (+ main_~r~0 10))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64430#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-27 13:18:04,392 INFO L290 TraceCheckUtils]: 114: Hoare triple {64430#(< main_~u~0 (+ main_~r~0 10))} assume !!(#t~post7 < 50);havoc #t~post7; {64430#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-27 13:18:04,392 INFO L272 TraceCheckUtils]: 115: Hoare triple {64430#(< main_~u~0 (+ main_~r~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)); {64085#true} is VALID [2022-04-27 13:18:04,392 INFO L290 TraceCheckUtils]: 116: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,392 INFO L290 TraceCheckUtils]: 117: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,392 INFO L290 TraceCheckUtils]: 118: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,392 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {64085#true} {64430#(< main_~u~0 (+ main_~r~0 10))} #96#return; {64430#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-27 13:18:04,393 INFO L290 TraceCheckUtils]: 120: Hoare triple {64430#(< main_~u~0 (+ main_~r~0 10))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:18:04,393 INFO L290 TraceCheckUtils]: 121: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:18:04,394 INFO L290 TraceCheckUtils]: 122: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !!(#t~post7 < 50);havoc #t~post7; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:18:04,394 INFO L272 TraceCheckUtils]: 123: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:04,394 INFO L290 TraceCheckUtils]: 124: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,394 INFO L290 TraceCheckUtils]: 125: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,394 INFO L290 TraceCheckUtils]: 126: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,394 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {64085#true} {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #96#return; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:18:04,395 INFO L290 TraceCheckUtils]: 128: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !(~r~0 > 0); {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:18:04,395 INFO L290 TraceCheckUtils]: 129: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:18:04,395 INFO L290 TraceCheckUtils]: 130: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !!(#t~post8 < 50);havoc #t~post8; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:18:04,396 INFO L272 TraceCheckUtils]: 131: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:04,396 INFO L290 TraceCheckUtils]: 132: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,396 INFO L290 TraceCheckUtils]: 133: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,396 INFO L290 TraceCheckUtils]: 134: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,396 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {64085#true} {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #98#return; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:18:04,397 INFO L290 TraceCheckUtils]: 136: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:18:04,398 INFO L290 TraceCheckUtils]: 137: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:18:04,398 INFO L290 TraceCheckUtils]: 138: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(#t~post8 < 50);havoc #t~post8; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:18:04,398 INFO L272 TraceCheckUtils]: 139: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~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)); {64085#true} is VALID [2022-04-27 13:18:04,398 INFO L290 TraceCheckUtils]: 140: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,398 INFO L290 TraceCheckUtils]: 141: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,398 INFO L290 TraceCheckUtils]: 142: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,399 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {64085#true} {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #98#return; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:18:04,399 INFO L290 TraceCheckUtils]: 144: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !(~r~0 < 0); {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:18:04,399 INFO L290 TraceCheckUtils]: 145: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:18:04,400 INFO L290 TraceCheckUtils]: 146: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(#t~post6 < 50);havoc #t~post6; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:18:04,400 INFO L272 TraceCheckUtils]: 147: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~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)); {64085#true} is VALID [2022-04-27 13:18:04,400 INFO L290 TraceCheckUtils]: 148: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,400 INFO L290 TraceCheckUtils]: 149: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,400 INFO L290 TraceCheckUtils]: 150: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,400 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {64085#true} {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #94#return; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:18:04,400 INFO L290 TraceCheckUtils]: 152: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(0 != ~r~0); {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:18:04,401 INFO L290 TraceCheckUtils]: 153: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:18:04,401 INFO L290 TraceCheckUtils]: 154: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(#t~post7 < 50);havoc #t~post7; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:18:04,401 INFO L272 TraceCheckUtils]: 155: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~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)); {64085#true} is VALID [2022-04-27 13:18:04,401 INFO L290 TraceCheckUtils]: 156: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,401 INFO L290 TraceCheckUtils]: 157: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,401 INFO L290 TraceCheckUtils]: 158: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,402 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {64085#true} {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #96#return; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:18:04,403 INFO L290 TraceCheckUtils]: 160: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-27 13:18:04,403 INFO L290 TraceCheckUtils]: 161: Hoare triple {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-27 13:18:04,403 INFO L290 TraceCheckUtils]: 162: Hoare triple {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} assume !!(#t~post7 < 50);havoc #t~post7; {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-27 13:18:04,403 INFO L272 TraceCheckUtils]: 163: Hoare triple {64577#(and (< 5 main_~v~0) (< main_~r~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)); {64085#true} is VALID [2022-04-27 13:18:04,403 INFO L290 TraceCheckUtils]: 164: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,403 INFO L290 TraceCheckUtils]: 165: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,403 INFO L290 TraceCheckUtils]: 166: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,404 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {64085#true} {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} #96#return; {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-27 13:18:04,404 INFO L290 TraceCheckUtils]: 168: Hoare triple {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64602#(< main_~r~0 0)} is VALID [2022-04-27 13:18:04,405 INFO L290 TraceCheckUtils]: 169: Hoare triple {64602#(< main_~r~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64602#(< main_~r~0 0)} is VALID [2022-04-27 13:18:04,405 INFO L290 TraceCheckUtils]: 170: Hoare triple {64602#(< main_~r~0 0)} assume !!(#t~post7 < 50);havoc #t~post7; {64602#(< main_~r~0 0)} is VALID [2022-04-27 13:18:04,405 INFO L272 TraceCheckUtils]: 171: Hoare triple {64602#(< 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)); {64085#true} is VALID [2022-04-27 13:18:04,405 INFO L290 TraceCheckUtils]: 172: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:04,405 INFO L290 TraceCheckUtils]: 173: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:04,405 INFO L290 TraceCheckUtils]: 174: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:04,406 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {64085#true} {64602#(< main_~r~0 0)} #96#return; {64602#(< main_~r~0 0)} is VALID [2022-04-27 13:18:04,406 INFO L290 TraceCheckUtils]: 176: Hoare triple {64602#(< main_~r~0 0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64086#false} is VALID [2022-04-27 13:18:04,406 INFO L290 TraceCheckUtils]: 177: Hoare triple {64086#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64086#false} is VALID [2022-04-27 13:18:04,406 INFO L290 TraceCheckUtils]: 178: Hoare triple {64086#false} assume !(#t~post7 < 50);havoc #t~post7; {64086#false} is VALID [2022-04-27 13:18:04,406 INFO L290 TraceCheckUtils]: 179: Hoare triple {64086#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64086#false} is VALID [2022-04-27 13:18:04,406 INFO L290 TraceCheckUtils]: 180: Hoare triple {64086#false} assume !(#t~post8 < 50);havoc #t~post8; {64086#false} is VALID [2022-04-27 13:18:04,406 INFO L290 TraceCheckUtils]: 181: Hoare triple {64086#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64086#false} is VALID [2022-04-27 13:18:04,406 INFO L290 TraceCheckUtils]: 182: Hoare triple {64086#false} assume !(#t~post6 < 50);havoc #t~post6; {64086#false} is VALID [2022-04-27 13:18:04,406 INFO L272 TraceCheckUtils]: 183: Hoare triple {64086#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64086#false} is VALID [2022-04-27 13:18:04,406 INFO L290 TraceCheckUtils]: 184: Hoare triple {64086#false} ~cond := #in~cond; {64086#false} is VALID [2022-04-27 13:18:04,407 INFO L290 TraceCheckUtils]: 185: Hoare triple {64086#false} assume 0 == ~cond; {64086#false} is VALID [2022-04-27 13:18:04,407 INFO L290 TraceCheckUtils]: 186: Hoare triple {64086#false} assume !false; {64086#false} is VALID [2022-04-27 13:18:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 84 proven. 248 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2022-04-27 13:18:04,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:05,457 INFO L290 TraceCheckUtils]: 186: Hoare triple {64086#false} assume !false; {64086#false} is VALID [2022-04-27 13:18:05,457 INFO L290 TraceCheckUtils]: 185: Hoare triple {64086#false} assume 0 == ~cond; {64086#false} is VALID [2022-04-27 13:18:05,457 INFO L290 TraceCheckUtils]: 184: Hoare triple {64086#false} ~cond := #in~cond; {64086#false} is VALID [2022-04-27 13:18:05,458 INFO L272 TraceCheckUtils]: 183: Hoare triple {64086#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64086#false} is VALID [2022-04-27 13:18:05,458 INFO L290 TraceCheckUtils]: 182: Hoare triple {64086#false} assume !(#t~post6 < 50);havoc #t~post6; {64086#false} is VALID [2022-04-27 13:18:05,458 INFO L290 TraceCheckUtils]: 181: Hoare triple {64086#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64086#false} is VALID [2022-04-27 13:18:05,458 INFO L290 TraceCheckUtils]: 180: Hoare triple {64086#false} assume !(#t~post8 < 50);havoc #t~post8; {64086#false} is VALID [2022-04-27 13:18:05,458 INFO L290 TraceCheckUtils]: 179: Hoare triple {64086#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64086#false} is VALID [2022-04-27 13:18:05,458 INFO L290 TraceCheckUtils]: 178: Hoare triple {64086#false} assume !(#t~post7 < 50);havoc #t~post7; {64086#false} is VALID [2022-04-27 13:18:05,458 INFO L290 TraceCheckUtils]: 177: Hoare triple {64086#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64086#false} is VALID [2022-04-27 13:18:05,458 INFO L290 TraceCheckUtils]: 176: Hoare triple {64687#(not (< 0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64086#false} is VALID [2022-04-27 13:18:05,459 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {64085#true} {64687#(not (< 0 main_~r~0))} #96#return; {64687#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:18:05,459 INFO L290 TraceCheckUtils]: 174: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,459 INFO L290 TraceCheckUtils]: 173: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,459 INFO L290 TraceCheckUtils]: 172: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,459 INFO L272 TraceCheckUtils]: 171: Hoare triple {64687#(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)); {64085#true} is VALID [2022-04-27 13:18:05,459 INFO L290 TraceCheckUtils]: 170: Hoare triple {64687#(not (< 0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {64687#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:18:05,459 INFO L290 TraceCheckUtils]: 169: Hoare triple {64687#(not (< 0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64687#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:18:05,460 INFO L290 TraceCheckUtils]: 168: Hoare triple {64712#(<= main_~r~0 main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64687#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:18:05,461 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {64085#true} {64712#(<= main_~r~0 main_~v~0)} #96#return; {64712#(<= main_~r~0 main_~v~0)} is VALID [2022-04-27 13:18:05,461 INFO L290 TraceCheckUtils]: 166: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,461 INFO L290 TraceCheckUtils]: 165: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,461 INFO L290 TraceCheckUtils]: 164: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,461 INFO L272 TraceCheckUtils]: 163: Hoare triple {64712#(<= main_~r~0 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,461 INFO L290 TraceCheckUtils]: 162: Hoare triple {64712#(<= main_~r~0 main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {64712#(<= main_~r~0 main_~v~0)} is VALID [2022-04-27 13:18:05,461 INFO L290 TraceCheckUtils]: 161: Hoare triple {64712#(<= main_~r~0 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64712#(<= main_~r~0 main_~v~0)} is VALID [2022-04-27 13:18:05,462 INFO L290 TraceCheckUtils]: 160: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64712#(<= main_~r~0 main_~v~0)} is VALID [2022-04-27 13:18:05,462 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {64085#true} {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #96#return; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:18:05,462 INFO L290 TraceCheckUtils]: 158: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,462 INFO L290 TraceCheckUtils]: 157: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,462 INFO L290 TraceCheckUtils]: 156: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,463 INFO L272 TraceCheckUtils]: 155: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,463 INFO L290 TraceCheckUtils]: 154: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post7 < 50);havoc #t~post7; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:18:05,463 INFO L290 TraceCheckUtils]: 153: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:18:05,463 INFO L290 TraceCheckUtils]: 152: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(0 != ~r~0); {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:18:05,464 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {64085#true} {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #94#return; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:18:05,464 INFO L290 TraceCheckUtils]: 150: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,464 INFO L290 TraceCheckUtils]: 149: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,464 INFO L290 TraceCheckUtils]: 148: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,464 INFO L272 TraceCheckUtils]: 147: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,464 INFO L290 TraceCheckUtils]: 146: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post6 < 50);havoc #t~post6; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:18:05,465 INFO L290 TraceCheckUtils]: 145: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:18:05,465 INFO L290 TraceCheckUtils]: 144: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !(~r~0 < 0); {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:18:05,465 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {64085#true} {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #98#return; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:18:05,465 INFO L290 TraceCheckUtils]: 142: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,465 INFO L290 TraceCheckUtils]: 141: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,466 INFO L290 TraceCheckUtils]: 140: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,466 INFO L272 TraceCheckUtils]: 139: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,466 INFO L290 TraceCheckUtils]: 138: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:18:05,466 INFO L290 TraceCheckUtils]: 137: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:18:05,467 INFO L290 TraceCheckUtils]: 136: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:18:05,468 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {64085#true} {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #98#return; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:18:05,468 INFO L290 TraceCheckUtils]: 134: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,468 INFO L290 TraceCheckUtils]: 133: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,468 INFO L290 TraceCheckUtils]: 132: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,468 INFO L272 TraceCheckUtils]: 131: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,468 INFO L290 TraceCheckUtils]: 130: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(#t~post8 < 50);havoc #t~post8; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:18:05,469 INFO L290 TraceCheckUtils]: 129: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:18:05,469 INFO L290 TraceCheckUtils]: 128: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:18:05,469 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {64085#true} {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #96#return; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:18:05,470 INFO L290 TraceCheckUtils]: 126: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,470 INFO L290 TraceCheckUtils]: 125: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,470 INFO L290 TraceCheckUtils]: 124: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,470 INFO L272 TraceCheckUtils]: 123: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,470 INFO L290 TraceCheckUtils]: 122: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 50);havoc #t~post7; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:18:05,470 INFO L290 TraceCheckUtils]: 121: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:18:05,471 INFO L290 TraceCheckUtils]: 120: Hoare triple {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:18:05,471 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {64085#true} {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} #96#return; {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,471 INFO L290 TraceCheckUtils]: 118: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,472 INFO L290 TraceCheckUtils]: 117: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,472 INFO L290 TraceCheckUtils]: 116: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,472 INFO L272 TraceCheckUtils]: 115: Hoare triple {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,472 INFO L290 TraceCheckUtils]: 114: Hoare triple {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} assume !!(#t~post7 < 50);havoc #t~post7; {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,472 INFO L290 TraceCheckUtils]: 113: Hoare triple {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,473 INFO L290 TraceCheckUtils]: 112: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,473 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {64085#true} {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #96#return; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,473 INFO L290 TraceCheckUtils]: 110: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,473 INFO L290 TraceCheckUtils]: 109: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,474 INFO L290 TraceCheckUtils]: 108: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,474 INFO L272 TraceCheckUtils]: 107: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,474 INFO L290 TraceCheckUtils]: 106: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(#t~post7 < 50);havoc #t~post7; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,474 INFO L290 TraceCheckUtils]: 105: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,475 INFO L290 TraceCheckUtils]: 104: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(0 != ~r~0); {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,475 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {64085#true} {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #94#return; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,475 INFO L290 TraceCheckUtils]: 102: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,475 INFO L290 TraceCheckUtils]: 101: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,475 INFO L290 TraceCheckUtils]: 100: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,475 INFO L272 TraceCheckUtils]: 99: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,476 INFO L290 TraceCheckUtils]: 98: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(#t~post6 < 50);havoc #t~post6; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,476 INFO L290 TraceCheckUtils]: 97: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,476 INFO L290 TraceCheckUtils]: 96: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !(~r~0 < 0); {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,477 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {64085#true} {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #98#return; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,477 INFO L290 TraceCheckUtils]: 94: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,477 INFO L290 TraceCheckUtils]: 93: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,477 INFO L290 TraceCheckUtils]: 92: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,477 INFO L272 TraceCheckUtils]: 91: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,478 INFO L290 TraceCheckUtils]: 90: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(#t~post8 < 50);havoc #t~post8; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,478 INFO L290 TraceCheckUtils]: 89: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,479 INFO L290 TraceCheckUtils]: 88: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:18:05,479 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {64085#true} {64957#(<= main_~v~0 (+ main_~r~0 8))} #98#return; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:18:05,480 INFO L290 TraceCheckUtils]: 86: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,480 INFO L290 TraceCheckUtils]: 85: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,480 INFO L290 TraceCheckUtils]: 84: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,480 INFO L272 TraceCheckUtils]: 83: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,480 INFO L290 TraceCheckUtils]: 82: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} assume !!(#t~post8 < 50);havoc #t~post8; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:18:05,480 INFO L290 TraceCheckUtils]: 81: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:18:05,480 INFO L290 TraceCheckUtils]: 80: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} assume !(~r~0 > 0); {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:18:05,481 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {64085#true} {64957#(<= main_~v~0 (+ main_~r~0 8))} #96#return; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:18:05,481 INFO L290 TraceCheckUtils]: 78: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,481 INFO L290 TraceCheckUtils]: 77: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,481 INFO L290 TraceCheckUtils]: 76: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,481 INFO L272 TraceCheckUtils]: 75: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,481 INFO L290 TraceCheckUtils]: 74: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} assume !!(#t~post7 < 50);havoc #t~post7; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:18:05,482 INFO L290 TraceCheckUtils]: 73: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:18:05,482 INFO L290 TraceCheckUtils]: 72: Hoare triple {64283#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:18:05,483 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {64085#true} {64283#(<= main_~v~0 3)} #96#return; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:18:05,483 INFO L290 TraceCheckUtils]: 70: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,483 INFO L290 TraceCheckUtils]: 69: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,483 INFO L290 TraceCheckUtils]: 68: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,483 INFO L272 TraceCheckUtils]: 67: Hoare triple {64283#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:05,483 INFO L290 TraceCheckUtils]: 66: Hoare triple {64283#(<= main_~v~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:18:05,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {64283#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:18:05,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {64138#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:18:05,484 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #96#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,484 INFO L272 TraceCheckUtils]: 59: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:05,485 INFO L290 TraceCheckUtils]: 58: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,485 INFO L290 TraceCheckUtils]: 57: Hoare triple {64138#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,485 INFO L290 TraceCheckUtils]: 56: Hoare triple {64138#(<= main_~v~0 1)} assume !!(0 != ~r~0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,486 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #94#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,486 INFO L290 TraceCheckUtils]: 54: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,486 INFO L272 TraceCheckUtils]: 51: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:05,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {64138#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {64138#(<= main_~v~0 1)} assume !(~r~0 < 0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,487 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #98#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,487 INFO L290 TraceCheckUtils]: 44: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,487 INFO L272 TraceCheckUtils]: 43: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:05,487 INFO L290 TraceCheckUtils]: 42: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {64138#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {64138#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,488 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #98#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,489 INFO L272 TraceCheckUtils]: 35: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:05,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {64138#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {64138#(<= main_~v~0 1)} assume !(~r~0 > 0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,490 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #96#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,490 INFO L272 TraceCheckUtils]: 27: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:05,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {64138#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {64138#(<= main_~v~0 1)} assume !!(0 != ~r~0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,491 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #94#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,491 INFO L272 TraceCheckUtils]: 19: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:18:05,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {64138#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {64085#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:18:05,492 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {64085#true} {64085#true} #92#return; {64085#true} is VALID [2022-04-27 13:18:05,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,492 INFO L272 TraceCheckUtils]: 11: Hoare triple {64085#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)); {64085#true} is VALID [2022-04-27 13:18:05,492 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {64085#true} {64085#true} #90#return; {64085#true} is VALID [2022-04-27 13:18:05,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:18:05,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:18:05,493 INFO L272 TraceCheckUtils]: 6: Hoare triple {64085#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:18:05,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {64085#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; {64085#true} is VALID [2022-04-27 13:18:05,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {64085#true} call #t~ret9 := main(); {64085#true} is VALID [2022-04-27 13:18:05,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64085#true} {64085#true} #102#return; {64085#true} is VALID [2022-04-27 13:18:05,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:18:05,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {64085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {64085#true} is VALID [2022-04-27 13:18:05,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {64085#true} call ULTIMATE.init(); {64085#true} is VALID [2022-04-27 13:18:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 84 proven. 248 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2022-04-27 13:18:05,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:05,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118531535] [2022-04-27 13:18:05,494 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:05,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870182865] [2022-04-27 13:18:05,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870182865] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:05,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:05,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-27 13:18:05,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208999570] [2022-04-27 13:18:05,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:05,495 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) Word has length 187 [2022-04-27 13:18:05,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:05,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-27 13:18:05,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:05,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 13:18:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:05,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 13:18:05,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-27 13:18:05,637 INFO L87 Difference]: Start difference. First operand 1968 states and 2649 transitions. Second operand has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-27 13:18:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:19,734 INFO L93 Difference]: Finished difference Result 3252 states and 4395 transitions. [2022-04-27 13:18:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-27 13:18:19,734 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) Word has length 187 [2022-04-27 13:18:19,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-27 13:18:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 746 transitions. [2022-04-27 13:18:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-27 13:18:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 746 transitions. [2022-04-27 13:18:19,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 746 transitions. [2022-04-27 13:18:20,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 746 edges. 746 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:20,751 INFO L225 Difference]: With dead ends: 3252 [2022-04-27 13:18:20,752 INFO L226 Difference]: Without dead ends: 2993 [2022-04-27 13:18:20,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=507, Invalid=2573, Unknown=0, NotChecked=0, Total=3080 [2022-04-27 13:18:20,753 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 276 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:20,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 2084 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 13:18:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2022-04-27 13:18:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2462. [2022-04-27 13:18:24,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:24,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2993 states. Second operand has 2462 states, 1845 states have (on average 1.1718157181571816) internal successors, (2162), 1887 states have internal predecessors, (2162), 592 states have call successors, (592), 26 states have call predecessors, (592), 24 states have return successors, (590), 548 states have call predecessors, (590), 590 states have call successors, (590) [2022-04-27 13:18:24,176 INFO L74 IsIncluded]: Start isIncluded. First operand 2993 states. Second operand has 2462 states, 1845 states have (on average 1.1718157181571816) internal successors, (2162), 1887 states have internal predecessors, (2162), 592 states have call successors, (592), 26 states have call predecessors, (592), 24 states have return successors, (590), 548 states have call predecessors, (590), 590 states have call successors, (590) [2022-04-27 13:18:24,177 INFO L87 Difference]: Start difference. First operand 2993 states. Second operand has 2462 states, 1845 states have (on average 1.1718157181571816) internal successors, (2162), 1887 states have internal predecessors, (2162), 592 states have call successors, (592), 26 states have call predecessors, (592), 24 states have return successors, (590), 548 states have call predecessors, (590), 590 states have call successors, (590) [2022-04-27 13:18:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:24,417 INFO L93 Difference]: Finished difference Result 2993 states and 4017 transitions. [2022-04-27 13:18:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4017 transitions. [2022-04-27 13:18:24,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:24,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:24,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 2462 states, 1845 states have (on average 1.1718157181571816) internal successors, (2162), 1887 states have internal predecessors, (2162), 592 states have call successors, (592), 26 states have call predecessors, (592), 24 states have return successors, (590), 548 states have call predecessors, (590), 590 states have call successors, (590) Second operand 2993 states. [2022-04-27 13:18:24,426 INFO L87 Difference]: Start difference. First operand has 2462 states, 1845 states have (on average 1.1718157181571816) internal successors, (2162), 1887 states have internal predecessors, (2162), 592 states have call successors, (592), 26 states have call predecessors, (592), 24 states have return successors, (590), 548 states have call predecessors, (590), 590 states have call successors, (590) Second operand 2993 states. [2022-04-27 13:18:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:24,668 INFO L93 Difference]: Finished difference Result 2993 states and 4017 transitions. [2022-04-27 13:18:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4017 transitions. [2022-04-27 13:18:24,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:24,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:24,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:24,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 1845 states have (on average 1.1718157181571816) internal successors, (2162), 1887 states have internal predecessors, (2162), 592 states have call successors, (592), 26 states have call predecessors, (592), 24 states have return successors, (590), 548 states have call predecessors, (590), 590 states have call successors, (590) [2022-04-27 13:18:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 3344 transitions. [2022-04-27 13:18:24,917 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 3344 transitions. Word has length 187 [2022-04-27 13:18:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:24,918 INFO L495 AbstractCegarLoop]: Abstraction has 2462 states and 3344 transitions. [2022-04-27 13:18:24,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-27 13:18:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 3344 transitions. [2022-04-27 13:18:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:18:24,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:24,921 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:24,929 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-27 13:18:25,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:25,122 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:25,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:25,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2070462991, now seen corresponding path program 10 times [2022-04-27 13:18:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:25,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936471588] [2022-04-27 13:18:25,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:25,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:25,142 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:25,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737747576] [2022-04-27 13:18:25,143 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 13:18:25,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:25,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:25,144 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-27 13:18:25,145 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-27 13:18:25,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 13:18:25,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:18:25,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-27 13:18:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:25,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:26,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {79339#true} call ULTIMATE.init(); {79339#true} is VALID [2022-04-27 13:18:26,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {79339#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {79347#(<= ~counter~0 0)} assume true; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79347#(<= ~counter~0 0)} {79339#true} #102#return; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {79347#(<= ~counter~0 0)} call #t~ret9 := main(); {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {79347#(<= ~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; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,238 INFO L272 TraceCheckUtils]: 6: Hoare triple {79347#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {79347#(<= ~counter~0 0)} ~cond := #in~cond; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {79347#(<= ~counter~0 0)} assume !(0 == ~cond); {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {79347#(<= ~counter~0 0)} assume true; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,240 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79347#(<= ~counter~0 0)} {79347#(<= ~counter~0 0)} #90#return; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,240 INFO L272 TraceCheckUtils]: 11: Hoare triple {79347#(<= ~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)); {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {79347#(<= ~counter~0 0)} ~cond := #in~cond; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {79347#(<= ~counter~0 0)} assume !(0 == ~cond); {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {79347#(<= ~counter~0 0)} assume true; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,241 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79347#(<= ~counter~0 0)} {79347#(<= ~counter~0 0)} #92#return; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {79347#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {79347#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {79396#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,243 INFO L272 TraceCheckUtils]: 19: Hoare triple {79396#(<= ~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)); {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {79396#(<= ~counter~0 1)} ~cond := #in~cond; {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {79396#(<= ~counter~0 1)} assume !(0 == ~cond); {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {79396#(<= ~counter~0 1)} assume true; {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,244 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79396#(<= ~counter~0 1)} {79396#(<= ~counter~0 1)} #94#return; {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {79396#(<= ~counter~0 1)} assume !!(0 != ~r~0); {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {79396#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:26,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {79421#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:26,246 INFO L272 TraceCheckUtils]: 27: Hoare triple {79421#(<= ~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)); {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:26,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {79421#(<= ~counter~0 2)} ~cond := #in~cond; {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:26,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {79421#(<= ~counter~0 2)} assume !(0 == ~cond); {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:26,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {79421#(<= ~counter~0 2)} assume true; {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:26,247 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79421#(<= ~counter~0 2)} {79421#(<= ~counter~0 2)} #96#return; {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:26,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {79421#(<= ~counter~0 2)} assume !(~r~0 > 0); {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:26,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {79421#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:26,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {79446#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:26,249 INFO L272 TraceCheckUtils]: 35: Hoare triple {79446#(<= ~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)); {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:26,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {79446#(<= ~counter~0 3)} ~cond := #in~cond; {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:26,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {79446#(<= ~counter~0 3)} assume !(0 == ~cond); {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:26,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {79446#(<= ~counter~0 3)} assume true; {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:26,250 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79446#(<= ~counter~0 3)} {79446#(<= ~counter~0 3)} #98#return; {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:26,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {79446#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:26,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {79446#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:26,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {79471#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:26,252 INFO L272 TraceCheckUtils]: 43: Hoare triple {79471#(<= ~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)); {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:26,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {79471#(<= ~counter~0 4)} ~cond := #in~cond; {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:26,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {79471#(<= ~counter~0 4)} assume !(0 == ~cond); {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:26,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {79471#(<= ~counter~0 4)} assume true; {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:26,254 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79471#(<= ~counter~0 4)} {79471#(<= ~counter~0 4)} #98#return; {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:26,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {79471#(<= ~counter~0 4)} assume !(~r~0 < 0); {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:26,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {79471#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:26,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {79496#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:26,256 INFO L272 TraceCheckUtils]: 51: Hoare triple {79496#(<= ~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)); {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:26,256 INFO L290 TraceCheckUtils]: 52: Hoare triple {79496#(<= ~counter~0 5)} ~cond := #in~cond; {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:26,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {79496#(<= ~counter~0 5)} assume !(0 == ~cond); {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:26,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {79496#(<= ~counter~0 5)} assume true; {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:26,257 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79496#(<= ~counter~0 5)} {79496#(<= ~counter~0 5)} #94#return; {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:26,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {79496#(<= ~counter~0 5)} assume !!(0 != ~r~0); {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:26,258 INFO L290 TraceCheckUtils]: 57: Hoare triple {79496#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:26,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {79521#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:26,259 INFO L272 TraceCheckUtils]: 59: Hoare triple {79521#(<= ~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)); {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:26,259 INFO L290 TraceCheckUtils]: 60: Hoare triple {79521#(<= ~counter~0 6)} ~cond := #in~cond; {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:26,259 INFO L290 TraceCheckUtils]: 61: Hoare triple {79521#(<= ~counter~0 6)} assume !(0 == ~cond); {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:26,283 INFO L290 TraceCheckUtils]: 62: Hoare triple {79521#(<= ~counter~0 6)} assume true; {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:26,284 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79521#(<= ~counter~0 6)} {79521#(<= ~counter~0 6)} #96#return; {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:26,284 INFO L290 TraceCheckUtils]: 64: Hoare triple {79521#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:26,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {79521#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:26,286 INFO L290 TraceCheckUtils]: 66: Hoare triple {79546#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:26,286 INFO L272 TraceCheckUtils]: 67: Hoare triple {79546#(<= ~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)); {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:26,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {79546#(<= ~counter~0 7)} ~cond := #in~cond; {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:26,287 INFO L290 TraceCheckUtils]: 69: Hoare triple {79546#(<= ~counter~0 7)} assume !(0 == ~cond); {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:26,287 INFO L290 TraceCheckUtils]: 70: Hoare triple {79546#(<= ~counter~0 7)} assume true; {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:26,288 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79546#(<= ~counter~0 7)} {79546#(<= ~counter~0 7)} #96#return; {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:26,288 INFO L290 TraceCheckUtils]: 72: Hoare triple {79546#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:26,289 INFO L290 TraceCheckUtils]: 73: Hoare triple {79546#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:26,289 INFO L290 TraceCheckUtils]: 74: Hoare triple {79571#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:26,290 INFO L272 TraceCheckUtils]: 75: Hoare triple {79571#(<= ~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)); {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:26,290 INFO L290 TraceCheckUtils]: 76: Hoare triple {79571#(<= ~counter~0 8)} ~cond := #in~cond; {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:26,290 INFO L290 TraceCheckUtils]: 77: Hoare triple {79571#(<= ~counter~0 8)} assume !(0 == ~cond); {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:26,290 INFO L290 TraceCheckUtils]: 78: Hoare triple {79571#(<= ~counter~0 8)} assume true; {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:26,291 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79571#(<= ~counter~0 8)} {79571#(<= ~counter~0 8)} #96#return; {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:26,291 INFO L290 TraceCheckUtils]: 80: Hoare triple {79571#(<= ~counter~0 8)} assume !(~r~0 > 0); {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:26,292 INFO L290 TraceCheckUtils]: 81: Hoare triple {79571#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:26,292 INFO L290 TraceCheckUtils]: 82: Hoare triple {79596#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:26,293 INFO L272 TraceCheckUtils]: 83: Hoare triple {79596#(<= ~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)); {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:26,293 INFO L290 TraceCheckUtils]: 84: Hoare triple {79596#(<= ~counter~0 9)} ~cond := #in~cond; {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:26,293 INFO L290 TraceCheckUtils]: 85: Hoare triple {79596#(<= ~counter~0 9)} assume !(0 == ~cond); {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:26,294 INFO L290 TraceCheckUtils]: 86: Hoare triple {79596#(<= ~counter~0 9)} assume true; {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:26,294 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79596#(<= ~counter~0 9)} {79596#(<= ~counter~0 9)} #98#return; {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:26,294 INFO L290 TraceCheckUtils]: 88: Hoare triple {79596#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:26,295 INFO L290 TraceCheckUtils]: 89: Hoare triple {79596#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:26,296 INFO L290 TraceCheckUtils]: 90: Hoare triple {79621#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:26,296 INFO L272 TraceCheckUtils]: 91: Hoare triple {79621#(<= ~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)); {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:26,296 INFO L290 TraceCheckUtils]: 92: Hoare triple {79621#(<= ~counter~0 10)} ~cond := #in~cond; {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:26,297 INFO L290 TraceCheckUtils]: 93: Hoare triple {79621#(<= ~counter~0 10)} assume !(0 == ~cond); {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:26,297 INFO L290 TraceCheckUtils]: 94: Hoare triple {79621#(<= ~counter~0 10)} assume true; {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:26,297 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79621#(<= ~counter~0 10)} {79621#(<= ~counter~0 10)} #98#return; {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:26,297 INFO L290 TraceCheckUtils]: 96: Hoare triple {79621#(<= ~counter~0 10)} assume !(~r~0 < 0); {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:26,298 INFO L290 TraceCheckUtils]: 97: Hoare triple {79621#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:26,299 INFO L290 TraceCheckUtils]: 98: Hoare triple {79646#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:26,299 INFO L272 TraceCheckUtils]: 99: Hoare triple {79646#(<= ~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)); {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:26,299 INFO L290 TraceCheckUtils]: 100: Hoare triple {79646#(<= ~counter~0 11)} ~cond := #in~cond; {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:26,300 INFO L290 TraceCheckUtils]: 101: Hoare triple {79646#(<= ~counter~0 11)} assume !(0 == ~cond); {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:26,300 INFO L290 TraceCheckUtils]: 102: Hoare triple {79646#(<= ~counter~0 11)} assume true; {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:26,300 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79646#(<= ~counter~0 11)} {79646#(<= ~counter~0 11)} #94#return; {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:26,301 INFO L290 TraceCheckUtils]: 104: Hoare triple {79646#(<= ~counter~0 11)} assume !!(0 != ~r~0); {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:26,302 INFO L290 TraceCheckUtils]: 105: Hoare triple {79646#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:26,302 INFO L290 TraceCheckUtils]: 106: Hoare triple {79671#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:26,302 INFO L272 TraceCheckUtils]: 107: Hoare triple {79671#(<= ~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)); {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:26,303 INFO L290 TraceCheckUtils]: 108: Hoare triple {79671#(<= ~counter~0 12)} ~cond := #in~cond; {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:26,303 INFO L290 TraceCheckUtils]: 109: Hoare triple {79671#(<= ~counter~0 12)} assume !(0 == ~cond); {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:26,303 INFO L290 TraceCheckUtils]: 110: Hoare triple {79671#(<= ~counter~0 12)} assume true; {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:26,304 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79671#(<= ~counter~0 12)} {79671#(<= ~counter~0 12)} #96#return; {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:26,304 INFO L290 TraceCheckUtils]: 112: Hoare triple {79671#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:26,305 INFO L290 TraceCheckUtils]: 113: Hoare triple {79671#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:26,305 INFO L290 TraceCheckUtils]: 114: Hoare triple {79696#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:26,306 INFO L272 TraceCheckUtils]: 115: Hoare triple {79696#(<= ~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)); {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:26,306 INFO L290 TraceCheckUtils]: 116: Hoare triple {79696#(<= ~counter~0 13)} ~cond := #in~cond; {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:26,306 INFO L290 TraceCheckUtils]: 117: Hoare triple {79696#(<= ~counter~0 13)} assume !(0 == ~cond); {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:26,306 INFO L290 TraceCheckUtils]: 118: Hoare triple {79696#(<= ~counter~0 13)} assume true; {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:26,307 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {79696#(<= ~counter~0 13)} {79696#(<= ~counter~0 13)} #96#return; {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:26,307 INFO L290 TraceCheckUtils]: 120: Hoare triple {79696#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:26,308 INFO L290 TraceCheckUtils]: 121: Hoare triple {79696#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:26,308 INFO L290 TraceCheckUtils]: 122: Hoare triple {79721#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:26,309 INFO L272 TraceCheckUtils]: 123: Hoare triple {79721#(<= ~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)); {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:26,309 INFO L290 TraceCheckUtils]: 124: Hoare triple {79721#(<= ~counter~0 14)} ~cond := #in~cond; {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:26,309 INFO L290 TraceCheckUtils]: 125: Hoare triple {79721#(<= ~counter~0 14)} assume !(0 == ~cond); {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:26,310 INFO L290 TraceCheckUtils]: 126: Hoare triple {79721#(<= ~counter~0 14)} assume true; {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:26,310 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {79721#(<= ~counter~0 14)} {79721#(<= ~counter~0 14)} #96#return; {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:26,310 INFO L290 TraceCheckUtils]: 128: Hoare triple {79721#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:26,311 INFO L290 TraceCheckUtils]: 129: Hoare triple {79721#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:26,312 INFO L290 TraceCheckUtils]: 130: Hoare triple {79746#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:26,312 INFO L272 TraceCheckUtils]: 131: Hoare triple {79746#(<= ~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)); {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:26,312 INFO L290 TraceCheckUtils]: 132: Hoare triple {79746#(<= ~counter~0 15)} ~cond := #in~cond; {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:26,313 INFO L290 TraceCheckUtils]: 133: Hoare triple {79746#(<= ~counter~0 15)} assume !(0 == ~cond); {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:26,313 INFO L290 TraceCheckUtils]: 134: Hoare triple {79746#(<= ~counter~0 15)} assume true; {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:26,313 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {79746#(<= ~counter~0 15)} {79746#(<= ~counter~0 15)} #96#return; {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:26,313 INFO L290 TraceCheckUtils]: 136: Hoare triple {79746#(<= ~counter~0 15)} assume !(~r~0 > 0); {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:26,314 INFO L290 TraceCheckUtils]: 137: Hoare triple {79746#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:26,315 INFO L290 TraceCheckUtils]: 138: Hoare triple {79771#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:26,315 INFO L272 TraceCheckUtils]: 139: Hoare triple {79771#(<= ~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)); {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:26,315 INFO L290 TraceCheckUtils]: 140: Hoare triple {79771#(<= ~counter~0 16)} ~cond := #in~cond; {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:26,316 INFO L290 TraceCheckUtils]: 141: Hoare triple {79771#(<= ~counter~0 16)} assume !(0 == ~cond); {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:26,316 INFO L290 TraceCheckUtils]: 142: Hoare triple {79771#(<= ~counter~0 16)} assume true; {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:26,316 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {79771#(<= ~counter~0 16)} {79771#(<= ~counter~0 16)} #98#return; {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:26,317 INFO L290 TraceCheckUtils]: 144: Hoare triple {79771#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:26,318 INFO L290 TraceCheckUtils]: 145: Hoare triple {79771#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:26,318 INFO L290 TraceCheckUtils]: 146: Hoare triple {79796#(<= ~counter~0 17)} assume !!(#t~post8 < 50);havoc #t~post8; {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:26,318 INFO L272 TraceCheckUtils]: 147: Hoare triple {79796#(<= ~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)); {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:26,319 INFO L290 TraceCheckUtils]: 148: Hoare triple {79796#(<= ~counter~0 17)} ~cond := #in~cond; {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:26,319 INFO L290 TraceCheckUtils]: 149: Hoare triple {79796#(<= ~counter~0 17)} assume !(0 == ~cond); {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:26,319 INFO L290 TraceCheckUtils]: 150: Hoare triple {79796#(<= ~counter~0 17)} assume true; {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:26,320 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {79796#(<= ~counter~0 17)} {79796#(<= ~counter~0 17)} #98#return; {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:26,320 INFO L290 TraceCheckUtils]: 152: Hoare triple {79796#(<= ~counter~0 17)} assume !(~r~0 < 0); {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:26,321 INFO L290 TraceCheckUtils]: 153: Hoare triple {79796#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:26,321 INFO L290 TraceCheckUtils]: 154: Hoare triple {79821#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:26,322 INFO L272 TraceCheckUtils]: 155: Hoare triple {79821#(<= ~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)); {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:26,322 INFO L290 TraceCheckUtils]: 156: Hoare triple {79821#(<= ~counter~0 18)} ~cond := #in~cond; {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:26,322 INFO L290 TraceCheckUtils]: 157: Hoare triple {79821#(<= ~counter~0 18)} assume !(0 == ~cond); {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:26,322 INFO L290 TraceCheckUtils]: 158: Hoare triple {79821#(<= ~counter~0 18)} assume true; {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:26,323 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {79821#(<= ~counter~0 18)} {79821#(<= ~counter~0 18)} #94#return; {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:26,323 INFO L290 TraceCheckUtils]: 160: Hoare triple {79821#(<= ~counter~0 18)} assume !!(0 != ~r~0); {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:26,324 INFO L290 TraceCheckUtils]: 161: Hoare triple {79821#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:26,325 INFO L290 TraceCheckUtils]: 162: Hoare triple {79846#(<= ~counter~0 19)} assume !!(#t~post7 < 50);havoc #t~post7; {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:26,325 INFO L272 TraceCheckUtils]: 163: Hoare triple {79846#(<= ~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)); {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:26,325 INFO L290 TraceCheckUtils]: 164: Hoare triple {79846#(<= ~counter~0 19)} ~cond := #in~cond; {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:26,326 INFO L290 TraceCheckUtils]: 165: Hoare triple {79846#(<= ~counter~0 19)} assume !(0 == ~cond); {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:26,326 INFO L290 TraceCheckUtils]: 166: Hoare triple {79846#(<= ~counter~0 19)} assume true; {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:26,326 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {79846#(<= ~counter~0 19)} {79846#(<= ~counter~0 19)} #96#return; {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:26,326 INFO L290 TraceCheckUtils]: 168: Hoare triple {79846#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:26,328 INFO L290 TraceCheckUtils]: 169: Hoare triple {79846#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:26,328 INFO L290 TraceCheckUtils]: 170: Hoare triple {79871#(<= ~counter~0 20)} assume !!(#t~post7 < 50);havoc #t~post7; {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:26,328 INFO L272 TraceCheckUtils]: 171: Hoare triple {79871#(<= ~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)); {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:26,329 INFO L290 TraceCheckUtils]: 172: Hoare triple {79871#(<= ~counter~0 20)} ~cond := #in~cond; {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:26,329 INFO L290 TraceCheckUtils]: 173: Hoare triple {79871#(<= ~counter~0 20)} assume !(0 == ~cond); {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:26,329 INFO L290 TraceCheckUtils]: 174: Hoare triple {79871#(<= ~counter~0 20)} assume true; {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:26,329 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {79871#(<= ~counter~0 20)} {79871#(<= ~counter~0 20)} #96#return; {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:26,330 INFO L290 TraceCheckUtils]: 176: Hoare triple {79871#(<= ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:26,330 INFO L290 TraceCheckUtils]: 177: Hoare triple {79871#(<= ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79896#(<= |main_#t~post7| 20)} is VALID [2022-04-27 13:18:26,330 INFO L290 TraceCheckUtils]: 178: Hoare triple {79896#(<= |main_#t~post7| 20)} assume !(#t~post7 < 50);havoc #t~post7; {79340#false} is VALID [2022-04-27 13:18:26,330 INFO L290 TraceCheckUtils]: 179: Hoare triple {79340#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79340#false} is VALID [2022-04-27 13:18:26,331 INFO L290 TraceCheckUtils]: 180: Hoare triple {79340#false} assume !(#t~post8 < 50);havoc #t~post8; {79340#false} is VALID [2022-04-27 13:18:26,331 INFO L290 TraceCheckUtils]: 181: Hoare triple {79340#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79340#false} is VALID [2022-04-27 13:18:26,331 INFO L290 TraceCheckUtils]: 182: Hoare triple {79340#false} assume !(#t~post6 < 50);havoc #t~post6; {79340#false} is VALID [2022-04-27 13:18:26,331 INFO L272 TraceCheckUtils]: 183: Hoare triple {79340#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79340#false} is VALID [2022-04-27 13:18:26,331 INFO L290 TraceCheckUtils]: 184: Hoare triple {79340#false} ~cond := #in~cond; {79340#false} is VALID [2022-04-27 13:18:26,331 INFO L290 TraceCheckUtils]: 185: Hoare triple {79340#false} assume 0 == ~cond; {79340#false} is VALID [2022-04-27 13:18:26,331 INFO L290 TraceCheckUtils]: 186: Hoare triple {79340#false} assume !false; {79340#false} is VALID [2022-04-27 13:18:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 60 proven. 1044 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:26,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:27,501 INFO L290 TraceCheckUtils]: 186: Hoare triple {79340#false} assume !false; {79340#false} is VALID [2022-04-27 13:18:27,502 INFO L290 TraceCheckUtils]: 185: Hoare triple {79340#false} assume 0 == ~cond; {79340#false} is VALID [2022-04-27 13:18:27,502 INFO L290 TraceCheckUtils]: 184: Hoare triple {79340#false} ~cond := #in~cond; {79340#false} is VALID [2022-04-27 13:18:27,502 INFO L272 TraceCheckUtils]: 183: Hoare triple {79340#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79340#false} is VALID [2022-04-27 13:18:27,502 INFO L290 TraceCheckUtils]: 182: Hoare triple {79340#false} assume !(#t~post6 < 50);havoc #t~post6; {79340#false} is VALID [2022-04-27 13:18:27,502 INFO L290 TraceCheckUtils]: 181: Hoare triple {79340#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79340#false} is VALID [2022-04-27 13:18:27,502 INFO L290 TraceCheckUtils]: 180: Hoare triple {79340#false} assume !(#t~post8 < 50);havoc #t~post8; {79340#false} is VALID [2022-04-27 13:18:27,502 INFO L290 TraceCheckUtils]: 179: Hoare triple {79340#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79340#false} is VALID [2022-04-27 13:18:27,503 INFO L290 TraceCheckUtils]: 178: Hoare triple {79948#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {79340#false} is VALID [2022-04-27 13:18:27,503 INFO L290 TraceCheckUtils]: 177: Hoare triple {79952#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79948#(< |main_#t~post7| 50)} is VALID [2022-04-27 13:18:27,503 INFO L290 TraceCheckUtils]: 176: Hoare triple {79952#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79952#(< ~counter~0 50)} is VALID [2022-04-27 13:18:27,504 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {79339#true} {79952#(< ~counter~0 50)} #96#return; {79952#(< ~counter~0 50)} is VALID [2022-04-27 13:18:27,504 INFO L290 TraceCheckUtils]: 174: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,504 INFO L290 TraceCheckUtils]: 173: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,504 INFO L290 TraceCheckUtils]: 172: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,504 INFO L272 TraceCheckUtils]: 171: Hoare triple {79952#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,504 INFO L290 TraceCheckUtils]: 170: Hoare triple {79952#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {79952#(< ~counter~0 50)} is VALID [2022-04-27 13:18:27,506 INFO L290 TraceCheckUtils]: 169: Hoare triple {79977#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79952#(< ~counter~0 50)} is VALID [2022-04-27 13:18:27,506 INFO L290 TraceCheckUtils]: 168: Hoare triple {79977#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79977#(< ~counter~0 49)} is VALID [2022-04-27 13:18:27,507 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {79339#true} {79977#(< ~counter~0 49)} #96#return; {79977#(< ~counter~0 49)} is VALID [2022-04-27 13:18:27,507 INFO L290 TraceCheckUtils]: 166: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,507 INFO L290 TraceCheckUtils]: 165: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,507 INFO L290 TraceCheckUtils]: 164: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,507 INFO L272 TraceCheckUtils]: 163: Hoare triple {79977#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,507 INFO L290 TraceCheckUtils]: 162: Hoare triple {79977#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {79977#(< ~counter~0 49)} is VALID [2022-04-27 13:18:27,508 INFO L290 TraceCheckUtils]: 161: Hoare triple {80002#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79977#(< ~counter~0 49)} is VALID [2022-04-27 13:18:27,508 INFO L290 TraceCheckUtils]: 160: Hoare triple {80002#(< ~counter~0 48)} assume !!(0 != ~r~0); {80002#(< ~counter~0 48)} is VALID [2022-04-27 13:18:27,509 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {79339#true} {80002#(< ~counter~0 48)} #94#return; {80002#(< ~counter~0 48)} is VALID [2022-04-27 13:18:27,509 INFO L290 TraceCheckUtils]: 158: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,509 INFO L290 TraceCheckUtils]: 157: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,509 INFO L290 TraceCheckUtils]: 156: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,509 INFO L272 TraceCheckUtils]: 155: Hoare triple {80002#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,509 INFO L290 TraceCheckUtils]: 154: Hoare triple {80002#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {80002#(< ~counter~0 48)} is VALID [2022-04-27 13:18:27,510 INFO L290 TraceCheckUtils]: 153: Hoare triple {80027#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80002#(< ~counter~0 48)} is VALID [2022-04-27 13:18:27,510 INFO L290 TraceCheckUtils]: 152: Hoare triple {80027#(< ~counter~0 47)} assume !(~r~0 < 0); {80027#(< ~counter~0 47)} is VALID [2022-04-27 13:18:27,511 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {79339#true} {80027#(< ~counter~0 47)} #98#return; {80027#(< ~counter~0 47)} is VALID [2022-04-27 13:18:27,511 INFO L290 TraceCheckUtils]: 150: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,511 INFO L290 TraceCheckUtils]: 149: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,511 INFO L290 TraceCheckUtils]: 148: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,511 INFO L272 TraceCheckUtils]: 147: Hoare triple {80027#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,511 INFO L290 TraceCheckUtils]: 146: Hoare triple {80027#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {80027#(< ~counter~0 47)} is VALID [2022-04-27 13:18:27,512 INFO L290 TraceCheckUtils]: 145: Hoare triple {80052#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80027#(< ~counter~0 47)} is VALID [2022-04-27 13:18:27,512 INFO L290 TraceCheckUtils]: 144: Hoare triple {80052#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80052#(< ~counter~0 46)} is VALID [2022-04-27 13:18:27,513 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {79339#true} {80052#(< ~counter~0 46)} #98#return; {80052#(< ~counter~0 46)} is VALID [2022-04-27 13:18:27,513 INFO L290 TraceCheckUtils]: 142: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,513 INFO L290 TraceCheckUtils]: 141: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,513 INFO L290 TraceCheckUtils]: 140: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,513 INFO L272 TraceCheckUtils]: 139: Hoare triple {80052#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,513 INFO L290 TraceCheckUtils]: 138: Hoare triple {80052#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {80052#(< ~counter~0 46)} is VALID [2022-04-27 13:18:27,514 INFO L290 TraceCheckUtils]: 137: Hoare triple {80077#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80052#(< ~counter~0 46)} is VALID [2022-04-27 13:18:27,515 INFO L290 TraceCheckUtils]: 136: Hoare triple {80077#(< ~counter~0 45)} assume !(~r~0 > 0); {80077#(< ~counter~0 45)} is VALID [2022-04-27 13:18:27,515 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {79339#true} {80077#(< ~counter~0 45)} #96#return; {80077#(< ~counter~0 45)} is VALID [2022-04-27 13:18:27,515 INFO L290 TraceCheckUtils]: 134: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,515 INFO L290 TraceCheckUtils]: 133: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,515 INFO L290 TraceCheckUtils]: 132: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,515 INFO L272 TraceCheckUtils]: 131: Hoare triple {80077#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,516 INFO L290 TraceCheckUtils]: 130: Hoare triple {80077#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {80077#(< ~counter~0 45)} is VALID [2022-04-27 13:18:27,517 INFO L290 TraceCheckUtils]: 129: Hoare triple {80102#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80077#(< ~counter~0 45)} is VALID [2022-04-27 13:18:27,517 INFO L290 TraceCheckUtils]: 128: Hoare triple {80102#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80102#(< ~counter~0 44)} is VALID [2022-04-27 13:18:27,517 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {79339#true} {80102#(< ~counter~0 44)} #96#return; {80102#(< ~counter~0 44)} is VALID [2022-04-27 13:18:27,517 INFO L290 TraceCheckUtils]: 126: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,518 INFO L290 TraceCheckUtils]: 125: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,518 INFO L290 TraceCheckUtils]: 124: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,518 INFO L272 TraceCheckUtils]: 123: Hoare triple {80102#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,518 INFO L290 TraceCheckUtils]: 122: Hoare triple {80102#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {80102#(< ~counter~0 44)} is VALID [2022-04-27 13:18:27,519 INFO L290 TraceCheckUtils]: 121: Hoare triple {80127#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80102#(< ~counter~0 44)} is VALID [2022-04-27 13:18:27,519 INFO L290 TraceCheckUtils]: 120: Hoare triple {80127#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80127#(< ~counter~0 43)} is VALID [2022-04-27 13:18:27,520 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {79339#true} {80127#(< ~counter~0 43)} #96#return; {80127#(< ~counter~0 43)} is VALID [2022-04-27 13:18:27,520 INFO L290 TraceCheckUtils]: 118: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,520 INFO L290 TraceCheckUtils]: 117: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,520 INFO L290 TraceCheckUtils]: 116: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,520 INFO L272 TraceCheckUtils]: 115: Hoare triple {80127#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,520 INFO L290 TraceCheckUtils]: 114: Hoare triple {80127#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {80127#(< ~counter~0 43)} is VALID [2022-04-27 13:18:27,521 INFO L290 TraceCheckUtils]: 113: Hoare triple {80152#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80127#(< ~counter~0 43)} is VALID [2022-04-27 13:18:27,521 INFO L290 TraceCheckUtils]: 112: Hoare triple {80152#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80152#(< ~counter~0 42)} is VALID [2022-04-27 13:18:27,522 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79339#true} {80152#(< ~counter~0 42)} #96#return; {80152#(< ~counter~0 42)} is VALID [2022-04-27 13:18:27,522 INFO L290 TraceCheckUtils]: 110: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,522 INFO L290 TraceCheckUtils]: 109: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,522 INFO L290 TraceCheckUtils]: 108: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,522 INFO L272 TraceCheckUtils]: 107: Hoare triple {80152#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,522 INFO L290 TraceCheckUtils]: 106: Hoare triple {80152#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {80152#(< ~counter~0 42)} is VALID [2022-04-27 13:18:27,523 INFO L290 TraceCheckUtils]: 105: Hoare triple {80177#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80152#(< ~counter~0 42)} is VALID [2022-04-27 13:18:27,523 INFO L290 TraceCheckUtils]: 104: Hoare triple {80177#(< ~counter~0 41)} assume !!(0 != ~r~0); {80177#(< ~counter~0 41)} is VALID [2022-04-27 13:18:27,524 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79339#true} {80177#(< ~counter~0 41)} #94#return; {80177#(< ~counter~0 41)} is VALID [2022-04-27 13:18:27,524 INFO L290 TraceCheckUtils]: 102: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,524 INFO L290 TraceCheckUtils]: 101: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,524 INFO L290 TraceCheckUtils]: 100: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,524 INFO L272 TraceCheckUtils]: 99: Hoare triple {80177#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,524 INFO L290 TraceCheckUtils]: 98: Hoare triple {80177#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {80177#(< ~counter~0 41)} is VALID [2022-04-27 13:18:27,525 INFO L290 TraceCheckUtils]: 97: Hoare triple {80202#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80177#(< ~counter~0 41)} is VALID [2022-04-27 13:18:27,526 INFO L290 TraceCheckUtils]: 96: Hoare triple {80202#(< ~counter~0 40)} assume !(~r~0 < 0); {80202#(< ~counter~0 40)} is VALID [2022-04-27 13:18:27,526 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79339#true} {80202#(< ~counter~0 40)} #98#return; {80202#(< ~counter~0 40)} is VALID [2022-04-27 13:18:27,526 INFO L290 TraceCheckUtils]: 94: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,526 INFO L290 TraceCheckUtils]: 92: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,526 INFO L272 TraceCheckUtils]: 91: Hoare triple {80202#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,526 INFO L290 TraceCheckUtils]: 90: Hoare triple {80202#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {80202#(< ~counter~0 40)} is VALID [2022-04-27 13:18:27,527 INFO L290 TraceCheckUtils]: 89: Hoare triple {80227#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80202#(< ~counter~0 40)} is VALID [2022-04-27 13:18:27,528 INFO L290 TraceCheckUtils]: 88: Hoare triple {80227#(< ~counter~0 39)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80227#(< ~counter~0 39)} is VALID [2022-04-27 13:18:27,528 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79339#true} {80227#(< ~counter~0 39)} #98#return; {80227#(< ~counter~0 39)} is VALID [2022-04-27 13:18:27,528 INFO L290 TraceCheckUtils]: 86: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,528 INFO L290 TraceCheckUtils]: 85: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,528 INFO L290 TraceCheckUtils]: 84: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,528 INFO L272 TraceCheckUtils]: 83: Hoare triple {80227#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,529 INFO L290 TraceCheckUtils]: 82: Hoare triple {80227#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {80227#(< ~counter~0 39)} is VALID [2022-04-27 13:18:27,529 INFO L290 TraceCheckUtils]: 81: Hoare triple {80252#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80227#(< ~counter~0 39)} is VALID [2022-04-27 13:18:27,530 INFO L290 TraceCheckUtils]: 80: Hoare triple {80252#(< ~counter~0 38)} assume !(~r~0 > 0); {80252#(< ~counter~0 38)} is VALID [2022-04-27 13:18:27,530 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79339#true} {80252#(< ~counter~0 38)} #96#return; {80252#(< ~counter~0 38)} is VALID [2022-04-27 13:18:27,530 INFO L290 TraceCheckUtils]: 78: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,530 INFO L290 TraceCheckUtils]: 77: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,530 INFO L290 TraceCheckUtils]: 76: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,531 INFO L272 TraceCheckUtils]: 75: Hoare triple {80252#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {80252#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {80252#(< ~counter~0 38)} is VALID [2022-04-27 13:18:27,532 INFO L290 TraceCheckUtils]: 73: Hoare triple {80277#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80252#(< ~counter~0 38)} is VALID [2022-04-27 13:18:27,532 INFO L290 TraceCheckUtils]: 72: Hoare triple {80277#(< ~counter~0 37)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80277#(< ~counter~0 37)} is VALID [2022-04-27 13:18:27,532 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79339#true} {80277#(< ~counter~0 37)} #96#return; {80277#(< ~counter~0 37)} is VALID [2022-04-27 13:18:27,532 INFO L290 TraceCheckUtils]: 70: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,532 INFO L290 TraceCheckUtils]: 69: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,533 INFO L290 TraceCheckUtils]: 68: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,533 INFO L272 TraceCheckUtils]: 67: Hoare triple {80277#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,533 INFO L290 TraceCheckUtils]: 66: Hoare triple {80277#(< ~counter~0 37)} assume !!(#t~post7 < 50);havoc #t~post7; {80277#(< ~counter~0 37)} is VALID [2022-04-27 13:18:27,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {80302#(< ~counter~0 36)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80277#(< ~counter~0 37)} is VALID [2022-04-27 13:18:27,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {80302#(< ~counter~0 36)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80302#(< ~counter~0 36)} is VALID [2022-04-27 13:18:27,534 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79339#true} {80302#(< ~counter~0 36)} #96#return; {80302#(< ~counter~0 36)} is VALID [2022-04-27 13:18:27,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,535 INFO L272 TraceCheckUtils]: 59: Hoare triple {80302#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {80302#(< ~counter~0 36)} assume !!(#t~post7 < 50);havoc #t~post7; {80302#(< ~counter~0 36)} is VALID [2022-04-27 13:18:27,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {80327#(< ~counter~0 35)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80302#(< ~counter~0 36)} is VALID [2022-04-27 13:18:27,536 INFO L290 TraceCheckUtils]: 56: Hoare triple {80327#(< ~counter~0 35)} assume !!(0 != ~r~0); {80327#(< ~counter~0 35)} is VALID [2022-04-27 13:18:27,537 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79339#true} {80327#(< ~counter~0 35)} #94#return; {80327#(< ~counter~0 35)} is VALID [2022-04-27 13:18:27,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,537 INFO L272 TraceCheckUtils]: 51: Hoare triple {80327#(< ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {80327#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {80327#(< ~counter~0 35)} is VALID [2022-04-27 13:18:27,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {80352#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80327#(< ~counter~0 35)} is VALID [2022-04-27 13:18:27,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {80352#(< ~counter~0 34)} assume !(~r~0 < 0); {80352#(< ~counter~0 34)} is VALID [2022-04-27 13:18:27,539 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79339#true} {80352#(< ~counter~0 34)} #98#return; {80352#(< ~counter~0 34)} is VALID [2022-04-27 13:18:27,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,539 INFO L272 TraceCheckUtils]: 43: Hoare triple {80352#(< ~counter~0 34)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {80352#(< ~counter~0 34)} assume !!(#t~post8 < 50);havoc #t~post8; {80352#(< ~counter~0 34)} is VALID [2022-04-27 13:18:27,540 INFO L290 TraceCheckUtils]: 41: Hoare triple {80377#(< ~counter~0 33)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80352#(< ~counter~0 34)} is VALID [2022-04-27 13:18:27,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {80377#(< ~counter~0 33)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80377#(< ~counter~0 33)} is VALID [2022-04-27 13:18:27,541 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79339#true} {80377#(< ~counter~0 33)} #98#return; {80377#(< ~counter~0 33)} is VALID [2022-04-27 13:18:27,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,541 INFO L272 TraceCheckUtils]: 35: Hoare triple {80377#(< ~counter~0 33)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {80377#(< ~counter~0 33)} assume !!(#t~post8 < 50);havoc #t~post8; {80377#(< ~counter~0 33)} is VALID [2022-04-27 13:18:27,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {80402#(< ~counter~0 32)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80377#(< ~counter~0 33)} is VALID [2022-04-27 13:18:27,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {80402#(< ~counter~0 32)} assume !(~r~0 > 0); {80402#(< ~counter~0 32)} is VALID [2022-04-27 13:18:27,543 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79339#true} {80402#(< ~counter~0 32)} #96#return; {80402#(< ~counter~0 32)} is VALID [2022-04-27 13:18:27,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,543 INFO L272 TraceCheckUtils]: 27: Hoare triple {80402#(< ~counter~0 32)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {80402#(< ~counter~0 32)} assume !!(#t~post7 < 50);havoc #t~post7; {80402#(< ~counter~0 32)} is VALID [2022-04-27 13:18:27,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {80427#(< ~counter~0 31)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80402#(< ~counter~0 32)} is VALID [2022-04-27 13:18:27,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {80427#(< ~counter~0 31)} assume !!(0 != ~r~0); {80427#(< ~counter~0 31)} is VALID [2022-04-27 13:18:27,545 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79339#true} {80427#(< ~counter~0 31)} #94#return; {80427#(< ~counter~0 31)} is VALID [2022-04-27 13:18:27,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,545 INFO L272 TraceCheckUtils]: 19: Hoare triple {80427#(< ~counter~0 31)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {80427#(< ~counter~0 31)} assume !!(#t~post6 < 50);havoc #t~post6; {80427#(< ~counter~0 31)} is VALID [2022-04-27 13:18:27,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {80452#(< ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80427#(< ~counter~0 31)} is VALID [2022-04-27 13:18:27,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {80452#(< ~counter~0 30)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {80452#(< ~counter~0 30)} is VALID [2022-04-27 13:18:27,547 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79339#true} {80452#(< ~counter~0 30)} #92#return; {80452#(< ~counter~0 30)} is VALID [2022-04-27 13:18:27,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,547 INFO L272 TraceCheckUtils]: 11: Hoare triple {80452#(< ~counter~0 30)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,548 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79339#true} {80452#(< ~counter~0 30)} #90#return; {80452#(< ~counter~0 30)} is VALID [2022-04-27 13:18:27,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:18:27,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:18:27,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:18:27,548 INFO L272 TraceCheckUtils]: 6: Hoare triple {80452#(< ~counter~0 30)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:18:27,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {80452#(< ~counter~0 30)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {80452#(< ~counter~0 30)} is VALID [2022-04-27 13:18:27,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {80452#(< ~counter~0 30)} call #t~ret9 := main(); {80452#(< ~counter~0 30)} is VALID [2022-04-27 13:18:27,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80452#(< ~counter~0 30)} {79339#true} #102#return; {80452#(< ~counter~0 30)} is VALID [2022-04-27 13:18:27,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {80452#(< ~counter~0 30)} assume true; {80452#(< ~counter~0 30)} is VALID [2022-04-27 13:18:27,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {79339#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {80452#(< ~counter~0 30)} is VALID [2022-04-27 13:18:27,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {79339#true} call ULTIMATE.init(); {79339#true} is VALID [2022-04-27 13:18:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 60 proven. 284 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-04-27 13:18:27,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:27,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936471588] [2022-04-27 13:18:27,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:27,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737747576] [2022-04-27 13:18:27,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737747576] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:27,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:27,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-04-27 13:18:27,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852036028] [2022-04-27 13:18:27,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:27,552 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) Word has length 187 [2022-04-27 13:18:27,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:27,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-27 13:18:27,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:27,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-27 13:18:27,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:27,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-27 13:18:27,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2022-04-27 13:18:27,807 INFO L87 Difference]: Start difference. First operand 2462 states and 3344 transitions. Second operand has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-27 13:18:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:52,100 INFO L93 Difference]: Finished difference Result 9906 states and 14925 transitions. [2022-04-27 13:18:52,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-04-27 13:18:52,101 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) Word has length 187 [2022-04-27 13:18:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-27 13:18:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 956 transitions. [2022-04-27 13:18:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-27 13:18:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 956 transitions. [2022-04-27 13:18:52,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 956 transitions. [2022-04-27 13:18:52,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 956 edges. 956 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:56,505 INFO L225 Difference]: With dead ends: 9906 [2022-04-27 13:18:56,505 INFO L226 Difference]: Without dead ends: 9897 [2022-04-27 13:18:56,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2691, Invalid=4619, Unknown=0, NotChecked=0, Total=7310 [2022-04-27 13:18:56,509 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 1584 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 1053 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1053 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:56,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 1026 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1053 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 13:18:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9897 states. [2022-04-27 13:19:11,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9897 to 9645. [2022-04-27 13:19:11,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:19:11,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9897 states. Second operand has 9645 states, 7245 states have (on average 1.2641821946169771) internal successors, (9159), 7308 states have internal predecessors, (9159), 2355 states have call successors, (2355), 46 states have call predecessors, (2355), 44 states have return successors, (2353), 2290 states have call predecessors, (2353), 2353 states have call successors, (2353) [2022-04-27 13:19:11,456 INFO L74 IsIncluded]: Start isIncluded. First operand 9897 states. Second operand has 9645 states, 7245 states have (on average 1.2641821946169771) internal successors, (9159), 7308 states have internal predecessors, (9159), 2355 states have call successors, (2355), 46 states have call predecessors, (2355), 44 states have return successors, (2353), 2290 states have call predecessors, (2353), 2353 states have call successors, (2353) [2022-04-27 13:19:11,466 INFO L87 Difference]: Start difference. First operand 9897 states. Second operand has 9645 states, 7245 states have (on average 1.2641821946169771) internal successors, (9159), 7308 states have internal predecessors, (9159), 2355 states have call successors, (2355), 46 states have call predecessors, (2355), 44 states have return successors, (2353), 2290 states have call predecessors, (2353), 2353 states have call successors, (2353) [2022-04-27 13:19:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:19:13,809 INFO L93 Difference]: Finished difference Result 9897 states and 14111 transitions. [2022-04-27 13:19:13,809 INFO L276 IsEmpty]: Start isEmpty. Operand 9897 states and 14111 transitions. [2022-04-27 13:19:13,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:19:13,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:19:13,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 9645 states, 7245 states have (on average 1.2641821946169771) internal successors, (9159), 7308 states have internal predecessors, (9159), 2355 states have call successors, (2355), 46 states have call predecessors, (2355), 44 states have return successors, (2353), 2290 states have call predecessors, (2353), 2353 states have call successors, (2353) Second operand 9897 states. [2022-04-27 13:19:13,842 INFO L87 Difference]: Start difference. First operand has 9645 states, 7245 states have (on average 1.2641821946169771) internal successors, (9159), 7308 states have internal predecessors, (9159), 2355 states have call successors, (2355), 46 states have call predecessors, (2355), 44 states have return successors, (2353), 2290 states have call predecessors, (2353), 2353 states have call successors, (2353) Second operand 9897 states. [2022-04-27 13:19:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:19:16,590 INFO L93 Difference]: Finished difference Result 9897 states and 14111 transitions. [2022-04-27 13:19:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 9897 states and 14111 transitions. [2022-04-27 13:19:16,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:19:16,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:19:16,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:19:16,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:19:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9645 states, 7245 states have (on average 1.2641821946169771) internal successors, (9159), 7308 states have internal predecessors, (9159), 2355 states have call successors, (2355), 46 states have call predecessors, (2355), 44 states have return successors, (2353), 2290 states have call predecessors, (2353), 2353 states have call successors, (2353) [2022-04-27 13:19:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9645 states to 9645 states and 13867 transitions. [2022-04-27 13:19:20,196 INFO L78 Accepts]: Start accepts. Automaton has 9645 states and 13867 transitions. Word has length 187 [2022-04-27 13:19:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:19:20,196 INFO L495 AbstractCegarLoop]: Abstraction has 9645 states and 13867 transitions. [2022-04-27 13:19:20,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-27 13:19:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9645 states and 13867 transitions. [2022-04-27 13:19:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-27 13:19:20,201 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:19:20,201 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 10, 10, 10, 10, 8, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:19:20,219 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-27 13:19:20,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:19:20,415 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:19:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:19:20,416 INFO L85 PathProgramCache]: Analyzing trace with hash 179284923, now seen corresponding path program 2 times [2022-04-27 13:19:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:19:20,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777162546] [2022-04-27 13:19:20,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:19:20,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:19:20,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:19:20,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066170553] [2022-04-27 13:19:20,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:19:20,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:19:20,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:19:20,435 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-27 13:19:20,436 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-27 13:19:20,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:19:20,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:19:20,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 13:19:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:19:20,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:19:21,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {127992#true} call ULTIMATE.init(); {127992#true} is VALID [2022-04-27 13:19:21,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {127992#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {128000#(<= ~counter~0 0)} assume true; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128000#(<= ~counter~0 0)} {127992#true} #102#return; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {128000#(<= ~counter~0 0)} call #t~ret9 := main(); {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {128000#(<= ~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; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,546 INFO L272 TraceCheckUtils]: 6: Hoare triple {128000#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {128000#(<= ~counter~0 0)} ~cond := #in~cond; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {128000#(<= ~counter~0 0)} assume !(0 == ~cond); {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {128000#(<= ~counter~0 0)} assume true; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {128000#(<= ~counter~0 0)} {128000#(<= ~counter~0 0)} #90#return; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,560 INFO L272 TraceCheckUtils]: 11: Hoare triple {128000#(<= ~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)); {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {128000#(<= ~counter~0 0)} ~cond := #in~cond; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {128000#(<= ~counter~0 0)} assume !(0 == ~cond); {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {128000#(<= ~counter~0 0)} assume true; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,562 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {128000#(<= ~counter~0 0)} {128000#(<= ~counter~0 0)} #92#return; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {128000#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:21,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {128000#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:21,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {128049#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:21,566 INFO L272 TraceCheckUtils]: 19: Hoare triple {128049#(<= ~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)); {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:21,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {128049#(<= ~counter~0 1)} ~cond := #in~cond; {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:21,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {128049#(<= ~counter~0 1)} assume !(0 == ~cond); {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:21,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {128049#(<= ~counter~0 1)} assume true; {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:21,568 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {128049#(<= ~counter~0 1)} {128049#(<= ~counter~0 1)} #94#return; {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:21,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {128049#(<= ~counter~0 1)} assume !!(0 != ~r~0); {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:21,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {128049#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:21,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {128074#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:21,571 INFO L272 TraceCheckUtils]: 27: Hoare triple {128074#(<= ~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)); {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:21,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {128074#(<= ~counter~0 2)} ~cond := #in~cond; {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:21,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {128074#(<= ~counter~0 2)} assume !(0 == ~cond); {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:21,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {128074#(<= ~counter~0 2)} assume true; {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:21,573 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {128074#(<= ~counter~0 2)} {128074#(<= ~counter~0 2)} #96#return; {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:21,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {128074#(<= ~counter~0 2)} assume !(~r~0 > 0); {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:21,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {128074#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:21,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {128099#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:21,576 INFO L272 TraceCheckUtils]: 35: Hoare triple {128099#(<= ~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)); {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:21,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {128099#(<= ~counter~0 3)} ~cond := #in~cond; {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:21,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {128099#(<= ~counter~0 3)} assume !(0 == ~cond); {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:21,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {128099#(<= ~counter~0 3)} assume true; {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:21,578 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {128099#(<= ~counter~0 3)} {128099#(<= ~counter~0 3)} #98#return; {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:21,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {128099#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:21,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {128099#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:21,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {128124#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:21,581 INFO L272 TraceCheckUtils]: 43: Hoare triple {128124#(<= ~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)); {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:21,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {128124#(<= ~counter~0 4)} ~cond := #in~cond; {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:21,582 INFO L290 TraceCheckUtils]: 45: Hoare triple {128124#(<= ~counter~0 4)} assume !(0 == ~cond); {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:21,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {128124#(<= ~counter~0 4)} assume true; {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:21,583 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {128124#(<= ~counter~0 4)} {128124#(<= ~counter~0 4)} #98#return; {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:21,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {128124#(<= ~counter~0 4)} assume !(~r~0 < 0); {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:21,585 INFO L290 TraceCheckUtils]: 49: Hoare triple {128124#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:21,585 INFO L290 TraceCheckUtils]: 50: Hoare triple {128149#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:21,586 INFO L272 TraceCheckUtils]: 51: Hoare triple {128149#(<= ~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)); {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:21,586 INFO L290 TraceCheckUtils]: 52: Hoare triple {128149#(<= ~counter~0 5)} ~cond := #in~cond; {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:21,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {128149#(<= ~counter~0 5)} assume !(0 == ~cond); {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:21,587 INFO L290 TraceCheckUtils]: 54: Hoare triple {128149#(<= ~counter~0 5)} assume true; {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:21,587 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {128149#(<= ~counter~0 5)} {128149#(<= ~counter~0 5)} #94#return; {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:21,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {128149#(<= ~counter~0 5)} assume !!(0 != ~r~0); {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:21,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {128149#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:21,589 INFO L290 TraceCheckUtils]: 58: Hoare triple {128174#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:21,590 INFO L272 TraceCheckUtils]: 59: Hoare triple {128174#(<= ~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)); {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:21,590 INFO L290 TraceCheckUtils]: 60: Hoare triple {128174#(<= ~counter~0 6)} ~cond := #in~cond; {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:21,590 INFO L290 TraceCheckUtils]: 61: Hoare triple {128174#(<= ~counter~0 6)} assume !(0 == ~cond); {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:21,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {128174#(<= ~counter~0 6)} assume true; {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:21,591 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {128174#(<= ~counter~0 6)} {128174#(<= ~counter~0 6)} #96#return; {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:21,591 INFO L290 TraceCheckUtils]: 64: Hoare triple {128174#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:21,593 INFO L290 TraceCheckUtils]: 65: Hoare triple {128174#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:21,593 INFO L290 TraceCheckUtils]: 66: Hoare triple {128199#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:21,594 INFO L272 TraceCheckUtils]: 67: Hoare triple {128199#(<= ~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)); {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:21,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {128199#(<= ~counter~0 7)} ~cond := #in~cond; {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:21,594 INFO L290 TraceCheckUtils]: 69: Hoare triple {128199#(<= ~counter~0 7)} assume !(0 == ~cond); {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:21,595 INFO L290 TraceCheckUtils]: 70: Hoare triple {128199#(<= ~counter~0 7)} assume true; {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:21,595 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {128199#(<= ~counter~0 7)} {128199#(<= ~counter~0 7)} #96#return; {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:21,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {128199#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:21,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {128199#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:21,597 INFO L290 TraceCheckUtils]: 74: Hoare triple {128224#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:21,598 INFO L272 TraceCheckUtils]: 75: Hoare triple {128224#(<= ~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)); {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:21,598 INFO L290 TraceCheckUtils]: 76: Hoare triple {128224#(<= ~counter~0 8)} ~cond := #in~cond; {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:21,598 INFO L290 TraceCheckUtils]: 77: Hoare triple {128224#(<= ~counter~0 8)} assume !(0 == ~cond); {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:21,598 INFO L290 TraceCheckUtils]: 78: Hoare triple {128224#(<= ~counter~0 8)} assume true; {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:21,599 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {128224#(<= ~counter~0 8)} {128224#(<= ~counter~0 8)} #96#return; {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:21,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {128224#(<= ~counter~0 8)} assume !(~r~0 > 0); {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:21,601 INFO L290 TraceCheckUtils]: 81: Hoare triple {128224#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:21,601 INFO L290 TraceCheckUtils]: 82: Hoare triple {128249#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:21,602 INFO L272 TraceCheckUtils]: 83: Hoare triple {128249#(<= ~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)); {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:21,602 INFO L290 TraceCheckUtils]: 84: Hoare triple {128249#(<= ~counter~0 9)} ~cond := #in~cond; {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:21,602 INFO L290 TraceCheckUtils]: 85: Hoare triple {128249#(<= ~counter~0 9)} assume !(0 == ~cond); {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:21,602 INFO L290 TraceCheckUtils]: 86: Hoare triple {128249#(<= ~counter~0 9)} assume true; {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:21,603 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {128249#(<= ~counter~0 9)} {128249#(<= ~counter~0 9)} #98#return; {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:21,603 INFO L290 TraceCheckUtils]: 88: Hoare triple {128249#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:21,605 INFO L290 TraceCheckUtils]: 89: Hoare triple {128249#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:21,605 INFO L290 TraceCheckUtils]: 90: Hoare triple {128274#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:21,606 INFO L272 TraceCheckUtils]: 91: Hoare triple {128274#(<= ~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)); {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:21,606 INFO L290 TraceCheckUtils]: 92: Hoare triple {128274#(<= ~counter~0 10)} ~cond := #in~cond; {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:21,606 INFO L290 TraceCheckUtils]: 93: Hoare triple {128274#(<= ~counter~0 10)} assume !(0 == ~cond); {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:21,606 INFO L290 TraceCheckUtils]: 94: Hoare triple {128274#(<= ~counter~0 10)} assume true; {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:21,607 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {128274#(<= ~counter~0 10)} {128274#(<= ~counter~0 10)} #98#return; {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:21,607 INFO L290 TraceCheckUtils]: 96: Hoare triple {128274#(<= ~counter~0 10)} assume !(~r~0 < 0); {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:21,609 INFO L290 TraceCheckUtils]: 97: Hoare triple {128274#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:21,609 INFO L290 TraceCheckUtils]: 98: Hoare triple {128299#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:21,609 INFO L272 TraceCheckUtils]: 99: Hoare triple {128299#(<= ~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)); {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:21,610 INFO L290 TraceCheckUtils]: 100: Hoare triple {128299#(<= ~counter~0 11)} ~cond := #in~cond; {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:21,610 INFO L290 TraceCheckUtils]: 101: Hoare triple {128299#(<= ~counter~0 11)} assume !(0 == ~cond); {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:21,610 INFO L290 TraceCheckUtils]: 102: Hoare triple {128299#(<= ~counter~0 11)} assume true; {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:21,611 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {128299#(<= ~counter~0 11)} {128299#(<= ~counter~0 11)} #94#return; {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:21,611 INFO L290 TraceCheckUtils]: 104: Hoare triple {128299#(<= ~counter~0 11)} assume !!(0 != ~r~0); {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:21,612 INFO L290 TraceCheckUtils]: 105: Hoare triple {128299#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:21,613 INFO L290 TraceCheckUtils]: 106: Hoare triple {128324#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:21,613 INFO L272 TraceCheckUtils]: 107: Hoare triple {128324#(<= ~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)); {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:21,613 INFO L290 TraceCheckUtils]: 108: Hoare triple {128324#(<= ~counter~0 12)} ~cond := #in~cond; {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:21,614 INFO L290 TraceCheckUtils]: 109: Hoare triple {128324#(<= ~counter~0 12)} assume !(0 == ~cond); {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:21,614 INFO L290 TraceCheckUtils]: 110: Hoare triple {128324#(<= ~counter~0 12)} assume true; {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:21,614 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {128324#(<= ~counter~0 12)} {128324#(<= ~counter~0 12)} #96#return; {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:21,615 INFO L290 TraceCheckUtils]: 112: Hoare triple {128324#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:21,616 INFO L290 TraceCheckUtils]: 113: Hoare triple {128324#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:21,617 INFO L290 TraceCheckUtils]: 114: Hoare triple {128349#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:21,617 INFO L272 TraceCheckUtils]: 115: Hoare triple {128349#(<= ~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)); {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:21,617 INFO L290 TraceCheckUtils]: 116: Hoare triple {128349#(<= ~counter~0 13)} ~cond := #in~cond; {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:21,618 INFO L290 TraceCheckUtils]: 117: Hoare triple {128349#(<= ~counter~0 13)} assume !(0 == ~cond); {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:21,618 INFO L290 TraceCheckUtils]: 118: Hoare triple {128349#(<= ~counter~0 13)} assume true; {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:21,618 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {128349#(<= ~counter~0 13)} {128349#(<= ~counter~0 13)} #96#return; {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:21,619 INFO L290 TraceCheckUtils]: 120: Hoare triple {128349#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:21,620 INFO L290 TraceCheckUtils]: 121: Hoare triple {128349#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:21,620 INFO L290 TraceCheckUtils]: 122: Hoare triple {128374#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:21,621 INFO L272 TraceCheckUtils]: 123: Hoare triple {128374#(<= ~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)); {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:21,621 INFO L290 TraceCheckUtils]: 124: Hoare triple {128374#(<= ~counter~0 14)} ~cond := #in~cond; {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:21,621 INFO L290 TraceCheckUtils]: 125: Hoare triple {128374#(<= ~counter~0 14)} assume !(0 == ~cond); {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:21,621 INFO L290 TraceCheckUtils]: 126: Hoare triple {128374#(<= ~counter~0 14)} assume true; {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:21,622 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {128374#(<= ~counter~0 14)} {128374#(<= ~counter~0 14)} #96#return; {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:21,622 INFO L290 TraceCheckUtils]: 128: Hoare triple {128374#(<= ~counter~0 14)} assume !(~r~0 > 0); {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:21,623 INFO L290 TraceCheckUtils]: 129: Hoare triple {128374#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:21,624 INFO L290 TraceCheckUtils]: 130: Hoare triple {128399#(<= ~counter~0 15)} assume !!(#t~post8 < 50);havoc #t~post8; {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:21,624 INFO L272 TraceCheckUtils]: 131: Hoare triple {128399#(<= ~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)); {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:21,625 INFO L290 TraceCheckUtils]: 132: Hoare triple {128399#(<= ~counter~0 15)} ~cond := #in~cond; {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:21,625 INFO L290 TraceCheckUtils]: 133: Hoare triple {128399#(<= ~counter~0 15)} assume !(0 == ~cond); {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:21,625 INFO L290 TraceCheckUtils]: 134: Hoare triple {128399#(<= ~counter~0 15)} assume true; {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:21,625 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {128399#(<= ~counter~0 15)} {128399#(<= ~counter~0 15)} #98#return; {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:21,626 INFO L290 TraceCheckUtils]: 136: Hoare triple {128399#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:21,627 INFO L290 TraceCheckUtils]: 137: Hoare triple {128399#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:21,627 INFO L290 TraceCheckUtils]: 138: Hoare triple {128424#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:21,628 INFO L272 TraceCheckUtils]: 139: Hoare triple {128424#(<= ~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)); {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:21,628 INFO L290 TraceCheckUtils]: 140: Hoare triple {128424#(<= ~counter~0 16)} ~cond := #in~cond; {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:21,628 INFO L290 TraceCheckUtils]: 141: Hoare triple {128424#(<= ~counter~0 16)} assume !(0 == ~cond); {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:21,628 INFO L290 TraceCheckUtils]: 142: Hoare triple {128424#(<= ~counter~0 16)} assume true; {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:21,629 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {128424#(<= ~counter~0 16)} {128424#(<= ~counter~0 16)} #98#return; {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:21,629 INFO L290 TraceCheckUtils]: 144: Hoare triple {128424#(<= ~counter~0 16)} assume !(~r~0 < 0); {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:21,630 INFO L290 TraceCheckUtils]: 145: Hoare triple {128424#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:21,631 INFO L290 TraceCheckUtils]: 146: Hoare triple {128449#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:21,631 INFO L272 TraceCheckUtils]: 147: Hoare triple {128449#(<= ~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)); {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:21,632 INFO L290 TraceCheckUtils]: 148: Hoare triple {128449#(<= ~counter~0 17)} ~cond := #in~cond; {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:21,632 INFO L290 TraceCheckUtils]: 149: Hoare triple {128449#(<= ~counter~0 17)} assume !(0 == ~cond); {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:21,632 INFO L290 TraceCheckUtils]: 150: Hoare triple {128449#(<= ~counter~0 17)} assume true; {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:21,632 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {128449#(<= ~counter~0 17)} {128449#(<= ~counter~0 17)} #94#return; {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:21,633 INFO L290 TraceCheckUtils]: 152: Hoare triple {128449#(<= ~counter~0 17)} assume !!(0 != ~r~0); {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:21,634 INFO L290 TraceCheckUtils]: 153: Hoare triple {128449#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:21,634 INFO L290 TraceCheckUtils]: 154: Hoare triple {128474#(<= ~counter~0 18)} assume !!(#t~post7 < 50);havoc #t~post7; {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:21,635 INFO L272 TraceCheckUtils]: 155: Hoare triple {128474#(<= ~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)); {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:21,635 INFO L290 TraceCheckUtils]: 156: Hoare triple {128474#(<= ~counter~0 18)} ~cond := #in~cond; {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:21,635 INFO L290 TraceCheckUtils]: 157: Hoare triple {128474#(<= ~counter~0 18)} assume !(0 == ~cond); {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:21,636 INFO L290 TraceCheckUtils]: 158: Hoare triple {128474#(<= ~counter~0 18)} assume true; {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:21,636 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {128474#(<= ~counter~0 18)} {128474#(<= ~counter~0 18)} #96#return; {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:21,636 INFO L290 TraceCheckUtils]: 160: Hoare triple {128474#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:21,637 INFO L290 TraceCheckUtils]: 161: Hoare triple {128474#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:21,638 INFO L290 TraceCheckUtils]: 162: Hoare triple {128499#(<= ~counter~0 19)} assume !!(#t~post7 < 50);havoc #t~post7; {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:21,638 INFO L272 TraceCheckUtils]: 163: Hoare triple {128499#(<= ~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)); {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:21,639 INFO L290 TraceCheckUtils]: 164: Hoare triple {128499#(<= ~counter~0 19)} ~cond := #in~cond; {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:21,639 INFO L290 TraceCheckUtils]: 165: Hoare triple {128499#(<= ~counter~0 19)} assume !(0 == ~cond); {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:21,639 INFO L290 TraceCheckUtils]: 166: Hoare triple {128499#(<= ~counter~0 19)} assume true; {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:21,639 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {128499#(<= ~counter~0 19)} {128499#(<= ~counter~0 19)} #96#return; {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:21,640 INFO L290 TraceCheckUtils]: 168: Hoare triple {128499#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:21,641 INFO L290 TraceCheckUtils]: 169: Hoare triple {128499#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:21,641 INFO L290 TraceCheckUtils]: 170: Hoare triple {128524#(<= ~counter~0 20)} assume !!(#t~post7 < 50);havoc #t~post7; {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:21,642 INFO L272 TraceCheckUtils]: 171: Hoare triple {128524#(<= ~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)); {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:21,642 INFO L290 TraceCheckUtils]: 172: Hoare triple {128524#(<= ~counter~0 20)} ~cond := #in~cond; {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:21,642 INFO L290 TraceCheckUtils]: 173: Hoare triple {128524#(<= ~counter~0 20)} assume !(0 == ~cond); {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:21,643 INFO L290 TraceCheckUtils]: 174: Hoare triple {128524#(<= ~counter~0 20)} assume true; {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:21,643 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {128524#(<= ~counter~0 20)} {128524#(<= ~counter~0 20)} #96#return; {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:21,643 INFO L290 TraceCheckUtils]: 176: Hoare triple {128524#(<= ~counter~0 20)} assume !(~r~0 > 0); {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:21,645 INFO L290 TraceCheckUtils]: 177: Hoare triple {128524#(<= ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:21,645 INFO L290 TraceCheckUtils]: 178: Hoare triple {128549#(<= ~counter~0 21)} assume !!(#t~post8 < 50);havoc #t~post8; {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:21,645 INFO L272 TraceCheckUtils]: 179: Hoare triple {128549#(<= ~counter~0 21)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:21,646 INFO L290 TraceCheckUtils]: 180: Hoare triple {128549#(<= ~counter~0 21)} ~cond := #in~cond; {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:21,646 INFO L290 TraceCheckUtils]: 181: Hoare triple {128549#(<= ~counter~0 21)} assume !(0 == ~cond); {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:21,646 INFO L290 TraceCheckUtils]: 182: Hoare triple {128549#(<= ~counter~0 21)} assume true; {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:21,647 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {128549#(<= ~counter~0 21)} {128549#(<= ~counter~0 21)} #98#return; {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:21,647 INFO L290 TraceCheckUtils]: 184: Hoare triple {128549#(<= ~counter~0 21)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:21,647 INFO L290 TraceCheckUtils]: 185: Hoare triple {128549#(<= ~counter~0 21)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128574#(<= |main_#t~post8| 21)} is VALID [2022-04-27 13:19:21,647 INFO L290 TraceCheckUtils]: 186: Hoare triple {128574#(<= |main_#t~post8| 21)} assume !(#t~post8 < 50);havoc #t~post8; {127993#false} is VALID [2022-04-27 13:19:21,648 INFO L290 TraceCheckUtils]: 187: Hoare triple {127993#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127993#false} is VALID [2022-04-27 13:19:21,648 INFO L290 TraceCheckUtils]: 188: Hoare triple {127993#false} assume !(#t~post6 < 50);havoc #t~post6; {127993#false} is VALID [2022-04-27 13:19:21,648 INFO L272 TraceCheckUtils]: 189: Hoare triple {127993#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127993#false} is VALID [2022-04-27 13:19:21,648 INFO L290 TraceCheckUtils]: 190: Hoare triple {127993#false} ~cond := #in~cond; {127993#false} is VALID [2022-04-27 13:19:21,648 INFO L290 TraceCheckUtils]: 191: Hoare triple {127993#false} assume 0 == ~cond; {127993#false} is VALID [2022-04-27 13:19:21,648 INFO L290 TraceCheckUtils]: 192: Hoare triple {127993#false} assume !false; {127993#false} is VALID [2022-04-27 13:19:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 50 proven. 1142 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:19:21,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:19:22,954 INFO L290 TraceCheckUtils]: 192: Hoare triple {127993#false} assume !false; {127993#false} is VALID [2022-04-27 13:19:22,954 INFO L290 TraceCheckUtils]: 191: Hoare triple {127993#false} assume 0 == ~cond; {127993#false} is VALID [2022-04-27 13:19:22,954 INFO L290 TraceCheckUtils]: 190: Hoare triple {127993#false} ~cond := #in~cond; {127993#false} is VALID [2022-04-27 13:19:22,954 INFO L272 TraceCheckUtils]: 189: Hoare triple {127993#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127993#false} is VALID [2022-04-27 13:19:22,954 INFO L290 TraceCheckUtils]: 188: Hoare triple {127993#false} assume !(#t~post6 < 50);havoc #t~post6; {127993#false} is VALID [2022-04-27 13:19:22,954 INFO L290 TraceCheckUtils]: 187: Hoare triple {127993#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127993#false} is VALID [2022-04-27 13:19:22,955 INFO L290 TraceCheckUtils]: 186: Hoare triple {128614#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {127993#false} is VALID [2022-04-27 13:19:22,955 INFO L290 TraceCheckUtils]: 185: Hoare triple {128618#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128614#(< |main_#t~post8| 50)} is VALID [2022-04-27 13:19:22,955 INFO L290 TraceCheckUtils]: 184: Hoare triple {128618#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128618#(< ~counter~0 50)} is VALID [2022-04-27 13:19:22,956 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {127992#true} {128618#(< ~counter~0 50)} #98#return; {128618#(< ~counter~0 50)} is VALID [2022-04-27 13:19:22,956 INFO L290 TraceCheckUtils]: 182: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,956 INFO L290 TraceCheckUtils]: 181: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,956 INFO L290 TraceCheckUtils]: 180: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,956 INFO L272 TraceCheckUtils]: 179: Hoare triple {128618#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,956 INFO L290 TraceCheckUtils]: 178: Hoare triple {128618#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {128618#(< ~counter~0 50)} is VALID [2022-04-27 13:19:22,958 INFO L290 TraceCheckUtils]: 177: Hoare triple {128643#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128618#(< ~counter~0 50)} is VALID [2022-04-27 13:19:22,958 INFO L290 TraceCheckUtils]: 176: Hoare triple {128643#(< ~counter~0 49)} assume !(~r~0 > 0); {128643#(< ~counter~0 49)} is VALID [2022-04-27 13:19:22,959 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {127992#true} {128643#(< ~counter~0 49)} #96#return; {128643#(< ~counter~0 49)} is VALID [2022-04-27 13:19:22,959 INFO L290 TraceCheckUtils]: 174: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,959 INFO L290 TraceCheckUtils]: 173: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,959 INFO L290 TraceCheckUtils]: 172: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,959 INFO L272 TraceCheckUtils]: 171: Hoare triple {128643#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,959 INFO L290 TraceCheckUtils]: 170: Hoare triple {128643#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {128643#(< ~counter~0 49)} is VALID [2022-04-27 13:19:22,960 INFO L290 TraceCheckUtils]: 169: Hoare triple {128668#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128643#(< ~counter~0 49)} is VALID [2022-04-27 13:19:22,961 INFO L290 TraceCheckUtils]: 168: Hoare triple {128668#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128668#(< ~counter~0 48)} is VALID [2022-04-27 13:19:22,961 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {127992#true} {128668#(< ~counter~0 48)} #96#return; {128668#(< ~counter~0 48)} is VALID [2022-04-27 13:19:22,961 INFO L290 TraceCheckUtils]: 166: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,961 INFO L290 TraceCheckUtils]: 165: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,961 INFO L290 TraceCheckUtils]: 164: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,961 INFO L272 TraceCheckUtils]: 163: Hoare triple {128668#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,962 INFO L290 TraceCheckUtils]: 162: Hoare triple {128668#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {128668#(< ~counter~0 48)} is VALID [2022-04-27 13:19:22,963 INFO L290 TraceCheckUtils]: 161: Hoare triple {128693#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128668#(< ~counter~0 48)} is VALID [2022-04-27 13:19:22,963 INFO L290 TraceCheckUtils]: 160: Hoare triple {128693#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128693#(< ~counter~0 47)} is VALID [2022-04-27 13:19:22,964 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {127992#true} {128693#(< ~counter~0 47)} #96#return; {128693#(< ~counter~0 47)} is VALID [2022-04-27 13:19:22,964 INFO L290 TraceCheckUtils]: 158: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,964 INFO L290 TraceCheckUtils]: 157: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,964 INFO L290 TraceCheckUtils]: 156: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,964 INFO L272 TraceCheckUtils]: 155: Hoare triple {128693#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,964 INFO L290 TraceCheckUtils]: 154: Hoare triple {128693#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {128693#(< ~counter~0 47)} is VALID [2022-04-27 13:19:22,965 INFO L290 TraceCheckUtils]: 153: Hoare triple {128718#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128693#(< ~counter~0 47)} is VALID [2022-04-27 13:19:22,965 INFO L290 TraceCheckUtils]: 152: Hoare triple {128718#(< ~counter~0 46)} assume !!(0 != ~r~0); {128718#(< ~counter~0 46)} is VALID [2022-04-27 13:19:22,966 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {127992#true} {128718#(< ~counter~0 46)} #94#return; {128718#(< ~counter~0 46)} is VALID [2022-04-27 13:19:22,966 INFO L290 TraceCheckUtils]: 150: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,966 INFO L290 TraceCheckUtils]: 149: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,966 INFO L290 TraceCheckUtils]: 148: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,966 INFO L272 TraceCheckUtils]: 147: Hoare triple {128718#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,966 INFO L290 TraceCheckUtils]: 146: Hoare triple {128718#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {128718#(< ~counter~0 46)} is VALID [2022-04-27 13:19:22,967 INFO L290 TraceCheckUtils]: 145: Hoare triple {128743#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128718#(< ~counter~0 46)} is VALID [2022-04-27 13:19:22,968 INFO L290 TraceCheckUtils]: 144: Hoare triple {128743#(< ~counter~0 45)} assume !(~r~0 < 0); {128743#(< ~counter~0 45)} is VALID [2022-04-27 13:19:22,968 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {127992#true} {128743#(< ~counter~0 45)} #98#return; {128743#(< ~counter~0 45)} is VALID [2022-04-27 13:19:22,968 INFO L290 TraceCheckUtils]: 142: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,968 INFO L290 TraceCheckUtils]: 141: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,968 INFO L290 TraceCheckUtils]: 140: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,968 INFO L272 TraceCheckUtils]: 139: Hoare triple {128743#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,969 INFO L290 TraceCheckUtils]: 138: Hoare triple {128743#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {128743#(< ~counter~0 45)} is VALID [2022-04-27 13:19:22,970 INFO L290 TraceCheckUtils]: 137: Hoare triple {128768#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128743#(< ~counter~0 45)} is VALID [2022-04-27 13:19:22,970 INFO L290 TraceCheckUtils]: 136: Hoare triple {128768#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128768#(< ~counter~0 44)} is VALID [2022-04-27 13:19:22,970 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {127992#true} {128768#(< ~counter~0 44)} #98#return; {128768#(< ~counter~0 44)} is VALID [2022-04-27 13:19:22,970 INFO L290 TraceCheckUtils]: 134: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,971 INFO L290 TraceCheckUtils]: 133: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,971 INFO L290 TraceCheckUtils]: 132: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,971 INFO L272 TraceCheckUtils]: 131: Hoare triple {128768#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,971 INFO L290 TraceCheckUtils]: 130: Hoare triple {128768#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {128768#(< ~counter~0 44)} is VALID [2022-04-27 13:19:22,972 INFO L290 TraceCheckUtils]: 129: Hoare triple {128793#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128768#(< ~counter~0 44)} is VALID [2022-04-27 13:19:22,972 INFO L290 TraceCheckUtils]: 128: Hoare triple {128793#(< ~counter~0 43)} assume !(~r~0 > 0); {128793#(< ~counter~0 43)} is VALID [2022-04-27 13:19:22,973 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {127992#true} {128793#(< ~counter~0 43)} #96#return; {128793#(< ~counter~0 43)} is VALID [2022-04-27 13:19:22,973 INFO L290 TraceCheckUtils]: 126: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,973 INFO L290 TraceCheckUtils]: 125: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,973 INFO L290 TraceCheckUtils]: 124: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,973 INFO L272 TraceCheckUtils]: 123: Hoare triple {128793#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,973 INFO L290 TraceCheckUtils]: 122: Hoare triple {128793#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {128793#(< ~counter~0 43)} is VALID [2022-04-27 13:19:22,974 INFO L290 TraceCheckUtils]: 121: Hoare triple {128818#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128793#(< ~counter~0 43)} is VALID [2022-04-27 13:19:22,975 INFO L290 TraceCheckUtils]: 120: Hoare triple {128818#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128818#(< ~counter~0 42)} is VALID [2022-04-27 13:19:22,975 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {127992#true} {128818#(< ~counter~0 42)} #96#return; {128818#(< ~counter~0 42)} is VALID [2022-04-27 13:19:22,975 INFO L290 TraceCheckUtils]: 118: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,975 INFO L290 TraceCheckUtils]: 117: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,975 INFO L290 TraceCheckUtils]: 116: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,975 INFO L272 TraceCheckUtils]: 115: Hoare triple {128818#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,976 INFO L290 TraceCheckUtils]: 114: Hoare triple {128818#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {128818#(< ~counter~0 42)} is VALID [2022-04-27 13:19:22,977 INFO L290 TraceCheckUtils]: 113: Hoare triple {128843#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128818#(< ~counter~0 42)} is VALID [2022-04-27 13:19:22,977 INFO L290 TraceCheckUtils]: 112: Hoare triple {128843#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128843#(< ~counter~0 41)} is VALID [2022-04-27 13:19:22,977 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {127992#true} {128843#(< ~counter~0 41)} #96#return; {128843#(< ~counter~0 41)} is VALID [2022-04-27 13:19:22,978 INFO L290 TraceCheckUtils]: 110: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,978 INFO L290 TraceCheckUtils]: 109: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,978 INFO L290 TraceCheckUtils]: 108: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,978 INFO L272 TraceCheckUtils]: 107: Hoare triple {128843#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,978 INFO L290 TraceCheckUtils]: 106: Hoare triple {128843#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {128843#(< ~counter~0 41)} is VALID [2022-04-27 13:19:22,979 INFO L290 TraceCheckUtils]: 105: Hoare triple {128868#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128843#(< ~counter~0 41)} is VALID [2022-04-27 13:19:22,979 INFO L290 TraceCheckUtils]: 104: Hoare triple {128868#(< ~counter~0 40)} assume !!(0 != ~r~0); {128868#(< ~counter~0 40)} is VALID [2022-04-27 13:19:22,980 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {127992#true} {128868#(< ~counter~0 40)} #94#return; {128868#(< ~counter~0 40)} is VALID [2022-04-27 13:19:22,980 INFO L290 TraceCheckUtils]: 102: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,980 INFO L290 TraceCheckUtils]: 101: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,980 INFO L290 TraceCheckUtils]: 100: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,980 INFO L272 TraceCheckUtils]: 99: Hoare triple {128868#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,980 INFO L290 TraceCheckUtils]: 98: Hoare triple {128868#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {128868#(< ~counter~0 40)} is VALID [2022-04-27 13:19:22,981 INFO L290 TraceCheckUtils]: 97: Hoare triple {128893#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128868#(< ~counter~0 40)} is VALID [2022-04-27 13:19:22,982 INFO L290 TraceCheckUtils]: 96: Hoare triple {128893#(< ~counter~0 39)} assume !(~r~0 < 0); {128893#(< ~counter~0 39)} is VALID [2022-04-27 13:19:22,982 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {127992#true} {128893#(< ~counter~0 39)} #98#return; {128893#(< ~counter~0 39)} is VALID [2022-04-27 13:19:22,982 INFO L290 TraceCheckUtils]: 94: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,982 INFO L290 TraceCheckUtils]: 93: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,982 INFO L290 TraceCheckUtils]: 92: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,982 INFO L272 TraceCheckUtils]: 91: Hoare triple {128893#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,983 INFO L290 TraceCheckUtils]: 90: Hoare triple {128893#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {128893#(< ~counter~0 39)} is VALID [2022-04-27 13:19:22,984 INFO L290 TraceCheckUtils]: 89: Hoare triple {128918#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128893#(< ~counter~0 39)} is VALID [2022-04-27 13:19:22,984 INFO L290 TraceCheckUtils]: 88: Hoare triple {128918#(< ~counter~0 38)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128918#(< ~counter~0 38)} is VALID [2022-04-27 13:19:22,984 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {127992#true} {128918#(< ~counter~0 38)} #98#return; {128918#(< ~counter~0 38)} is VALID [2022-04-27 13:19:22,985 INFO L290 TraceCheckUtils]: 86: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,985 INFO L290 TraceCheckUtils]: 85: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,985 INFO L290 TraceCheckUtils]: 84: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,985 INFO L272 TraceCheckUtils]: 83: Hoare triple {128918#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,985 INFO L290 TraceCheckUtils]: 82: Hoare triple {128918#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {128918#(< ~counter~0 38)} is VALID [2022-04-27 13:19:22,986 INFO L290 TraceCheckUtils]: 81: Hoare triple {128943#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128918#(< ~counter~0 38)} is VALID [2022-04-27 13:19:22,986 INFO L290 TraceCheckUtils]: 80: Hoare triple {128943#(< ~counter~0 37)} assume !(~r~0 > 0); {128943#(< ~counter~0 37)} is VALID [2022-04-27 13:19:22,987 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {127992#true} {128943#(< ~counter~0 37)} #96#return; {128943#(< ~counter~0 37)} is VALID [2022-04-27 13:19:22,987 INFO L290 TraceCheckUtils]: 78: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,987 INFO L290 TraceCheckUtils]: 77: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,987 INFO L290 TraceCheckUtils]: 76: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,987 INFO L272 TraceCheckUtils]: 75: Hoare triple {128943#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,987 INFO L290 TraceCheckUtils]: 74: Hoare triple {128943#(< ~counter~0 37)} assume !!(#t~post7 < 50);havoc #t~post7; {128943#(< ~counter~0 37)} is VALID [2022-04-27 13:19:22,988 INFO L290 TraceCheckUtils]: 73: Hoare triple {128968#(< ~counter~0 36)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128943#(< ~counter~0 37)} is VALID [2022-04-27 13:19:22,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {128968#(< ~counter~0 36)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128968#(< ~counter~0 36)} is VALID [2022-04-27 13:19:22,989 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {127992#true} {128968#(< ~counter~0 36)} #96#return; {128968#(< ~counter~0 36)} is VALID [2022-04-27 13:19:22,989 INFO L290 TraceCheckUtils]: 70: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,989 INFO L290 TraceCheckUtils]: 69: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,989 INFO L290 TraceCheckUtils]: 68: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,989 INFO L272 TraceCheckUtils]: 67: Hoare triple {128968#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,989 INFO L290 TraceCheckUtils]: 66: Hoare triple {128968#(< ~counter~0 36)} assume !!(#t~post7 < 50);havoc #t~post7; {128968#(< ~counter~0 36)} is VALID [2022-04-27 13:19:22,991 INFO L290 TraceCheckUtils]: 65: Hoare triple {128993#(< ~counter~0 35)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128968#(< ~counter~0 36)} is VALID [2022-04-27 13:19:22,991 INFO L290 TraceCheckUtils]: 64: Hoare triple {128993#(< ~counter~0 35)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128993#(< ~counter~0 35)} is VALID [2022-04-27 13:19:22,991 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {127992#true} {128993#(< ~counter~0 35)} #96#return; {128993#(< ~counter~0 35)} is VALID [2022-04-27 13:19:22,991 INFO L290 TraceCheckUtils]: 62: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,992 INFO L290 TraceCheckUtils]: 61: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,992 INFO L290 TraceCheckUtils]: 60: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,992 INFO L272 TraceCheckUtils]: 59: Hoare triple {128993#(< ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,992 INFO L290 TraceCheckUtils]: 58: Hoare triple {128993#(< ~counter~0 35)} assume !!(#t~post7 < 50);havoc #t~post7; {128993#(< ~counter~0 35)} is VALID [2022-04-27 13:19:22,993 INFO L290 TraceCheckUtils]: 57: Hoare triple {129018#(< ~counter~0 34)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128993#(< ~counter~0 35)} is VALID [2022-04-27 13:19:22,993 INFO L290 TraceCheckUtils]: 56: Hoare triple {129018#(< ~counter~0 34)} assume !!(0 != ~r~0); {129018#(< ~counter~0 34)} is VALID [2022-04-27 13:19:22,994 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {127992#true} {129018#(< ~counter~0 34)} #94#return; {129018#(< ~counter~0 34)} is VALID [2022-04-27 13:19:22,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,994 INFO L290 TraceCheckUtils]: 52: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,994 INFO L272 TraceCheckUtils]: 51: Hoare triple {129018#(< ~counter~0 34)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,994 INFO L290 TraceCheckUtils]: 50: Hoare triple {129018#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {129018#(< ~counter~0 34)} is VALID [2022-04-27 13:19:22,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {129043#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {129018#(< ~counter~0 34)} is VALID [2022-04-27 13:19:22,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {129043#(< ~counter~0 33)} assume !(~r~0 < 0); {129043#(< ~counter~0 33)} is VALID [2022-04-27 13:19:22,996 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {127992#true} {129043#(< ~counter~0 33)} #98#return; {129043#(< ~counter~0 33)} is VALID [2022-04-27 13:19:22,996 INFO L290 TraceCheckUtils]: 46: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,996 INFO L290 TraceCheckUtils]: 45: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,996 INFO L290 TraceCheckUtils]: 44: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,996 INFO L272 TraceCheckUtils]: 43: Hoare triple {129043#(< ~counter~0 33)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {129043#(< ~counter~0 33)} assume !!(#t~post8 < 50);havoc #t~post8; {129043#(< ~counter~0 33)} is VALID [2022-04-27 13:19:22,997 INFO L290 TraceCheckUtils]: 41: Hoare triple {129068#(< ~counter~0 32)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {129043#(< ~counter~0 33)} is VALID [2022-04-27 13:19:22,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {129068#(< ~counter~0 32)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {129068#(< ~counter~0 32)} is VALID [2022-04-27 13:19:22,998 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {127992#true} {129068#(< ~counter~0 32)} #98#return; {129068#(< ~counter~0 32)} is VALID [2022-04-27 13:19:22,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:22,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:22,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:22,998 INFO L272 TraceCheckUtils]: 35: Hoare triple {129068#(< ~counter~0 32)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:22,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {129068#(< ~counter~0 32)} assume !!(#t~post8 < 50);havoc #t~post8; {129068#(< ~counter~0 32)} is VALID [2022-04-27 13:19:23,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {129093#(< ~counter~0 31)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {129068#(< ~counter~0 32)} is VALID [2022-04-27 13:19:23,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {129093#(< ~counter~0 31)} assume !(~r~0 > 0); {129093#(< ~counter~0 31)} is VALID [2022-04-27 13:19:23,001 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {127992#true} {129093#(< ~counter~0 31)} #96#return; {129093#(< ~counter~0 31)} is VALID [2022-04-27 13:19:23,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:23,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:23,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:23,001 INFO L272 TraceCheckUtils]: 27: Hoare triple {129093#(< ~counter~0 31)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:23,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {129093#(< ~counter~0 31)} assume !!(#t~post7 < 50);havoc #t~post7; {129093#(< ~counter~0 31)} is VALID [2022-04-27 13:19:23,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {129118#(< ~counter~0 30)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {129093#(< ~counter~0 31)} is VALID [2022-04-27 13:19:23,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {129118#(< ~counter~0 30)} assume !!(0 != ~r~0); {129118#(< ~counter~0 30)} is VALID [2022-04-27 13:19:23,003 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {127992#true} {129118#(< ~counter~0 30)} #94#return; {129118#(< ~counter~0 30)} is VALID [2022-04-27 13:19:23,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:23,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:23,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:23,003 INFO L272 TraceCheckUtils]: 19: Hoare triple {129118#(< ~counter~0 30)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:23,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {129118#(< ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {129118#(< ~counter~0 30)} is VALID [2022-04-27 13:19:23,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {129143#(< ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {129118#(< ~counter~0 30)} is VALID [2022-04-27 13:19:23,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {129143#(< ~counter~0 29)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {129143#(< ~counter~0 29)} is VALID [2022-04-27 13:19:23,005 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {127992#true} {129143#(< ~counter~0 29)} #92#return; {129143#(< ~counter~0 29)} is VALID [2022-04-27 13:19:23,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:23,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:23,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:23,006 INFO L272 TraceCheckUtils]: 11: Hoare triple {129143#(< ~counter~0 29)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:23,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {127992#true} {129143#(< ~counter~0 29)} #90#return; {129143#(< ~counter~0 29)} is VALID [2022-04-27 13:19:23,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:19:23,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:19:23,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:19:23,006 INFO L272 TraceCheckUtils]: 6: Hoare triple {129143#(< ~counter~0 29)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:19:23,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {129143#(< ~counter~0 29)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {129143#(< ~counter~0 29)} is VALID [2022-04-27 13:19:23,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {129143#(< ~counter~0 29)} call #t~ret9 := main(); {129143#(< ~counter~0 29)} is VALID [2022-04-27 13:19:23,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129143#(< ~counter~0 29)} {127992#true} #102#return; {129143#(< ~counter~0 29)} is VALID [2022-04-27 13:19:23,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {129143#(< ~counter~0 29)} assume true; {129143#(< ~counter~0 29)} is VALID [2022-04-27 13:19:23,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {127992#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {129143#(< ~counter~0 29)} is VALID [2022-04-27 13:19:23,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {127992#true} call ULTIMATE.init(); {127992#true} is VALID [2022-04-27 13:19:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 50 proven. 302 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2022-04-27 13:19:23,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:19:23,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777162546] [2022-04-27 13:19:23,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:19:23,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066170553] [2022-04-27 13:19:23,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066170553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:19:23,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:19:23,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2022-04-27 13:19:23,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375543300] [2022-04-27 13:19:23,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:19:23,010 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) Word has length 193 [2022-04-27 13:19:23,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:19:23,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-27 13:19:23,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:19:23,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-27 13:19:23,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:19:23,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-27 13:19:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 13:19:23,316 INFO L87 Difference]: Start difference. First operand 9645 states and 13867 transitions. Second operand has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-27 13:19:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:19:50,758 INFO L93 Difference]: Finished difference Result 14792 states and 21463 transitions. [2022-04-27 13:19:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-04-27 13:19:50,758 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) Word has length 193 [2022-04-27 13:19:50,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:19:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-27 13:19:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1004 transitions. [2022-04-27 13:19:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-27 13:19:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1004 transitions. [2022-04-27 13:19:50,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 1004 transitions. [2022-04-27 13:19:51,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1004 edges. 1004 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:19:53,998 INFO L225 Difference]: With dead ends: 14792 [2022-04-27 13:19:53,999 INFO L226 Difference]: Without dead ends: 7697 [2022-04-27 13:19:54,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2864, Invalid=4968, Unknown=0, NotChecked=0, Total=7832 [2022-04-27 13:19:54,014 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 1857 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 1237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1237 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:19:54,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1857 Valid, 843 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1237 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 13:19:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7697 states. [2022-04-27 13:20:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7697 to 7470. [2022-04-27 13:20:05,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:05,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7697 states. Second operand has 7470 states, 5600 states have (on average 1.1821428571428572) internal successors, (6620), 5644 states have internal predecessors, (6620), 1823 states have call successors, (1823), 48 states have call predecessors, (1823), 46 states have return successors, (1821), 1777 states have call predecessors, (1821), 1821 states have call successors, (1821) [2022-04-27 13:20:05,275 INFO L74 IsIncluded]: Start isIncluded. First operand 7697 states. Second operand has 7470 states, 5600 states have (on average 1.1821428571428572) internal successors, (6620), 5644 states have internal predecessors, (6620), 1823 states have call successors, (1823), 48 states have call predecessors, (1823), 46 states have return successors, (1821), 1777 states have call predecessors, (1821), 1821 states have call successors, (1821) [2022-04-27 13:20:05,282 INFO L87 Difference]: Start difference. First operand 7697 states. Second operand has 7470 states, 5600 states have (on average 1.1821428571428572) internal successors, (6620), 5644 states have internal predecessors, (6620), 1823 states have call successors, (1823), 48 states have call predecessors, (1823), 46 states have return successors, (1821), 1777 states have call predecessors, (1821), 1821 states have call successors, (1821) [2022-04-27 13:20:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:06,929 INFO L93 Difference]: Finished difference Result 7697 states and 10470 transitions. [2022-04-27 13:20:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 7697 states and 10470 transitions. [2022-04-27 13:20:06,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:06,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:06,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 7470 states, 5600 states have (on average 1.1821428571428572) internal successors, (6620), 5644 states have internal predecessors, (6620), 1823 states have call successors, (1823), 48 states have call predecessors, (1823), 46 states have return successors, (1821), 1777 states have call predecessors, (1821), 1821 states have call successors, (1821) Second operand 7697 states. [2022-04-27 13:20:06,955 INFO L87 Difference]: Start difference. First operand has 7470 states, 5600 states have (on average 1.1821428571428572) internal successors, (6620), 5644 states have internal predecessors, (6620), 1823 states have call successors, (1823), 48 states have call predecessors, (1823), 46 states have return successors, (1821), 1777 states have call predecessors, (1821), 1821 states have call successors, (1821) Second operand 7697 states. [2022-04-27 13:20:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:08,650 INFO L93 Difference]: Finished difference Result 7697 states and 10470 transitions. [2022-04-27 13:20:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 7697 states and 10470 transitions. [2022-04-27 13:20:08,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:08,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:08,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:08,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7470 states, 5600 states have (on average 1.1821428571428572) internal successors, (6620), 5644 states have internal predecessors, (6620), 1823 states have call successors, (1823), 48 states have call predecessors, (1823), 46 states have return successors, (1821), 1777 states have call predecessors, (1821), 1821 states have call successors, (1821) [2022-04-27 13:20:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 10264 transitions. [2022-04-27 13:20:10,776 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 10264 transitions. Word has length 193 [2022-04-27 13:20:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:10,776 INFO L495 AbstractCegarLoop]: Abstraction has 7470 states and 10264 transitions. [2022-04-27 13:20:10,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-27 13:20:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 10264 transitions. [2022-04-27 13:20:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-04-27 13:20:10,781 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:10,781 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 10, 10, 10, 10, 8, 8, 8, 8, 6, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:10,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-27 13:20:10,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:10,995 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:10,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1172412185, now seen corresponding path program 2 times [2022-04-27 13:20:10,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:10,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805300967] [2022-04-27 13:20:10,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:10,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:11,012 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:20:11,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355290780] [2022-04-27 13:20:11,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:20:11,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:11,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:11,014 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-27 13:20:11,014 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-27 13:20:11,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:20:11,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:20:11,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-27 13:20:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:11,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:20:12,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {176020#true} call ULTIMATE.init(); {176020#true} is VALID [2022-04-27 13:20:12,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {176020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {176028#(<= ~counter~0 0)} assume true; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176028#(<= ~counter~0 0)} {176020#true} #102#return; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {176028#(<= ~counter~0 0)} call #t~ret9 := main(); {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {176028#(<= ~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; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,171 INFO L272 TraceCheckUtils]: 6: Hoare triple {176028#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {176028#(<= ~counter~0 0)} ~cond := #in~cond; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {176028#(<= ~counter~0 0)} assume !(0 == ~cond); {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {176028#(<= ~counter~0 0)} assume true; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,172 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176028#(<= ~counter~0 0)} {176028#(<= ~counter~0 0)} #90#return; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,173 INFO L272 TraceCheckUtils]: 11: Hoare triple {176028#(<= ~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)); {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {176028#(<= ~counter~0 0)} ~cond := #in~cond; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {176028#(<= ~counter~0 0)} assume !(0 == ~cond); {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {176028#(<= ~counter~0 0)} assume true; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,174 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176028#(<= ~counter~0 0)} {176028#(<= ~counter~0 0)} #92#return; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {176028#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:12,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {176028#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:20:12,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {176077#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:20:12,177 INFO L272 TraceCheckUtils]: 19: Hoare triple {176077#(<= ~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)); {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:20:12,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {176077#(<= ~counter~0 1)} ~cond := #in~cond; {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:20:12,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {176077#(<= ~counter~0 1)} assume !(0 == ~cond); {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:20:12,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {176077#(<= ~counter~0 1)} assume true; {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:20:12,178 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176077#(<= ~counter~0 1)} {176077#(<= ~counter~0 1)} #94#return; {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:20:12,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {176077#(<= ~counter~0 1)} assume !!(0 != ~r~0); {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:20:12,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {176077#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:20:12,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {176102#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:20:12,181 INFO L272 TraceCheckUtils]: 27: Hoare triple {176102#(<= ~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)); {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:20:12,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {176102#(<= ~counter~0 2)} ~cond := #in~cond; {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:20:12,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {176102#(<= ~counter~0 2)} assume !(0 == ~cond); {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:20:12,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {176102#(<= ~counter~0 2)} assume true; {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:20:12,182 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176102#(<= ~counter~0 2)} {176102#(<= ~counter~0 2)} #96#return; {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:20:12,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {176102#(<= ~counter~0 2)} assume !(~r~0 > 0); {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:20:12,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {176102#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:20:12,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {176127#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:20:12,185 INFO L272 TraceCheckUtils]: 35: Hoare triple {176127#(<= ~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)); {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:20:12,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {176127#(<= ~counter~0 3)} ~cond := #in~cond; {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:20:12,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {176127#(<= ~counter~0 3)} assume !(0 == ~cond); {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:20:12,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {176127#(<= ~counter~0 3)} assume true; {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:20:12,186 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176127#(<= ~counter~0 3)} {176127#(<= ~counter~0 3)} #98#return; {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:20:12,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {176127#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:20:12,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {176127#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:20:12,189 INFO L290 TraceCheckUtils]: 42: Hoare triple {176152#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:20:12,189 INFO L272 TraceCheckUtils]: 43: Hoare triple {176152#(<= ~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)); {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:20:12,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {176152#(<= ~counter~0 4)} ~cond := #in~cond; {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:20:12,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {176152#(<= ~counter~0 4)} assume !(0 == ~cond); {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:20:12,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {176152#(<= ~counter~0 4)} assume true; {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:20:12,191 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176152#(<= ~counter~0 4)} {176152#(<= ~counter~0 4)} #98#return; {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:20:12,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {176152#(<= ~counter~0 4)} assume !(~r~0 < 0); {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:20:12,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {176152#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:20:12,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {176177#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:20:12,193 INFO L272 TraceCheckUtils]: 51: Hoare triple {176177#(<= ~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)); {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:20:12,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {176177#(<= ~counter~0 5)} ~cond := #in~cond; {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:20:12,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {176177#(<= ~counter~0 5)} assume !(0 == ~cond); {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:20:12,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {176177#(<= ~counter~0 5)} assume true; {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:20:12,195 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176177#(<= ~counter~0 5)} {176177#(<= ~counter~0 5)} #94#return; {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:20:12,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {176177#(<= ~counter~0 5)} assume !!(0 != ~r~0); {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:20:12,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {176177#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:20:12,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {176202#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:20:12,197 INFO L272 TraceCheckUtils]: 59: Hoare triple {176202#(<= ~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)); {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:20:12,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {176202#(<= ~counter~0 6)} ~cond := #in~cond; {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:20:12,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {176202#(<= ~counter~0 6)} assume !(0 == ~cond); {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:20:12,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {176202#(<= ~counter~0 6)} assume true; {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:20:12,199 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176202#(<= ~counter~0 6)} {176202#(<= ~counter~0 6)} #96#return; {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:20:12,199 INFO L290 TraceCheckUtils]: 64: Hoare triple {176202#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:20:12,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {176202#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:20:12,201 INFO L290 TraceCheckUtils]: 66: Hoare triple {176227#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:20:12,201 INFO L272 TraceCheckUtils]: 67: Hoare triple {176227#(<= ~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)); {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:20:12,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {176227#(<= ~counter~0 7)} ~cond := #in~cond; {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:20:12,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {176227#(<= ~counter~0 7)} assume !(0 == ~cond); {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:20:12,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {176227#(<= ~counter~0 7)} assume true; {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:20:12,202 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176227#(<= ~counter~0 7)} {176227#(<= ~counter~0 7)} #96#return; {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:20:12,203 INFO L290 TraceCheckUtils]: 72: Hoare triple {176227#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:20:12,204 INFO L290 TraceCheckUtils]: 73: Hoare triple {176227#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:20:12,205 INFO L290 TraceCheckUtils]: 74: Hoare triple {176252#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:20:12,205 INFO L272 TraceCheckUtils]: 75: Hoare triple {176252#(<= ~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)); {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:20:12,205 INFO L290 TraceCheckUtils]: 76: Hoare triple {176252#(<= ~counter~0 8)} ~cond := #in~cond; {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:20:12,206 INFO L290 TraceCheckUtils]: 77: Hoare triple {176252#(<= ~counter~0 8)} assume !(0 == ~cond); {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:20:12,206 INFO L290 TraceCheckUtils]: 78: Hoare triple {176252#(<= ~counter~0 8)} assume true; {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:20:12,206 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176252#(<= ~counter~0 8)} {176252#(<= ~counter~0 8)} #96#return; {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:20:12,207 INFO L290 TraceCheckUtils]: 80: Hoare triple {176252#(<= ~counter~0 8)} assume !(~r~0 > 0); {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:20:12,209 INFO L290 TraceCheckUtils]: 81: Hoare triple {176252#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:20:12,209 INFO L290 TraceCheckUtils]: 82: Hoare triple {176277#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:20:12,209 INFO L272 TraceCheckUtils]: 83: Hoare triple {176277#(<= ~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)); {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:20:12,210 INFO L290 TraceCheckUtils]: 84: Hoare triple {176277#(<= ~counter~0 9)} ~cond := #in~cond; {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:20:12,210 INFO L290 TraceCheckUtils]: 85: Hoare triple {176277#(<= ~counter~0 9)} assume !(0 == ~cond); {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:20:12,210 INFO L290 TraceCheckUtils]: 86: Hoare triple {176277#(<= ~counter~0 9)} assume true; {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:20:12,211 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176277#(<= ~counter~0 9)} {176277#(<= ~counter~0 9)} #98#return; {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:20:12,211 INFO L290 TraceCheckUtils]: 88: Hoare triple {176277#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:20:12,213 INFO L290 TraceCheckUtils]: 89: Hoare triple {176277#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:20:12,213 INFO L290 TraceCheckUtils]: 90: Hoare triple {176302#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:20:12,214 INFO L272 TraceCheckUtils]: 91: Hoare triple {176302#(<= ~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)); {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:20:12,214 INFO L290 TraceCheckUtils]: 92: Hoare triple {176302#(<= ~counter~0 10)} ~cond := #in~cond; {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:20:12,214 INFO L290 TraceCheckUtils]: 93: Hoare triple {176302#(<= ~counter~0 10)} assume !(0 == ~cond); {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:20:12,214 INFO L290 TraceCheckUtils]: 94: Hoare triple {176302#(<= ~counter~0 10)} assume true; {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:20:12,215 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176302#(<= ~counter~0 10)} {176302#(<= ~counter~0 10)} #98#return; {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:20:12,215 INFO L290 TraceCheckUtils]: 96: Hoare triple {176302#(<= ~counter~0 10)} assume !(~r~0 < 0); {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:20:12,217 INFO L290 TraceCheckUtils]: 97: Hoare triple {176302#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:20:12,217 INFO L290 TraceCheckUtils]: 98: Hoare triple {176327#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:20:12,218 INFO L272 TraceCheckUtils]: 99: Hoare triple {176327#(<= ~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)); {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:20:12,218 INFO L290 TraceCheckUtils]: 100: Hoare triple {176327#(<= ~counter~0 11)} ~cond := #in~cond; {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:20:12,218 INFO L290 TraceCheckUtils]: 101: Hoare triple {176327#(<= ~counter~0 11)} assume !(0 == ~cond); {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:20:12,218 INFO L290 TraceCheckUtils]: 102: Hoare triple {176327#(<= ~counter~0 11)} assume true; {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:20:12,219 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176327#(<= ~counter~0 11)} {176327#(<= ~counter~0 11)} #94#return; {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:20:12,219 INFO L290 TraceCheckUtils]: 104: Hoare triple {176327#(<= ~counter~0 11)} assume !!(0 != ~r~0); {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:20:12,221 INFO L290 TraceCheckUtils]: 105: Hoare triple {176327#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:20:12,221 INFO L290 TraceCheckUtils]: 106: Hoare triple {176352#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:20:12,222 INFO L272 TraceCheckUtils]: 107: Hoare triple {176352#(<= ~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)); {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:20:12,222 INFO L290 TraceCheckUtils]: 108: Hoare triple {176352#(<= ~counter~0 12)} ~cond := #in~cond; {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:20:12,222 INFO L290 TraceCheckUtils]: 109: Hoare triple {176352#(<= ~counter~0 12)} assume !(0 == ~cond); {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:20:12,222 INFO L290 TraceCheckUtils]: 110: Hoare triple {176352#(<= ~counter~0 12)} assume true; {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:20:12,223 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176352#(<= ~counter~0 12)} {176352#(<= ~counter~0 12)} #96#return; {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:20:12,223 INFO L290 TraceCheckUtils]: 112: Hoare triple {176352#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:20:12,225 INFO L290 TraceCheckUtils]: 113: Hoare triple {176352#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:20:12,225 INFO L290 TraceCheckUtils]: 114: Hoare triple {176377#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:20:12,226 INFO L272 TraceCheckUtils]: 115: Hoare triple {176377#(<= ~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)); {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:20:12,226 INFO L290 TraceCheckUtils]: 116: Hoare triple {176377#(<= ~counter~0 13)} ~cond := #in~cond; {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:20:12,226 INFO L290 TraceCheckUtils]: 117: Hoare triple {176377#(<= ~counter~0 13)} assume !(0 == ~cond); {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:20:12,227 INFO L290 TraceCheckUtils]: 118: Hoare triple {176377#(<= ~counter~0 13)} assume true; {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:20:12,227 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176377#(<= ~counter~0 13)} {176377#(<= ~counter~0 13)} #96#return; {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:20:12,227 INFO L290 TraceCheckUtils]: 120: Hoare triple {176377#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:20:12,229 INFO L290 TraceCheckUtils]: 121: Hoare triple {176377#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:20:12,230 INFO L290 TraceCheckUtils]: 122: Hoare triple {176402#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:20:12,230 INFO L272 TraceCheckUtils]: 123: Hoare triple {176402#(<= ~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)); {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:20:12,230 INFO L290 TraceCheckUtils]: 124: Hoare triple {176402#(<= ~counter~0 14)} ~cond := #in~cond; {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:20:12,230 INFO L290 TraceCheckUtils]: 125: Hoare triple {176402#(<= ~counter~0 14)} assume !(0 == ~cond); {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:20:12,231 INFO L290 TraceCheckUtils]: 126: Hoare triple {176402#(<= ~counter~0 14)} assume true; {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:20:12,231 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176402#(<= ~counter~0 14)} {176402#(<= ~counter~0 14)} #96#return; {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:20:12,231 INFO L290 TraceCheckUtils]: 128: Hoare triple {176402#(<= ~counter~0 14)} assume !(~r~0 > 0); {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:20:12,233 INFO L290 TraceCheckUtils]: 129: Hoare triple {176402#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:20:12,233 INFO L290 TraceCheckUtils]: 130: Hoare triple {176427#(<= ~counter~0 15)} assume !!(#t~post8 < 50);havoc #t~post8; {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:20:12,234 INFO L272 TraceCheckUtils]: 131: Hoare triple {176427#(<= ~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)); {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:20:12,234 INFO L290 TraceCheckUtils]: 132: Hoare triple {176427#(<= ~counter~0 15)} ~cond := #in~cond; {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:20:12,234 INFO L290 TraceCheckUtils]: 133: Hoare triple {176427#(<= ~counter~0 15)} assume !(0 == ~cond); {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:20:12,235 INFO L290 TraceCheckUtils]: 134: Hoare triple {176427#(<= ~counter~0 15)} assume true; {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:20:12,235 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176427#(<= ~counter~0 15)} {176427#(<= ~counter~0 15)} #98#return; {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:20:12,235 INFO L290 TraceCheckUtils]: 136: Hoare triple {176427#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:20:12,237 INFO L290 TraceCheckUtils]: 137: Hoare triple {176427#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:20:12,238 INFO L290 TraceCheckUtils]: 138: Hoare triple {176452#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:20:12,238 INFO L272 TraceCheckUtils]: 139: Hoare triple {176452#(<= ~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)); {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:20:12,238 INFO L290 TraceCheckUtils]: 140: Hoare triple {176452#(<= ~counter~0 16)} ~cond := #in~cond; {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:20:12,239 INFO L290 TraceCheckUtils]: 141: Hoare triple {176452#(<= ~counter~0 16)} assume !(0 == ~cond); {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:20:12,239 INFO L290 TraceCheckUtils]: 142: Hoare triple {176452#(<= ~counter~0 16)} assume true; {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:20:12,239 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176452#(<= ~counter~0 16)} {176452#(<= ~counter~0 16)} #98#return; {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:20:12,240 INFO L290 TraceCheckUtils]: 144: Hoare triple {176452#(<= ~counter~0 16)} assume !(~r~0 < 0); {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:20:12,241 INFO L290 TraceCheckUtils]: 145: Hoare triple {176452#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:20:12,242 INFO L290 TraceCheckUtils]: 146: Hoare triple {176477#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:20:12,242 INFO L272 TraceCheckUtils]: 147: Hoare triple {176477#(<= ~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)); {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:20:12,242 INFO L290 TraceCheckUtils]: 148: Hoare triple {176477#(<= ~counter~0 17)} ~cond := #in~cond; {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:20:12,243 INFO L290 TraceCheckUtils]: 149: Hoare triple {176477#(<= ~counter~0 17)} assume !(0 == ~cond); {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:20:12,243 INFO L290 TraceCheckUtils]: 150: Hoare triple {176477#(<= ~counter~0 17)} assume true; {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:20:12,243 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176477#(<= ~counter~0 17)} {176477#(<= ~counter~0 17)} #94#return; {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:20:12,244 INFO L290 TraceCheckUtils]: 152: Hoare triple {176477#(<= ~counter~0 17)} assume !!(0 != ~r~0); {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:20:12,245 INFO L290 TraceCheckUtils]: 153: Hoare triple {176477#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:20:12,245 INFO L290 TraceCheckUtils]: 154: Hoare triple {176502#(<= ~counter~0 18)} assume !!(#t~post7 < 50);havoc #t~post7; {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:20:12,246 INFO L272 TraceCheckUtils]: 155: Hoare triple {176502#(<= ~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)); {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:20:12,246 INFO L290 TraceCheckUtils]: 156: Hoare triple {176502#(<= ~counter~0 18)} ~cond := #in~cond; {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:20:12,246 INFO L290 TraceCheckUtils]: 157: Hoare triple {176502#(<= ~counter~0 18)} assume !(0 == ~cond); {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:20:12,247 INFO L290 TraceCheckUtils]: 158: Hoare triple {176502#(<= ~counter~0 18)} assume true; {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:20:12,247 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {176502#(<= ~counter~0 18)} {176502#(<= ~counter~0 18)} #96#return; {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:20:12,247 INFO L290 TraceCheckUtils]: 160: Hoare triple {176502#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:20:12,249 INFO L290 TraceCheckUtils]: 161: Hoare triple {176502#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:20:12,249 INFO L290 TraceCheckUtils]: 162: Hoare triple {176527#(<= ~counter~0 19)} assume !!(#t~post7 < 50);havoc #t~post7; {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:20:12,250 INFO L272 TraceCheckUtils]: 163: Hoare triple {176527#(<= ~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)); {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:20:12,250 INFO L290 TraceCheckUtils]: 164: Hoare triple {176527#(<= ~counter~0 19)} ~cond := #in~cond; {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:20:12,250 INFO L290 TraceCheckUtils]: 165: Hoare triple {176527#(<= ~counter~0 19)} assume !(0 == ~cond); {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:20:12,251 INFO L290 TraceCheckUtils]: 166: Hoare triple {176527#(<= ~counter~0 19)} assume true; {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:20:12,251 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {176527#(<= ~counter~0 19)} {176527#(<= ~counter~0 19)} #96#return; {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:20:12,251 INFO L290 TraceCheckUtils]: 168: Hoare triple {176527#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:20:12,253 INFO L290 TraceCheckUtils]: 169: Hoare triple {176527#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:20:12,253 INFO L290 TraceCheckUtils]: 170: Hoare triple {176552#(<= ~counter~0 20)} assume !!(#t~post7 < 50);havoc #t~post7; {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:20:12,254 INFO L272 TraceCheckUtils]: 171: Hoare triple {176552#(<= ~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)); {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:20:12,254 INFO L290 TraceCheckUtils]: 172: Hoare triple {176552#(<= ~counter~0 20)} ~cond := #in~cond; {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:20:12,271 INFO L290 TraceCheckUtils]: 173: Hoare triple {176552#(<= ~counter~0 20)} assume !(0 == ~cond); {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:20:12,272 INFO L290 TraceCheckUtils]: 174: Hoare triple {176552#(<= ~counter~0 20)} assume true; {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:20:12,272 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {176552#(<= ~counter~0 20)} {176552#(<= ~counter~0 20)} #96#return; {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:20:12,273 INFO L290 TraceCheckUtils]: 176: Hoare triple {176552#(<= ~counter~0 20)} assume !(~r~0 > 0); {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:20:12,275 INFO L290 TraceCheckUtils]: 177: Hoare triple {176552#(<= ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:20:12,275 INFO L290 TraceCheckUtils]: 178: Hoare triple {176577#(<= ~counter~0 21)} assume !!(#t~post8 < 50);havoc #t~post8; {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:20:12,276 INFO L272 TraceCheckUtils]: 179: Hoare triple {176577#(<= ~counter~0 21)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:20:12,276 INFO L290 TraceCheckUtils]: 180: Hoare triple {176577#(<= ~counter~0 21)} ~cond := #in~cond; {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:20:12,276 INFO L290 TraceCheckUtils]: 181: Hoare triple {176577#(<= ~counter~0 21)} assume !(0 == ~cond); {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:20:12,277 INFO L290 TraceCheckUtils]: 182: Hoare triple {176577#(<= ~counter~0 21)} assume true; {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:20:12,277 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {176577#(<= ~counter~0 21)} {176577#(<= ~counter~0 21)} #98#return; {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:20:12,277 INFO L290 TraceCheckUtils]: 184: Hoare triple {176577#(<= ~counter~0 21)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:20:12,279 INFO L290 TraceCheckUtils]: 185: Hoare triple {176577#(<= ~counter~0 21)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:20:12,280 INFO L290 TraceCheckUtils]: 186: Hoare triple {176602#(<= ~counter~0 22)} assume !!(#t~post8 < 50);havoc #t~post8; {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:20:12,280 INFO L272 TraceCheckUtils]: 187: Hoare triple {176602#(<= ~counter~0 22)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:20:12,281 INFO L290 TraceCheckUtils]: 188: Hoare triple {176602#(<= ~counter~0 22)} ~cond := #in~cond; {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:20:12,281 INFO L290 TraceCheckUtils]: 189: Hoare triple {176602#(<= ~counter~0 22)} assume !(0 == ~cond); {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:20:12,281 INFO L290 TraceCheckUtils]: 190: Hoare triple {176602#(<= ~counter~0 22)} assume true; {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:20:12,282 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {176602#(<= ~counter~0 22)} {176602#(<= ~counter~0 22)} #98#return; {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:20:12,282 INFO L290 TraceCheckUtils]: 192: Hoare triple {176602#(<= ~counter~0 22)} assume !(~r~0 < 0); {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:20:12,282 INFO L290 TraceCheckUtils]: 193: Hoare triple {176602#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176627#(<= |main_#t~post6| 22)} is VALID [2022-04-27 13:20:12,283 INFO L290 TraceCheckUtils]: 194: Hoare triple {176627#(<= |main_#t~post6| 22)} assume !(#t~post6 < 50);havoc #t~post6; {176021#false} is VALID [2022-04-27 13:20:12,283 INFO L272 TraceCheckUtils]: 195: Hoare triple {176021#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176021#false} is VALID [2022-04-27 13:20:12,283 INFO L290 TraceCheckUtils]: 196: Hoare triple {176021#false} ~cond := #in~cond; {176021#false} is VALID [2022-04-27 13:20:12,283 INFO L290 TraceCheckUtils]: 197: Hoare triple {176021#false} assume 0 == ~cond; {176021#false} is VALID [2022-04-27 13:20:12,283 INFO L290 TraceCheckUtils]: 198: Hoare triple {176021#false} assume !false; {176021#false} is VALID [2022-04-27 13:20:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 44 proven. 1248 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:20:12,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:20:13,590 INFO L290 TraceCheckUtils]: 198: Hoare triple {176021#false} assume !false; {176021#false} is VALID [2022-04-27 13:20:13,590 INFO L290 TraceCheckUtils]: 197: Hoare triple {176021#false} assume 0 == ~cond; {176021#false} is VALID [2022-04-27 13:20:13,590 INFO L290 TraceCheckUtils]: 196: Hoare triple {176021#false} ~cond := #in~cond; {176021#false} is VALID [2022-04-27 13:20:13,590 INFO L272 TraceCheckUtils]: 195: Hoare triple {176021#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176021#false} is VALID [2022-04-27 13:20:13,591 INFO L290 TraceCheckUtils]: 194: Hoare triple {176655#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {176021#false} is VALID [2022-04-27 13:20:13,591 INFO L290 TraceCheckUtils]: 193: Hoare triple {176659#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176655#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:20:13,591 INFO L290 TraceCheckUtils]: 192: Hoare triple {176659#(< ~counter~0 50)} assume !(~r~0 < 0); {176659#(< ~counter~0 50)} is VALID [2022-04-27 13:20:13,592 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {176020#true} {176659#(< ~counter~0 50)} #98#return; {176659#(< ~counter~0 50)} is VALID [2022-04-27 13:20:13,592 INFO L290 TraceCheckUtils]: 190: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,592 INFO L290 TraceCheckUtils]: 189: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,592 INFO L290 TraceCheckUtils]: 188: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,592 INFO L272 TraceCheckUtils]: 187: Hoare triple {176659#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,592 INFO L290 TraceCheckUtils]: 186: Hoare triple {176659#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {176659#(< ~counter~0 50)} is VALID [2022-04-27 13:20:13,594 INFO L290 TraceCheckUtils]: 185: Hoare triple {176684#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176659#(< ~counter~0 50)} is VALID [2022-04-27 13:20:13,595 INFO L290 TraceCheckUtils]: 184: Hoare triple {176684#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176684#(< ~counter~0 49)} is VALID [2022-04-27 13:20:13,595 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {176020#true} {176684#(< ~counter~0 49)} #98#return; {176684#(< ~counter~0 49)} is VALID [2022-04-27 13:20:13,595 INFO L290 TraceCheckUtils]: 182: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,595 INFO L290 TraceCheckUtils]: 181: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,595 INFO L290 TraceCheckUtils]: 180: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,595 INFO L272 TraceCheckUtils]: 179: Hoare triple {176684#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,596 INFO L290 TraceCheckUtils]: 178: Hoare triple {176684#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {176684#(< ~counter~0 49)} is VALID [2022-04-27 13:20:13,597 INFO L290 TraceCheckUtils]: 177: Hoare triple {176709#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176684#(< ~counter~0 49)} is VALID [2022-04-27 13:20:13,597 INFO L290 TraceCheckUtils]: 176: Hoare triple {176709#(< ~counter~0 48)} assume !(~r~0 > 0); {176709#(< ~counter~0 48)} is VALID [2022-04-27 13:20:13,598 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {176020#true} {176709#(< ~counter~0 48)} #96#return; {176709#(< ~counter~0 48)} is VALID [2022-04-27 13:20:13,598 INFO L290 TraceCheckUtils]: 174: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,598 INFO L290 TraceCheckUtils]: 173: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,598 INFO L290 TraceCheckUtils]: 172: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,598 INFO L272 TraceCheckUtils]: 171: Hoare triple {176709#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,598 INFO L290 TraceCheckUtils]: 170: Hoare triple {176709#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {176709#(< ~counter~0 48)} is VALID [2022-04-27 13:20:13,599 INFO L290 TraceCheckUtils]: 169: Hoare triple {176734#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176709#(< ~counter~0 48)} is VALID [2022-04-27 13:20:13,600 INFO L290 TraceCheckUtils]: 168: Hoare triple {176734#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176734#(< ~counter~0 47)} is VALID [2022-04-27 13:20:13,600 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {176020#true} {176734#(< ~counter~0 47)} #96#return; {176734#(< ~counter~0 47)} is VALID [2022-04-27 13:20:13,600 INFO L290 TraceCheckUtils]: 166: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,600 INFO L290 TraceCheckUtils]: 165: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,600 INFO L290 TraceCheckUtils]: 164: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,600 INFO L272 TraceCheckUtils]: 163: Hoare triple {176734#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,601 INFO L290 TraceCheckUtils]: 162: Hoare triple {176734#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {176734#(< ~counter~0 47)} is VALID [2022-04-27 13:20:13,602 INFO L290 TraceCheckUtils]: 161: Hoare triple {176759#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176734#(< ~counter~0 47)} is VALID [2022-04-27 13:20:13,602 INFO L290 TraceCheckUtils]: 160: Hoare triple {176759#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176759#(< ~counter~0 46)} is VALID [2022-04-27 13:20:13,603 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {176020#true} {176759#(< ~counter~0 46)} #96#return; {176759#(< ~counter~0 46)} is VALID [2022-04-27 13:20:13,603 INFO L290 TraceCheckUtils]: 158: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,603 INFO L290 TraceCheckUtils]: 157: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,603 INFO L290 TraceCheckUtils]: 156: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,603 INFO L272 TraceCheckUtils]: 155: Hoare triple {176759#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,603 INFO L290 TraceCheckUtils]: 154: Hoare triple {176759#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {176759#(< ~counter~0 46)} is VALID [2022-04-27 13:20:13,605 INFO L290 TraceCheckUtils]: 153: Hoare triple {176784#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176759#(< ~counter~0 46)} is VALID [2022-04-27 13:20:13,605 INFO L290 TraceCheckUtils]: 152: Hoare triple {176784#(< ~counter~0 45)} assume !!(0 != ~r~0); {176784#(< ~counter~0 45)} is VALID [2022-04-27 13:20:13,605 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176020#true} {176784#(< ~counter~0 45)} #94#return; {176784#(< ~counter~0 45)} is VALID [2022-04-27 13:20:13,605 INFO L290 TraceCheckUtils]: 150: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,605 INFO L290 TraceCheckUtils]: 149: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,605 INFO L290 TraceCheckUtils]: 148: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,606 INFO L272 TraceCheckUtils]: 147: Hoare triple {176784#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,606 INFO L290 TraceCheckUtils]: 146: Hoare triple {176784#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {176784#(< ~counter~0 45)} is VALID [2022-04-27 13:20:13,607 INFO L290 TraceCheckUtils]: 145: Hoare triple {176809#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176784#(< ~counter~0 45)} is VALID [2022-04-27 13:20:13,607 INFO L290 TraceCheckUtils]: 144: Hoare triple {176809#(< ~counter~0 44)} assume !(~r~0 < 0); {176809#(< ~counter~0 44)} is VALID [2022-04-27 13:20:13,608 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176020#true} {176809#(< ~counter~0 44)} #98#return; {176809#(< ~counter~0 44)} is VALID [2022-04-27 13:20:13,608 INFO L290 TraceCheckUtils]: 142: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,608 INFO L290 TraceCheckUtils]: 141: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,608 INFO L290 TraceCheckUtils]: 140: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,608 INFO L272 TraceCheckUtils]: 139: Hoare triple {176809#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,608 INFO L290 TraceCheckUtils]: 138: Hoare triple {176809#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {176809#(< ~counter~0 44)} is VALID [2022-04-27 13:20:13,609 INFO L290 TraceCheckUtils]: 137: Hoare triple {176834#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176809#(< ~counter~0 44)} is VALID [2022-04-27 13:20:13,610 INFO L290 TraceCheckUtils]: 136: Hoare triple {176834#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176834#(< ~counter~0 43)} is VALID [2022-04-27 13:20:13,610 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176020#true} {176834#(< ~counter~0 43)} #98#return; {176834#(< ~counter~0 43)} is VALID [2022-04-27 13:20:13,610 INFO L290 TraceCheckUtils]: 134: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,610 INFO L290 TraceCheckUtils]: 133: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,610 INFO L290 TraceCheckUtils]: 132: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,610 INFO L272 TraceCheckUtils]: 131: Hoare triple {176834#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,611 INFO L290 TraceCheckUtils]: 130: Hoare triple {176834#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {176834#(< ~counter~0 43)} is VALID [2022-04-27 13:20:13,612 INFO L290 TraceCheckUtils]: 129: Hoare triple {176859#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176834#(< ~counter~0 43)} is VALID [2022-04-27 13:20:13,612 INFO L290 TraceCheckUtils]: 128: Hoare triple {176859#(< ~counter~0 42)} assume !(~r~0 > 0); {176859#(< ~counter~0 42)} is VALID [2022-04-27 13:20:13,613 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176020#true} {176859#(< ~counter~0 42)} #96#return; {176859#(< ~counter~0 42)} is VALID [2022-04-27 13:20:13,613 INFO L290 TraceCheckUtils]: 126: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,613 INFO L290 TraceCheckUtils]: 125: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,613 INFO L290 TraceCheckUtils]: 124: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,613 INFO L272 TraceCheckUtils]: 123: Hoare triple {176859#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,613 INFO L290 TraceCheckUtils]: 122: Hoare triple {176859#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {176859#(< ~counter~0 42)} is VALID [2022-04-27 13:20:13,614 INFO L290 TraceCheckUtils]: 121: Hoare triple {176884#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176859#(< ~counter~0 42)} is VALID [2022-04-27 13:20:13,615 INFO L290 TraceCheckUtils]: 120: Hoare triple {176884#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176884#(< ~counter~0 41)} is VALID [2022-04-27 13:20:13,615 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176020#true} {176884#(< ~counter~0 41)} #96#return; {176884#(< ~counter~0 41)} is VALID [2022-04-27 13:20:13,615 INFO L290 TraceCheckUtils]: 118: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,615 INFO L290 TraceCheckUtils]: 117: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,615 INFO L290 TraceCheckUtils]: 116: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,615 INFO L272 TraceCheckUtils]: 115: Hoare triple {176884#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,616 INFO L290 TraceCheckUtils]: 114: Hoare triple {176884#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {176884#(< ~counter~0 41)} is VALID [2022-04-27 13:20:13,617 INFO L290 TraceCheckUtils]: 113: Hoare triple {176909#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176884#(< ~counter~0 41)} is VALID [2022-04-27 13:20:13,617 INFO L290 TraceCheckUtils]: 112: Hoare triple {176909#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176909#(< ~counter~0 40)} is VALID [2022-04-27 13:20:13,618 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176020#true} {176909#(< ~counter~0 40)} #96#return; {176909#(< ~counter~0 40)} is VALID [2022-04-27 13:20:13,618 INFO L290 TraceCheckUtils]: 110: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,618 INFO L290 TraceCheckUtils]: 109: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,618 INFO L290 TraceCheckUtils]: 108: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,618 INFO L272 TraceCheckUtils]: 107: Hoare triple {176909#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,618 INFO L290 TraceCheckUtils]: 106: Hoare triple {176909#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {176909#(< ~counter~0 40)} is VALID [2022-04-27 13:20:13,619 INFO L290 TraceCheckUtils]: 105: Hoare triple {176934#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176909#(< ~counter~0 40)} is VALID [2022-04-27 13:20:13,619 INFO L290 TraceCheckUtils]: 104: Hoare triple {176934#(< ~counter~0 39)} assume !!(0 != ~r~0); {176934#(< ~counter~0 39)} is VALID [2022-04-27 13:20:13,620 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176020#true} {176934#(< ~counter~0 39)} #94#return; {176934#(< ~counter~0 39)} is VALID [2022-04-27 13:20:13,620 INFO L290 TraceCheckUtils]: 102: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,620 INFO L290 TraceCheckUtils]: 101: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,620 INFO L290 TraceCheckUtils]: 100: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,620 INFO L272 TraceCheckUtils]: 99: Hoare triple {176934#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,620 INFO L290 TraceCheckUtils]: 98: Hoare triple {176934#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {176934#(< ~counter~0 39)} is VALID [2022-04-27 13:20:13,621 INFO L290 TraceCheckUtils]: 97: Hoare triple {176959#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176934#(< ~counter~0 39)} is VALID [2022-04-27 13:20:13,622 INFO L290 TraceCheckUtils]: 96: Hoare triple {176959#(< ~counter~0 38)} assume !(~r~0 < 0); {176959#(< ~counter~0 38)} is VALID [2022-04-27 13:20:13,622 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176020#true} {176959#(< ~counter~0 38)} #98#return; {176959#(< ~counter~0 38)} is VALID [2022-04-27 13:20:13,622 INFO L290 TraceCheckUtils]: 94: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,622 INFO L290 TraceCheckUtils]: 93: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,622 INFO L290 TraceCheckUtils]: 92: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,622 INFO L272 TraceCheckUtils]: 91: Hoare triple {176959#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,623 INFO L290 TraceCheckUtils]: 90: Hoare triple {176959#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {176959#(< ~counter~0 38)} is VALID [2022-04-27 13:20:13,624 INFO L290 TraceCheckUtils]: 89: Hoare triple {176984#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176959#(< ~counter~0 38)} is VALID [2022-04-27 13:20:13,624 INFO L290 TraceCheckUtils]: 88: Hoare triple {176984#(< ~counter~0 37)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176984#(< ~counter~0 37)} is VALID [2022-04-27 13:20:13,625 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176020#true} {176984#(< ~counter~0 37)} #98#return; {176984#(< ~counter~0 37)} is VALID [2022-04-27 13:20:13,625 INFO L290 TraceCheckUtils]: 86: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,625 INFO L290 TraceCheckUtils]: 85: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,625 INFO L290 TraceCheckUtils]: 84: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,625 INFO L272 TraceCheckUtils]: 83: Hoare triple {176984#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,625 INFO L290 TraceCheckUtils]: 82: Hoare triple {176984#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {176984#(< ~counter~0 37)} is VALID [2022-04-27 13:20:13,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {177009#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176984#(< ~counter~0 37)} is VALID [2022-04-27 13:20:13,626 INFO L290 TraceCheckUtils]: 80: Hoare triple {177009#(< ~counter~0 36)} assume !(~r~0 > 0); {177009#(< ~counter~0 36)} is VALID [2022-04-27 13:20:13,627 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176020#true} {177009#(< ~counter~0 36)} #96#return; {177009#(< ~counter~0 36)} is VALID [2022-04-27 13:20:13,627 INFO L290 TraceCheckUtils]: 78: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,627 INFO L290 TraceCheckUtils]: 77: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,627 INFO L290 TraceCheckUtils]: 76: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,627 INFO L272 TraceCheckUtils]: 75: Hoare triple {177009#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,627 INFO L290 TraceCheckUtils]: 74: Hoare triple {177009#(< ~counter~0 36)} assume !!(#t~post7 < 50);havoc #t~post7; {177009#(< ~counter~0 36)} is VALID [2022-04-27 13:20:13,628 INFO L290 TraceCheckUtils]: 73: Hoare triple {177034#(< ~counter~0 35)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177009#(< ~counter~0 36)} is VALID [2022-04-27 13:20:13,629 INFO L290 TraceCheckUtils]: 72: Hoare triple {177034#(< ~counter~0 35)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177034#(< ~counter~0 35)} is VALID [2022-04-27 13:20:13,629 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176020#true} {177034#(< ~counter~0 35)} #96#return; {177034#(< ~counter~0 35)} is VALID [2022-04-27 13:20:13,629 INFO L290 TraceCheckUtils]: 70: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,629 INFO L290 TraceCheckUtils]: 69: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,629 INFO L290 TraceCheckUtils]: 68: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,629 INFO L272 TraceCheckUtils]: 67: Hoare triple {177034#(< ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,630 INFO L290 TraceCheckUtils]: 66: Hoare triple {177034#(< ~counter~0 35)} assume !!(#t~post7 < 50);havoc #t~post7; {177034#(< ~counter~0 35)} is VALID [2022-04-27 13:20:13,631 INFO L290 TraceCheckUtils]: 65: Hoare triple {177059#(< ~counter~0 34)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177034#(< ~counter~0 35)} is VALID [2022-04-27 13:20:13,631 INFO L290 TraceCheckUtils]: 64: Hoare triple {177059#(< ~counter~0 34)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177059#(< ~counter~0 34)} is VALID [2022-04-27 13:20:13,632 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176020#true} {177059#(< ~counter~0 34)} #96#return; {177059#(< ~counter~0 34)} is VALID [2022-04-27 13:20:13,632 INFO L290 TraceCheckUtils]: 62: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,632 INFO L290 TraceCheckUtils]: 61: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,632 INFO L290 TraceCheckUtils]: 60: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,632 INFO L272 TraceCheckUtils]: 59: Hoare triple {177059#(< ~counter~0 34)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,632 INFO L290 TraceCheckUtils]: 58: Hoare triple {177059#(< ~counter~0 34)} assume !!(#t~post7 < 50);havoc #t~post7; {177059#(< ~counter~0 34)} is VALID [2022-04-27 13:20:13,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {177084#(< ~counter~0 33)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177059#(< ~counter~0 34)} is VALID [2022-04-27 13:20:13,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {177084#(< ~counter~0 33)} assume !!(0 != ~r~0); {177084#(< ~counter~0 33)} is VALID [2022-04-27 13:20:13,634 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176020#true} {177084#(< ~counter~0 33)} #94#return; {177084#(< ~counter~0 33)} is VALID [2022-04-27 13:20:13,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,634 INFO L272 TraceCheckUtils]: 51: Hoare triple {177084#(< ~counter~0 33)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {177084#(< ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {177084#(< ~counter~0 33)} is VALID [2022-04-27 13:20:13,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {177109#(< ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177084#(< ~counter~0 33)} is VALID [2022-04-27 13:20:13,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {177109#(< ~counter~0 32)} assume !(~r~0 < 0); {177109#(< ~counter~0 32)} is VALID [2022-04-27 13:20:13,636 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176020#true} {177109#(< ~counter~0 32)} #98#return; {177109#(< ~counter~0 32)} is VALID [2022-04-27 13:20:13,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,637 INFO L290 TraceCheckUtils]: 44: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,637 INFO L272 TraceCheckUtils]: 43: Hoare triple {177109#(< ~counter~0 32)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,637 INFO L290 TraceCheckUtils]: 42: Hoare triple {177109#(< ~counter~0 32)} assume !!(#t~post8 < 50);havoc #t~post8; {177109#(< ~counter~0 32)} is VALID [2022-04-27 13:20:13,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {177134#(< ~counter~0 31)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177109#(< ~counter~0 32)} is VALID [2022-04-27 13:20:13,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {177134#(< ~counter~0 31)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177134#(< ~counter~0 31)} is VALID [2022-04-27 13:20:13,639 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176020#true} {177134#(< ~counter~0 31)} #98#return; {177134#(< ~counter~0 31)} is VALID [2022-04-27 13:20:13,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,639 INFO L272 TraceCheckUtils]: 35: Hoare triple {177134#(< ~counter~0 31)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {177134#(< ~counter~0 31)} assume !!(#t~post8 < 50);havoc #t~post8; {177134#(< ~counter~0 31)} is VALID [2022-04-27 13:20:13,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {177159#(< ~counter~0 30)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177134#(< ~counter~0 31)} is VALID [2022-04-27 13:20:13,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {177159#(< ~counter~0 30)} assume !(~r~0 > 0); {177159#(< ~counter~0 30)} is VALID [2022-04-27 13:20:13,641 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176020#true} {177159#(< ~counter~0 30)} #96#return; {177159#(< ~counter~0 30)} is VALID [2022-04-27 13:20:13,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,641 INFO L272 TraceCheckUtils]: 27: Hoare triple {177159#(< ~counter~0 30)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {177159#(< ~counter~0 30)} assume !!(#t~post7 < 50);havoc #t~post7; {177159#(< ~counter~0 30)} is VALID [2022-04-27 13:20:13,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {177184#(< ~counter~0 29)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177159#(< ~counter~0 30)} is VALID [2022-04-27 13:20:13,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {177184#(< ~counter~0 29)} assume !!(0 != ~r~0); {177184#(< ~counter~0 29)} is VALID [2022-04-27 13:20:13,643 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176020#true} {177184#(< ~counter~0 29)} #94#return; {177184#(< ~counter~0 29)} is VALID [2022-04-27 13:20:13,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,644 INFO L272 TraceCheckUtils]: 19: Hoare triple {177184#(< ~counter~0 29)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {177184#(< ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {177184#(< ~counter~0 29)} is VALID [2022-04-27 13:20:13,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {177209#(< ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177184#(< ~counter~0 29)} is VALID [2022-04-27 13:20:13,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {177209#(< ~counter~0 28)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {177209#(< ~counter~0 28)} is VALID [2022-04-27 13:20:13,646 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176020#true} {177209#(< ~counter~0 28)} #92#return; {177209#(< ~counter~0 28)} is VALID [2022-04-27 13:20:13,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,646 INFO L272 TraceCheckUtils]: 11: Hoare triple {177209#(< ~counter~0 28)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,646 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176020#true} {177209#(< ~counter~0 28)} #90#return; {177209#(< ~counter~0 28)} is VALID [2022-04-27 13:20:13,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:20:13,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:20:13,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:20:13,647 INFO L272 TraceCheckUtils]: 6: Hoare triple {177209#(< ~counter~0 28)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:20:13,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {177209#(< ~counter~0 28)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {177209#(< ~counter~0 28)} is VALID [2022-04-27 13:20:13,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {177209#(< ~counter~0 28)} call #t~ret9 := main(); {177209#(< ~counter~0 28)} is VALID [2022-04-27 13:20:13,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177209#(< ~counter~0 28)} {176020#true} #102#return; {177209#(< ~counter~0 28)} is VALID [2022-04-27 13:20:13,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {177209#(< ~counter~0 28)} assume true; {177209#(< ~counter~0 28)} is VALID [2022-04-27 13:20:13,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {176020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {177209#(< ~counter~0 28)} is VALID [2022-04-27 13:20:13,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {176020#true} call ULTIMATE.init(); {176020#true} is VALID [2022-04-27 13:20:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 44 proven. 324 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-04-27 13:20:13,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:20:13,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805300967] [2022-04-27 13:20:13,649 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:20:13,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355290780] [2022-04-27 13:20:13,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355290780] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:20:13,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:20:13,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-27 13:20:13,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908017786] [2022-04-27 13:20:13,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:20:13,650 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 199 [2022-04-27 13:20:13,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:20:13,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:20:14,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:14,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 13:20:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:20:14,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 13:20:14,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 13:20:14,016 INFO L87 Difference]: Start difference. First operand 7470 states and 10264 transitions. Second operand has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:20:37,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:37,870 INFO L93 Difference]: Finished difference Result 8076 states and 11149 transitions. [2022-04-27 13:20:37,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-04-27 13:20:37,870 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 199 [2022-04-27 13:20:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:20:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 940 transitions. [2022-04-27 13:20:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:20:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 940 transitions. [2022-04-27 13:20:37,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 940 transitions. [2022-04-27 13:20:38,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 940 edges. 940 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:41,230 INFO L225 Difference]: With dead ends: 8076 [2022-04-27 13:20:41,230 INFO L226 Difference]: Without dead ends: 7927 [2022-04-27 13:20:41,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3046, Invalid=5326, Unknown=0, NotChecked=0, Total=8372 [2022-04-27 13:20:41,234 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1759 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 1378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1378 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:41,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 978 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1378 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 13:20:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7927 states. [2022-04-27 13:20:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7927 to 7220. [2022-04-27 13:20:53,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:53,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7927 states. Second operand has 7220 states, 5413 states have (on average 1.1211897284315537) internal successors, (6069), 5457 states have internal predecessors, (6069), 1758 states have call successors, (1758), 50 states have call predecessors, (1758), 48 states have return successors, (1756), 1712 states have call predecessors, (1756), 1756 states have call successors, (1756) [2022-04-27 13:20:53,129 INFO L74 IsIncluded]: Start isIncluded. First operand 7927 states. Second operand has 7220 states, 5413 states have (on average 1.1211897284315537) internal successors, (6069), 5457 states have internal predecessors, (6069), 1758 states have call successors, (1758), 50 states have call predecessors, (1758), 48 states have return successors, (1756), 1712 states have call predecessors, (1756), 1756 states have call successors, (1756) [2022-04-27 13:20:53,136 INFO L87 Difference]: Start difference. First operand 7927 states. Second operand has 7220 states, 5413 states have (on average 1.1211897284315537) internal successors, (6069), 5457 states have internal predecessors, (6069), 1758 states have call successors, (1758), 50 states have call predecessors, (1758), 48 states have return successors, (1756), 1712 states have call predecessors, (1756), 1756 states have call successors, (1756) [2022-04-27 13:20:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:54,863 INFO L93 Difference]: Finished difference Result 7927 states and 10483 transitions. [2022-04-27 13:20:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 7927 states and 10483 transitions. [2022-04-27 13:20:54,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:54,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:54,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 7220 states, 5413 states have (on average 1.1211897284315537) internal successors, (6069), 5457 states have internal predecessors, (6069), 1758 states have call successors, (1758), 50 states have call predecessors, (1758), 48 states have return successors, (1756), 1712 states have call predecessors, (1756), 1756 states have call successors, (1756) Second operand 7927 states. [2022-04-27 13:20:54,890 INFO L87 Difference]: Start difference. First operand has 7220 states, 5413 states have (on average 1.1211897284315537) internal successors, (6069), 5457 states have internal predecessors, (6069), 1758 states have call successors, (1758), 50 states have call predecessors, (1758), 48 states have return successors, (1756), 1712 states have call predecessors, (1756), 1756 states have call successors, (1756) Second operand 7927 states. [2022-04-27 13:20:56,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:56,612 INFO L93 Difference]: Finished difference Result 7927 states and 10483 transitions. [2022-04-27 13:20:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7927 states and 10483 transitions. [2022-04-27 13:20:56,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:56,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:56,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:56,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7220 states, 5413 states have (on average 1.1211897284315537) internal successors, (6069), 5457 states have internal predecessors, (6069), 1758 states have call successors, (1758), 50 states have call predecessors, (1758), 48 states have return successors, (1756), 1712 states have call predecessors, (1756), 1756 states have call successors, (1756) [2022-04-27 13:20:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 9583 transitions. [2022-04-27 13:20:58,637 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 9583 transitions. Word has length 199 [2022-04-27 13:20:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:58,637 INFO L495 AbstractCegarLoop]: Abstraction has 7220 states and 9583 transitions. [2022-04-27 13:20:58,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:20:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 9583 transitions. [2022-04-27 13:20:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2022-04-27 13:20:58,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:58,650 INFO L195 NwaCegarLoop]: trace histogram [45, 44, 44, 20, 19, 19, 19, 17, 16, 16, 16, 11, 10, 9, 9, 9, 9, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:58,667 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-27 13:20:58,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:58,851 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:58,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2044709741, now seen corresponding path program 11 times [2022-04-27 13:20:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:58,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712990507] [2022-04-27 13:20:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:58,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:20:58,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965140570] [2022-04-27 13:20:58,891 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 13:20:58,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:58,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:58,892 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-27 13:20:58,893 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-27 13:20:59,334 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-27 13:20:59,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:20:59,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 13:20:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:59,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:25:15,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {214713#true} call ULTIMATE.init(); {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {214713#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {214713#true} {214713#true} #102#return; {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {214713#true} call #t~ret9 := main(); {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {214713#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; {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L272 TraceCheckUtils]: 6: Hoare triple {214713#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {214713#true} {214713#true} #90#return; {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L272 TraceCheckUtils]: 11: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {214713#true} {214713#true} #92#return; {214713#true} is VALID [2022-04-27 13:25:15,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {214713#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {214713#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {214713#true} assume !!(#t~post6 < 50);havoc #t~post6; {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L272 TraceCheckUtils]: 19: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {214713#true} {214713#true} #94#return; {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {214713#true} assume !!(0 != ~r~0); {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {214713#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {214713#true} assume !!(#t~post7 < 50);havoc #t~post7; {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L272 TraceCheckUtils]: 27: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {214713#true} {214713#true} #96#return; {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {214713#true} assume !(~r~0 > 0); {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {214713#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214713#true} is VALID [2022-04-27 13:25:15,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {214713#true} assume !!(#t~post8 < 50);havoc #t~post8; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L272 TraceCheckUtils]: 35: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {214713#true} {214713#true} #98#return; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {214713#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {214713#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {214713#true} assume !!(#t~post8 < 50);havoc #t~post8; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L272 TraceCheckUtils]: 43: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 45: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 46: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {214713#true} {214713#true} #98#return; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 48: Hoare triple {214713#true} assume !(~r~0 < 0); {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 49: Hoare triple {214713#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 50: Hoare triple {214713#true} assume !!(#t~post6 < 50);havoc #t~post6; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L272 TraceCheckUtils]: 51: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 52: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,825 INFO L290 TraceCheckUtils]: 53: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,826 INFO L290 TraceCheckUtils]: 54: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,826 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {214713#true} {214713#true} #94#return; {214713#true} is VALID [2022-04-27 13:25:15,826 INFO L290 TraceCheckUtils]: 56: Hoare triple {214713#true} assume !!(0 != ~r~0); {214713#true} is VALID [2022-04-27 13:25:15,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {214713#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214713#true} is VALID [2022-04-27 13:25:15,826 INFO L290 TraceCheckUtils]: 58: Hoare triple {214713#true} assume !!(#t~post7 < 50);havoc #t~post7; {214713#true} is VALID [2022-04-27 13:25:15,826 INFO L272 TraceCheckUtils]: 59: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:15,826 INFO L290 TraceCheckUtils]: 60: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,826 INFO L290 TraceCheckUtils]: 61: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,826 INFO L290 TraceCheckUtils]: 62: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,826 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {214713#true} {214713#true} #96#return; {214713#true} is VALID [2022-04-27 13:25:15,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {214713#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {214910#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-27 13:25:15,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {214910#(< 2 (+ main_~v~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214910#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-27 13:25:15,837 INFO L290 TraceCheckUtils]: 66: Hoare triple {214910#(< 2 (+ main_~v~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {214910#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-27 13:25:15,837 INFO L272 TraceCheckUtils]: 67: Hoare triple {214910#(< 2 (+ main_~v~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:15,837 INFO L290 TraceCheckUtils]: 68: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,837 INFO L290 TraceCheckUtils]: 69: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,837 INFO L290 TraceCheckUtils]: 70: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,838 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {214713#true} {214910#(< 2 (+ main_~v~0 main_~r~0))} #96#return; {214910#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-27 13:25:15,839 INFO L290 TraceCheckUtils]: 72: Hoare triple {214910#(< 2 (+ main_~v~0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,839 INFO L290 TraceCheckUtils]: 73: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,840 INFO L290 TraceCheckUtils]: 74: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,840 INFO L272 TraceCheckUtils]: 75: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:15,840 INFO L290 TraceCheckUtils]: 76: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,840 INFO L290 TraceCheckUtils]: 77: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,840 INFO L290 TraceCheckUtils]: 78: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,840 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {214713#true} {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} #96#return; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,840 INFO L290 TraceCheckUtils]: 80: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !(~r~0 > 0); {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,841 INFO L290 TraceCheckUtils]: 81: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,841 INFO L290 TraceCheckUtils]: 82: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,841 INFO L272 TraceCheckUtils]: 83: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:15,841 INFO L290 TraceCheckUtils]: 84: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,841 INFO L290 TraceCheckUtils]: 85: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,841 INFO L290 TraceCheckUtils]: 86: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,842 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {214713#true} {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} #98#return; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,845 INFO L290 TraceCheckUtils]: 88: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,845 INFO L290 TraceCheckUtils]: 89: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,846 INFO L290 TraceCheckUtils]: 90: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,846 INFO L272 TraceCheckUtils]: 91: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:15,846 INFO L290 TraceCheckUtils]: 92: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,846 INFO L290 TraceCheckUtils]: 93: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,846 INFO L290 TraceCheckUtils]: 94: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,846 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {214713#true} {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #98#return; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,847 INFO L290 TraceCheckUtils]: 96: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !(~r~0 < 0); {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,847 INFO L290 TraceCheckUtils]: 97: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,847 INFO L290 TraceCheckUtils]: 98: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,847 INFO L272 TraceCheckUtils]: 99: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:15,847 INFO L290 TraceCheckUtils]: 100: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,847 INFO L290 TraceCheckUtils]: 101: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,847 INFO L290 TraceCheckUtils]: 102: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,848 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {214713#true} {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #94#return; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,848 INFO L290 TraceCheckUtils]: 104: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(0 != ~r~0); {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,848 INFO L290 TraceCheckUtils]: 105: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,849 INFO L290 TraceCheckUtils]: 106: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,849 INFO L272 TraceCheckUtils]: 107: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:15,849 INFO L290 TraceCheckUtils]: 108: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,849 INFO L290 TraceCheckUtils]: 109: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,849 INFO L290 TraceCheckUtils]: 110: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,849 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {214713#true} {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #96#return; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:15,850 INFO L290 TraceCheckUtils]: 112: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:15,851 INFO L290 TraceCheckUtils]: 113: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:15,851 INFO L290 TraceCheckUtils]: 114: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:15,851 INFO L272 TraceCheckUtils]: 115: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 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)); {214713#true} is VALID [2022-04-27 13:25:15,851 INFO L290 TraceCheckUtils]: 116: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,851 INFO L290 TraceCheckUtils]: 117: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,851 INFO L290 TraceCheckUtils]: 118: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,852 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {214713#true} {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #96#return; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:15,852 INFO L290 TraceCheckUtils]: 120: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !(~r~0 > 0); {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:15,852 INFO L290 TraceCheckUtils]: 121: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:15,853 INFO L290 TraceCheckUtils]: 122: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !!(#t~post8 < 50);havoc #t~post8; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:15,853 INFO L272 TraceCheckUtils]: 123: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 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)); {214713#true} is VALID [2022-04-27 13:25:15,853 INFO L290 TraceCheckUtils]: 124: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,853 INFO L290 TraceCheckUtils]: 125: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,853 INFO L290 TraceCheckUtils]: 126: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,853 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {214713#true} {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #98#return; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:15,866 INFO L290 TraceCheckUtils]: 128: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:15,868 INFO L290 TraceCheckUtils]: 129: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:15,869 INFO L290 TraceCheckUtils]: 130: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} assume !!(#t~post8 < 50);havoc #t~post8; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:15,869 INFO L272 TraceCheckUtils]: 131: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 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)); {214713#true} is VALID [2022-04-27 13:25:15,869 INFO L290 TraceCheckUtils]: 132: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,869 INFO L290 TraceCheckUtils]: 133: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,870 INFO L290 TraceCheckUtils]: 134: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,870 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {214713#true} {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} #98#return; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:15,872 INFO L290 TraceCheckUtils]: 136: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} assume !(~r~0 < 0); {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:15,874 INFO L290 TraceCheckUtils]: 137: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:15,875 INFO L290 TraceCheckUtils]: 138: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:15,875 INFO L272 TraceCheckUtils]: 139: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 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)); {214713#true} is VALID [2022-04-27 13:25:15,875 INFO L290 TraceCheckUtils]: 140: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,875 INFO L290 TraceCheckUtils]: 141: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,875 INFO L290 TraceCheckUtils]: 142: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,875 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {214713#true} {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} #94#return; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:15,877 INFO L290 TraceCheckUtils]: 144: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} assume !!(0 != ~r~0); {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:15,879 INFO L290 TraceCheckUtils]: 145: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:15,880 INFO L290 TraceCheckUtils]: 146: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:15,880 INFO L272 TraceCheckUtils]: 147: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 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)); {214713#true} is VALID [2022-04-27 13:25:15,880 INFO L290 TraceCheckUtils]: 148: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,880 INFO L290 TraceCheckUtils]: 149: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,880 INFO L290 TraceCheckUtils]: 150: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,881 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {214713#true} {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} #96#return; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:15,883 INFO L290 TraceCheckUtils]: 152: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:15,889 INFO L290 TraceCheckUtils]: 153: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:15,893 INFO L290 TraceCheckUtils]: 154: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} assume !!(#t~post7 < 50);havoc #t~post7; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:15,893 INFO L272 TraceCheckUtils]: 155: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:15,893 INFO L290 TraceCheckUtils]: 156: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,893 INFO L290 TraceCheckUtils]: 157: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,893 INFO L290 TraceCheckUtils]: 158: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,894 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {214713#true} {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} #96#return; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:15,897 INFO L290 TraceCheckUtils]: 160: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} assume !(~r~0 > 0); {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:15,903 INFO L290 TraceCheckUtils]: 161: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:15,906 INFO L290 TraceCheckUtils]: 162: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} assume !!(#t~post8 < 50);havoc #t~post8; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:15,907 INFO L272 TraceCheckUtils]: 163: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:15,907 INFO L290 TraceCheckUtils]: 164: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:15,907 INFO L290 TraceCheckUtils]: 165: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:15,907 INFO L290 TraceCheckUtils]: 166: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:15,907 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {214713#true} {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} #98#return; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:17,916 WARN L290 TraceCheckUtils]: 168: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is UNKNOWN [2022-04-27 13:25:17,924 INFO L290 TraceCheckUtils]: 169: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:17,928 INFO L290 TraceCheckUtils]: 170: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} assume !!(#t~post8 < 50);havoc #t~post8; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:17,928 INFO L272 TraceCheckUtils]: 171: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:17,928 INFO L290 TraceCheckUtils]: 172: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:17,928 INFO L290 TraceCheckUtils]: 173: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:17,928 INFO L290 TraceCheckUtils]: 174: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:17,929 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {214713#true} {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} #98#return; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:17,931 INFO L290 TraceCheckUtils]: 176: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} assume !(~r~0 < 0); {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:17,941 INFO L290 TraceCheckUtils]: 177: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:17,944 INFO L290 TraceCheckUtils]: 178: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} assume !!(#t~post6 < 50);havoc #t~post6; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:17,945 INFO L272 TraceCheckUtils]: 179: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:17,945 INFO L290 TraceCheckUtils]: 180: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:17,945 INFO L290 TraceCheckUtils]: 181: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:17,945 INFO L290 TraceCheckUtils]: 182: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:17,945 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {214713#true} {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} #94#return; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:17,953 INFO L290 TraceCheckUtils]: 184: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} assume !!(0 != ~r~0); {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:17,963 INFO L290 TraceCheckUtils]: 185: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:17,971 INFO L290 TraceCheckUtils]: 186: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} assume !!(#t~post7 < 50);havoc #t~post7; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:17,971 INFO L272 TraceCheckUtils]: 187: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:17,971 INFO L290 TraceCheckUtils]: 188: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:17,971 INFO L290 TraceCheckUtils]: 189: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:17,972 INFO L290 TraceCheckUtils]: 190: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:17,972 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {214713#true} {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} #96#return; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:18,046 INFO L290 TraceCheckUtils]: 192: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:18,052 INFO L290 TraceCheckUtils]: 193: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:18,057 INFO L290 TraceCheckUtils]: 194: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} assume !!(#t~post7 < 50);havoc #t~post7; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:18,058 INFO L272 TraceCheckUtils]: 195: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:18,058 INFO L290 TraceCheckUtils]: 196: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:18,058 INFO L290 TraceCheckUtils]: 197: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:18,058 INFO L290 TraceCheckUtils]: 198: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:18,058 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {214713#true} {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} #96#return; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:18,064 INFO L290 TraceCheckUtils]: 200: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} assume !(~r~0 > 0); {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:18,069 INFO L290 TraceCheckUtils]: 201: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:18,073 INFO L290 TraceCheckUtils]: 202: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} assume !!(#t~post8 < 50);havoc #t~post8; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:18,073 INFO L272 TraceCheckUtils]: 203: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:18,073 INFO L290 TraceCheckUtils]: 204: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:18,073 INFO L290 TraceCheckUtils]: 205: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:18,073 INFO L290 TraceCheckUtils]: 206: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:18,074 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {214713#true} {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} #98#return; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:18,078 INFO L290 TraceCheckUtils]: 208: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:18,082 INFO L290 TraceCheckUtils]: 209: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:18,084 INFO L290 TraceCheckUtils]: 210: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} assume !!(#t~post8 < 50);havoc #t~post8; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:18,084 INFO L272 TraceCheckUtils]: 211: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:18,084 INFO L290 TraceCheckUtils]: 212: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:18,084 INFO L290 TraceCheckUtils]: 213: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:18,084 INFO L290 TraceCheckUtils]: 214: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:18,084 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {214713#true} {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} #98#return; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:18,086 INFO L290 TraceCheckUtils]: 216: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} assume !(~r~0 < 0); {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:18,090 INFO L290 TraceCheckUtils]: 217: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:18,092 INFO L290 TraceCheckUtils]: 218: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} assume !!(#t~post6 < 50);havoc #t~post6; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:18,092 INFO L272 TraceCheckUtils]: 219: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:18,092 INFO L290 TraceCheckUtils]: 220: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:18,092 INFO L290 TraceCheckUtils]: 221: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:18,092 INFO L290 TraceCheckUtils]: 222: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:18,093 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {214713#true} {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} #94#return; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:18,097 INFO L290 TraceCheckUtils]: 224: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} assume !!(0 != ~r~0); {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:18,101 INFO L290 TraceCheckUtils]: 225: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:18,103 INFO L290 TraceCheckUtils]: 226: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} assume !!(#t~post7 < 50);havoc #t~post7; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:18,103 INFO L272 TraceCheckUtils]: 227: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:18,103 INFO L290 TraceCheckUtils]: 228: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:18,103 INFO L290 TraceCheckUtils]: 229: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:18,103 INFO L290 TraceCheckUtils]: 230: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:18,104 INFO L284 TraceCheckUtils]: 231: Hoare quadruple {214713#true} {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} #96#return; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:18,166 INFO L290 TraceCheckUtils]: 232: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:18,188 INFO L290 TraceCheckUtils]: 233: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:18,202 INFO L290 TraceCheckUtils]: 234: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} assume !!(#t~post7 < 50);havoc #t~post7; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:18,202 INFO L272 TraceCheckUtils]: 235: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:18,202 INFO L290 TraceCheckUtils]: 236: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:18,202 INFO L290 TraceCheckUtils]: 237: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:18,202 INFO L290 TraceCheckUtils]: 238: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:18,203 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {214713#true} {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} #96#return; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:18,220 INFO L290 TraceCheckUtils]: 240: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} assume !(~r~0 > 0); {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:18,231 INFO L290 TraceCheckUtils]: 241: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:18,246 INFO L290 TraceCheckUtils]: 242: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} assume !!(#t~post8 < 50);havoc #t~post8; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:18,246 INFO L272 TraceCheckUtils]: 243: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:18,246 INFO L290 TraceCheckUtils]: 244: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:18,246 INFO L290 TraceCheckUtils]: 245: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:18,246 INFO L290 TraceCheckUtils]: 246: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:18,247 INFO L284 TraceCheckUtils]: 247: Hoare quadruple {214713#true} {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} #98#return; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:18,261 INFO L290 TraceCheckUtils]: 248: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:18,291 INFO L290 TraceCheckUtils]: 249: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:18,300 INFO L290 TraceCheckUtils]: 250: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} assume !!(#t~post8 < 50);havoc #t~post8; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:18,301 INFO L272 TraceCheckUtils]: 251: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:18,301 INFO L290 TraceCheckUtils]: 252: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:18,301 INFO L290 TraceCheckUtils]: 253: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:18,301 INFO L290 TraceCheckUtils]: 254: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:18,301 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {214713#true} {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} #98#return; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:18,312 INFO L290 TraceCheckUtils]: 256: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} assume !(~r~0 < 0); {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:18,319 INFO L290 TraceCheckUtils]: 257: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:18,324 INFO L290 TraceCheckUtils]: 258: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} assume !!(#t~post6 < 50);havoc #t~post6; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:18,324 INFO L272 TraceCheckUtils]: 259: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:18,324 INFO L290 TraceCheckUtils]: 260: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:18,324 INFO L290 TraceCheckUtils]: 261: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:18,324 INFO L290 TraceCheckUtils]: 262: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:18,325 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {214713#true} {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} #94#return; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:18,331 INFO L290 TraceCheckUtils]: 264: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} assume !!(0 != ~r~0); {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:18,343 INFO L290 TraceCheckUtils]: 265: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:18,349 INFO L290 TraceCheckUtils]: 266: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} assume !!(#t~post7 < 50);havoc #t~post7; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:18,349 INFO L272 TraceCheckUtils]: 267: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:18,349 INFO L290 TraceCheckUtils]: 268: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:18,349 INFO L290 TraceCheckUtils]: 269: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:18,349 INFO L290 TraceCheckUtils]: 270: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:18,350 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {214713#true} {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} #96#return; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:18,399 INFO L290 TraceCheckUtils]: 272: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:18,524 INFO L290 TraceCheckUtils]: 273: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:18,707 INFO L290 TraceCheckUtils]: 274: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} assume !!(#t~post7 < 50);havoc #t~post7; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:18,707 INFO L272 TraceCheckUtils]: 275: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:18,707 INFO L290 TraceCheckUtils]: 276: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:18,707 INFO L290 TraceCheckUtils]: 277: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:18,707 INFO L290 TraceCheckUtils]: 278: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:18,708 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {214713#true} {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} #96#return; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:18,727 INFO L290 TraceCheckUtils]: 280: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} assume !(~r~0 > 0); {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:18,752 INFO L290 TraceCheckUtils]: 281: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:18,767 INFO L290 TraceCheckUtils]: 282: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} assume !!(#t~post8 < 50);havoc #t~post8; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:18,767 INFO L272 TraceCheckUtils]: 283: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:18,767 INFO L290 TraceCheckUtils]: 284: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:18,767 INFO L290 TraceCheckUtils]: 285: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:18,767 INFO L290 TraceCheckUtils]: 286: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:18,768 INFO L284 TraceCheckUtils]: 287: Hoare quadruple {214713#true} {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} #98#return; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:19,526 INFO L290 TraceCheckUtils]: 288: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:19,537 INFO L290 TraceCheckUtils]: 289: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:19,562 INFO L290 TraceCheckUtils]: 290: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} assume !!(#t~post8 < 50);havoc #t~post8; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:19,562 INFO L272 TraceCheckUtils]: 291: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 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)); {214713#true} is VALID [2022-04-27 13:25:19,562 INFO L290 TraceCheckUtils]: 292: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:19,562 INFO L290 TraceCheckUtils]: 293: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:19,562 INFO L290 TraceCheckUtils]: 294: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:19,563 INFO L284 TraceCheckUtils]: 295: Hoare quadruple {214713#true} {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} #98#return; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:19,609 INFO L290 TraceCheckUtils]: 296: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} assume !(~r~0 < 0); {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:19,660 INFO L290 TraceCheckUtils]: 297: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:19,710 INFO L290 TraceCheckUtils]: 298: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} assume !!(#t~post6 < 50);havoc #t~post6; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:19,710 INFO L272 TraceCheckUtils]: 299: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 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)); {214713#true} is VALID [2022-04-27 13:25:19,710 INFO L290 TraceCheckUtils]: 300: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:19,710 INFO L290 TraceCheckUtils]: 301: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:19,710 INFO L290 TraceCheckUtils]: 302: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:19,711 INFO L284 TraceCheckUtils]: 303: Hoare quadruple {214713#true} {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} #94#return; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:19,739 INFO L290 TraceCheckUtils]: 304: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} assume !!(0 != ~r~0); {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:19,792 INFO L290 TraceCheckUtils]: 305: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:19,820 INFO L290 TraceCheckUtils]: 306: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} assume !!(#t~post7 < 50);havoc #t~post7; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:19,820 INFO L272 TraceCheckUtils]: 307: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 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)); {214713#true} is VALID [2022-04-27 13:25:19,820 INFO L290 TraceCheckUtils]: 308: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:19,820 INFO L290 TraceCheckUtils]: 309: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:19,820 INFO L290 TraceCheckUtils]: 310: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:19,821 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {214713#true} {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} #96#return; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:21,837 WARN L290 TraceCheckUtils]: 312: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is UNKNOWN [2022-04-27 13:25:21,894 INFO L290 TraceCheckUtils]: 313: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:21,919 INFO L290 TraceCheckUtils]: 314: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:21,919 INFO L272 TraceCheckUtils]: 315: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) 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)); {214713#true} is VALID [2022-04-27 13:25:21,919 INFO L290 TraceCheckUtils]: 316: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:21,919 INFO L290 TraceCheckUtils]: 317: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:21,919 INFO L290 TraceCheckUtils]: 318: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:21,920 INFO L284 TraceCheckUtils]: 319: Hoare quadruple {214713#true} {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #96#return; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:21,938 INFO L290 TraceCheckUtils]: 320: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !(~r~0 > 0); {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:21,965 INFO L290 TraceCheckUtils]: 321: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:21,984 INFO L290 TraceCheckUtils]: 322: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(#t~post8 < 50);havoc #t~post8; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:21,984 INFO L272 TraceCheckUtils]: 323: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) 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)); {214713#true} is VALID [2022-04-27 13:25:21,984 INFO L290 TraceCheckUtils]: 324: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:21,984 INFO L290 TraceCheckUtils]: 325: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:21,984 INFO L290 TraceCheckUtils]: 326: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:21,985 INFO L284 TraceCheckUtils]: 327: Hoare quadruple {214713#true} {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #98#return; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:22,048 INFO L290 TraceCheckUtils]: 328: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:22,065 INFO L290 TraceCheckUtils]: 329: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:22,081 INFO L290 TraceCheckUtils]: 330: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(#t~post8 < 50);havoc #t~post8; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:22,081 INFO L272 TraceCheckUtils]: 331: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) 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)); {214713#true} is VALID [2022-04-27 13:25:22,081 INFO L290 TraceCheckUtils]: 332: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:22,081 INFO L290 TraceCheckUtils]: 333: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:22,081 INFO L290 TraceCheckUtils]: 334: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:22,081 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {214713#true} {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #98#return; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:22,090 INFO L290 TraceCheckUtils]: 336: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !(~r~0 < 0); {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:22,102 INFO L290 TraceCheckUtils]: 337: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:22,118 INFO L290 TraceCheckUtils]: 338: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:22,118 INFO L272 TraceCheckUtils]: 339: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) 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)); {214713#true} is VALID [2022-04-27 13:25:22,118 INFO L290 TraceCheckUtils]: 340: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:22,118 INFO L290 TraceCheckUtils]: 341: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:22,118 INFO L290 TraceCheckUtils]: 342: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:22,119 INFO L284 TraceCheckUtils]: 343: Hoare quadruple {214713#true} {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #94#return; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:22,132 INFO L290 TraceCheckUtils]: 344: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(0 != ~r~0); {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:22,144 INFO L290 TraceCheckUtils]: 345: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:22,157 INFO L290 TraceCheckUtils]: 346: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:22,157 INFO L272 TraceCheckUtils]: 347: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) 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)); {214713#true} is VALID [2022-04-27 13:25:22,157 INFO L290 TraceCheckUtils]: 348: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:22,157 INFO L290 TraceCheckUtils]: 349: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:22,157 INFO L290 TraceCheckUtils]: 350: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:22,158 INFO L284 TraceCheckUtils]: 351: Hoare quadruple {214713#true} {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #96#return; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:24,220 WARN L290 TraceCheckUtils]: 352: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is UNKNOWN [2022-04-27 13:25:26,238 WARN L290 TraceCheckUtils]: 353: Hoare triple {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is UNKNOWN [2022-04-27 13:25:27,115 INFO L290 TraceCheckUtils]: 354: Hoare triple {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} assume !!(#t~post7 < 50);havoc #t~post7; {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is VALID [2022-04-27 13:25:27,116 INFO L272 TraceCheckUtils]: 355: Hoare triple {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:27,116 INFO L290 TraceCheckUtils]: 356: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:27,116 INFO L290 TraceCheckUtils]: 357: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:27,116 INFO L290 TraceCheckUtils]: 358: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:27,117 INFO L284 TraceCheckUtils]: 359: Hoare quadruple {214713#true} {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} #96#return; {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is VALID [2022-04-27 13:25:29,081 WARN L290 TraceCheckUtils]: 360: Hoare triple {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is UNKNOWN [2022-04-27 13:25:29,081 INFO L290 TraceCheckUtils]: 361: Hoare triple {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is VALID [2022-04-27 13:25:29,082 INFO L290 TraceCheckUtils]: 362: Hoare triple {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} assume !!(#t~post7 < 50);havoc #t~post7; {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is VALID [2022-04-27 13:25:29,082 INFO L272 TraceCheckUtils]: 363: Hoare triple {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:29,082 INFO L290 TraceCheckUtils]: 364: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:29,082 INFO L290 TraceCheckUtils]: 365: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:29,082 INFO L290 TraceCheckUtils]: 366: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:29,082 INFO L284 TraceCheckUtils]: 367: Hoare quadruple {214713#true} {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} #96#return; {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is VALID [2022-04-27 13:25:29,089 INFO L290 TraceCheckUtils]: 368: Hoare triple {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {214714#false} is VALID [2022-04-27 13:25:29,089 INFO L290 TraceCheckUtils]: 369: Hoare triple {214714#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214714#false} is VALID [2022-04-27 13:25:29,089 INFO L290 TraceCheckUtils]: 370: Hoare triple {214714#false} assume !(#t~post7 < 50);havoc #t~post7; {214714#false} is VALID [2022-04-27 13:25:29,089 INFO L290 TraceCheckUtils]: 371: Hoare triple {214714#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214714#false} is VALID [2022-04-27 13:25:29,089 INFO L290 TraceCheckUtils]: 372: Hoare triple {214714#false} assume !(#t~post8 < 50);havoc #t~post8; {214714#false} is VALID [2022-04-27 13:25:29,089 INFO L290 TraceCheckUtils]: 373: Hoare triple {214714#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {214714#false} is VALID [2022-04-27 13:25:29,089 INFO L290 TraceCheckUtils]: 374: Hoare triple {214714#false} assume !(#t~post6 < 50);havoc #t~post6; {214714#false} is VALID [2022-04-27 13:25:29,089 INFO L272 TraceCheckUtils]: 375: Hoare triple {214714#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214714#false} is VALID [2022-04-27 13:25:29,089 INFO L290 TraceCheckUtils]: 376: Hoare triple {214714#false} ~cond := #in~cond; {214714#false} is VALID [2022-04-27 13:25:29,089 INFO L290 TraceCheckUtils]: 377: Hoare triple {214714#false} assume 0 == ~cond; {214714#false} is VALID [2022-04-27 13:25:29,089 INFO L290 TraceCheckUtils]: 378: Hoare triple {214714#false} assume !false; {214714#false} is VALID [2022-04-27 13:25:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5272 backedges. 480 proven. 836 refuted. 156 times theorem prover too weak. 3800 trivial. 0 not checked. [2022-04-27 13:25:29,092 INFO L328 TraceCheckSpWp]: Computing backward predicates...