/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-34549b5 [2022-04-07 14:01:59,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 14:01:59,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 14:01:59,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 14:01:59,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 14:01:59,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 14:01:59,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 14:01:59,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 14:01:59,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 14:01:59,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 14:01:59,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 14:01:59,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 14:01:59,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 14:01:59,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 14:01:59,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 14:01:59,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 14:01:59,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 14:01:59,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 14:01:59,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 14:01:59,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 14:01:59,997 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 14:02:00,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 14:02:00,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 14:02:00,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 14:02:00,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 14:02:00,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 14:02:00,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 14:02:00,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 14:02:00,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 14:02:00,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 14:02:00,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 14:02:00,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 14:02:00,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 14:02:00,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 14:02:00,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 14:02:00,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 14:02:00,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 14:02:00,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 14:02:00,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 14:02:00,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 14:02:00,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 14:02:00,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 14:02:00,028 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-07 14:02:00,057 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 14:02:00,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 14:02:00,058 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 14:02:00,058 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 14:02:00,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 14:02:00,058 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 14:02:00,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 14:02:00,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 14:02:00,059 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 14:02:00,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 14:02:00,060 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 14:02:00,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 14:02:00,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 14:02:00,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 14:02:00,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 14:02:00,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 14:02:00,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 14:02:00,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 14:02:00,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 14:02:00,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 14:02:00,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 14:02:00,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 14:02:00,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 14:02:00,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 14:02:00,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 14:02:00,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 14:02:00,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 14:02:00,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 14:02:00,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 14:02:00,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 14:02:00,063 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 14:02:00,064 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 14:02:00,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 14:02:00,064 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-07 14:02:00,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 14:02:00,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 14:02:00,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 14:02:00,278 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 14:02:00,279 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 14:02:00,280 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-07 14:02:00,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60f93c02e/9a33765709a94e5a869cc3015ad2cef8/FLAG906155b5b [2022-04-07 14:02:00,746 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 14:02:00,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2022-04-07 14:02:00,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60f93c02e/9a33765709a94e5a869cc3015ad2cef8/FLAG906155b5b [2022-04-07 14:02:00,766 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60f93c02e/9a33765709a94e5a869cc3015ad2cef8 [2022-04-07 14:02:00,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 14:02:00,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 14:02:00,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 14:02:00,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 14:02:00,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 14:02:00,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:02:00" (1/1) ... [2022-04-07 14:02:00,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21811a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:02:00, skipping insertion in model container [2022-04-07 14:02:00,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:02:00" (1/1) ... [2022-04-07 14:02:00,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 14:02:00,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 14:02:00,939 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-07 14:02:00,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 14:02:00,964 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 14:02:00,974 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-07 14:02:00,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 14:02:00,996 INFO L208 MainTranslator]: Completed translation [2022-04-07 14:02:00,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:02:00 WrapperNode [2022-04-07 14:02:00,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 14:02:00,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 14:02:00,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 14:02:00,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 14:02:01,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:02:00" (1/1) ... [2022-04-07 14:02:01,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:02:00" (1/1) ... [2022-04-07 14:02:01,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:02:00" (1/1) ... [2022-04-07 14:02:01,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:02:00" (1/1) ... [2022-04-07 14:02:01,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:02:00" (1/1) ... [2022-04-07 14:02:01,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:02:00" (1/1) ... [2022-04-07 14:02:01,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:02:00" (1/1) ... [2022-04-07 14:02:01,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 14:02:01,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 14:02:01,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 14:02:01,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 14:02:01,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:02:00" (1/1) ... [2022-04-07 14:02:01,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 14:02:01,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:01,089 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-07 14:02:01,110 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-07 14:02:01,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 14:02:01,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 14:02:01,126 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 14:02:01,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 14:02:01,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 14:02:01,129 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 14:02:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 14:02:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 14:02:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 14:02:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 14:02:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 14:02:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 14:02:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 14:02:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 14:02:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 14:02:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 14:02:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 14:02:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 14:02:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 14:02:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 14:02:01,183 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 14:02:01,184 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 14:02:01,321 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 14:02:01,327 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 14:02:01,328 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 14:02:01,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:02:01 BoogieIcfgContainer [2022-04-07 14:02:01,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 14:02:01,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 14:02:01,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 14:02:01,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 14:02:01,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 02:02:00" (1/3) ... [2022-04-07 14:02:01,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745765e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:02:01, skipping insertion in model container [2022-04-07 14:02:01,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:02:00" (2/3) ... [2022-04-07 14:02:01,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745765e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:02:01, skipping insertion in model container [2022-04-07 14:02:01,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:02:01" (3/3) ... [2022-04-07 14:02:01,336 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound50.c [2022-04-07 14:02:01,339 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 14:02:01,340 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 14:02:01,388 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 14:02:01,409 INFO L340 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 [2022-04-07 14:02:01,410 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 14:02:01,426 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-07 14:02:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 14:02:01,430 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:01,430 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:01,431 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:01,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:01,435 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-07 14:02:01,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:01,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905055882] [2022-04-07 14:02:01,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:01,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:01,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:01,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503964142] [2022-04-07 14:02:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:01,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:01,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:01,536 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-07 14:02:01,569 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-07 14:02:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:01,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-07 14:02:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:01,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:01,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-07 14:02:01,774 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-07 14:02:01,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-07 14:02:01,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-07 14:02:01,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-07 14:02:01,775 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-07 14:02:01,775 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-07 14:02:01,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-07 14:02:01,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-07 14:02:01,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-07 14:02:01,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-07 14:02:01,777 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-07 14:02:01,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-07 14:02:01,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-07 14:02:01,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-07 14:02:01,778 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-07 14:02:01,778 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-07 14:02:01,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-07 14:02:01,779 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-07 14:02:01,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-07 14:02:01,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-07 14:02:01,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-07 14:02:01,780 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-07 14:02:01,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:01,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905055882] [2022-04-07 14:02:01,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:01,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503964142] [2022-04-07 14:02:01,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503964142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:01,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:01,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-07 14:02:01,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539388045] [2022-04-07 14:02:01,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:01,794 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-07 14:02:01,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:01,798 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-07 14:02:01,829 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-07 14:02:01,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-07 14:02:01,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:01,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-07 14:02:01,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-07 14:02:01,856 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-07 14:02:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:01,943 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-07 14:02:01,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-07 14:02:01,944 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 14:02:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:01,945 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-07 14:02:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-07 14:02:01,956 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-07 14:02:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-07 14:02:01,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-07 14:02:02,064 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-07 14:02:02,072 INFO L225 Difference]: With dead ends: 67 [2022-04-07 14:02:02,073 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 14:02:02,075 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-07 14:02:02,078 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:02,079 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:02:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 14:02:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 14:02:02,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:02,108 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-07 14:02:02,109 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-07 14:02:02,110 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-07 14:02:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:02,119 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-07 14:02:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 14:02:02,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:02,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:02,129 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-07 14:02:02,129 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-07 14:02:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:02,133 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-07 14:02:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 14:02:02,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:02,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:02,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:02,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:02,134 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-07 14:02:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-07 14:02:02,137 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-07 14:02:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:02,138 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-07 14:02:02,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 14:02:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 14:02:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 14:02:02,142 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:02,143 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:02,168 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-07 14:02:02,365 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-07 14:02:02,366 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-07 14:02:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:02,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799737433] [2022-04-07 14:02:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:02,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:02,384 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:02,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972766979] [2022-04-07 14:02:02,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:02,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:02,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:02,386 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-07 14:02:02,400 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-07 14:02:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:02,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 14:02:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:02,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:02,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-07 14:02:02,621 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-07 14:02:02,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:02,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#(<= ~counter~0 0)} {307#true} #102#return; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:02,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#(<= ~counter~0 0)} call #t~ret9 := main(); {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:02,623 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-07 14:02:02,624 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-07 14:02:02,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:02,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:02,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:02,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #90#return; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:02,627 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-07 14:02:02,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:02,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:02,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:02,630 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #92#return; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:02,630 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-07 14:02:02,631 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-07 14:02:02,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {308#false} is VALID [2022-04-07 14:02:02,631 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-07 14:02:02,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-07 14:02:02,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-07 14:02:02,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-07 14:02:02,632 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-07 14:02:02,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:02,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:02,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799737433] [2022-04-07 14:02:02,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:02,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972766979] [2022-04-07 14:02:02,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972766979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:02,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:02,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 14:02:02,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676305834] [2022-04-07 14:02:02,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:02,635 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-07 14:02:02,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:02,635 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-07 14:02:02,654 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-07 14:02:02,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 14:02:02,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:02,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 14:02:02,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:02:02,656 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-07 14:02:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:02,750 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-07 14:02:02,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 14:02:02,751 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-07 14:02:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:02,751 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-07 14:02:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-07 14:02:02,754 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-07 14:02:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-07 14:02:02,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-07 14:02:02,801 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-07 14:02:02,803 INFO L225 Difference]: With dead ends: 41 [2022-04-07 14:02:02,803 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 14:02:02,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:02:02,804 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:02,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:02:02,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 14:02:02,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-07 14:02:02,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:02,813 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-07 14:02:02,814 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-07 14:02:02,814 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-07 14:02:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:02,817 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-07 14:02:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 14:02:02,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:02,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:02,818 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-07 14:02:02,819 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-07 14:02:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:02,821 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-07 14:02:02,821 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 14:02:02,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:02,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:02,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:02,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:02,823 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-07 14:02:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-07 14:02:02,825 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-07 14:02:02,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:02,825 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-07 14:02:02,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 14:02:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 14:02:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 14:02:02,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:02,826 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:02,851 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-07 14:02:03,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-07 14:02:03,040 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:03,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-07 14:02:03,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:03,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959227275] [2022-04-07 14:02:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:03,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:03,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:03,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206068206] [2022-04-07 14:02:03,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:03,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:03,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:03,061 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-07 14:02:03,062 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-07 14:02:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:03,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 14:02:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:03,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:03,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-07 14:02:03,563 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-07 14:02:03,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-07 14:02:03,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #102#return; {554#true} is VALID [2022-04-07 14:02:03,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret9 := main(); {554#true} is VALID [2022-04-07 14:02:03,567 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-07 14:02:03,567 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-07 14:02:03,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-07 14:02:03,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-07 14:02:03,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-07 14:02:03,567 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #90#return; {554#true} is VALID [2022-04-07 14:02:03,568 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-07 14:02:03,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-07 14:02:03,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-07 14:02:03,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-07 14:02:03,568 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #92#return; {554#true} is VALID [2022-04-07 14:02:04,209 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-07 14:02:04,211 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-07 14:02:04,211 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-07 14:02:06,215 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-07 14:02:06,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:02:06,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-07 14:02:06,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-07 14:02:06,217 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-07 14:02:06,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:06,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:06,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959227275] [2022-04-07 14:02:06,217 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:06,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206068206] [2022-04-07 14:02:06,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206068206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:06,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:06,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:02:06,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608256544] [2022-04-07 14:02:06,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:06,219 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-07 14:02:06,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:06,219 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-07 14:02:08,610 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-07 14:02:08,611 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:02:08,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:08,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:02:08,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:02:08,611 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-07 14:02:12,806 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-07 14:02:15,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:02:16,836 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:02:20,213 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-07 14:02:22,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:02:31,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:02:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:31,522 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-07 14:02:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:02:31,522 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-07 14:02:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:31,522 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-07 14:02:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-07 14:02:31,526 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-07 14:02:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-07 14:02:31,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-07 14:02:35,942 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-07 14:02:35,944 INFO L225 Difference]: With dead ends: 53 [2022-04-07 14:02:35,944 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 14:02:35,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 14:02:35,946 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 16 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:35,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 122 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2022-04-07 14:02:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 14:02:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-07 14:02:35,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:35,957 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-07 14:02:35,958 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-07 14:02:35,958 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-07 14:02:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:35,961 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-07 14:02:35,962 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-07 14:02:35,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:35,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:35,963 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-07 14:02:35,963 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-07 14:02:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:35,966 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-07 14:02:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-07 14:02:35,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:35,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:35,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:35,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:35,968 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-07 14:02:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-07 14:02:35,970 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-07 14:02:35,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:35,971 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-07 14:02:35,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 14:02:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-07 14:02:35,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 14:02:35,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:35,972 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:35,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-07 14:02:36,172 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:36,173 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-07 14:02:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:36,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877001389] [2022-04-07 14:02:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:36,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:36,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:36,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [651292740] [2022-04-07 14:02:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:36,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:36,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:36,195 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-07 14:02:36,196 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-07 14:02:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:36,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 14:02:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:36,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:36,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-07 14:02:36,432 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-07 14:02:36,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:36,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-07 14:02:36,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-07 14:02:36,432 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-07 14:02:36,432 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-07 14:02:36,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-07 14:02:36,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-07 14:02:36,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:36,433 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-07 14:02:36,433 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-07 14:02:36,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-07 14:02:36,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-07 14:02:36,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:36,434 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-07 14:02:36,434 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-07 14:02:36,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-07 14:02:36,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 50);havoc #t~post6; {877#true} is VALID [2022-04-07 14:02:36,434 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-07 14:02:36,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:02:36,436 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-07 14:02:36,436 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-07 14:02:36,437 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-07 14:02:36,438 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-07 14:02:36,438 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-07 14:02:36,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:02:36,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-07 14:02:36,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-07 14:02:36,440 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-07 14:02:36,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:36,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-07 14:02:36,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-07 14:02:36,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:02:36,910 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-07 14:02:36,910 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-07 14:02:36,914 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-07 14:02:36,918 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-07 14:02:36,919 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-07 14:02:36,920 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-07 14:02:36,920 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-07 14:02:36,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 50);havoc #t~post6; {877#true} is VALID [2022-04-07 14:02:36,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-07 14:02:36,920 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-07 14:02:36,920 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-07 14:02:36,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:36,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-07 14:02:36,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-07 14:02:36,921 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-07 14:02:36,921 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-07 14:02:36,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:36,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-07 14:02:36,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-07 14:02:36,921 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-07 14:02:36,922 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-07 14:02:36,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-07 14:02:36,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-07 14:02:36,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:36,922 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-07 14:02:36,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-07 14:02:36,922 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-07 14:02:36,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:36,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877001389] [2022-04-07 14:02:36,923 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:36,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651292740] [2022-04-07 14:02:36,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651292740] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:36,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:36,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 14:02:36,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728925220] [2022-04-07 14:02:36,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:36,924 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-07 14:02:36,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:36,925 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-07 14:02:36,950 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-07 14:02:36,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 14:02:36,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 14:02:36,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:02:36,951 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-07 14:02:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:37,460 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-07 14:02:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 14:02:37,460 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-07 14:02:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:37,461 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-07 14:02:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-07 14:02:37,462 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-07 14:02:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-07 14:02:37,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-07 14:02:37,513 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-07 14:02:37,514 INFO L225 Difference]: With dead ends: 57 [2022-04-07 14:02:37,514 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 14:02:37,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-07 14:02:37,516 INFO L913 BasicCegarLoop]: 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-07 14:02:37,516 INFO L914 BasicCegarLoop]: 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-07 14:02:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 14:02:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-07 14:02:37,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:37,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 14:02:37,532 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 14:02:37,533 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 14:02:37,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:37,535 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-07 14:02:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-07 14:02:37,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:37,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:37,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-07 14:02:37,537 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-07 14:02:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:37,539 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-07 14:02:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-07 14:02:37,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:37,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:37,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:37,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 14:02:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-07 14:02:37,542 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 29 [2022-04-07 14:02:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:37,542 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-07 14:02:37,543 INFO L479 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-07 14:02:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-07 14:02:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 14:02:37,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:37,550 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:37,576 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-07 14:02:37,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:37,751 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:37,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-07 14:02:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:37,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033645056] [2022-04-07 14:02:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:37,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:37,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455588385] [2022-04-07 14:02:37,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:37,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:37,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:37,782 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-07 14:02:37,784 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-07 14:02:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:37,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 14:02:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:37,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:38,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {1324#true} call ULTIMATE.init(); {1324#true} is VALID [2022-04-07 14:02:38,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1324#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1332#(<= ~counter~0 0)} assume true; {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1332#(<= ~counter~0 0)} {1324#true} #102#return; {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {1332#(<= ~counter~0 0)} call #t~ret9 := main(); {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {1332#(<= ~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; {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,025 INFO L272 TraceCheckUtils]: 6: Hoare triple {1332#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#(<= ~counter~0 0)} ~cond := #in~cond; {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#(<= ~counter~0 0)} assume !(0 == ~cond); {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {1332#(<= ~counter~0 0)} assume true; {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,027 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1332#(<= ~counter~0 0)} {1332#(<= ~counter~0 0)} #90#return; {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,027 INFO L272 TraceCheckUtils]: 11: Hoare triple {1332#(<= ~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)); {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {1332#(<= ~counter~0 0)} ~cond := #in~cond; {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {1332#(<= ~counter~0 0)} assume !(0 == ~cond); {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {1332#(<= ~counter~0 0)} assume true; {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,029 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1332#(<= ~counter~0 0)} {1332#(<= ~counter~0 0)} #92#return; {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {1332#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1332#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {1332#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1381#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {1381#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1381#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,035 INFO L272 TraceCheckUtils]: 19: Hoare triple {1381#(<= ~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)); {1381#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {1381#(<= ~counter~0 1)} ~cond := #in~cond; {1381#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {1381#(<= ~counter~0 1)} assume !(0 == ~cond); {1381#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {1381#(<= ~counter~0 1)} assume true; {1381#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,037 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1381#(<= ~counter~0 1)} {1381#(<= ~counter~0 1)} #94#return; {1381#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {1381#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1381#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {1381#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1406#(<= |main_#t~post7| 1)} is VALID [2022-04-07 14:02:38,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {1325#false} is VALID [2022-04-07 14:02:38,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {1325#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1325#false} is VALID [2022-04-07 14:02:38,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {1325#false} assume !(#t~post8 < 50);havoc #t~post8; {1325#false} is VALID [2022-04-07 14:02:38,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {1325#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1325#false} is VALID [2022-04-07 14:02:38,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {1325#false} assume !(#t~post6 < 50);havoc #t~post6; {1325#false} is VALID [2022-04-07 14:02:38,039 INFO L272 TraceCheckUtils]: 31: Hoare triple {1325#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1325#false} is VALID [2022-04-07 14:02:38,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {1325#false} ~cond := #in~cond; {1325#false} is VALID [2022-04-07 14:02:38,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {1325#false} assume 0 == ~cond; {1325#false} is VALID [2022-04-07 14:02:38,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {1325#false} assume !false; {1325#false} is VALID [2022-04-07 14:02:38,039 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-07 14:02:38,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:38,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:38,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033645056] [2022-04-07 14:02:38,040 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:38,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455588385] [2022-04-07 14:02:38,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455588385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:38,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:38,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:02:38,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394913893] [2022-04-07 14:02:38,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:38,042 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-07 14:02:38,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:38,042 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-07 14:02:38,065 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-07 14:02:38,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:02:38,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:38,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:02:38,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:02:38,066 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 14:02:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:38,196 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-07 14:02:38,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:02:38,197 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-07 14:02:38,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:38,197 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-07 14:02:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-07 14:02:38,199 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-07 14:02:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-07 14:02:38,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-07 14:02:38,263 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-07 14:02:38,264 INFO L225 Difference]: With dead ends: 97 [2022-04-07 14:02:38,265 INFO L226 Difference]: Without dead ends: 60 [2022-04-07 14:02:38,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:02:38,266 INFO L913 BasicCegarLoop]: 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-07 14:02:38,266 INFO L914 BasicCegarLoop]: 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-07 14:02:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-07 14:02:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-07 14:02:38,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:38,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 14:02:38,285 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 14:02:38,286 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 14:02:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:38,292 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-07 14:02:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-07 14:02:38,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:38,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:38,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-07 14:02:38,298 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-07 14:02:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:38,302 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-07 14:02:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-07 14:02:38,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:38,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:38,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:38,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 14:02:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-07 14:02:38,308 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 35 [2022-04-07 14:02:38,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:38,309 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-07 14:02:38,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 14:02:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-07 14:02:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 14:02:38,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:38,312 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:38,337 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-07 14:02:38,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:38,528 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:38,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:38,528 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-07 14:02:38,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:38,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811264486] [2022-04-07 14:02:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:38,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:38,546 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:38,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403299507] [2022-04-07 14:02:38,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:38,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:38,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:38,549 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-07 14:02:38,550 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-07 14:02:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:38,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 14:02:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:38,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:38,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} call ULTIMATE.init(); {1774#true} is VALID [2022-04-07 14:02:38,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {1782#(<= ~counter~0 0)} assume true; {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1782#(<= ~counter~0 0)} {1774#true} #102#return; {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {1782#(<= ~counter~0 0)} call #t~ret9 := main(); {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {1782#(<= ~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; {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {1782#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {1782#(<= ~counter~0 0)} ~cond := #in~cond; {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {1782#(<= ~counter~0 0)} assume !(0 == ~cond); {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {1782#(<= ~counter~0 0)} assume true; {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,834 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1782#(<= ~counter~0 0)} {1782#(<= ~counter~0 0)} #90#return; {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,835 INFO L272 TraceCheckUtils]: 11: Hoare triple {1782#(<= ~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)); {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {1782#(<= ~counter~0 0)} ~cond := #in~cond; {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {1782#(<= ~counter~0 0)} assume !(0 == ~cond); {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {1782#(<= ~counter~0 0)} assume true; {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,837 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1782#(<= ~counter~0 0)} {1782#(<= ~counter~0 0)} #92#return; {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {1782#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1782#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:38,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {1782#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1831#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {1831#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1831#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,839 INFO L272 TraceCheckUtils]: 19: Hoare triple {1831#(<= ~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)); {1831#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {1831#(<= ~counter~0 1)} ~cond := #in~cond; {1831#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {1831#(<= ~counter~0 1)} assume !(0 == ~cond); {1831#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {1831#(<= ~counter~0 1)} assume true; {1831#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,843 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1831#(<= ~counter~0 1)} {1831#(<= ~counter~0 1)} #94#return; {1831#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {1831#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1831#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:38,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {1831#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1856#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:38,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {1856#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {1856#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:38,845 INFO L272 TraceCheckUtils]: 27: Hoare triple {1856#(<= ~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)); {1856#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:38,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {1856#(<= ~counter~0 2)} ~cond := #in~cond; {1856#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:38,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {1856#(<= ~counter~0 2)} assume !(0 == ~cond); {1856#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:38,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {1856#(<= ~counter~0 2)} assume true; {1856#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:38,847 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1856#(<= ~counter~0 2)} {1856#(<= ~counter~0 2)} #96#return; {1856#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:38,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {1856#(<= ~counter~0 2)} assume !(~r~0 > 0); {1856#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:38,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {1856#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1881#(<= |main_#t~post8| 2)} is VALID [2022-04-07 14:02:38,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {1881#(<= |main_#t~post8| 2)} assume !(#t~post8 < 50);havoc #t~post8; {1775#false} is VALID [2022-04-07 14:02:38,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1775#false} is VALID [2022-04-07 14:02:38,848 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#false} assume !(#t~post6 < 50);havoc #t~post6; {1775#false} is VALID [2022-04-07 14:02:38,849 INFO L272 TraceCheckUtils]: 37: Hoare triple {1775#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1775#false} is VALID [2022-04-07 14:02:38,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {1775#false} ~cond := #in~cond; {1775#false} is VALID [2022-04-07 14:02:38,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {1775#false} assume 0 == ~cond; {1775#false} is VALID [2022-04-07 14:02:38,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {1775#false} assume !false; {1775#false} is VALID [2022-04-07 14:02:38,849 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-07 14:02:38,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:39,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {1775#false} assume !false; {1775#false} is VALID [2022-04-07 14:02:39,098 INFO L290 TraceCheckUtils]: 39: Hoare triple {1775#false} assume 0 == ~cond; {1775#false} is VALID [2022-04-07 14:02:39,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {1775#false} ~cond := #in~cond; {1775#false} is VALID [2022-04-07 14:02:39,099 INFO L272 TraceCheckUtils]: 37: Hoare triple {1775#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1775#false} is VALID [2022-04-07 14:02:39,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#false} assume !(#t~post6 < 50);havoc #t~post6; {1775#false} is VALID [2022-04-07 14:02:39,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1775#false} is VALID [2022-04-07 14:02:39,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {1921#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {1775#false} is VALID [2022-04-07 14:02:39,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1921#(< |main_#t~post8| 50)} is VALID [2022-04-07 14:02:39,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#(< ~counter~0 50)} assume !(~r~0 > 0); {1925#(< ~counter~0 50)} is VALID [2022-04-07 14:02:39,100 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1774#true} {1925#(< ~counter~0 50)} #96#return; {1925#(< ~counter~0 50)} is VALID [2022-04-07 14:02:39,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-07 14:02:39,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {1774#true} assume !(0 == ~cond); {1774#true} is VALID [2022-04-07 14:02:39,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {1774#true} ~cond := #in~cond; {1774#true} is VALID [2022-04-07 14:02:39,101 INFO L272 TraceCheckUtils]: 27: Hoare triple {1925#(< ~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)); {1774#true} is VALID [2022-04-07 14:02:39,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {1925#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {1925#(< ~counter~0 50)} is VALID [2022-04-07 14:02:39,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {1950#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1925#(< ~counter~0 50)} is VALID [2022-04-07 14:02:39,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {1950#(< ~counter~0 49)} assume !!(0 != ~r~0); {1950#(< ~counter~0 49)} is VALID [2022-04-07 14:02:39,102 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1774#true} {1950#(< ~counter~0 49)} #94#return; {1950#(< ~counter~0 49)} is VALID [2022-04-07 14:02:39,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-07 14:02:39,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {1774#true} assume !(0 == ~cond); {1774#true} is VALID [2022-04-07 14:02:39,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {1774#true} ~cond := #in~cond; {1774#true} is VALID [2022-04-07 14:02:39,103 INFO L272 TraceCheckUtils]: 19: Hoare triple {1950#(< ~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)); {1774#true} is VALID [2022-04-07 14:02:39,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {1950#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {1950#(< ~counter~0 49)} is VALID [2022-04-07 14:02:39,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {1975#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1950#(< ~counter~0 49)} is VALID [2022-04-07 14:02:39,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {1975#(< ~counter~0 48)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1975#(< ~counter~0 48)} is VALID [2022-04-07 14:02:39,104 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1774#true} {1975#(< ~counter~0 48)} #92#return; {1975#(< ~counter~0 48)} is VALID [2022-04-07 14:02:39,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-07 14:02:39,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {1774#true} assume !(0 == ~cond); {1774#true} is VALID [2022-04-07 14:02:39,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {1774#true} ~cond := #in~cond; {1774#true} is VALID [2022-04-07 14:02:39,105 INFO L272 TraceCheckUtils]: 11: Hoare triple {1975#(< ~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)); {1774#true} is VALID [2022-04-07 14:02:39,105 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1774#true} {1975#(< ~counter~0 48)} #90#return; {1975#(< ~counter~0 48)} is VALID [2022-04-07 14:02:39,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-07 14:02:39,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {1774#true} assume !(0 == ~cond); {1774#true} is VALID [2022-04-07 14:02:39,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {1774#true} ~cond := #in~cond; {1774#true} is VALID [2022-04-07 14:02:39,106 INFO L272 TraceCheckUtils]: 6: Hoare triple {1975#(< ~counter~0 48)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1774#true} is VALID [2022-04-07 14:02:39,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {1975#(< ~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; {1975#(< ~counter~0 48)} is VALID [2022-04-07 14:02:39,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {1975#(< ~counter~0 48)} call #t~ret9 := main(); {1975#(< ~counter~0 48)} is VALID [2022-04-07 14:02:39,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1975#(< ~counter~0 48)} {1774#true} #102#return; {1975#(< ~counter~0 48)} is VALID [2022-04-07 14:02:39,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {1975#(< ~counter~0 48)} assume true; {1975#(< ~counter~0 48)} is VALID [2022-04-07 14:02:39,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1975#(< ~counter~0 48)} is VALID [2022-04-07 14:02:39,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} call ULTIMATE.init(); {1774#true} is VALID [2022-04-07 14:02:39,118 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-07 14:02:39,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:39,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811264486] [2022-04-07 14:02:39,118 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:39,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403299507] [2022-04-07 14:02:39,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403299507] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 14:02:39,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 14:02:39,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-07 14:02:39,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454104206] [2022-04-07 14:02:39,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:39,122 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-07 14:02:39,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:39,124 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-07 14:02:39,149 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-07 14:02:39,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 14:02:39,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:39,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 14:02:39,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:02:39,151 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 14:02:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:39,307 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2022-04-07 14:02:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 14:02:39,307 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-07 14:02:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:39,307 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-07 14:02:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-07 14:02:39,312 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-07 14:02:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-07 14:02:39,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-07 14:02:39,382 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-07 14:02:39,384 INFO L225 Difference]: With dead ends: 106 [2022-04-07 14:02:39,384 INFO L226 Difference]: Without dead ends: 69 [2022-04-07 14:02:39,385 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:02:39,386 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:39,386 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:02:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-07 14:02:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-07 14:02:39,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:39,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 14:02:39,407 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 14:02:39,408 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 14:02:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:39,410 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-07 14:02:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-07 14:02:39,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:39,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:39,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-07 14:02:39,411 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-07 14:02:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:39,414 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-07 14:02:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-07 14:02:39,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:39,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:39,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:39,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 14:02:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-07 14:02:39,417 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 41 [2022-04-07 14:02:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:39,417 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-07 14:02:39,417 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 14:02:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-07 14:02:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 14:02:39,418 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:39,418 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:39,447 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-07 14:02:39,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:39,627 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:39,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-07 14:02:39,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:39,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561267606] [2022-04-07 14:02:39,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:39,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:39,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:39,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537226130] [2022-04-07 14:02:39,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:39,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:39,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:39,643 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-07 14:02:39,653 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-07 14:02:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:39,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 14:02:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:39,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:39,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {2410#true} call ULTIMATE.init(); {2410#true} is VALID [2022-04-07 14:02:39,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {2410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#(<= ~counter~0 0)} assume true; {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#(<= ~counter~0 0)} {2410#true} #102#return; {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#(<= ~counter~0 0)} call #t~ret9 := main(); {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#(<= ~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; {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,925 INFO L272 TraceCheckUtils]: 6: Hoare triple {2418#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {2418#(<= ~counter~0 0)} ~cond := #in~cond; {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {2418#(<= ~counter~0 0)} assume !(0 == ~cond); {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#(<= ~counter~0 0)} assume true; {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,929 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2418#(<= ~counter~0 0)} {2418#(<= ~counter~0 0)} #90#return; {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,930 INFO L272 TraceCheckUtils]: 11: Hoare triple {2418#(<= ~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)); {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {2418#(<= ~counter~0 0)} ~cond := #in~cond; {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {2418#(<= ~counter~0 0)} assume !(0 == ~cond); {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#(<= ~counter~0 0)} assume true; {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,934 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2418#(<= ~counter~0 0)} {2418#(<= ~counter~0 0)} #92#return; {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2418#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:39,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {2418#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2467#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:39,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {2467#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2467#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:39,936 INFO L272 TraceCheckUtils]: 19: Hoare triple {2467#(<= ~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)); {2467#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:39,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {2467#(<= ~counter~0 1)} ~cond := #in~cond; {2467#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:39,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {2467#(<= ~counter~0 1)} assume !(0 == ~cond); {2467#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:39,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {2467#(<= ~counter~0 1)} assume true; {2467#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:39,937 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2467#(<= ~counter~0 1)} {2467#(<= ~counter~0 1)} #94#return; {2467#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:39,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {2467#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2467#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:39,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {2467#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2492#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:39,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {2492#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {2492#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:39,939 INFO L272 TraceCheckUtils]: 27: Hoare triple {2492#(<= ~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)); {2492#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:39,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {2492#(<= ~counter~0 2)} ~cond := #in~cond; {2492#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:39,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {2492#(<= ~counter~0 2)} assume !(0 == ~cond); {2492#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:39,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {2492#(<= ~counter~0 2)} assume true; {2492#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:39,940 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2492#(<= ~counter~0 2)} {2492#(<= ~counter~0 2)} #96#return; {2492#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:39,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {2492#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2492#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:39,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {2492#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2517#(<= |main_#t~post7| 2)} is VALID [2022-04-07 14:02:39,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {2517#(<= |main_#t~post7| 2)} assume !(#t~post7 < 50);havoc #t~post7; {2411#false} is VALID [2022-04-07 14:02:39,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {2411#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2411#false} is VALID [2022-04-07 14:02:39,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {2411#false} assume !(#t~post8 < 50);havoc #t~post8; {2411#false} is VALID [2022-04-07 14:02:39,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {2411#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2411#false} is VALID [2022-04-07 14:02:39,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {2411#false} assume !(#t~post6 < 50);havoc #t~post6; {2411#false} is VALID [2022-04-07 14:02:39,943 INFO L272 TraceCheckUtils]: 39: Hoare triple {2411#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2411#false} is VALID [2022-04-07 14:02:39,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {2411#false} ~cond := #in~cond; {2411#false} is VALID [2022-04-07 14:02:39,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {2411#false} assume 0 == ~cond; {2411#false} is VALID [2022-04-07 14:02:39,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {2411#false} assume !false; {2411#false} is VALID [2022-04-07 14:02:39,946 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-07 14:02:39,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:40,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {2411#false} assume !false; {2411#false} is VALID [2022-04-07 14:02:40,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {2411#false} assume 0 == ~cond; {2411#false} is VALID [2022-04-07 14:02:40,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {2411#false} ~cond := #in~cond; {2411#false} is VALID [2022-04-07 14:02:40,172 INFO L272 TraceCheckUtils]: 39: Hoare triple {2411#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2411#false} is VALID [2022-04-07 14:02:40,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {2411#false} assume !(#t~post6 < 50);havoc #t~post6; {2411#false} is VALID [2022-04-07 14:02:40,172 INFO L290 TraceCheckUtils]: 37: Hoare triple {2411#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2411#false} is VALID [2022-04-07 14:02:40,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {2411#false} assume !(#t~post8 < 50);havoc #t~post8; {2411#false} is VALID [2022-04-07 14:02:40,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {2411#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2411#false} is VALID [2022-04-07 14:02:40,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {2569#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {2411#false} is VALID [2022-04-07 14:02:40,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {2573#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2569#(< |main_#t~post7| 50)} is VALID [2022-04-07 14:02:40,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {2573#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2573#(< ~counter~0 50)} is VALID [2022-04-07 14:02:40,174 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2410#true} {2573#(< ~counter~0 50)} #96#return; {2573#(< ~counter~0 50)} is VALID [2022-04-07 14:02:40,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-07 14:02:40,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {2410#true} assume !(0 == ~cond); {2410#true} is VALID [2022-04-07 14:02:40,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {2410#true} ~cond := #in~cond; {2410#true} is VALID [2022-04-07 14:02:40,174 INFO L272 TraceCheckUtils]: 27: Hoare triple {2573#(< ~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)); {2410#true} is VALID [2022-04-07 14:02:40,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {2573#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {2573#(< ~counter~0 50)} is VALID [2022-04-07 14:02:40,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {2598#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2573#(< ~counter~0 50)} is VALID [2022-04-07 14:02:40,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {2598#(< ~counter~0 49)} assume !!(0 != ~r~0); {2598#(< ~counter~0 49)} is VALID [2022-04-07 14:02:40,177 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2410#true} {2598#(< ~counter~0 49)} #94#return; {2598#(< ~counter~0 49)} is VALID [2022-04-07 14:02:40,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-07 14:02:40,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {2410#true} assume !(0 == ~cond); {2410#true} is VALID [2022-04-07 14:02:40,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {2410#true} ~cond := #in~cond; {2410#true} is VALID [2022-04-07 14:02:40,177 INFO L272 TraceCheckUtils]: 19: Hoare triple {2598#(< ~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)); {2410#true} is VALID [2022-04-07 14:02:40,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {2598#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {2598#(< ~counter~0 49)} is VALID [2022-04-07 14:02:40,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {2623#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2598#(< ~counter~0 49)} is VALID [2022-04-07 14:02:40,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {2623#(< ~counter~0 48)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2623#(< ~counter~0 48)} is VALID [2022-04-07 14:02:40,179 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2410#true} {2623#(< ~counter~0 48)} #92#return; {2623#(< ~counter~0 48)} is VALID [2022-04-07 14:02:40,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-07 14:02:40,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {2410#true} assume !(0 == ~cond); {2410#true} is VALID [2022-04-07 14:02:40,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {2410#true} ~cond := #in~cond; {2410#true} is VALID [2022-04-07 14:02:40,180 INFO L272 TraceCheckUtils]: 11: Hoare triple {2623#(< ~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)); {2410#true} is VALID [2022-04-07 14:02:40,180 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2410#true} {2623#(< ~counter~0 48)} #90#return; {2623#(< ~counter~0 48)} is VALID [2022-04-07 14:02:40,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-07 14:02:40,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {2410#true} assume !(0 == ~cond); {2410#true} is VALID [2022-04-07 14:02:40,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {2410#true} ~cond := #in~cond; {2410#true} is VALID [2022-04-07 14:02:40,181 INFO L272 TraceCheckUtils]: 6: Hoare triple {2623#(< ~counter~0 48)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2410#true} is VALID [2022-04-07 14:02:40,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {2623#(< ~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; {2623#(< ~counter~0 48)} is VALID [2022-04-07 14:02:40,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {2623#(< ~counter~0 48)} call #t~ret9 := main(); {2623#(< ~counter~0 48)} is VALID [2022-04-07 14:02:40,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2623#(< ~counter~0 48)} {2410#true} #102#return; {2623#(< ~counter~0 48)} is VALID [2022-04-07 14:02:40,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {2623#(< ~counter~0 48)} assume true; {2623#(< ~counter~0 48)} is VALID [2022-04-07 14:02:40,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {2410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2623#(< ~counter~0 48)} is VALID [2022-04-07 14:02:40,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {2410#true} call ULTIMATE.init(); {2410#true} is VALID [2022-04-07 14:02:40,183 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-07 14:02:40,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:40,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561267606] [2022-04-07 14:02:40,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:40,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537226130] [2022-04-07 14:02:40,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537226130] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:40,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:40,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-07 14:02:40,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343406503] [2022-04-07 14:02:40,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:40,184 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-07 14:02:40,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:40,185 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-07 14:02:40,245 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-07 14:02:40,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 14:02:40,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:40,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 14:02:40,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:02:40,248 INFO L87 Difference]: Start difference. First operand 68 states and 83 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-07 14:02:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:40,664 INFO L93 Difference]: Finished difference Result 189 states and 244 transitions. [2022-04-07 14:02:40,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 14:02:40,664 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-07 14:02:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:40,665 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-07 14:02:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-07 14:02:40,668 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-07 14:02:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-07 14:02:40,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 156 transitions. [2022-04-07 14:02:40,788 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-07 14:02:40,792 INFO L225 Difference]: With dead ends: 189 [2022-04-07 14:02:40,792 INFO L226 Difference]: Without dead ends: 152 [2022-04-07 14:02:40,793 INFO L912 BasicCegarLoop]: 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-07 14:02:40,794 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 81 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:40,794 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 179 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 14:02:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-07 14:02:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2022-04-07 14:02:40,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:40,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 14:02:40,850 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 14:02:40,851 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 14:02:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:40,856 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2022-04-07 14:02:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2022-04-07 14:02:40,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:40,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:40,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 152 states. [2022-04-07 14:02:40,858 INFO L87 Difference]: Start difference. First operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 152 states. [2022-04-07 14:02:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:40,863 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2022-04-07 14:02:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2022-04-07 14:02:40,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:40,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:40,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:40,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 14:02:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 172 transitions. [2022-04-07 14:02:40,869 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 172 transitions. Word has length 43 [2022-04-07 14:02:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:40,869 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 172 transitions. [2022-04-07 14:02:40,869 INFO L479 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-07 14:02:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 172 transitions. [2022-04-07 14:02:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-07 14:02:40,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:40,870 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:40,895 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-07 14:02:41,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:41,083 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:41,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-07 14:02:41,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:41,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094395924] [2022-04-07 14:02:41,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:41,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:41,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:41,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345393651] [2022-04-07 14:02:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:41,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:41,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:41,099 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-07 14:02:41,129 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-07 14:02:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:41,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 14:02:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:41,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:41,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {3440#true} call ULTIMATE.init(); {3440#true} is VALID [2022-04-07 14:02:41,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {3440#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3440#true} is VALID [2022-04-07 14:02:41,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-07 14:02:41,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3440#true} {3440#true} #102#return; {3440#true} is VALID [2022-04-07 14:02:41,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {3440#true} call #t~ret9 := main(); {3440#true} is VALID [2022-04-07 14:02:41,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {3440#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; {3440#true} is VALID [2022-04-07 14:02:41,325 INFO L272 TraceCheckUtils]: 6: Hoare triple {3440#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3440#true} is VALID [2022-04-07 14:02:41,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-07 14:02:41,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-07 14:02:41,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-07 14:02:41,325 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3440#true} {3440#true} #90#return; {3440#true} is VALID [2022-04-07 14:02:41,325 INFO L272 TraceCheckUtils]: 11: Hoare triple {3440#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)); {3440#true} is VALID [2022-04-07 14:02:41,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-07 14:02:41,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-07 14:02:41,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-07 14:02:41,326 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3440#true} {3440#true} #92#return; {3440#true} is VALID [2022-04-07 14:02:41,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {3440#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3440#true} is VALID [2022-04-07 14:02:41,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {3440#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3440#true} is VALID [2022-04-07 14:02:41,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {3440#true} assume !!(#t~post6 < 50);havoc #t~post6; {3440#true} is VALID [2022-04-07 14:02:41,326 INFO L272 TraceCheckUtils]: 19: Hoare triple {3440#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)); {3440#true} is VALID [2022-04-07 14:02:41,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-07 14:02:41,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-07 14:02:41,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-07 14:02:41,326 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3440#true} {3440#true} #94#return; {3440#true} is VALID [2022-04-07 14:02:41,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {3440#true} assume !!(0 != ~r~0); {3517#(not (= main_~r~0 0))} is VALID [2022-04-07 14:02:41,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {3517#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3517#(not (= main_~r~0 0))} is VALID [2022-04-07 14:02:41,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {3517#(not (= main_~r~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {3517#(not (= main_~r~0 0))} is VALID [2022-04-07 14:02:41,328 INFO L272 TraceCheckUtils]: 27: Hoare triple {3517#(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)); {3440#true} is VALID [2022-04-07 14:02:41,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-07 14:02:41,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-07 14:02:41,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-07 14:02:41,329 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3440#true} {3517#(not (= main_~r~0 0))} #96#return; {3517#(not (= main_~r~0 0))} is VALID [2022-04-07 14:02:41,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {3517#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-07 14:02:41,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-07 14:02:41,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 50);havoc #t~post8; {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-07 14:02:41,330 INFO L272 TraceCheckUtils]: 35: Hoare triple {3542#(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)); {3440#true} is VALID [2022-04-07 14:02:41,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-07 14:02:41,330 INFO L290 TraceCheckUtils]: 37: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-07 14:02:41,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-07 14:02:41,335 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3440#true} {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-07 14:02:41,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3441#false} is VALID [2022-04-07 14:02:41,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {3441#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3441#false} is VALID [2022-04-07 14:02:41,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {3441#false} assume !(#t~post6 < 50);havoc #t~post6; {3441#false} is VALID [2022-04-07 14:02:41,336 INFO L272 TraceCheckUtils]: 43: Hoare triple {3441#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3441#false} is VALID [2022-04-07 14:02:41,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {3441#false} ~cond := #in~cond; {3441#false} is VALID [2022-04-07 14:02:41,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {3441#false} assume 0 == ~cond; {3441#false} is VALID [2022-04-07 14:02:41,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {3441#false} assume !false; {3441#false} is VALID [2022-04-07 14:02:41,337 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-07 14:02:41,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:41,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:41,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094395924] [2022-04-07 14:02:41,337 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:41,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345393651] [2022-04-07 14:02:41,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345393651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:41,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:41,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 14:02:41,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484688348] [2022-04-07 14:02:41,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:41,338 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-07 14:02:41,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:41,339 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-07 14:02:41,369 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-07 14:02:41,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 14:02:41,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:41,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 14:02:41,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:02:41,370 INFO L87 Difference]: Start difference. First operand 136 states and 172 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-07 14:02:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:41,554 INFO L93 Difference]: Finished difference Result 227 states and 304 transitions. [2022-04-07 14:02:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 14:02:41,554 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-07 14:02:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:41,554 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-07 14:02:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-07 14:02:41,556 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-07 14:02:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-07 14:02:41,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-07 14:02:41,640 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-07 14:02:41,644 INFO L225 Difference]: With dead ends: 227 [2022-04-07 14:02:41,644 INFO L226 Difference]: Without dead ends: 172 [2022-04-07 14:02:41,645 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:02:41,646 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 23 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:41,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 94 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:02:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-07 14:02:41,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2022-04-07 14:02:41,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:41,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-07 14:02:41,697 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-07 14:02:41,698 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-07 14:02:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:41,703 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2022-04-07 14:02:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2022-04-07 14:02:41,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:41,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:41,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-07 14:02:41,706 INFO L87 Difference]: Start difference. First operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-07 14:02:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:41,711 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2022-04-07 14:02:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2022-04-07 14:02:41,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:41,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:41,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:41,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-07 14:02:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 201 transitions. [2022-04-07 14:02:41,717 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 201 transitions. Word has length 47 [2022-04-07 14:02:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:41,718 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 201 transitions. [2022-04-07 14:02:41,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 14:02:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 201 transitions. [2022-04-07 14:02:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-07 14:02:41,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:41,719 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:41,741 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-07 14:02:41,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-07 14:02:41,931 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:41,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-07 14:02:41,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:41,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370835210] [2022-04-07 14:02:41,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:41,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:41,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:41,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [247907066] [2022-04-07 14:02:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:41,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:41,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:41,944 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-07 14:02:41,950 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-07 14:02:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:41,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 14:02:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:42,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:42,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {4460#true} call ULTIMATE.init(); {4460#true} is VALID [2022-04-07 14:02:42,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {4468#(<= ~counter~0 0)} assume true; {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4468#(<= ~counter~0 0)} {4460#true} #102#return; {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {4468#(<= ~counter~0 0)} call #t~ret9 := main(); {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {4468#(<= ~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; {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,273 INFO L272 TraceCheckUtils]: 6: Hoare triple {4468#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {4468#(<= ~counter~0 0)} ~cond := #in~cond; {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {4468#(<= ~counter~0 0)} assume !(0 == ~cond); {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {4468#(<= ~counter~0 0)} assume true; {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,274 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4468#(<= ~counter~0 0)} {4468#(<= ~counter~0 0)} #90#return; {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,274 INFO L272 TraceCheckUtils]: 11: Hoare triple {4468#(<= ~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)); {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {4468#(<= ~counter~0 0)} ~cond := #in~cond; {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {4468#(<= ~counter~0 0)} assume !(0 == ~cond); {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {4468#(<= ~counter~0 0)} assume true; {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,276 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4468#(<= ~counter~0 0)} {4468#(<= ~counter~0 0)} #92#return; {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {4468#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4468#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:42,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {4468#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4517#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:42,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {4517#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {4517#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:42,278 INFO L272 TraceCheckUtils]: 19: Hoare triple {4517#(<= ~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)); {4517#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:42,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {4517#(<= ~counter~0 1)} ~cond := #in~cond; {4517#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:42,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {4517#(<= ~counter~0 1)} assume !(0 == ~cond); {4517#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:42,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {4517#(<= ~counter~0 1)} assume true; {4517#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:42,279 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4517#(<= ~counter~0 1)} {4517#(<= ~counter~0 1)} #94#return; {4517#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:42,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {4517#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4517#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:42,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {4517#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4542#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:42,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {4542#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {4542#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:42,281 INFO L272 TraceCheckUtils]: 27: Hoare triple {4542#(<= ~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)); {4542#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:42,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {4542#(<= ~counter~0 2)} ~cond := #in~cond; {4542#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:42,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {4542#(<= ~counter~0 2)} assume !(0 == ~cond); {4542#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:42,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {4542#(<= ~counter~0 2)} assume true; {4542#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:42,283 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4542#(<= ~counter~0 2)} {4542#(<= ~counter~0 2)} #96#return; {4542#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:42,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {4542#(<= ~counter~0 2)} assume !(~r~0 > 0); {4542#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:42,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {4542#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4567#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:42,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {4567#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {4567#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:42,284 INFO L272 TraceCheckUtils]: 35: Hoare triple {4567#(<= ~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)); {4567#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:42,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {4567#(<= ~counter~0 3)} ~cond := #in~cond; {4567#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:42,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {4567#(<= ~counter~0 3)} assume !(0 == ~cond); {4567#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:42,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {4567#(<= ~counter~0 3)} assume true; {4567#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:42,286 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4567#(<= ~counter~0 3)} {4567#(<= ~counter~0 3)} #98#return; {4567#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:42,286 INFO L290 TraceCheckUtils]: 40: Hoare triple {4567#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4567#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:42,287 INFO L290 TraceCheckUtils]: 41: Hoare triple {4567#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4592#(<= |main_#t~post8| 3)} is VALID [2022-04-07 14:02:42,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {4592#(<= |main_#t~post8| 3)} assume !(#t~post8 < 50);havoc #t~post8; {4461#false} is VALID [2022-04-07 14:02:42,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {4461#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4461#false} is VALID [2022-04-07 14:02:42,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {4461#false} assume !(#t~post6 < 50);havoc #t~post6; {4461#false} is VALID [2022-04-07 14:02:42,287 INFO L272 TraceCheckUtils]: 45: Hoare triple {4461#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4461#false} is VALID [2022-04-07 14:02:42,287 INFO L290 TraceCheckUtils]: 46: Hoare triple {4461#false} ~cond := #in~cond; {4461#false} is VALID [2022-04-07 14:02:42,288 INFO L290 TraceCheckUtils]: 47: Hoare triple {4461#false} assume 0 == ~cond; {4461#false} is VALID [2022-04-07 14:02:42,288 INFO L290 TraceCheckUtils]: 48: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-04-07 14:02:42,288 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-07 14:02:42,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:42,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-04-07 14:02:42,544 INFO L290 TraceCheckUtils]: 47: Hoare triple {4461#false} assume 0 == ~cond; {4461#false} is VALID [2022-04-07 14:02:42,544 INFO L290 TraceCheckUtils]: 46: Hoare triple {4461#false} ~cond := #in~cond; {4461#false} is VALID [2022-04-07 14:02:42,544 INFO L272 TraceCheckUtils]: 45: Hoare triple {4461#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4461#false} is VALID [2022-04-07 14:02:42,544 INFO L290 TraceCheckUtils]: 44: Hoare triple {4461#false} assume !(#t~post6 < 50);havoc #t~post6; {4461#false} is VALID [2022-04-07 14:02:42,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {4461#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4461#false} is VALID [2022-04-07 14:02:42,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {4632#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {4461#false} is VALID [2022-04-07 14:02:42,545 INFO L290 TraceCheckUtils]: 41: Hoare triple {4636#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4632#(< |main_#t~post8| 50)} is VALID [2022-04-07 14:02:42,545 INFO L290 TraceCheckUtils]: 40: Hoare triple {4636#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4636#(< ~counter~0 50)} is VALID [2022-04-07 14:02:42,545 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4460#true} {4636#(< ~counter~0 50)} #98#return; {4636#(< ~counter~0 50)} is VALID [2022-04-07 14:02:42,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-07 14:02:42,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-07 14:02:42,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-07 14:02:42,546 INFO L272 TraceCheckUtils]: 35: Hoare triple {4636#(< ~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)); {4460#true} is VALID [2022-04-07 14:02:42,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {4636#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {4636#(< ~counter~0 50)} is VALID [2022-04-07 14:02:42,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {4661#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4636#(< ~counter~0 50)} is VALID [2022-04-07 14:02:42,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {4661#(< ~counter~0 49)} assume !(~r~0 > 0); {4661#(< ~counter~0 49)} is VALID [2022-04-07 14:02:42,548 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4460#true} {4661#(< ~counter~0 49)} #96#return; {4661#(< ~counter~0 49)} is VALID [2022-04-07 14:02:42,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-07 14:02:42,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-07 14:02:42,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-07 14:02:42,549 INFO L272 TraceCheckUtils]: 27: Hoare triple {4661#(< ~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)); {4460#true} is VALID [2022-04-07 14:02:42,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {4661#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {4661#(< ~counter~0 49)} is VALID [2022-04-07 14:02:42,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {4686#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4661#(< ~counter~0 49)} is VALID [2022-04-07 14:02:42,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {4686#(< ~counter~0 48)} assume !!(0 != ~r~0); {4686#(< ~counter~0 48)} is VALID [2022-04-07 14:02:42,550 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4460#true} {4686#(< ~counter~0 48)} #94#return; {4686#(< ~counter~0 48)} is VALID [2022-04-07 14:02:42,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-07 14:02:42,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-07 14:02:42,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-07 14:02:42,550 INFO L272 TraceCheckUtils]: 19: Hoare triple {4686#(< ~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)); {4460#true} is VALID [2022-04-07 14:02:42,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {4686#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {4686#(< ~counter~0 48)} is VALID [2022-04-07 14:02:42,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {4711#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4686#(< ~counter~0 48)} is VALID [2022-04-07 14:02:42,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {4711#(< ~counter~0 47)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4711#(< ~counter~0 47)} is VALID [2022-04-07 14:02:42,552 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4460#true} {4711#(< ~counter~0 47)} #92#return; {4711#(< ~counter~0 47)} is VALID [2022-04-07 14:02:42,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-07 14:02:42,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-07 14:02:42,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-07 14:02:42,552 INFO L272 TraceCheckUtils]: 11: Hoare triple {4711#(< ~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)); {4460#true} is VALID [2022-04-07 14:02:42,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4460#true} {4711#(< ~counter~0 47)} #90#return; {4711#(< ~counter~0 47)} is VALID [2022-04-07 14:02:42,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-07 14:02:42,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-07 14:02:42,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-07 14:02:42,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {4711#(< ~counter~0 47)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4460#true} is VALID [2022-04-07 14:02:42,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {4711#(< ~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; {4711#(< ~counter~0 47)} is VALID [2022-04-07 14:02:42,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {4711#(< ~counter~0 47)} call #t~ret9 := main(); {4711#(< ~counter~0 47)} is VALID [2022-04-07 14:02:42,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4711#(< ~counter~0 47)} {4460#true} #102#return; {4711#(< ~counter~0 47)} is VALID [2022-04-07 14:02:42,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {4711#(< ~counter~0 47)} assume true; {4711#(< ~counter~0 47)} is VALID [2022-04-07 14:02:42,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4711#(< ~counter~0 47)} is VALID [2022-04-07 14:02:42,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {4460#true} call ULTIMATE.init(); {4460#true} is VALID [2022-04-07 14:02:42,554 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-07 14:02:42,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:42,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370835210] [2022-04-07 14:02:42,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:42,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247907066] [2022-04-07 14:02:42,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247907066] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:42,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:42,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-07 14:02:42,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12006883] [2022-04-07 14:02:42,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:42,556 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-07 14:02:42,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:42,556 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-07 14:02:42,621 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-07 14:02:42,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 14:02:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:42,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 14:02:42,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-07 14:02:42,622 INFO L87 Difference]: Start difference. First operand 154 states and 201 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-07 14:02:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:43,250 INFO L93 Difference]: Finished difference Result 343 states and 458 transitions. [2022-04-07 14:02:43,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-07 14:02:43,250 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-07 14:02:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:43,251 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-07 14:02:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-07 14:02:43,254 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-07 14:02:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-07 14:02:43,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 194 transitions. [2022-04-07 14:02:43,393 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-07 14:02:43,400 INFO L225 Difference]: With dead ends: 343 [2022-04-07 14:02:43,401 INFO L226 Difference]: Without dead ends: 258 [2022-04-07 14:02:43,401 INFO L912 BasicCegarLoop]: 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-07 14:02:43,402 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 133 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:43,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 262 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 14:02:43,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-07 14:02:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 236. [2022-04-07 14:02:43,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:43,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-07 14:02:43,503 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-07 14:02:43,504 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-07 14:02:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:43,526 INFO L93 Difference]: Finished difference Result 258 states and 329 transitions. [2022-04-07 14:02:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 329 transitions. [2022-04-07 14:02:43,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:43,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:43,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 258 states. [2022-04-07 14:02:43,528 INFO L87 Difference]: Start difference. First operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 258 states. [2022-04-07 14:02:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:43,535 INFO L93 Difference]: Finished difference Result 258 states and 329 transitions. [2022-04-07 14:02:43,535 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 329 transitions. [2022-04-07 14:02:43,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:43,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:43,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:43,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-07 14:02:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 310 transitions. [2022-04-07 14:02:43,543 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 310 transitions. Word has length 49 [2022-04-07 14:02:43,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:43,543 INFO L478 AbstractCegarLoop]: Abstraction has 236 states and 310 transitions. [2022-04-07 14:02:43,544 INFO L479 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-07 14:02:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 310 transitions. [2022-04-07 14:02:43,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 14:02:43,544 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:43,544 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:43,565 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-07 14:02:43,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:43,759 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:43,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:43,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-07 14:02:43,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:43,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384596813] [2022-04-07 14:02:43,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:43,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:43,774 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:43,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661943334] [2022-04-07 14:02:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:43,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:43,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:43,775 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-07 14:02:43,783 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-07 14:02:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:43,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 14:02:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:43,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:44,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {6091#true} call ULTIMATE.init(); {6091#true} is VALID [2022-04-07 14:02:44,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {6091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {6099#(<= ~counter~0 0)} assume true; {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6099#(<= ~counter~0 0)} {6091#true} #102#return; {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {6099#(<= ~counter~0 0)} call #t~ret9 := main(); {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {6099#(<= ~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; {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,108 INFO L272 TraceCheckUtils]: 6: Hoare triple {6099#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {6099#(<= ~counter~0 0)} ~cond := #in~cond; {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {6099#(<= ~counter~0 0)} assume !(0 == ~cond); {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {6099#(<= ~counter~0 0)} assume true; {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,109 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6099#(<= ~counter~0 0)} {6099#(<= ~counter~0 0)} #90#return; {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,109 INFO L272 TraceCheckUtils]: 11: Hoare triple {6099#(<= ~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)); {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {6099#(<= ~counter~0 0)} ~cond := #in~cond; {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {6099#(<= ~counter~0 0)} assume !(0 == ~cond); {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {6099#(<= ~counter~0 0)} assume true; {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,111 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6099#(<= ~counter~0 0)} {6099#(<= ~counter~0 0)} #92#return; {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {6099#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6099#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:44,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {6099#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6148#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:44,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {6148#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6148#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:44,112 INFO L272 TraceCheckUtils]: 19: Hoare triple {6148#(<= ~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)); {6148#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:44,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {6148#(<= ~counter~0 1)} ~cond := #in~cond; {6148#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:44,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {6148#(<= ~counter~0 1)} assume !(0 == ~cond); {6148#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:44,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {6148#(<= ~counter~0 1)} assume true; {6148#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:44,113 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6148#(<= ~counter~0 1)} {6148#(<= ~counter~0 1)} #94#return; {6148#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:44,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {6148#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6148#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:44,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {6148#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6173#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:44,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {6173#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {6173#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:44,115 INFO L272 TraceCheckUtils]: 27: Hoare triple {6173#(<= ~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)); {6173#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:44,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {6173#(<= ~counter~0 2)} ~cond := #in~cond; {6173#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:44,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {6173#(<= ~counter~0 2)} assume !(0 == ~cond); {6173#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:44,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {6173#(<= ~counter~0 2)} assume true; {6173#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:44,116 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6173#(<= ~counter~0 2)} {6173#(<= ~counter~0 2)} #96#return; {6173#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:44,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {6173#(<= ~counter~0 2)} assume !(~r~0 > 0); {6173#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:44,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {6173#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6198#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:44,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {6198#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {6198#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:44,118 INFO L272 TraceCheckUtils]: 35: Hoare triple {6198#(<= ~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)); {6198#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:44,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {6198#(<= ~counter~0 3)} ~cond := #in~cond; {6198#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:44,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {6198#(<= ~counter~0 3)} assume !(0 == ~cond); {6198#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:44,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {6198#(<= ~counter~0 3)} assume true; {6198#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:44,120 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6198#(<= ~counter~0 3)} {6198#(<= ~counter~0 3)} #98#return; {6198#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:44,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {6198#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6198#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:44,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {6198#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6223#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:44,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {6223#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {6223#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:44,121 INFO L272 TraceCheckUtils]: 43: Hoare triple {6223#(<= ~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)); {6223#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:44,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {6223#(<= ~counter~0 4)} ~cond := #in~cond; {6223#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:44,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {6223#(<= ~counter~0 4)} assume !(0 == ~cond); {6223#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:44,123 INFO L290 TraceCheckUtils]: 46: Hoare triple {6223#(<= ~counter~0 4)} assume true; {6223#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:44,123 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6223#(<= ~counter~0 4)} {6223#(<= ~counter~0 4)} #98#return; {6223#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:44,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {6223#(<= ~counter~0 4)} assume !(~r~0 < 0); {6223#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:44,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {6223#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6248#(<= |main_#t~post6| 4)} is VALID [2022-04-07 14:02:44,124 INFO L290 TraceCheckUtils]: 50: Hoare triple {6248#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {6092#false} is VALID [2022-04-07 14:02:44,124 INFO L272 TraceCheckUtils]: 51: Hoare triple {6092#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6092#false} is VALID [2022-04-07 14:02:44,124 INFO L290 TraceCheckUtils]: 52: Hoare triple {6092#false} ~cond := #in~cond; {6092#false} is VALID [2022-04-07 14:02:44,124 INFO L290 TraceCheckUtils]: 53: Hoare triple {6092#false} assume 0 == ~cond; {6092#false} is VALID [2022-04-07 14:02:44,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {6092#false} assume !false; {6092#false} is VALID [2022-04-07 14:02:44,125 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-07 14:02:44,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:44,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {6092#false} assume !false; {6092#false} is VALID [2022-04-07 14:02:44,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {6092#false} assume 0 == ~cond; {6092#false} is VALID [2022-04-07 14:02:44,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {6092#false} ~cond := #in~cond; {6092#false} is VALID [2022-04-07 14:02:44,433 INFO L272 TraceCheckUtils]: 51: Hoare triple {6092#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6092#false} is VALID [2022-04-07 14:02:44,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {6276#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {6092#false} is VALID [2022-04-07 14:02:44,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {6280#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6276#(< |main_#t~post6| 50)} is VALID [2022-04-07 14:02:44,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {6280#(< ~counter~0 50)} assume !(~r~0 < 0); {6280#(< ~counter~0 50)} is VALID [2022-04-07 14:02:44,434 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6091#true} {6280#(< ~counter~0 50)} #98#return; {6280#(< ~counter~0 50)} is VALID [2022-04-07 14:02:44,435 INFO L290 TraceCheckUtils]: 46: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-07 14:02:44,435 INFO L290 TraceCheckUtils]: 45: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-07 14:02:44,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-07 14:02:44,435 INFO L272 TraceCheckUtils]: 43: Hoare triple {6280#(< ~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)); {6091#true} is VALID [2022-04-07 14:02:44,435 INFO L290 TraceCheckUtils]: 42: Hoare triple {6280#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {6280#(< ~counter~0 50)} is VALID [2022-04-07 14:02:44,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {6305#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6280#(< ~counter~0 50)} is VALID [2022-04-07 14:02:44,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {6305#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6305#(< ~counter~0 49)} is VALID [2022-04-07 14:02:44,436 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6091#true} {6305#(< ~counter~0 49)} #98#return; {6305#(< ~counter~0 49)} is VALID [2022-04-07 14:02:44,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-07 14:02:44,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-07 14:02:44,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-07 14:02:44,436 INFO L272 TraceCheckUtils]: 35: Hoare triple {6305#(< ~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)); {6091#true} is VALID [2022-04-07 14:02:44,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {6305#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {6305#(< ~counter~0 49)} is VALID [2022-04-07 14:02:44,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {6330#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6305#(< ~counter~0 49)} is VALID [2022-04-07 14:02:44,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {6330#(< ~counter~0 48)} assume !(~r~0 > 0); {6330#(< ~counter~0 48)} is VALID [2022-04-07 14:02:44,438 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6091#true} {6330#(< ~counter~0 48)} #96#return; {6330#(< ~counter~0 48)} is VALID [2022-04-07 14:02:44,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-07 14:02:44,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-07 14:02:44,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-07 14:02:44,438 INFO L272 TraceCheckUtils]: 27: Hoare triple {6330#(< ~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)); {6091#true} is VALID [2022-04-07 14:02:44,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {6330#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {6330#(< ~counter~0 48)} is VALID [2022-04-07 14:02:44,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {6355#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6330#(< ~counter~0 48)} is VALID [2022-04-07 14:02:44,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {6355#(< ~counter~0 47)} assume !!(0 != ~r~0); {6355#(< ~counter~0 47)} is VALID [2022-04-07 14:02:44,440 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6091#true} {6355#(< ~counter~0 47)} #94#return; {6355#(< ~counter~0 47)} is VALID [2022-04-07 14:02:44,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-07 14:02:44,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-07 14:02:44,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-07 14:02:44,441 INFO L272 TraceCheckUtils]: 19: Hoare triple {6355#(< ~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)); {6091#true} is VALID [2022-04-07 14:02:44,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {6355#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {6355#(< ~counter~0 47)} is VALID [2022-04-07 14:02:44,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {6380#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6355#(< ~counter~0 47)} is VALID [2022-04-07 14:02:44,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {6380#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6380#(< ~counter~0 46)} is VALID [2022-04-07 14:02:44,442 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6091#true} {6380#(< ~counter~0 46)} #92#return; {6380#(< ~counter~0 46)} is VALID [2022-04-07 14:02:44,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-07 14:02:44,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-07 14:02:44,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-07 14:02:44,443 INFO L272 TraceCheckUtils]: 11: Hoare triple {6380#(< ~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)); {6091#true} is VALID [2022-04-07 14:02:44,447 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6091#true} {6380#(< ~counter~0 46)} #90#return; {6380#(< ~counter~0 46)} is VALID [2022-04-07 14:02:44,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-07 14:02:44,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-07 14:02:44,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-07 14:02:44,448 INFO L272 TraceCheckUtils]: 6: Hoare triple {6380#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6091#true} is VALID [2022-04-07 14:02:44,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {6380#(< ~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; {6380#(< ~counter~0 46)} is VALID [2022-04-07 14:02:44,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {6380#(< ~counter~0 46)} call #t~ret9 := main(); {6380#(< ~counter~0 46)} is VALID [2022-04-07 14:02:44,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6380#(< ~counter~0 46)} {6091#true} #102#return; {6380#(< ~counter~0 46)} is VALID [2022-04-07 14:02:44,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {6380#(< ~counter~0 46)} assume true; {6380#(< ~counter~0 46)} is VALID [2022-04-07 14:02:44,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {6091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6380#(< ~counter~0 46)} is VALID [2022-04-07 14:02:44,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {6091#true} call ULTIMATE.init(); {6091#true} is VALID [2022-04-07 14:02:44,450 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-07 14:02:44,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:44,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384596813] [2022-04-07 14:02:44,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:44,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661943334] [2022-04-07 14:02:44,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661943334] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:44,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:44,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-07 14:02:44,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427155765] [2022-04-07 14:02:44,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:44,452 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-07 14:02:44,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:44,452 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-07 14:02:44,529 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-07 14:02:44,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 14:02:44,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:44,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 14:02:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-07 14:02:44,530 INFO L87 Difference]: Start difference. First operand 236 states and 310 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-07 14:02:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:45,452 INFO L93 Difference]: Finished difference Result 338 states and 453 transitions. [2022-04-07 14:02:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-07 14:02:45,452 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-07 14:02:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:45,453 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-07 14:02:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-07 14:02:45,457 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-07 14:02:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-07 14:02:45,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 204 transitions. [2022-04-07 14:02:45,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-07 14:02:45,630 INFO L225 Difference]: With dead ends: 338 [2022-04-07 14:02:45,630 INFO L226 Difference]: Without dead ends: 333 [2022-04-07 14:02:45,630 INFO L912 BasicCegarLoop]: 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-07 14:02:45,631 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 296 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:45,631 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 226 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 14:02:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-04-07 14:02:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 319. [2022-04-07 14:02:45,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:45,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2022-04-07 14:02:45,764 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2022-04-07 14:02:45,765 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2022-04-07 14:02:45,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:45,774 INFO L93 Difference]: Finished difference Result 333 states and 435 transitions. [2022-04-07 14:02:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 435 transitions. [2022-04-07 14:02:45,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:45,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:45,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) Second operand 333 states. [2022-04-07 14:02:45,777 INFO L87 Difference]: Start difference. First operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) Second operand 333 states. [2022-04-07 14:02:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:45,786 INFO L93 Difference]: Finished difference Result 333 states and 435 transitions. [2022-04-07 14:02:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 435 transitions. [2022-04-07 14:02:45,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:45,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:45,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:45,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:45,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2022-04-07 14:02:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 418 transitions. [2022-04-07 14:02:45,798 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 418 transitions. Word has length 55 [2022-04-07 14:02:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:45,798 INFO L478 AbstractCegarLoop]: Abstraction has 319 states and 418 transitions. [2022-04-07 14:02:45,799 INFO L479 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-07 14:02:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 418 transitions. [2022-04-07 14:02:45,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-07 14:02:45,800 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:45,800 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:45,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-07 14:02:46,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-07 14:02:46,015 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash -304792209, now seen corresponding path program 1 times [2022-04-07 14:02:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:46,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851604180] [2022-04-07 14:02:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:46,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:46,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:46,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766621275] [2022-04-07 14:02:46,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:46,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:46,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:46,031 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-07 14:02:46,055 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-07 14:02:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:46,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-07 14:02:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:46,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:46,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {8022#true} call ULTIMATE.init(); {8022#true} is VALID [2022-04-07 14:02:46,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {8022#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8022#true} is VALID [2022-04-07 14:02:46,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8022#true} {8022#true} #102#return; {8022#true} is VALID [2022-04-07 14:02:46,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {8022#true} call #t~ret9 := main(); {8022#true} is VALID [2022-04-07 14:02:46,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {8022#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; {8022#true} is VALID [2022-04-07 14:02:46,411 INFO L272 TraceCheckUtils]: 6: Hoare triple {8022#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8022#true} is VALID [2022-04-07 14:02:46,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,411 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8022#true} {8022#true} #90#return; {8022#true} is VALID [2022-04-07 14:02:46,412 INFO L272 TraceCheckUtils]: 11: Hoare triple {8022#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)); {8022#true} is VALID [2022-04-07 14:02:46,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,412 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8022#true} {8022#true} #92#return; {8022#true} is VALID [2022-04-07 14:02:46,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {8022#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {8075#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,413 INFO L272 TraceCheckUtils]: 19: Hoare triple {8075#(<= 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)); {8022#true} is VALID [2022-04-07 14:02:46,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,413 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #94#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {8075#(<= main_~v~0 1)} assume !!(0 != ~r~0); {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {8075#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,414 INFO L272 TraceCheckUtils]: 27: Hoare triple {8075#(<= 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)); {8022#true} is VALID [2022-04-07 14:02:46,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,415 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #96#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {8075#(<= main_~v~0 1)} assume !(~r~0 > 0); {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {8075#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,416 INFO L272 TraceCheckUtils]: 35: Hoare triple {8075#(<= 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)); {8022#true} is VALID [2022-04-07 14:02:46,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,417 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #98#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {8075#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {8075#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,418 INFO L290 TraceCheckUtils]: 42: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,418 INFO L272 TraceCheckUtils]: 43: Hoare triple {8075#(<= 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)); {8022#true} is VALID [2022-04-07 14:02:46,418 INFO L290 TraceCheckUtils]: 44: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,418 INFO L290 TraceCheckUtils]: 45: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,418 INFO L290 TraceCheckUtils]: 46: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,419 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #98#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {8075#(<= main_~v~0 1)} assume !(~r~0 < 0); {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {8075#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,419 INFO L272 TraceCheckUtils]: 51: Hoare triple {8075#(<= 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)); {8022#true} is VALID [2022-04-07 14:02:46,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,420 INFO L290 TraceCheckUtils]: 53: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,420 INFO L290 TraceCheckUtils]: 54: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,420 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #94#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {8075#(<= main_~v~0 1)} assume !!(0 != ~r~0); {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {8075#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,421 INFO L272 TraceCheckUtils]: 59: Hoare triple {8075#(<= 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)); {8022#true} is VALID [2022-04-07 14:02:46,421 INFO L290 TraceCheckUtils]: 60: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,421 INFO L290 TraceCheckUtils]: 61: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,421 INFO L290 TraceCheckUtils]: 62: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,422 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #96#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {8075#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-07 14:02:46,424 INFO L290 TraceCheckUtils]: 65: Hoare triple {8220#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-07 14:02:46,424 INFO L290 TraceCheckUtils]: 66: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !(#t~post7 < 50);havoc #t~post7; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-07 14:02:46,424 INFO L290 TraceCheckUtils]: 67: Hoare triple {8220#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-07 14:02:46,425 INFO L290 TraceCheckUtils]: 68: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-07 14:02:46,425 INFO L272 TraceCheckUtils]: 69: Hoare triple {8220#(< 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)); {8022#true} is VALID [2022-04-07 14:02:46,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,425 INFO L290 TraceCheckUtils]: 72: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,426 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8022#true} {8220#(< 0 (+ main_~r~0 1))} #98#return; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-07 14:02:46,426 INFO L290 TraceCheckUtils]: 74: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8023#false} is VALID [2022-04-07 14:02:46,426 INFO L290 TraceCheckUtils]: 75: Hoare triple {8023#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L290 TraceCheckUtils]: 76: Hoare triple {8023#false} assume !!(#t~post8 < 50);havoc #t~post8; {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L272 TraceCheckUtils]: 77: Hoare triple {8023#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)); {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L290 TraceCheckUtils]: 78: Hoare triple {8023#false} ~cond := #in~cond; {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L290 TraceCheckUtils]: 79: Hoare triple {8023#false} assume !(0 == ~cond); {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L290 TraceCheckUtils]: 80: Hoare triple {8023#false} assume true; {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8023#false} {8023#false} #98#return; {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L290 TraceCheckUtils]: 82: Hoare triple {8023#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L290 TraceCheckUtils]: 83: Hoare triple {8023#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L290 TraceCheckUtils]: 84: Hoare triple {8023#false} assume !(#t~post8 < 50);havoc #t~post8; {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L290 TraceCheckUtils]: 85: Hoare triple {8023#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L290 TraceCheckUtils]: 86: Hoare triple {8023#false} assume !(#t~post6 < 50);havoc #t~post6; {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L272 TraceCheckUtils]: 87: Hoare triple {8023#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8023#false} is VALID [2022-04-07 14:02:46,427 INFO L290 TraceCheckUtils]: 88: Hoare triple {8023#false} ~cond := #in~cond; {8023#false} is VALID [2022-04-07 14:02:46,428 INFO L290 TraceCheckUtils]: 89: Hoare triple {8023#false} assume 0 == ~cond; {8023#false} is VALID [2022-04-07 14:02:46,428 INFO L290 TraceCheckUtils]: 90: Hoare triple {8023#false} assume !false; {8023#false} is VALID [2022-04-07 14:02:46,428 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-07 14:02:46,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:46,738 INFO L290 TraceCheckUtils]: 90: Hoare triple {8023#false} assume !false; {8023#false} is VALID [2022-04-07 14:02:46,738 INFO L290 TraceCheckUtils]: 89: Hoare triple {8023#false} assume 0 == ~cond; {8023#false} is VALID [2022-04-07 14:02:46,738 INFO L290 TraceCheckUtils]: 88: Hoare triple {8023#false} ~cond := #in~cond; {8023#false} is VALID [2022-04-07 14:02:46,738 INFO L272 TraceCheckUtils]: 87: Hoare triple {8023#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8023#false} is VALID [2022-04-07 14:02:46,738 INFO L290 TraceCheckUtils]: 86: Hoare triple {8023#false} assume !(#t~post6 < 50);havoc #t~post6; {8023#false} is VALID [2022-04-07 14:02:46,738 INFO L290 TraceCheckUtils]: 85: Hoare triple {8023#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8023#false} is VALID [2022-04-07 14:02:46,738 INFO L290 TraceCheckUtils]: 84: Hoare triple {8023#false} assume !(#t~post8 < 50);havoc #t~post8; {8023#false} is VALID [2022-04-07 14:02:46,739 INFO L290 TraceCheckUtils]: 83: Hoare triple {8023#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8023#false} is VALID [2022-04-07 14:02:46,739 INFO L290 TraceCheckUtils]: 82: Hoare triple {8023#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8023#false} is VALID [2022-04-07 14:02:46,739 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8022#true} {8023#false} #98#return; {8023#false} is VALID [2022-04-07 14:02:46,739 INFO L290 TraceCheckUtils]: 80: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,739 INFO L290 TraceCheckUtils]: 79: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,739 INFO L290 TraceCheckUtils]: 78: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,739 INFO L272 TraceCheckUtils]: 77: Hoare triple {8023#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)); {8022#true} is VALID [2022-04-07 14:02:46,739 INFO L290 TraceCheckUtils]: 76: Hoare triple {8023#false} assume !!(#t~post8 < 50);havoc #t~post8; {8023#false} is VALID [2022-04-07 14:02:46,739 INFO L290 TraceCheckUtils]: 75: Hoare triple {8023#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8023#false} is VALID [2022-04-07 14:02:46,740 INFO L290 TraceCheckUtils]: 74: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8023#false} is VALID [2022-04-07 14:02:46,741 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8022#true} {8220#(< 0 (+ main_~r~0 1))} #98#return; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-07 14:02:46,741 INFO L290 TraceCheckUtils]: 72: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,741 INFO L290 TraceCheckUtils]: 71: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,741 INFO L290 TraceCheckUtils]: 70: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,741 INFO L272 TraceCheckUtils]: 69: Hoare triple {8220#(< 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)); {8022#true} is VALID [2022-04-07 14:02:46,741 INFO L290 TraceCheckUtils]: 68: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-07 14:02:46,741 INFO L290 TraceCheckUtils]: 67: Hoare triple {8220#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-07 14:02:46,742 INFO L290 TraceCheckUtils]: 66: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !(#t~post7 < 50);havoc #t~post7; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-07 14:02:46,742 INFO L290 TraceCheckUtils]: 65: Hoare triple {8220#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-07 14:02:46,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {8075#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-07 14:02:46,743 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #96#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,744 INFO L272 TraceCheckUtils]: 59: Hoare triple {8075#(<= 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)); {8022#true} is VALID [2022-04-07 14:02:46,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {8075#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {8075#(<= main_~v~0 1)} assume !!(0 != ~r~0); {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,745 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #94#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,745 INFO L290 TraceCheckUtils]: 54: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,745 INFO L290 TraceCheckUtils]: 53: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,745 INFO L290 TraceCheckUtils]: 52: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,746 INFO L272 TraceCheckUtils]: 51: Hoare triple {8075#(<= 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)); {8022#true} is VALID [2022-04-07 14:02:46,746 INFO L290 TraceCheckUtils]: 50: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,746 INFO L290 TraceCheckUtils]: 49: Hoare triple {8075#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {8075#(<= main_~v~0 1)} assume !(~r~0 < 0); {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,747 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #98#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,747 INFO L272 TraceCheckUtils]: 43: Hoare triple {8075#(<= 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)); {8022#true} is VALID [2022-04-07 14:02:46,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {8075#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {8075#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,749 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #98#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,749 INFO L272 TraceCheckUtils]: 35: Hoare triple {8075#(<= 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)); {8022#true} is VALID [2022-04-07 14:02:46,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {8075#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {8075#(<= main_~v~0 1)} assume !(~r~0 > 0); {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,751 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #96#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,751 INFO L272 TraceCheckUtils]: 27: Hoare triple {8075#(<= 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)); {8022#true} is VALID [2022-04-07 14:02:46,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {8075#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {8075#(<= main_~v~0 1)} assume !!(0 != ~r~0); {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,753 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #94#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,753 INFO L272 TraceCheckUtils]: 19: Hoare triple {8075#(<= 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)); {8022#true} is VALID [2022-04-07 14:02:46,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {8075#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {8022#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8075#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:46,755 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8022#true} {8022#true} #92#return; {8022#true} is VALID [2022-04-07 14:02:46,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,755 INFO L272 TraceCheckUtils]: 11: Hoare triple {8022#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)); {8022#true} is VALID [2022-04-07 14:02:46,755 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8022#true} {8022#true} #90#return; {8022#true} is VALID [2022-04-07 14:02:46,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-07 14:02:46,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-07 14:02:46,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {8022#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8022#true} is VALID [2022-04-07 14:02:46,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {8022#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; {8022#true} is VALID [2022-04-07 14:02:46,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {8022#true} call #t~ret9 := main(); {8022#true} is VALID [2022-04-07 14:02:46,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8022#true} {8022#true} #102#return; {8022#true} is VALID [2022-04-07 14:02:46,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-07 14:02:46,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {8022#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8022#true} is VALID [2022-04-07 14:02:46,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {8022#true} call ULTIMATE.init(); {8022#true} is VALID [2022-04-07 14:02:46,757 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-07 14:02:46,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:46,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851604180] [2022-04-07 14:02:46,757 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:46,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766621275] [2022-04-07 14:02:46,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766621275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:46,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:46,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-07 14:02:46,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136697130] [2022-04-07 14:02:46,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:46,758 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-07 14:02:46,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:46,760 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-07 14:02:46,809 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-07 14:02:46,809 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 14:02:46,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 14:02:46,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:02:46,810 INFO L87 Difference]: Start difference. First operand 319 states and 418 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-07 14:02:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:47,285 INFO L93 Difference]: Finished difference Result 571 states and 778 transitions. [2022-04-07 14:02:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:02:47,286 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-07 14:02:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:47,286 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-07 14:02:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-07 14:02:47,288 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-07 14:02:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-07 14:02:47,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-07 14:02:47,378 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-07 14:02:47,389 INFO L225 Difference]: With dead ends: 571 [2022-04-07 14:02:47,389 INFO L226 Difference]: Without dead ends: 383 [2022-04-07 14:02:47,390 INFO L912 BasicCegarLoop]: 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-07 14:02:47,391 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 18 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:47,391 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 139 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:02:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-07 14:02:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2022-04-07 14:02:47,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:47,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-07 14:02:47,587 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-07 14:02:47,587 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-07 14:02:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:47,599 INFO L93 Difference]: Finished difference Result 383 states and 508 transitions. [2022-04-07 14:02:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 508 transitions. [2022-04-07 14:02:47,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:47,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:47,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) Second operand 383 states. [2022-04-07 14:02:47,602 INFO L87 Difference]: Start difference. First operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) Second operand 383 states. [2022-04-07 14:02:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:47,616 INFO L93 Difference]: Finished difference Result 383 states and 508 transitions. [2022-04-07 14:02:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 508 transitions. [2022-04-07 14:02:47,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:47,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:47,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:47,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-07 14:02:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 505 transitions. [2022-04-07 14:02:47,643 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 505 transitions. Word has length 91 [2022-04-07 14:02:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:47,643 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 505 transitions. [2022-04-07 14:02:47,644 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (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-07 14:02:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 505 transitions. [2022-04-07 14:02:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-07 14:02:47,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:47,645 INFO L499 BasicCegarLoop]: 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-07 14:02:47,668 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-07 14:02:47,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-07 14:02:47,859 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:47,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:47,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1103092705, now seen corresponding path program 2 times [2022-04-07 14:02:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:47,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651668732] [2022-04-07 14:02:47,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:47,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:47,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:47,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647516532] [2022-04-07 14:02:47,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:02:47,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:47,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:47,882 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-07 14:02:47,899 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-07 14:02:47,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:02:47,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:02:47,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 14:02:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:47,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:48,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {10665#true} call ULTIMATE.init(); {10665#true} is VALID [2022-04-07 14:02:48,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {10665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {10673#(<= ~counter~0 0)} assume true; {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10673#(<= ~counter~0 0)} {10665#true} #102#return; {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {10673#(<= ~counter~0 0)} call #t~ret9 := main(); {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {10673#(<= ~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; {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {10673#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {10673#(<= ~counter~0 0)} ~cond := #in~cond; {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {10673#(<= ~counter~0 0)} assume !(0 == ~cond); {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {10673#(<= ~counter~0 0)} assume true; {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,408 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10673#(<= ~counter~0 0)} {10673#(<= ~counter~0 0)} #90#return; {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,408 INFO L272 TraceCheckUtils]: 11: Hoare triple {10673#(<= ~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)); {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {10673#(<= ~counter~0 0)} ~cond := #in~cond; {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {10673#(<= ~counter~0 0)} assume !(0 == ~cond); {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {10673#(<= ~counter~0 0)} assume true; {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,410 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10673#(<= ~counter~0 0)} {10673#(<= ~counter~0 0)} #92#return; {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {10673#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10673#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:48,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {10673#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10722#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:48,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {10722#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {10722#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:48,411 INFO L272 TraceCheckUtils]: 19: Hoare triple {10722#(<= ~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)); {10722#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:48,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {10722#(<= ~counter~0 1)} ~cond := #in~cond; {10722#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:48,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {10722#(<= ~counter~0 1)} assume !(0 == ~cond); {10722#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:48,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {10722#(<= ~counter~0 1)} assume true; {10722#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:48,412 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10722#(<= ~counter~0 1)} {10722#(<= ~counter~0 1)} #94#return; {10722#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:48,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {10722#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10722#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:48,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {10722#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10747#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:48,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {10747#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {10747#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:48,414 INFO L272 TraceCheckUtils]: 27: Hoare triple {10747#(<= ~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)); {10747#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:48,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {10747#(<= ~counter~0 2)} ~cond := #in~cond; {10747#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:48,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {10747#(<= ~counter~0 2)} assume !(0 == ~cond); {10747#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:48,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {10747#(<= ~counter~0 2)} assume true; {10747#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:48,415 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10747#(<= ~counter~0 2)} {10747#(<= ~counter~0 2)} #96#return; {10747#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:48,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {10747#(<= ~counter~0 2)} assume !(~r~0 > 0); {10747#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:48,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {10747#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10772#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:48,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {10772#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {10772#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:48,417 INFO L272 TraceCheckUtils]: 35: Hoare triple {10772#(<= ~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)); {10772#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:48,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {10772#(<= ~counter~0 3)} ~cond := #in~cond; {10772#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:48,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {10772#(<= ~counter~0 3)} assume !(0 == ~cond); {10772#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:48,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {10772#(<= ~counter~0 3)} assume true; {10772#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:48,418 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10772#(<= ~counter~0 3)} {10772#(<= ~counter~0 3)} #98#return; {10772#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:48,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {10772#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10772#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:48,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {10772#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10797#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:48,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {10797#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {10797#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:48,419 INFO L272 TraceCheckUtils]: 43: Hoare triple {10797#(<= ~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)); {10797#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:48,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {10797#(<= ~counter~0 4)} ~cond := #in~cond; {10797#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:48,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {10797#(<= ~counter~0 4)} assume !(0 == ~cond); {10797#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:48,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {10797#(<= ~counter~0 4)} assume true; {10797#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:48,425 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10797#(<= ~counter~0 4)} {10797#(<= ~counter~0 4)} #98#return; {10797#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:48,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {10797#(<= ~counter~0 4)} assume !(~r~0 < 0); {10797#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:48,426 INFO L290 TraceCheckUtils]: 49: Hoare triple {10797#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10822#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:48,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {10822#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {10822#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:48,426 INFO L272 TraceCheckUtils]: 51: Hoare triple {10822#(<= ~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)); {10822#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:48,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {10822#(<= ~counter~0 5)} ~cond := #in~cond; {10822#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:48,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {10822#(<= ~counter~0 5)} assume !(0 == ~cond); {10822#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:48,427 INFO L290 TraceCheckUtils]: 54: Hoare triple {10822#(<= ~counter~0 5)} assume true; {10822#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:48,428 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10822#(<= ~counter~0 5)} {10822#(<= ~counter~0 5)} #94#return; {10822#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:48,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {10822#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10822#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:48,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {10822#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10847#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:48,429 INFO L290 TraceCheckUtils]: 58: Hoare triple {10847#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {10847#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:48,429 INFO L272 TraceCheckUtils]: 59: Hoare triple {10847#(<= ~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)); {10847#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:48,429 INFO L290 TraceCheckUtils]: 60: Hoare triple {10847#(<= ~counter~0 6)} ~cond := #in~cond; {10847#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:48,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {10847#(<= ~counter~0 6)} assume !(0 == ~cond); {10847#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:48,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {10847#(<= ~counter~0 6)} assume true; {10847#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:48,430 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10847#(<= ~counter~0 6)} {10847#(<= ~counter~0 6)} #96#return; {10847#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:48,431 INFO L290 TraceCheckUtils]: 64: Hoare triple {10847#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10847#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:48,431 INFO L290 TraceCheckUtils]: 65: Hoare triple {10847#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10872#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:48,432 INFO L290 TraceCheckUtils]: 66: Hoare triple {10872#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {10872#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:48,432 INFO L272 TraceCheckUtils]: 67: Hoare triple {10872#(<= ~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)); {10872#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:48,433 INFO L290 TraceCheckUtils]: 68: Hoare triple {10872#(<= ~counter~0 7)} ~cond := #in~cond; {10872#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:48,433 INFO L290 TraceCheckUtils]: 69: Hoare triple {10872#(<= ~counter~0 7)} assume !(0 == ~cond); {10872#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:48,433 INFO L290 TraceCheckUtils]: 70: Hoare triple {10872#(<= ~counter~0 7)} assume true; {10872#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:48,434 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10872#(<= ~counter~0 7)} {10872#(<= ~counter~0 7)} #96#return; {10872#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:48,434 INFO L290 TraceCheckUtils]: 72: Hoare triple {10872#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10872#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:48,435 INFO L290 TraceCheckUtils]: 73: Hoare triple {10872#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10897#(<= |main_#t~post7| 7)} is VALID [2022-04-07 14:02:48,435 INFO L290 TraceCheckUtils]: 74: Hoare triple {10897#(<= |main_#t~post7| 7)} assume !(#t~post7 < 50);havoc #t~post7; {10666#false} is VALID [2022-04-07 14:02:48,435 INFO L290 TraceCheckUtils]: 75: Hoare triple {10666#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10666#false} is VALID [2022-04-07 14:02:48,435 INFO L290 TraceCheckUtils]: 76: Hoare triple {10666#false} assume !!(#t~post8 < 50);havoc #t~post8; {10666#false} is VALID [2022-04-07 14:02:48,435 INFO L272 TraceCheckUtils]: 77: Hoare triple {10666#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)); {10666#false} is VALID [2022-04-07 14:02:48,435 INFO L290 TraceCheckUtils]: 78: Hoare triple {10666#false} ~cond := #in~cond; {10666#false} is VALID [2022-04-07 14:02:48,436 INFO L290 TraceCheckUtils]: 79: Hoare triple {10666#false} assume !(0 == ~cond); {10666#false} is VALID [2022-04-07 14:02:48,436 INFO L290 TraceCheckUtils]: 80: Hoare triple {10666#false} assume true; {10666#false} is VALID [2022-04-07 14:02:48,436 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10666#false} {10666#false} #98#return; {10666#false} is VALID [2022-04-07 14:02:48,436 INFO L290 TraceCheckUtils]: 82: Hoare triple {10666#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10666#false} is VALID [2022-04-07 14:02:48,436 INFO L290 TraceCheckUtils]: 83: Hoare triple {10666#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10666#false} is VALID [2022-04-07 14:02:48,436 INFO L290 TraceCheckUtils]: 84: Hoare triple {10666#false} assume !(#t~post8 < 50);havoc #t~post8; {10666#false} is VALID [2022-04-07 14:02:48,436 INFO L290 TraceCheckUtils]: 85: Hoare triple {10666#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10666#false} is VALID [2022-04-07 14:02:48,436 INFO L290 TraceCheckUtils]: 86: Hoare triple {10666#false} assume !(#t~post6 < 50);havoc #t~post6; {10666#false} is VALID [2022-04-07 14:02:48,436 INFO L272 TraceCheckUtils]: 87: Hoare triple {10666#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10666#false} is VALID [2022-04-07 14:02:48,436 INFO L290 TraceCheckUtils]: 88: Hoare triple {10666#false} ~cond := #in~cond; {10666#false} is VALID [2022-04-07 14:02:48,436 INFO L290 TraceCheckUtils]: 89: Hoare triple {10666#false} assume 0 == ~cond; {10666#false} is VALID [2022-04-07 14:02:48,436 INFO L290 TraceCheckUtils]: 90: Hoare triple {10666#false} assume !false; {10666#false} is VALID [2022-04-07 14:02:48,437 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-07 14:02:48,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:48,928 INFO L290 TraceCheckUtils]: 90: Hoare triple {10666#false} assume !false; {10666#false} is VALID [2022-04-07 14:02:48,928 INFO L290 TraceCheckUtils]: 89: Hoare triple {10666#false} assume 0 == ~cond; {10666#false} is VALID [2022-04-07 14:02:48,928 INFO L290 TraceCheckUtils]: 88: Hoare triple {10666#false} ~cond := #in~cond; {10666#false} is VALID [2022-04-07 14:02:48,928 INFO L272 TraceCheckUtils]: 87: Hoare triple {10666#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10666#false} is VALID [2022-04-07 14:02:48,928 INFO L290 TraceCheckUtils]: 86: Hoare triple {10666#false} assume !(#t~post6 < 50);havoc #t~post6; {10666#false} is VALID [2022-04-07 14:02:48,929 INFO L290 TraceCheckUtils]: 85: Hoare triple {10666#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10666#false} is VALID [2022-04-07 14:02:48,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {10666#false} assume !(#t~post8 < 50);havoc #t~post8; {10666#false} is VALID [2022-04-07 14:02:48,929 INFO L290 TraceCheckUtils]: 83: Hoare triple {10666#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10666#false} is VALID [2022-04-07 14:02:48,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {10666#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10666#false} is VALID [2022-04-07 14:02:48,929 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10665#true} {10666#false} #98#return; {10666#false} is VALID [2022-04-07 14:02:48,929 INFO L290 TraceCheckUtils]: 80: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-07 14:02:48,929 INFO L290 TraceCheckUtils]: 79: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-07 14:02:48,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-07 14:02:48,929 INFO L272 TraceCheckUtils]: 77: Hoare triple {10666#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)); {10665#true} is VALID [2022-04-07 14:02:48,929 INFO L290 TraceCheckUtils]: 76: Hoare triple {10666#false} assume !!(#t~post8 < 50);havoc #t~post8; {10666#false} is VALID [2022-04-07 14:02:48,929 INFO L290 TraceCheckUtils]: 75: Hoare triple {10666#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10666#false} is VALID [2022-04-07 14:02:48,930 INFO L290 TraceCheckUtils]: 74: Hoare triple {10997#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {10666#false} is VALID [2022-04-07 14:02:48,930 INFO L290 TraceCheckUtils]: 73: Hoare triple {11001#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10997#(< |main_#t~post7| 50)} is VALID [2022-04-07 14:02:48,930 INFO L290 TraceCheckUtils]: 72: Hoare triple {11001#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11001#(< ~counter~0 50)} is VALID [2022-04-07 14:02:48,931 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10665#true} {11001#(< ~counter~0 50)} #96#return; {11001#(< ~counter~0 50)} is VALID [2022-04-07 14:02:48,931 INFO L290 TraceCheckUtils]: 70: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-07 14:02:48,931 INFO L290 TraceCheckUtils]: 69: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-07 14:02:48,931 INFO L290 TraceCheckUtils]: 68: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-07 14:02:48,931 INFO L272 TraceCheckUtils]: 67: Hoare triple {11001#(< ~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)); {10665#true} is VALID [2022-04-07 14:02:48,931 INFO L290 TraceCheckUtils]: 66: Hoare triple {11001#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {11001#(< ~counter~0 50)} is VALID [2022-04-07 14:02:48,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {11026#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11001#(< ~counter~0 50)} is VALID [2022-04-07 14:02:48,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {11026#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11026#(< ~counter~0 49)} is VALID [2022-04-07 14:02:48,933 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10665#true} {11026#(< ~counter~0 49)} #96#return; {11026#(< ~counter~0 49)} is VALID [2022-04-07 14:02:48,933 INFO L290 TraceCheckUtils]: 62: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-07 14:02:48,933 INFO L290 TraceCheckUtils]: 61: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-07 14:02:48,933 INFO L290 TraceCheckUtils]: 60: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-07 14:02:48,933 INFO L272 TraceCheckUtils]: 59: Hoare triple {11026#(< ~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)); {10665#true} is VALID [2022-04-07 14:02:48,933 INFO L290 TraceCheckUtils]: 58: Hoare triple {11026#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {11026#(< ~counter~0 49)} is VALID [2022-04-07 14:02:48,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {11051#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11026#(< ~counter~0 49)} is VALID [2022-04-07 14:02:48,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {11051#(< ~counter~0 48)} assume !!(0 != ~r~0); {11051#(< ~counter~0 48)} is VALID [2022-04-07 14:02:48,935 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10665#true} {11051#(< ~counter~0 48)} #94#return; {11051#(< ~counter~0 48)} is VALID [2022-04-07 14:02:48,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-07 14:02:48,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-07 14:02:48,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-07 14:02:48,935 INFO L272 TraceCheckUtils]: 51: Hoare triple {11051#(< ~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)); {10665#true} is VALID [2022-04-07 14:02:48,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {11051#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {11051#(< ~counter~0 48)} is VALID [2022-04-07 14:02:48,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {11076#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11051#(< ~counter~0 48)} is VALID [2022-04-07 14:02:48,937 INFO L290 TraceCheckUtils]: 48: Hoare triple {11076#(< ~counter~0 47)} assume !(~r~0 < 0); {11076#(< ~counter~0 47)} is VALID [2022-04-07 14:02:48,937 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10665#true} {11076#(< ~counter~0 47)} #98#return; {11076#(< ~counter~0 47)} is VALID [2022-04-07 14:02:48,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-07 14:02:48,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-07 14:02:48,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-07 14:02:48,938 INFO L272 TraceCheckUtils]: 43: Hoare triple {11076#(< ~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)); {10665#true} is VALID [2022-04-07 14:02:48,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {11076#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {11076#(< ~counter~0 47)} is VALID [2022-04-07 14:02:48,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {11101#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11076#(< ~counter~0 47)} is VALID [2022-04-07 14:02:48,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {11101#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11101#(< ~counter~0 46)} is VALID [2022-04-07 14:02:48,939 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10665#true} {11101#(< ~counter~0 46)} #98#return; {11101#(< ~counter~0 46)} is VALID [2022-04-07 14:02:48,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-07 14:02:48,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-07 14:02:48,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-07 14:02:48,940 INFO L272 TraceCheckUtils]: 35: Hoare triple {11101#(< ~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)); {10665#true} is VALID [2022-04-07 14:02:48,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {11101#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {11101#(< ~counter~0 46)} is VALID [2022-04-07 14:02:48,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {11126#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11101#(< ~counter~0 46)} is VALID [2022-04-07 14:02:48,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {11126#(< ~counter~0 45)} assume !(~r~0 > 0); {11126#(< ~counter~0 45)} is VALID [2022-04-07 14:02:48,941 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10665#true} {11126#(< ~counter~0 45)} #96#return; {11126#(< ~counter~0 45)} is VALID [2022-04-07 14:02:48,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-07 14:02:48,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-07 14:02:48,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-07 14:02:48,942 INFO L272 TraceCheckUtils]: 27: Hoare triple {11126#(< ~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)); {10665#true} is VALID [2022-04-07 14:02:48,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {11126#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {11126#(< ~counter~0 45)} is VALID [2022-04-07 14:02:48,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {11151#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11126#(< ~counter~0 45)} is VALID [2022-04-07 14:02:48,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {11151#(< ~counter~0 44)} assume !!(0 != ~r~0); {11151#(< ~counter~0 44)} is VALID [2022-04-07 14:02:48,943 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10665#true} {11151#(< ~counter~0 44)} #94#return; {11151#(< ~counter~0 44)} is VALID [2022-04-07 14:02:48,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-07 14:02:48,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-07 14:02:48,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-07 14:02:48,944 INFO L272 TraceCheckUtils]: 19: Hoare triple {11151#(< ~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)); {10665#true} is VALID [2022-04-07 14:02:48,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {11151#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {11151#(< ~counter~0 44)} is VALID [2022-04-07 14:02:48,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {11176#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11151#(< ~counter~0 44)} is VALID [2022-04-07 14:02:48,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {11176#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11176#(< ~counter~0 43)} is VALID [2022-04-07 14:02:48,945 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10665#true} {11176#(< ~counter~0 43)} #92#return; {11176#(< ~counter~0 43)} is VALID [2022-04-07 14:02:48,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-07 14:02:48,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-07 14:02:48,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-07 14:02:48,945 INFO L272 TraceCheckUtils]: 11: Hoare triple {11176#(< ~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)); {10665#true} is VALID [2022-04-07 14:02:48,946 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10665#true} {11176#(< ~counter~0 43)} #90#return; {11176#(< ~counter~0 43)} is VALID [2022-04-07 14:02:48,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-07 14:02:48,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-07 14:02:48,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-07 14:02:48,946 INFO L272 TraceCheckUtils]: 6: Hoare triple {11176#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10665#true} is VALID [2022-04-07 14:02:48,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {11176#(< ~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; {11176#(< ~counter~0 43)} is VALID [2022-04-07 14:02:48,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {11176#(< ~counter~0 43)} call #t~ret9 := main(); {11176#(< ~counter~0 43)} is VALID [2022-04-07 14:02:48,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11176#(< ~counter~0 43)} {10665#true} #102#return; {11176#(< ~counter~0 43)} is VALID [2022-04-07 14:02:48,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {11176#(< ~counter~0 43)} assume true; {11176#(< ~counter~0 43)} is VALID [2022-04-07 14:02:48,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {10665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11176#(< ~counter~0 43)} is VALID [2022-04-07 14:02:48,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {10665#true} call ULTIMATE.init(); {10665#true} is VALID [2022-04-07 14:02:48,948 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-07 14:02:48,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:48,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651668732] [2022-04-07 14:02:48,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:48,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647516532] [2022-04-07 14:02:48,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647516532] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:48,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:48,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-07 14:02:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348830213] [2022-04-07 14:02:48,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:48,950 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-07 14:02:48,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:48,951 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-07 14:02:49,066 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-07 14:02:49,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-07 14:02:49,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:49,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-07 14:02:49,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-07 14:02:49,068 INFO L87 Difference]: Start difference. First operand 380 states and 505 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-07 14:02:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:51,247 INFO L93 Difference]: Finished difference Result 1123 states and 1577 transitions. [2022-04-07 14:02:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-07 14:02:51,247 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-07 14:02:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:51,248 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-07 14:02:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 373 transitions. [2022-04-07 14:02:51,253 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-07 14:02:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 373 transitions. [2022-04-07 14:02:51,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 373 transitions. [2022-04-07 14:02:51,578 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-07 14:02:51,638 INFO L225 Difference]: With dead ends: 1123 [2022-04-07 14:02:51,638 INFO L226 Difference]: Without dead ends: 962 [2022-04-07 14:02:51,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=403, Invalid=719, Unknown=0, NotChecked=0, Total=1122 [2022-04-07 14:02:51,641 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 378 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:51,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 451 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 14:02:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-04-07 14:02:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 907. [2022-04-07 14:02:52,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:52,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 962 states. Second operand has 907 states, 686 states have (on average 1.2434402332361516) internal successors, (853), 697 states have internal predecessors, (853), 190 states have call successors, (190), 32 states have call predecessors, (190), 30 states have return successors, (188), 177 states have call predecessors, (188), 188 states have call successors, (188) [2022-04-07 14:02:52,203 INFO L74 IsIncluded]: Start isIncluded. First operand 962 states. Second operand has 907 states, 686 states have (on average 1.2434402332361516) internal successors, (853), 697 states have internal predecessors, (853), 190 states have call successors, (190), 32 states have call predecessors, (190), 30 states have return successors, (188), 177 states have call predecessors, (188), 188 states have call successors, (188) [2022-04-07 14:02:52,204 INFO L87 Difference]: Start difference. First operand 962 states. Second operand has 907 states, 686 states have (on average 1.2434402332361516) internal successors, (853), 697 states have internal predecessors, (853), 190 states have call successors, (190), 32 states have call predecessors, (190), 30 states have return successors, (188), 177 states have call predecessors, (188), 188 states have call successors, (188) [2022-04-07 14:02:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:52,251 INFO L93 Difference]: Finished difference Result 962 states and 1283 transitions. [2022-04-07 14:02:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1283 transitions. [2022-04-07 14:02:52,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:52,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:52,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 686 states have (on average 1.2434402332361516) internal successors, (853), 697 states have internal predecessors, (853), 190 states have call successors, (190), 32 states have call predecessors, (190), 30 states have return successors, (188), 177 states have call predecessors, (188), 188 states have call successors, (188) Second operand 962 states. [2022-04-07 14:02:52,256 INFO L87 Difference]: Start difference. First operand has 907 states, 686 states have (on average 1.2434402332361516) internal successors, (853), 697 states have internal predecessors, (853), 190 states have call successors, (190), 32 states have call predecessors, (190), 30 states have return successors, (188), 177 states have call predecessors, (188), 188 states have call successors, (188) Second operand 962 states. [2022-04-07 14:02:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:52,306 INFO L93 Difference]: Finished difference Result 962 states and 1283 transitions. [2022-04-07 14:02:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1283 transitions. [2022-04-07 14:02:52,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:52,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:52,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:52,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 686 states have (on average 1.2434402332361516) internal successors, (853), 697 states have internal predecessors, (853), 190 states have call successors, (190), 32 states have call predecessors, (190), 30 states have return successors, (188), 177 states have call predecessors, (188), 188 states have call successors, (188) [2022-04-07 14:02:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1231 transitions. [2022-04-07 14:02:52,367 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1231 transitions. Word has length 91 [2022-04-07 14:02:52,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:52,367 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1231 transitions. [2022-04-07 14:02:52,368 INFO L479 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-07 14:02:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1231 transitions. [2022-04-07 14:02:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-07 14:02:52,372 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:52,372 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:52,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-07 14:02:52,588 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-07 14:02:52,589 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:52,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:52,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 1 times [2022-04-07 14:02:52,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:52,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316796652] [2022-04-07 14:02:52,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:52,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:52,612 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:52,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106848697] [2022-04-07 14:02:52,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:52,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:52,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:52,616 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-07 14:02:52,617 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-07 14:02:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:52,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 14:02:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:52,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:53,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {16032#true} call ULTIMATE.init(); {16032#true} is VALID [2022-04-07 14:02:53,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {16032#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {16040#(<= ~counter~0 0)} assume true; {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16040#(<= ~counter~0 0)} {16032#true} #102#return; {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {16040#(<= ~counter~0 0)} call #t~ret9 := main(); {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {16040#(<= ~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; {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,225 INFO L272 TraceCheckUtils]: 6: Hoare triple {16040#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {16040#(<= ~counter~0 0)} ~cond := #in~cond; {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {16040#(<= ~counter~0 0)} assume !(0 == ~cond); {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {16040#(<= ~counter~0 0)} assume true; {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,227 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16040#(<= ~counter~0 0)} {16040#(<= ~counter~0 0)} #90#return; {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,227 INFO L272 TraceCheckUtils]: 11: Hoare triple {16040#(<= ~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)); {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {16040#(<= ~counter~0 0)} ~cond := #in~cond; {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {16040#(<= ~counter~0 0)} assume !(0 == ~cond); {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {16040#(<= ~counter~0 0)} assume true; {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,229 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16040#(<= ~counter~0 0)} {16040#(<= ~counter~0 0)} #92#return; {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {16040#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16040#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:53,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {16040#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16089#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:53,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {16089#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {16089#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:53,231 INFO L272 TraceCheckUtils]: 19: Hoare triple {16089#(<= ~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)); {16089#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:53,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {16089#(<= ~counter~0 1)} ~cond := #in~cond; {16089#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:53,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {16089#(<= ~counter~0 1)} assume !(0 == ~cond); {16089#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:53,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {16089#(<= ~counter~0 1)} assume true; {16089#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:53,232 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16089#(<= ~counter~0 1)} {16089#(<= ~counter~0 1)} #94#return; {16089#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:53,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {16089#(<= ~counter~0 1)} assume !!(0 != ~r~0); {16089#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:53,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {16089#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16114#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:53,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {16114#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {16114#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:53,234 INFO L272 TraceCheckUtils]: 27: Hoare triple {16114#(<= ~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)); {16114#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:53,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {16114#(<= ~counter~0 2)} ~cond := #in~cond; {16114#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:53,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {16114#(<= ~counter~0 2)} assume !(0 == ~cond); {16114#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:53,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {16114#(<= ~counter~0 2)} assume true; {16114#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:53,235 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16114#(<= ~counter~0 2)} {16114#(<= ~counter~0 2)} #96#return; {16114#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:53,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {16114#(<= ~counter~0 2)} assume !(~r~0 > 0); {16114#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:53,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {16114#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16139#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:53,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {16139#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {16139#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:53,237 INFO L272 TraceCheckUtils]: 35: Hoare triple {16139#(<= ~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)); {16139#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:53,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {16139#(<= ~counter~0 3)} ~cond := #in~cond; {16139#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:53,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {16139#(<= ~counter~0 3)} assume !(0 == ~cond); {16139#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:53,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {16139#(<= ~counter~0 3)} assume true; {16139#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:53,238 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16139#(<= ~counter~0 3)} {16139#(<= ~counter~0 3)} #98#return; {16139#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:53,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {16139#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16139#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:53,239 INFO L290 TraceCheckUtils]: 41: Hoare triple {16139#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16164#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:53,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {16164#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {16164#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:53,239 INFO L272 TraceCheckUtils]: 43: Hoare triple {16164#(<= ~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)); {16164#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:53,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {16164#(<= ~counter~0 4)} ~cond := #in~cond; {16164#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:53,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {16164#(<= ~counter~0 4)} assume !(0 == ~cond); {16164#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:53,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {16164#(<= ~counter~0 4)} assume true; {16164#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:53,244 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16164#(<= ~counter~0 4)} {16164#(<= ~counter~0 4)} #98#return; {16164#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:53,244 INFO L290 TraceCheckUtils]: 48: Hoare triple {16164#(<= ~counter~0 4)} assume !(~r~0 < 0); {16164#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:53,244 INFO L290 TraceCheckUtils]: 49: Hoare triple {16164#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16189#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:53,245 INFO L290 TraceCheckUtils]: 50: Hoare triple {16189#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {16189#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:53,245 INFO L272 TraceCheckUtils]: 51: Hoare triple {16189#(<= ~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)); {16189#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:53,245 INFO L290 TraceCheckUtils]: 52: Hoare triple {16189#(<= ~counter~0 5)} ~cond := #in~cond; {16189#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:53,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {16189#(<= ~counter~0 5)} assume !(0 == ~cond); {16189#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:53,246 INFO L290 TraceCheckUtils]: 54: Hoare triple {16189#(<= ~counter~0 5)} assume true; {16189#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:53,247 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16189#(<= ~counter~0 5)} {16189#(<= ~counter~0 5)} #94#return; {16189#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:53,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {16189#(<= ~counter~0 5)} assume !!(0 != ~r~0); {16189#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:53,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {16189#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16214#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:53,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {16214#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {16214#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:53,248 INFO L272 TraceCheckUtils]: 59: Hoare triple {16214#(<= ~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)); {16214#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:53,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {16214#(<= ~counter~0 6)} ~cond := #in~cond; {16214#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:53,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {16214#(<= ~counter~0 6)} assume !(0 == ~cond); {16214#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:53,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {16214#(<= ~counter~0 6)} assume true; {16214#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:53,249 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16214#(<= ~counter~0 6)} {16214#(<= ~counter~0 6)} #96#return; {16214#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:53,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {16214#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16214#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:53,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {16214#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16239#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:53,250 INFO L290 TraceCheckUtils]: 66: Hoare triple {16239#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {16239#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:53,251 INFO L272 TraceCheckUtils]: 67: Hoare triple {16239#(<= ~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)); {16239#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:53,251 INFO L290 TraceCheckUtils]: 68: Hoare triple {16239#(<= ~counter~0 7)} ~cond := #in~cond; {16239#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:53,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {16239#(<= ~counter~0 7)} assume !(0 == ~cond); {16239#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:53,252 INFO L290 TraceCheckUtils]: 70: Hoare triple {16239#(<= ~counter~0 7)} assume true; {16239#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:53,252 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16239#(<= ~counter~0 7)} {16239#(<= ~counter~0 7)} #96#return; {16239#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:53,255 INFO L290 TraceCheckUtils]: 72: Hoare triple {16239#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16239#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:53,256 INFO L290 TraceCheckUtils]: 73: Hoare triple {16239#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16264#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:53,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {16264#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {16264#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:53,257 INFO L272 TraceCheckUtils]: 75: Hoare triple {16264#(<= ~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)); {16264#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:53,257 INFO L290 TraceCheckUtils]: 76: Hoare triple {16264#(<= ~counter~0 8)} ~cond := #in~cond; {16264#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:53,257 INFO L290 TraceCheckUtils]: 77: Hoare triple {16264#(<= ~counter~0 8)} assume !(0 == ~cond); {16264#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:53,258 INFO L290 TraceCheckUtils]: 78: Hoare triple {16264#(<= ~counter~0 8)} assume true; {16264#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:53,258 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16264#(<= ~counter~0 8)} {16264#(<= ~counter~0 8)} #96#return; {16264#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:53,259 INFO L290 TraceCheckUtils]: 80: Hoare triple {16264#(<= ~counter~0 8)} assume !(~r~0 > 0); {16264#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:53,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {16264#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16289#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:53,260 INFO L290 TraceCheckUtils]: 82: Hoare triple {16289#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {16289#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:53,260 INFO L272 TraceCheckUtils]: 83: Hoare triple {16289#(<= ~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)); {16289#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:53,260 INFO L290 TraceCheckUtils]: 84: Hoare triple {16289#(<= ~counter~0 9)} ~cond := #in~cond; {16289#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:53,261 INFO L290 TraceCheckUtils]: 85: Hoare triple {16289#(<= ~counter~0 9)} assume !(0 == ~cond); {16289#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:53,261 INFO L290 TraceCheckUtils]: 86: Hoare triple {16289#(<= ~counter~0 9)} assume true; {16289#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:53,262 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16289#(<= ~counter~0 9)} {16289#(<= ~counter~0 9)} #98#return; {16289#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:53,262 INFO L290 TraceCheckUtils]: 88: Hoare triple {16289#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16289#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:53,263 INFO L290 TraceCheckUtils]: 89: Hoare triple {16289#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16314#(<= |main_#t~post8| 9)} is VALID [2022-04-07 14:02:53,263 INFO L290 TraceCheckUtils]: 90: Hoare triple {16314#(<= |main_#t~post8| 9)} assume !(#t~post8 < 50);havoc #t~post8; {16033#false} is VALID [2022-04-07 14:02:53,263 INFO L290 TraceCheckUtils]: 91: Hoare triple {16033#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16033#false} is VALID [2022-04-07 14:02:53,263 INFO L290 TraceCheckUtils]: 92: Hoare triple {16033#false} assume !(#t~post6 < 50);havoc #t~post6; {16033#false} is VALID [2022-04-07 14:02:53,263 INFO L272 TraceCheckUtils]: 93: Hoare triple {16033#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16033#false} is VALID [2022-04-07 14:02:53,263 INFO L290 TraceCheckUtils]: 94: Hoare triple {16033#false} ~cond := #in~cond; {16033#false} is VALID [2022-04-07 14:02:53,263 INFO L290 TraceCheckUtils]: 95: Hoare triple {16033#false} assume 0 == ~cond; {16033#false} is VALID [2022-04-07 14:02:53,263 INFO L290 TraceCheckUtils]: 96: Hoare triple {16033#false} assume !false; {16033#false} is VALID [2022-04-07 14:02:53,264 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-07 14:02:53,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:53,833 INFO L290 TraceCheckUtils]: 96: Hoare triple {16033#false} assume !false; {16033#false} is VALID [2022-04-07 14:02:53,833 INFO L290 TraceCheckUtils]: 95: Hoare triple {16033#false} assume 0 == ~cond; {16033#false} is VALID [2022-04-07 14:02:53,833 INFO L290 TraceCheckUtils]: 94: Hoare triple {16033#false} ~cond := #in~cond; {16033#false} is VALID [2022-04-07 14:02:53,833 INFO L272 TraceCheckUtils]: 93: Hoare triple {16033#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16033#false} is VALID [2022-04-07 14:02:53,833 INFO L290 TraceCheckUtils]: 92: Hoare triple {16033#false} assume !(#t~post6 < 50);havoc #t~post6; {16033#false} is VALID [2022-04-07 14:02:53,833 INFO L290 TraceCheckUtils]: 91: Hoare triple {16033#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16033#false} is VALID [2022-04-07 14:02:53,834 INFO L290 TraceCheckUtils]: 90: Hoare triple {16354#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {16033#false} is VALID [2022-04-07 14:02:53,834 INFO L290 TraceCheckUtils]: 89: Hoare triple {16358#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16354#(< |main_#t~post8| 50)} is VALID [2022-04-07 14:02:53,834 INFO L290 TraceCheckUtils]: 88: Hoare triple {16358#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16358#(< ~counter~0 50)} is VALID [2022-04-07 14:02:53,835 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16032#true} {16358#(< ~counter~0 50)} #98#return; {16358#(< ~counter~0 50)} is VALID [2022-04-07 14:02:53,835 INFO L290 TraceCheckUtils]: 86: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-07 14:02:53,835 INFO L290 TraceCheckUtils]: 85: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-07 14:02:53,835 INFO L290 TraceCheckUtils]: 84: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-07 14:02:53,835 INFO L272 TraceCheckUtils]: 83: Hoare triple {16358#(< ~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)); {16032#true} is VALID [2022-04-07 14:02:53,835 INFO L290 TraceCheckUtils]: 82: Hoare triple {16358#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {16358#(< ~counter~0 50)} is VALID [2022-04-07 14:02:53,836 INFO L290 TraceCheckUtils]: 81: Hoare triple {16383#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16358#(< ~counter~0 50)} is VALID [2022-04-07 14:02:53,836 INFO L290 TraceCheckUtils]: 80: Hoare triple {16383#(< ~counter~0 49)} assume !(~r~0 > 0); {16383#(< ~counter~0 49)} is VALID [2022-04-07 14:02:53,837 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16032#true} {16383#(< ~counter~0 49)} #96#return; {16383#(< ~counter~0 49)} is VALID [2022-04-07 14:02:53,837 INFO L290 TraceCheckUtils]: 78: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-07 14:02:53,837 INFO L290 TraceCheckUtils]: 77: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-07 14:02:53,837 INFO L290 TraceCheckUtils]: 76: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-07 14:02:53,837 INFO L272 TraceCheckUtils]: 75: Hoare triple {16383#(< ~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)); {16032#true} is VALID [2022-04-07 14:02:53,837 INFO L290 TraceCheckUtils]: 74: Hoare triple {16383#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {16383#(< ~counter~0 49)} is VALID [2022-04-07 14:02:53,838 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16383#(< ~counter~0 49)} is VALID [2022-04-07 14:02:53,838 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16408#(< ~counter~0 48)} is VALID [2022-04-07 14:02:53,839 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16032#true} {16408#(< ~counter~0 48)} #96#return; {16408#(< ~counter~0 48)} is VALID [2022-04-07 14:02:53,839 INFO L290 TraceCheckUtils]: 70: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-07 14:02:53,839 INFO L290 TraceCheckUtils]: 69: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-07 14:02:53,839 INFO L290 TraceCheckUtils]: 68: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-07 14:02:53,839 INFO L272 TraceCheckUtils]: 67: Hoare triple {16408#(< ~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)); {16032#true} is VALID [2022-04-07 14:02:53,839 INFO L290 TraceCheckUtils]: 66: Hoare triple {16408#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {16408#(< ~counter~0 48)} is VALID [2022-04-07 14:02:53,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {16433#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16408#(< ~counter~0 48)} is VALID [2022-04-07 14:02:53,840 INFO L290 TraceCheckUtils]: 64: Hoare triple {16433#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16433#(< ~counter~0 47)} is VALID [2022-04-07 14:02:53,840 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16032#true} {16433#(< ~counter~0 47)} #96#return; {16433#(< ~counter~0 47)} is VALID [2022-04-07 14:02:53,840 INFO L290 TraceCheckUtils]: 62: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-07 14:02:53,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-07 14:02:53,840 INFO L290 TraceCheckUtils]: 60: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-07 14:02:53,840 INFO L272 TraceCheckUtils]: 59: Hoare triple {16433#(< ~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)); {16032#true} is VALID [2022-04-07 14:02:53,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {16433#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {16433#(< ~counter~0 47)} is VALID [2022-04-07 14:02:53,841 INFO L290 TraceCheckUtils]: 57: Hoare triple {16458#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16433#(< ~counter~0 47)} is VALID [2022-04-07 14:02:53,841 INFO L290 TraceCheckUtils]: 56: Hoare triple {16458#(< ~counter~0 46)} assume !!(0 != ~r~0); {16458#(< ~counter~0 46)} is VALID [2022-04-07 14:02:53,842 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16032#true} {16458#(< ~counter~0 46)} #94#return; {16458#(< ~counter~0 46)} is VALID [2022-04-07 14:02:53,842 INFO L290 TraceCheckUtils]: 54: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-07 14:02:53,842 INFO L290 TraceCheckUtils]: 53: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-07 14:02:53,842 INFO L290 TraceCheckUtils]: 52: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-07 14:02:53,842 INFO L272 TraceCheckUtils]: 51: Hoare triple {16458#(< ~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)); {16032#true} is VALID [2022-04-07 14:02:53,842 INFO L290 TraceCheckUtils]: 50: Hoare triple {16458#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {16458#(< ~counter~0 46)} is VALID [2022-04-07 14:02:53,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {16483#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16458#(< ~counter~0 46)} is VALID [2022-04-07 14:02:53,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {16483#(< ~counter~0 45)} assume !(~r~0 < 0); {16483#(< ~counter~0 45)} is VALID [2022-04-07 14:02:53,844 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16032#true} {16483#(< ~counter~0 45)} #98#return; {16483#(< ~counter~0 45)} is VALID [2022-04-07 14:02:53,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-07 14:02:53,844 INFO L290 TraceCheckUtils]: 45: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-07 14:02:53,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-07 14:02:53,844 INFO L272 TraceCheckUtils]: 43: Hoare triple {16483#(< ~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)); {16032#true} is VALID [2022-04-07 14:02:53,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {16483#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {16483#(< ~counter~0 45)} is VALID [2022-04-07 14:02:53,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {16508#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16483#(< ~counter~0 45)} is VALID [2022-04-07 14:02:53,851 INFO L290 TraceCheckUtils]: 40: Hoare triple {16508#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16508#(< ~counter~0 44)} is VALID [2022-04-07 14:02:53,852 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16032#true} {16508#(< ~counter~0 44)} #98#return; {16508#(< ~counter~0 44)} is VALID [2022-04-07 14:02:53,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-07 14:02:53,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-07 14:02:53,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-07 14:02:53,852 INFO L272 TraceCheckUtils]: 35: Hoare triple {16508#(< ~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)); {16032#true} is VALID [2022-04-07 14:02:53,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {16508#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {16508#(< ~counter~0 44)} is VALID [2022-04-07 14:02:53,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {16533#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16508#(< ~counter~0 44)} is VALID [2022-04-07 14:02:53,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {16533#(< ~counter~0 43)} assume !(~r~0 > 0); {16533#(< ~counter~0 43)} is VALID [2022-04-07 14:02:53,854 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16032#true} {16533#(< ~counter~0 43)} #96#return; {16533#(< ~counter~0 43)} is VALID [2022-04-07 14:02:53,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-07 14:02:53,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-07 14:02:53,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-07 14:02:53,854 INFO L272 TraceCheckUtils]: 27: Hoare triple {16533#(< ~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)); {16032#true} is VALID [2022-04-07 14:02:53,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {16533#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {16533#(< ~counter~0 43)} is VALID [2022-04-07 14:02:53,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {16558#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16533#(< ~counter~0 43)} is VALID [2022-04-07 14:02:53,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {16558#(< ~counter~0 42)} assume !!(0 != ~r~0); {16558#(< ~counter~0 42)} is VALID [2022-04-07 14:02:53,855 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16032#true} {16558#(< ~counter~0 42)} #94#return; {16558#(< ~counter~0 42)} is VALID [2022-04-07 14:02:53,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-07 14:02:53,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-07 14:02:53,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-07 14:02:53,855 INFO L272 TraceCheckUtils]: 19: Hoare triple {16558#(< ~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)); {16032#true} is VALID [2022-04-07 14:02:53,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {16558#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {16558#(< ~counter~0 42)} is VALID [2022-04-07 14:02:53,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {16583#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16558#(< ~counter~0 42)} is VALID [2022-04-07 14:02:53,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {16583#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16583#(< ~counter~0 41)} is VALID [2022-04-07 14:02:53,857 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16032#true} {16583#(< ~counter~0 41)} #92#return; {16583#(< ~counter~0 41)} is VALID [2022-04-07 14:02:53,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-07 14:02:53,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-07 14:02:53,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-07 14:02:53,857 INFO L272 TraceCheckUtils]: 11: Hoare triple {16583#(< ~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)); {16032#true} is VALID [2022-04-07 14:02:53,857 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16032#true} {16583#(< ~counter~0 41)} #90#return; {16583#(< ~counter~0 41)} is VALID [2022-04-07 14:02:53,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {16032#true} assume true; {16032#true} is VALID [2022-04-07 14:02:53,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {16032#true} assume !(0 == ~cond); {16032#true} is VALID [2022-04-07 14:02:53,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {16032#true} ~cond := #in~cond; {16032#true} is VALID [2022-04-07 14:02:53,858 INFO L272 TraceCheckUtils]: 6: Hoare triple {16583#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {16032#true} is VALID [2022-04-07 14:02:53,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {16583#(< ~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; {16583#(< ~counter~0 41)} is VALID [2022-04-07 14:02:53,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {16583#(< ~counter~0 41)} call #t~ret9 := main(); {16583#(< ~counter~0 41)} is VALID [2022-04-07 14:02:53,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16583#(< ~counter~0 41)} {16032#true} #102#return; {16583#(< ~counter~0 41)} is VALID [2022-04-07 14:02:53,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {16583#(< ~counter~0 41)} assume true; {16583#(< ~counter~0 41)} is VALID [2022-04-07 14:02:53,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {16032#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16583#(< ~counter~0 41)} is VALID [2022-04-07 14:02:53,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {16032#true} call ULTIMATE.init(); {16032#true} is VALID [2022-04-07 14:02:53,860 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-07 14:02:53,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:53,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316796652] [2022-04-07 14:02:53,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:53,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106848697] [2022-04-07 14:02:53,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106848697] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:53,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:53,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-07 14:02:53,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898876454] [2022-04-07 14:02:53,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:53,861 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-07 14:02:53,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:53,861 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-07 14:02:53,973 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-07 14:02:53,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-07 14:02:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:53,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-07 14:02:53,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-07 14:02:53,974 INFO L87 Difference]: Start difference. First operand 907 states and 1231 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-07 14:02:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:56,652 INFO L93 Difference]: Finished difference Result 1471 states and 1986 transitions. [2022-04-07 14:02:56,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-07 14:02:56,652 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-07 14:02:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:56,653 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-07 14:02:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-07 14:02:56,659 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-07 14:02:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-07 14:02:56,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 467 transitions. [2022-04-07 14:02:57,063 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-07 14:02:57,106 INFO L225 Difference]: With dead ends: 1471 [2022-04-07 14:02:57,106 INFO L226 Difference]: Without dead ends: 869 [2022-04-07 14:02:57,108 INFO L912 BasicCegarLoop]: 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-07 14:02:57,110 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 727 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:57,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [727 Valid, 517 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-07 14:02:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-04-07 14:02:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 814. [2022-04-07 14:02:57,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:57,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 869 states. Second operand has 814 states, 609 states have (on average 1.2036124794745484) internal successors, (733), 613 states have internal predecessors, (733), 166 states have call successors, (166), 40 states have call predecessors, (166), 38 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-07 14:02:57,601 INFO L74 IsIncluded]: Start isIncluded. First operand 869 states. Second operand has 814 states, 609 states have (on average 1.2036124794745484) internal successors, (733), 613 states have internal predecessors, (733), 166 states have call successors, (166), 40 states have call predecessors, (166), 38 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-07 14:02:57,602 INFO L87 Difference]: Start difference. First operand 869 states. Second operand has 814 states, 609 states have (on average 1.2036124794745484) internal successors, (733), 613 states have internal predecessors, (733), 166 states have call successors, (166), 40 states have call predecessors, (166), 38 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-07 14:02:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:57,655 INFO L93 Difference]: Finished difference Result 869 states and 1109 transitions. [2022-04-07 14:02:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1109 transitions. [2022-04-07 14:02:57,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:57,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:57,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 814 states, 609 states have (on average 1.2036124794745484) internal successors, (733), 613 states have internal predecessors, (733), 166 states have call successors, (166), 40 states have call predecessors, (166), 38 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) Second operand 869 states. [2022-04-07 14:02:57,660 INFO L87 Difference]: Start difference. First operand has 814 states, 609 states have (on average 1.2036124794745484) internal successors, (733), 613 states have internal predecessors, (733), 166 states have call successors, (166), 40 states have call predecessors, (166), 38 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) Second operand 869 states. [2022-04-07 14:02:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:57,699 INFO L93 Difference]: Finished difference Result 869 states and 1109 transitions. [2022-04-07 14:02:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1109 transitions. [2022-04-07 14:02:57,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:57,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:57,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:57,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 609 states have (on average 1.2036124794745484) internal successors, (733), 613 states have internal predecessors, (733), 166 states have call successors, (166), 40 states have call predecessors, (166), 38 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-07 14:02:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1063 transitions. [2022-04-07 14:02:57,743 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1063 transitions. Word has length 97 [2022-04-07 14:02:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:57,743 INFO L478 AbstractCegarLoop]: Abstraction has 814 states and 1063 transitions. [2022-04-07 14:02:57,744 INFO L479 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-07 14:02:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1063 transitions. [2022-04-07 14:02:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-07 14:02:57,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:57,745 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:57,770 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-07 14:02:57,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-07 14:02:57,959 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:57,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:57,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 1 times [2022-04-07 14:02:57,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:57,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992262641] [2022-04-07 14:02:57,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:57,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:57,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:57,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2094339653] [2022-04-07 14:02:57,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:57,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:57,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:57,987 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-07 14:02:58,013 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-07 14:02:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:58,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 14:02:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:58,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:58,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {21583#true} call ULTIMATE.init(); {21583#true} is VALID [2022-04-07 14:02:58,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {21583#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {21591#(<= ~counter~0 0)} assume true; {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21591#(<= ~counter~0 0)} {21583#true} #102#return; {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {21591#(<= ~counter~0 0)} call #t~ret9 := main(); {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {21591#(<= ~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; {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,733 INFO L272 TraceCheckUtils]: 6: Hoare triple {21591#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {21591#(<= ~counter~0 0)} ~cond := #in~cond; {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {21591#(<= ~counter~0 0)} assume !(0 == ~cond); {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {21591#(<= ~counter~0 0)} assume true; {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21591#(<= ~counter~0 0)} {21591#(<= ~counter~0 0)} #90#return; {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,735 INFO L272 TraceCheckUtils]: 11: Hoare triple {21591#(<= ~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)); {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {21591#(<= ~counter~0 0)} ~cond := #in~cond; {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {21591#(<= ~counter~0 0)} assume !(0 == ~cond); {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {21591#(<= ~counter~0 0)} assume true; {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,736 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21591#(<= ~counter~0 0)} {21591#(<= ~counter~0 0)} #92#return; {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {21591#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21591#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:58,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {21591#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21640#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:58,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {21640#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {21640#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:58,738 INFO L272 TraceCheckUtils]: 19: Hoare triple {21640#(<= ~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)); {21640#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:58,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {21640#(<= ~counter~0 1)} ~cond := #in~cond; {21640#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:58,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {21640#(<= ~counter~0 1)} assume !(0 == ~cond); {21640#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:58,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {21640#(<= ~counter~0 1)} assume true; {21640#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:58,740 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21640#(<= ~counter~0 1)} {21640#(<= ~counter~0 1)} #94#return; {21640#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:58,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {21640#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21640#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:58,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {21640#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21665#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:58,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {21665#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {21665#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:58,742 INFO L272 TraceCheckUtils]: 27: Hoare triple {21665#(<= ~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)); {21665#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:58,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {21665#(<= ~counter~0 2)} ~cond := #in~cond; {21665#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:58,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {21665#(<= ~counter~0 2)} assume !(0 == ~cond); {21665#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:58,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {21665#(<= ~counter~0 2)} assume true; {21665#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:58,744 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21665#(<= ~counter~0 2)} {21665#(<= ~counter~0 2)} #96#return; {21665#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:58,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {21665#(<= ~counter~0 2)} assume !(~r~0 > 0); {21665#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:58,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {21665#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21690#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:58,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {21690#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {21690#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:58,745 INFO L272 TraceCheckUtils]: 35: Hoare triple {21690#(<= ~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)); {21690#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:58,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {21690#(<= ~counter~0 3)} ~cond := #in~cond; {21690#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:58,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {21690#(<= ~counter~0 3)} assume !(0 == ~cond); {21690#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:58,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {21690#(<= ~counter~0 3)} assume true; {21690#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:58,747 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21690#(<= ~counter~0 3)} {21690#(<= ~counter~0 3)} #98#return; {21690#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:58,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {21690#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21690#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:58,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {21690#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21715#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:58,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {21715#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {21715#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:58,749 INFO L272 TraceCheckUtils]: 43: Hoare triple {21715#(<= ~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)); {21715#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:58,749 INFO L290 TraceCheckUtils]: 44: Hoare triple {21715#(<= ~counter~0 4)} ~cond := #in~cond; {21715#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:58,749 INFO L290 TraceCheckUtils]: 45: Hoare triple {21715#(<= ~counter~0 4)} assume !(0 == ~cond); {21715#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:58,750 INFO L290 TraceCheckUtils]: 46: Hoare triple {21715#(<= ~counter~0 4)} assume true; {21715#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:58,750 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21715#(<= ~counter~0 4)} {21715#(<= ~counter~0 4)} #98#return; {21715#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:58,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {21715#(<= ~counter~0 4)} assume !(~r~0 < 0); {21715#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:58,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {21715#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21740#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:58,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {21740#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {21740#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:58,752 INFO L272 TraceCheckUtils]: 51: Hoare triple {21740#(<= ~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)); {21740#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:58,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {21740#(<= ~counter~0 5)} ~cond := #in~cond; {21740#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:58,753 INFO L290 TraceCheckUtils]: 53: Hoare triple {21740#(<= ~counter~0 5)} assume !(0 == ~cond); {21740#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:58,753 INFO L290 TraceCheckUtils]: 54: Hoare triple {21740#(<= ~counter~0 5)} assume true; {21740#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:58,754 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21740#(<= ~counter~0 5)} {21740#(<= ~counter~0 5)} #94#return; {21740#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:58,754 INFO L290 TraceCheckUtils]: 56: Hoare triple {21740#(<= ~counter~0 5)} assume !!(0 != ~r~0); {21740#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:58,755 INFO L290 TraceCheckUtils]: 57: Hoare triple {21740#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21765#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:58,755 INFO L290 TraceCheckUtils]: 58: Hoare triple {21765#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {21765#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:58,756 INFO L272 TraceCheckUtils]: 59: Hoare triple {21765#(<= ~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)); {21765#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:58,756 INFO L290 TraceCheckUtils]: 60: Hoare triple {21765#(<= ~counter~0 6)} ~cond := #in~cond; {21765#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:58,756 INFO L290 TraceCheckUtils]: 61: Hoare triple {21765#(<= ~counter~0 6)} assume !(0 == ~cond); {21765#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:58,757 INFO L290 TraceCheckUtils]: 62: Hoare triple {21765#(<= ~counter~0 6)} assume true; {21765#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:58,757 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21765#(<= ~counter~0 6)} {21765#(<= ~counter~0 6)} #96#return; {21765#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:58,757 INFO L290 TraceCheckUtils]: 64: Hoare triple {21765#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21765#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:58,758 INFO L290 TraceCheckUtils]: 65: Hoare triple {21765#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21790#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:58,758 INFO L290 TraceCheckUtils]: 66: Hoare triple {21790#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {21790#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:58,759 INFO L272 TraceCheckUtils]: 67: Hoare triple {21790#(<= ~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)); {21790#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:58,759 INFO L290 TraceCheckUtils]: 68: Hoare triple {21790#(<= ~counter~0 7)} ~cond := #in~cond; {21790#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:58,760 INFO L290 TraceCheckUtils]: 69: Hoare triple {21790#(<= ~counter~0 7)} assume !(0 == ~cond); {21790#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:58,760 INFO L290 TraceCheckUtils]: 70: Hoare triple {21790#(<= ~counter~0 7)} assume true; {21790#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:58,760 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21790#(<= ~counter~0 7)} {21790#(<= ~counter~0 7)} #96#return; {21790#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:58,761 INFO L290 TraceCheckUtils]: 72: Hoare triple {21790#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21790#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:58,761 INFO L290 TraceCheckUtils]: 73: Hoare triple {21790#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21815#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:58,762 INFO L290 TraceCheckUtils]: 74: Hoare triple {21815#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {21815#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:58,762 INFO L272 TraceCheckUtils]: 75: Hoare triple {21815#(<= ~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)); {21815#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:58,763 INFO L290 TraceCheckUtils]: 76: Hoare triple {21815#(<= ~counter~0 8)} ~cond := #in~cond; {21815#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:58,763 INFO L290 TraceCheckUtils]: 77: Hoare triple {21815#(<= ~counter~0 8)} assume !(0 == ~cond); {21815#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:58,763 INFO L290 TraceCheckUtils]: 78: Hoare triple {21815#(<= ~counter~0 8)} assume true; {21815#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:58,764 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {21815#(<= ~counter~0 8)} {21815#(<= ~counter~0 8)} #96#return; {21815#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:58,764 INFO L290 TraceCheckUtils]: 80: Hoare triple {21815#(<= ~counter~0 8)} assume !(~r~0 > 0); {21815#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:58,765 INFO L290 TraceCheckUtils]: 81: Hoare triple {21815#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21840#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:58,765 INFO L290 TraceCheckUtils]: 82: Hoare triple {21840#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {21840#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:58,766 INFO L272 TraceCheckUtils]: 83: Hoare triple {21840#(<= ~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)); {21840#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:58,766 INFO L290 TraceCheckUtils]: 84: Hoare triple {21840#(<= ~counter~0 9)} ~cond := #in~cond; {21840#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:58,766 INFO L290 TraceCheckUtils]: 85: Hoare triple {21840#(<= ~counter~0 9)} assume !(0 == ~cond); {21840#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:58,767 INFO L290 TraceCheckUtils]: 86: Hoare triple {21840#(<= ~counter~0 9)} assume true; {21840#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:58,767 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {21840#(<= ~counter~0 9)} {21840#(<= ~counter~0 9)} #98#return; {21840#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:58,768 INFO L290 TraceCheckUtils]: 88: Hoare triple {21840#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21840#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:58,768 INFO L290 TraceCheckUtils]: 89: Hoare triple {21840#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21865#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:58,769 INFO L290 TraceCheckUtils]: 90: Hoare triple {21865#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {21865#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:58,769 INFO L272 TraceCheckUtils]: 91: Hoare triple {21865#(<= ~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)); {21865#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:58,770 INFO L290 TraceCheckUtils]: 92: Hoare triple {21865#(<= ~counter~0 10)} ~cond := #in~cond; {21865#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:58,770 INFO L290 TraceCheckUtils]: 93: Hoare triple {21865#(<= ~counter~0 10)} assume !(0 == ~cond); {21865#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:58,770 INFO L290 TraceCheckUtils]: 94: Hoare triple {21865#(<= ~counter~0 10)} assume true; {21865#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:58,771 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {21865#(<= ~counter~0 10)} {21865#(<= ~counter~0 10)} #98#return; {21865#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:58,771 INFO L290 TraceCheckUtils]: 96: Hoare triple {21865#(<= ~counter~0 10)} assume !(~r~0 < 0); {21865#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:58,772 INFO L290 TraceCheckUtils]: 97: Hoare triple {21865#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21890#(<= |main_#t~post6| 10)} is VALID [2022-04-07 14:02:58,772 INFO L290 TraceCheckUtils]: 98: Hoare triple {21890#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {21584#false} is VALID [2022-04-07 14:02:58,772 INFO L272 TraceCheckUtils]: 99: Hoare triple {21584#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21584#false} is VALID [2022-04-07 14:02:58,772 INFO L290 TraceCheckUtils]: 100: Hoare triple {21584#false} ~cond := #in~cond; {21584#false} is VALID [2022-04-07 14:02:58,772 INFO L290 TraceCheckUtils]: 101: Hoare triple {21584#false} assume 0 == ~cond; {21584#false} is VALID [2022-04-07 14:02:58,772 INFO L290 TraceCheckUtils]: 102: Hoare triple {21584#false} assume !false; {21584#false} is VALID [2022-04-07 14:02:58,773 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-07 14:02:58,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:59,456 INFO L290 TraceCheckUtils]: 102: Hoare triple {21584#false} assume !false; {21584#false} is VALID [2022-04-07 14:02:59,456 INFO L290 TraceCheckUtils]: 101: Hoare triple {21584#false} assume 0 == ~cond; {21584#false} is VALID [2022-04-07 14:02:59,456 INFO L290 TraceCheckUtils]: 100: Hoare triple {21584#false} ~cond := #in~cond; {21584#false} is VALID [2022-04-07 14:02:59,456 INFO L272 TraceCheckUtils]: 99: Hoare triple {21584#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21584#false} is VALID [2022-04-07 14:02:59,456 INFO L290 TraceCheckUtils]: 98: Hoare triple {21918#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {21584#false} is VALID [2022-04-07 14:02:59,457 INFO L290 TraceCheckUtils]: 97: Hoare triple {21922#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21918#(< |main_#t~post6| 50)} is VALID [2022-04-07 14:02:59,457 INFO L290 TraceCheckUtils]: 96: Hoare triple {21922#(< ~counter~0 50)} assume !(~r~0 < 0); {21922#(< ~counter~0 50)} is VALID [2022-04-07 14:02:59,457 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {21583#true} {21922#(< ~counter~0 50)} #98#return; {21922#(< ~counter~0 50)} is VALID [2022-04-07 14:02:59,457 INFO L290 TraceCheckUtils]: 94: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-07 14:02:59,457 INFO L290 TraceCheckUtils]: 93: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-07 14:02:59,457 INFO L290 TraceCheckUtils]: 92: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-07 14:02:59,458 INFO L272 TraceCheckUtils]: 91: Hoare triple {21922#(< ~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)); {21583#true} is VALID [2022-04-07 14:02:59,458 INFO L290 TraceCheckUtils]: 90: Hoare triple {21922#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {21922#(< ~counter~0 50)} is VALID [2022-04-07 14:02:59,458 INFO L290 TraceCheckUtils]: 89: Hoare triple {21947#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21922#(< ~counter~0 50)} is VALID [2022-04-07 14:02:59,459 INFO L290 TraceCheckUtils]: 88: Hoare triple {21947#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21947#(< ~counter~0 49)} is VALID [2022-04-07 14:02:59,459 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {21583#true} {21947#(< ~counter~0 49)} #98#return; {21947#(< ~counter~0 49)} is VALID [2022-04-07 14:02:59,459 INFO L290 TraceCheckUtils]: 86: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-07 14:02:59,459 INFO L290 TraceCheckUtils]: 85: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-07 14:02:59,459 INFO L290 TraceCheckUtils]: 84: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-07 14:02:59,459 INFO L272 TraceCheckUtils]: 83: Hoare triple {21947#(< ~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)); {21583#true} is VALID [2022-04-07 14:02:59,460 INFO L290 TraceCheckUtils]: 82: Hoare triple {21947#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {21947#(< ~counter~0 49)} is VALID [2022-04-07 14:02:59,460 INFO L290 TraceCheckUtils]: 81: Hoare triple {21972#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21947#(< ~counter~0 49)} is VALID [2022-04-07 14:02:59,460 INFO L290 TraceCheckUtils]: 80: Hoare triple {21972#(< ~counter~0 48)} assume !(~r~0 > 0); {21972#(< ~counter~0 48)} is VALID [2022-04-07 14:02:59,461 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {21583#true} {21972#(< ~counter~0 48)} #96#return; {21972#(< ~counter~0 48)} is VALID [2022-04-07 14:02:59,461 INFO L290 TraceCheckUtils]: 78: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-07 14:02:59,461 INFO L290 TraceCheckUtils]: 77: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-07 14:02:59,461 INFO L290 TraceCheckUtils]: 76: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-07 14:02:59,461 INFO L272 TraceCheckUtils]: 75: Hoare triple {21972#(< ~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)); {21583#true} is VALID [2022-04-07 14:02:59,461 INFO L290 TraceCheckUtils]: 74: Hoare triple {21972#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {21972#(< ~counter~0 48)} is VALID [2022-04-07 14:02:59,462 INFO L290 TraceCheckUtils]: 73: Hoare triple {21997#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21972#(< ~counter~0 48)} is VALID [2022-04-07 14:02:59,462 INFO L290 TraceCheckUtils]: 72: Hoare triple {21997#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21997#(< ~counter~0 47)} is VALID [2022-04-07 14:02:59,463 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21583#true} {21997#(< ~counter~0 47)} #96#return; {21997#(< ~counter~0 47)} is VALID [2022-04-07 14:02:59,463 INFO L290 TraceCheckUtils]: 70: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-07 14:02:59,463 INFO L290 TraceCheckUtils]: 69: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-07 14:02:59,463 INFO L290 TraceCheckUtils]: 68: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-07 14:02:59,463 INFO L272 TraceCheckUtils]: 67: Hoare triple {21997#(< ~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)); {21583#true} is VALID [2022-04-07 14:02:59,463 INFO L290 TraceCheckUtils]: 66: Hoare triple {21997#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {21997#(< ~counter~0 47)} is VALID [2022-04-07 14:02:59,464 INFO L290 TraceCheckUtils]: 65: Hoare triple {22022#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21997#(< ~counter~0 47)} is VALID [2022-04-07 14:02:59,464 INFO L290 TraceCheckUtils]: 64: Hoare triple {22022#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22022#(< ~counter~0 46)} is VALID [2022-04-07 14:02:59,464 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21583#true} {22022#(< ~counter~0 46)} #96#return; {22022#(< ~counter~0 46)} is VALID [2022-04-07 14:02:59,464 INFO L290 TraceCheckUtils]: 62: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-07 14:02:59,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-07 14:02:59,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-07 14:02:59,465 INFO L272 TraceCheckUtils]: 59: Hoare triple {22022#(< ~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)); {21583#true} is VALID [2022-04-07 14:02:59,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {22022#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {22022#(< ~counter~0 46)} is VALID [2022-04-07 14:02:59,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {22047#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22022#(< ~counter~0 46)} is VALID [2022-04-07 14:02:59,465 INFO L290 TraceCheckUtils]: 56: Hoare triple {22047#(< ~counter~0 45)} assume !!(0 != ~r~0); {22047#(< ~counter~0 45)} is VALID [2022-04-07 14:02:59,466 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21583#true} {22047#(< ~counter~0 45)} #94#return; {22047#(< ~counter~0 45)} is VALID [2022-04-07 14:02:59,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-07 14:02:59,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-07 14:02:59,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-07 14:02:59,466 INFO L272 TraceCheckUtils]: 51: Hoare triple {22047#(< ~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)); {21583#true} is VALID [2022-04-07 14:02:59,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {22047#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {22047#(< ~counter~0 45)} is VALID [2022-04-07 14:02:59,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {22072#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22047#(< ~counter~0 45)} is VALID [2022-04-07 14:02:59,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {22072#(< ~counter~0 44)} assume !(~r~0 < 0); {22072#(< ~counter~0 44)} is VALID [2022-04-07 14:02:59,467 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21583#true} {22072#(< ~counter~0 44)} #98#return; {22072#(< ~counter~0 44)} is VALID [2022-04-07 14:02:59,468 INFO L290 TraceCheckUtils]: 46: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-07 14:02:59,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-07 14:02:59,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-07 14:02:59,468 INFO L272 TraceCheckUtils]: 43: Hoare triple {22072#(< ~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)); {21583#true} is VALID [2022-04-07 14:02:59,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {22072#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {22072#(< ~counter~0 44)} is VALID [2022-04-07 14:02:59,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {22097#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22072#(< ~counter~0 44)} is VALID [2022-04-07 14:02:59,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {22097#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22097#(< ~counter~0 43)} is VALID [2022-04-07 14:02:59,469 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21583#true} {22097#(< ~counter~0 43)} #98#return; {22097#(< ~counter~0 43)} is VALID [2022-04-07 14:02:59,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-07 14:02:59,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-07 14:02:59,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-07 14:02:59,469 INFO L272 TraceCheckUtils]: 35: Hoare triple {22097#(< ~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)); {21583#true} is VALID [2022-04-07 14:02:59,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {22097#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {22097#(< ~counter~0 43)} is VALID [2022-04-07 14:02:59,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {22122#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22097#(< ~counter~0 43)} is VALID [2022-04-07 14:02:59,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {22122#(< ~counter~0 42)} assume !(~r~0 > 0); {22122#(< ~counter~0 42)} is VALID [2022-04-07 14:02:59,471 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21583#true} {22122#(< ~counter~0 42)} #96#return; {22122#(< ~counter~0 42)} is VALID [2022-04-07 14:02:59,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-07 14:02:59,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-07 14:02:59,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-07 14:02:59,471 INFO L272 TraceCheckUtils]: 27: Hoare triple {22122#(< ~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)); {21583#true} is VALID [2022-04-07 14:02:59,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {22122#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {22122#(< ~counter~0 42)} is VALID [2022-04-07 14:02:59,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {22147#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22122#(< ~counter~0 42)} is VALID [2022-04-07 14:02:59,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {22147#(< ~counter~0 41)} assume !!(0 != ~r~0); {22147#(< ~counter~0 41)} is VALID [2022-04-07 14:02:59,472 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21583#true} {22147#(< ~counter~0 41)} #94#return; {22147#(< ~counter~0 41)} is VALID [2022-04-07 14:02:59,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-07 14:02:59,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-07 14:02:59,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-07 14:02:59,473 INFO L272 TraceCheckUtils]: 19: Hoare triple {22147#(< ~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)); {21583#true} is VALID [2022-04-07 14:02:59,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {22147#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {22147#(< ~counter~0 41)} is VALID [2022-04-07 14:02:59,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {22172#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22147#(< ~counter~0 41)} is VALID [2022-04-07 14:02:59,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {22172#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22172#(< ~counter~0 40)} is VALID [2022-04-07 14:02:59,474 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21583#true} {22172#(< ~counter~0 40)} #92#return; {22172#(< ~counter~0 40)} is VALID [2022-04-07 14:02:59,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-07 14:02:59,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-07 14:02:59,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-07 14:02:59,474 INFO L272 TraceCheckUtils]: 11: Hoare triple {22172#(< ~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)); {21583#true} is VALID [2022-04-07 14:02:59,475 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21583#true} {22172#(< ~counter~0 40)} #90#return; {22172#(< ~counter~0 40)} is VALID [2022-04-07 14:02:59,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {21583#true} assume true; {21583#true} is VALID [2022-04-07 14:02:59,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {21583#true} assume !(0 == ~cond); {21583#true} is VALID [2022-04-07 14:02:59,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {21583#true} ~cond := #in~cond; {21583#true} is VALID [2022-04-07 14:02:59,475 INFO L272 TraceCheckUtils]: 6: Hoare triple {22172#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21583#true} is VALID [2022-04-07 14:02:59,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {22172#(< ~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; {22172#(< ~counter~0 40)} is VALID [2022-04-07 14:02:59,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {22172#(< ~counter~0 40)} call #t~ret9 := main(); {22172#(< ~counter~0 40)} is VALID [2022-04-07 14:02:59,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22172#(< ~counter~0 40)} {21583#true} #102#return; {22172#(< ~counter~0 40)} is VALID [2022-04-07 14:02:59,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {22172#(< ~counter~0 40)} assume true; {22172#(< ~counter~0 40)} is VALID [2022-04-07 14:02:59,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {21583#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22172#(< ~counter~0 40)} is VALID [2022-04-07 14:02:59,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {21583#true} call ULTIMATE.init(); {21583#true} is VALID [2022-04-07 14:02:59,477 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-07 14:02:59,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992262641] [2022-04-07 14:02:59,477 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094339653] [2022-04-07 14:02:59,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094339653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:59,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:59,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-07 14:02:59,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395828324] [2022-04-07 14:02:59,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:59,478 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-07 14:02:59,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:59,478 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-07 14:02:59,597 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-07 14:02:59,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 14:02:59,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:59,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 14:02:59,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-07 14:02:59,598 INFO L87 Difference]: Start difference. First operand 814 states and 1063 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-07 14:03:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:02,119 INFO L93 Difference]: Finished difference Result 937 states and 1235 transitions. [2022-04-07 14:03:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-07 14:03:02,120 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-07 14:03:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:02,122 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-07 14:03:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 452 transitions. [2022-04-07 14:03:02,129 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-07 14:03:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 452 transitions. [2022-04-07 14:03:02,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 452 transitions. [2022-04-07 14:03:02,536 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-07 14:03:02,576 INFO L225 Difference]: With dead ends: 937 [2022-04-07 14:03:02,576 INFO L226 Difference]: Without dead ends: 932 [2022-04-07 14:03:02,577 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=670, Invalid=1222, Unknown=0, NotChecked=0, Total=1892 [2022-04-07 14:03:02,578 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 467 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:02,578 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 455 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-07 14:03:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-04-07 14:03:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 916. [2022-04-07 14:03:03,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:03,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 932 states. Second operand has 916 states, 687 states have (on average 1.1834061135371179) internal successors, (813), 693 states have internal predecessors, (813), 186 states have call successors, (186), 44 states have call predecessors, (186), 42 states have return successors, (184), 178 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-07 14:03:03,173 INFO L74 IsIncluded]: Start isIncluded. First operand 932 states. Second operand has 916 states, 687 states have (on average 1.1834061135371179) internal successors, (813), 693 states have internal predecessors, (813), 186 states have call successors, (186), 44 states have call predecessors, (186), 42 states have return successors, (184), 178 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-07 14:03:03,174 INFO L87 Difference]: Start difference. First operand 932 states. Second operand has 916 states, 687 states have (on average 1.1834061135371179) internal successors, (813), 693 states have internal predecessors, (813), 186 states have call successors, (186), 44 states have call predecessors, (186), 42 states have return successors, (184), 178 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-07 14:03:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:03,218 INFO L93 Difference]: Finished difference Result 932 states and 1203 transitions. [2022-04-07 14:03:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1203 transitions. [2022-04-07 14:03:03,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:03,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:03,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 916 states, 687 states have (on average 1.1834061135371179) internal successors, (813), 693 states have internal predecessors, (813), 186 states have call successors, (186), 44 states have call predecessors, (186), 42 states have return successors, (184), 178 states have call predecessors, (184), 184 states have call successors, (184) Second operand 932 states. [2022-04-07 14:03:03,223 INFO L87 Difference]: Start difference. First operand has 916 states, 687 states have (on average 1.1834061135371179) internal successors, (813), 693 states have internal predecessors, (813), 186 states have call successors, (186), 44 states have call predecessors, (186), 42 states have return successors, (184), 178 states have call predecessors, (184), 184 states have call successors, (184) Second operand 932 states. [2022-04-07 14:03:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:03,265 INFO L93 Difference]: Finished difference Result 932 states and 1203 transitions. [2022-04-07 14:03:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1203 transitions. [2022-04-07 14:03:03,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:03,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:03,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:03,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 687 states have (on average 1.1834061135371179) internal successors, (813), 693 states have internal predecessors, (813), 186 states have call successors, (186), 44 states have call predecessors, (186), 42 states have return successors, (184), 178 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-07 14:03:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1183 transitions. [2022-04-07 14:03:03,319 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1183 transitions. Word has length 103 [2022-04-07 14:03:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:03,320 INFO L478 AbstractCegarLoop]: Abstraction has 916 states and 1183 transitions. [2022-04-07 14:03:03,320 INFO L479 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-07 14:03:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1183 transitions. [2022-04-07 14:03:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-07 14:03:03,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:03,324 INFO L499 BasicCegarLoop]: 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-07 14:03:03,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-07 14:03:03,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:03,547 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:03,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash -599363247, now seen corresponding path program 3 times [2022-04-07 14:03:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:03,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191312129] [2022-04-07 14:03:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:03,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:03,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [400650080] [2022-04-07 14:03:03,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 14:03:03,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:03,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:03,578 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-07 14:03:03,612 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-07 14:03:03,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 14:03:03,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:03,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 14:03:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:03,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:04,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {26697#true} call ULTIMATE.init(); {26697#true} is VALID [2022-04-07 14:03:04,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {26697#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26697#true} is VALID [2022-04-07 14:03:04,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26697#true} {26697#true} #102#return; {26697#true} is VALID [2022-04-07 14:03:04,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {26697#true} call #t~ret9 := main(); {26697#true} is VALID [2022-04-07 14:03:04,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {26697#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; {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {26697#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26697#true} {26697#true} #90#return; {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L272 TraceCheckUtils]: 11: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26697#true} {26697#true} #92#return; {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {26697#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {26697#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {26697#true} assume !!(#t~post6 < 50);havoc #t~post6; {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L272 TraceCheckUtils]: 19: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26697#true} {26697#true} #94#return; {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {26697#true} assume !!(0 != ~r~0); {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {26697#true} assume !!(#t~post7 < 50);havoc #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L272 TraceCheckUtils]: 27: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {26697#true} assume !(~r~0 > 0); {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {26697#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {26697#true} assume !!(#t~post8 < 50);havoc #t~post8; {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L272 TraceCheckUtils]: 35: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26697#true} {26697#true} #98#return; {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L290 TraceCheckUtils]: 40: Hoare triple {26697#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L290 TraceCheckUtils]: 41: Hoare triple {26697#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L290 TraceCheckUtils]: 42: Hoare triple {26697#true} assume !!(#t~post8 < 50);havoc #t~post8; {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L272 TraceCheckUtils]: 43: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26697#true} {26697#true} #98#return; {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {26697#true} assume !(~r~0 < 0); {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L290 TraceCheckUtils]: 49: Hoare triple {26697#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L290 TraceCheckUtils]: 50: Hoare triple {26697#true} assume !!(#t~post6 < 50);havoc #t~post6; {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L272 TraceCheckUtils]: 51: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,046 INFO L290 TraceCheckUtils]: 52: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L290 TraceCheckUtils]: 54: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26697#true} {26697#true} #94#return; {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L290 TraceCheckUtils]: 56: Hoare triple {26697#true} assume !!(0 != ~r~0); {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L290 TraceCheckUtils]: 57: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L290 TraceCheckUtils]: 58: Hoare triple {26697#true} assume !!(#t~post7 < 50);havoc #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L272 TraceCheckUtils]: 59: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L290 TraceCheckUtils]: 60: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L290 TraceCheckUtils]: 61: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L290 TraceCheckUtils]: 62: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L290 TraceCheckUtils]: 64: Hoare triple {26697#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L290 TraceCheckUtils]: 65: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L290 TraceCheckUtils]: 66: Hoare triple {26697#true} assume !!(#t~post7 < 50);havoc #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L272 TraceCheckUtils]: 67: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,047 INFO L290 TraceCheckUtils]: 68: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L290 TraceCheckUtils]: 69: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L290 TraceCheckUtils]: 70: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L290 TraceCheckUtils]: 72: Hoare triple {26697#true} assume !(~r~0 > 0); {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L290 TraceCheckUtils]: 73: Hoare triple {26697#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L290 TraceCheckUtils]: 74: Hoare triple {26697#true} assume !!(#t~post8 < 50);havoc #t~post8; {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L272 TraceCheckUtils]: 75: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L290 TraceCheckUtils]: 76: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L290 TraceCheckUtils]: 77: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L290 TraceCheckUtils]: 78: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26697#true} {26697#true} #98#return; {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L290 TraceCheckUtils]: 80: Hoare triple {26697#true} assume !(~r~0 < 0); {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L290 TraceCheckUtils]: 81: Hoare triple {26697#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L290 TraceCheckUtils]: 82: Hoare triple {26697#true} assume !!(#t~post6 < 50);havoc #t~post6; {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L272 TraceCheckUtils]: 83: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,048 INFO L290 TraceCheckUtils]: 84: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L290 TraceCheckUtils]: 85: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L290 TraceCheckUtils]: 86: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {26697#true} {26697#true} #94#return; {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L290 TraceCheckUtils]: 88: Hoare triple {26697#true} assume !!(0 != ~r~0); {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L290 TraceCheckUtils]: 89: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L290 TraceCheckUtils]: 90: Hoare triple {26697#true} assume !!(#t~post7 < 50);havoc #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L272 TraceCheckUtils]: 91: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L290 TraceCheckUtils]: 92: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L290 TraceCheckUtils]: 93: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L290 TraceCheckUtils]: 94: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L290 TraceCheckUtils]: 96: Hoare triple {26697#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L290 TraceCheckUtils]: 97: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L290 TraceCheckUtils]: 98: Hoare triple {26697#true} assume !!(#t~post7 < 50);havoc #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,049 INFO L272 TraceCheckUtils]: 99: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L290 TraceCheckUtils]: 100: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L290 TraceCheckUtils]: 101: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L290 TraceCheckUtils]: 102: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L290 TraceCheckUtils]: 104: Hoare triple {26697#true} assume !(~r~0 > 0); {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L290 TraceCheckUtils]: 105: Hoare triple {26697#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L290 TraceCheckUtils]: 106: Hoare triple {26697#true} assume !!(#t~post8 < 50);havoc #t~post8; {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L272 TraceCheckUtils]: 107: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L290 TraceCheckUtils]: 108: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L290 TraceCheckUtils]: 109: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L290 TraceCheckUtils]: 110: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {26697#true} {26697#true} #98#return; {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L290 TraceCheckUtils]: 112: Hoare triple {26697#true} assume !(~r~0 < 0); {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L290 TraceCheckUtils]: 113: Hoare triple {26697#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L290 TraceCheckUtils]: 114: Hoare triple {26697#true} assume !!(#t~post6 < 50);havoc #t~post6; {26697#true} is VALID [2022-04-07 14:03:04,050 INFO L272 TraceCheckUtils]: 115: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L290 TraceCheckUtils]: 116: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L290 TraceCheckUtils]: 117: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L290 TraceCheckUtils]: 118: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {26697#true} {26697#true} #94#return; {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L290 TraceCheckUtils]: 120: Hoare triple {26697#true} assume !!(0 != ~r~0); {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L290 TraceCheckUtils]: 121: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L290 TraceCheckUtils]: 122: Hoare triple {26697#true} assume !!(#t~post7 < 50);havoc #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L272 TraceCheckUtils]: 123: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L290 TraceCheckUtils]: 124: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L290 TraceCheckUtils]: 125: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L290 TraceCheckUtils]: 126: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L290 TraceCheckUtils]: 128: Hoare triple {26697#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L290 TraceCheckUtils]: 129: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,051 INFO L290 TraceCheckUtils]: 130: Hoare triple {26697#true} assume !!(#t~post7 < 50);havoc #t~post7; {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L272 TraceCheckUtils]: 131: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L290 TraceCheckUtils]: 132: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L290 TraceCheckUtils]: 133: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L290 TraceCheckUtils]: 134: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {26697#true} {26697#true} #96#return; {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L290 TraceCheckUtils]: 136: Hoare triple {26697#true} assume !(~r~0 > 0); {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L290 TraceCheckUtils]: 137: Hoare triple {26697#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L290 TraceCheckUtils]: 138: Hoare triple {26697#true} assume !!(#t~post8 < 50);havoc #t~post8; {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L272 TraceCheckUtils]: 139: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L290 TraceCheckUtils]: 140: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L290 TraceCheckUtils]: 141: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L290 TraceCheckUtils]: 142: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {26697#true} {26697#true} #98#return; {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L290 TraceCheckUtils]: 144: Hoare triple {26697#true} assume !(~r~0 < 0); {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L290 TraceCheckUtils]: 145: Hoare triple {26697#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26697#true} is VALID [2022-04-07 14:03:04,052 INFO L290 TraceCheckUtils]: 146: Hoare triple {26697#true} assume !!(#t~post6 < 50);havoc #t~post6; {26697#true} is VALID [2022-04-07 14:03:04,053 INFO L272 TraceCheckUtils]: 147: Hoare triple {26697#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)); {26697#true} is VALID [2022-04-07 14:03:04,053 INFO L290 TraceCheckUtils]: 148: Hoare triple {26697#true} ~cond := #in~cond; {26697#true} is VALID [2022-04-07 14:03:04,053 INFO L290 TraceCheckUtils]: 149: Hoare triple {26697#true} assume !(0 == ~cond); {26697#true} is VALID [2022-04-07 14:03:04,053 INFO L290 TraceCheckUtils]: 150: Hoare triple {26697#true} assume true; {26697#true} is VALID [2022-04-07 14:03:04,053 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {26697#true} {26697#true} #94#return; {26697#true} is VALID [2022-04-07 14:03:04,053 INFO L290 TraceCheckUtils]: 152: Hoare triple {26697#true} assume !!(0 != ~r~0); {26697#true} is VALID [2022-04-07 14:03:04,053 INFO L290 TraceCheckUtils]: 153: Hoare triple {26697#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27161#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-07 14:03:04,054 INFO L290 TraceCheckUtils]: 154: Hoare triple {27161#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 50);havoc #t~post7; {27165#(<= 51 ~counter~0)} is VALID [2022-04-07 14:03:04,055 INFO L290 TraceCheckUtils]: 155: Hoare triple {27165#(<= 51 ~counter~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27169#(<= 52 ~counter~0)} is VALID [2022-04-07 14:03:04,055 INFO L290 TraceCheckUtils]: 156: Hoare triple {27169#(<= 52 ~counter~0)} assume !!(#t~post8 < 50);havoc #t~post8; {27169#(<= 52 ~counter~0)} is VALID [2022-04-07 14:03:04,055 INFO L272 TraceCheckUtils]: 157: Hoare triple {27169#(<= 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)); {27169#(<= 52 ~counter~0)} is VALID [2022-04-07 14:03:04,056 INFO L290 TraceCheckUtils]: 158: Hoare triple {27169#(<= 52 ~counter~0)} ~cond := #in~cond; {27169#(<= 52 ~counter~0)} is VALID [2022-04-07 14:03:04,068 INFO L290 TraceCheckUtils]: 159: Hoare triple {27169#(<= 52 ~counter~0)} assume !(0 == ~cond); {27169#(<= 52 ~counter~0)} is VALID [2022-04-07 14:03:04,068 INFO L290 TraceCheckUtils]: 160: Hoare triple {27169#(<= 52 ~counter~0)} assume true; {27169#(<= 52 ~counter~0)} is VALID [2022-04-07 14:03:04,069 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {27169#(<= 52 ~counter~0)} {27169#(<= 52 ~counter~0)} #98#return; {27169#(<= 52 ~counter~0)} is VALID [2022-04-07 14:03:04,069 INFO L290 TraceCheckUtils]: 162: Hoare triple {27169#(<= 52 ~counter~0)} assume !(~r~0 < 0); {27169#(<= 52 ~counter~0)} is VALID [2022-04-07 14:03:04,069 INFO L290 TraceCheckUtils]: 163: Hoare triple {27169#(<= 52 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27194#(<= 52 |main_#t~post6|)} is VALID [2022-04-07 14:03:04,070 INFO L290 TraceCheckUtils]: 164: Hoare triple {27194#(<= 52 |main_#t~post6|)} assume !!(#t~post6 < 50);havoc #t~post6; {26698#false} is VALID [2022-04-07 14:03:04,070 INFO L272 TraceCheckUtils]: 165: Hoare triple {26698#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)); {26698#false} is VALID [2022-04-07 14:03:04,070 INFO L290 TraceCheckUtils]: 166: Hoare triple {26698#false} ~cond := #in~cond; {26698#false} is VALID [2022-04-07 14:03:04,070 INFO L290 TraceCheckUtils]: 167: Hoare triple {26698#false} assume !(0 == ~cond); {26698#false} is VALID [2022-04-07 14:03:04,070 INFO L290 TraceCheckUtils]: 168: Hoare triple {26698#false} assume true; {26698#false} is VALID [2022-04-07 14:03:04,070 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {26698#false} {26698#false} #94#return; {26698#false} is VALID [2022-04-07 14:03:04,070 INFO L290 TraceCheckUtils]: 170: Hoare triple {26698#false} assume !!(0 != ~r~0); {26698#false} is VALID [2022-04-07 14:03:04,070 INFO L290 TraceCheckUtils]: 171: Hoare triple {26698#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26698#false} is VALID [2022-04-07 14:03:04,070 INFO L290 TraceCheckUtils]: 172: Hoare triple {26698#false} assume !(#t~post7 < 50);havoc #t~post7; {26698#false} is VALID [2022-04-07 14:03:04,070 INFO L290 TraceCheckUtils]: 173: Hoare triple {26698#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26698#false} is VALID [2022-04-07 14:03:04,071 INFO L290 TraceCheckUtils]: 174: Hoare triple {26698#false} assume !(#t~post8 < 50);havoc #t~post8; {26698#false} is VALID [2022-04-07 14:03:04,071 INFO L290 TraceCheckUtils]: 175: Hoare triple {26698#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26698#false} is VALID [2022-04-07 14:03:04,071 INFO L290 TraceCheckUtils]: 176: Hoare triple {26698#false} assume !(#t~post6 < 50);havoc #t~post6; {26698#false} is VALID [2022-04-07 14:03:04,071 INFO L272 TraceCheckUtils]: 177: Hoare triple {26698#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26698#false} is VALID [2022-04-07 14:03:04,071 INFO L290 TraceCheckUtils]: 178: Hoare triple {26698#false} ~cond := #in~cond; {26698#false} is VALID [2022-04-07 14:03:04,071 INFO L290 TraceCheckUtils]: 179: Hoare triple {26698#false} assume 0 == ~cond; {26698#false} is VALID [2022-04-07 14:03:04,071 INFO L290 TraceCheckUtils]: 180: Hoare triple {26698#false} assume !false; {26698#false} is VALID [2022-04-07 14:03:04,072 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-07 14:03:04,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:03:04,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:04,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191312129] [2022-04-07 14:03:04,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:04,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400650080] [2022-04-07 14:03:04,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400650080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:03:04,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:03:04,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 14:03:04,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972914513] [2022-04-07 14:03:04,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:03:04,073 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-07 14:03:04,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:04,074 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-07 14:03:04,118 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-07 14:03:04,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 14:03:04,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:04,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 14:03:04,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 14:03:04,119 INFO L87 Difference]: Start difference. First operand 916 states and 1183 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-07 14:03:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:05,139 INFO L93 Difference]: Finished difference Result 1223 states and 1589 transitions. [2022-04-07 14:03:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 14:03:05,139 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-07 14:03:05,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:05,140 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-07 14:03:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-07 14:03:05,141 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-07 14:03:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-07 14:03:05,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2022-04-07 14:03:05,200 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-07 14:03:05,239 INFO L225 Difference]: With dead ends: 1223 [2022-04-07 14:03:05,240 INFO L226 Difference]: Without dead ends: 986 [2022-04-07 14:03:05,240 INFO L912 BasicCegarLoop]: 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-07 14:03:05,241 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:05,241 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 194 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:03:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-04-07 14:03:05,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 947. [2022-04-07 14:03:05,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:05,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 986 states. Second operand has 947 states, 711 states have (on average 1.1631504922644162) internal successors, (827), 718 states have internal predecessors, (827), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 179 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-07 14:03:05,869 INFO L74 IsIncluded]: Start isIncluded. First operand 986 states. Second operand has 947 states, 711 states have (on average 1.1631504922644162) internal successors, (827), 718 states have internal predecessors, (827), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 179 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-07 14:03:05,870 INFO L87 Difference]: Start difference. First operand 986 states. Second operand has 947 states, 711 states have (on average 1.1631504922644162) internal successors, (827), 718 states have internal predecessors, (827), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 179 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-07 14:03:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:05,915 INFO L93 Difference]: Finished difference Result 986 states and 1246 transitions. [2022-04-07 14:03:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1246 transitions. [2022-04-07 14:03:05,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:05,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:05,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 947 states, 711 states have (on average 1.1631504922644162) internal successors, (827), 718 states have internal predecessors, (827), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 179 states have call predecessors, (186), 186 states have call successors, (186) Second operand 986 states. [2022-04-07 14:03:05,920 INFO L87 Difference]: Start difference. First operand has 947 states, 711 states have (on average 1.1631504922644162) internal successors, (827), 718 states have internal predecessors, (827), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 179 states have call predecessors, (186), 186 states have call successors, (186) Second operand 986 states. [2022-04-07 14:03:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:05,970 INFO L93 Difference]: Finished difference Result 986 states and 1246 transitions. [2022-04-07 14:03:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1246 transitions. [2022-04-07 14:03:05,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:05,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:05,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:05,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 711 states have (on average 1.1631504922644162) internal successors, (827), 718 states have internal predecessors, (827), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 179 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-07 14:03:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1201 transitions. [2022-04-07 14:03:06,024 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1201 transitions. Word has length 181 [2022-04-07 14:03:06,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:06,024 INFO L478 AbstractCegarLoop]: Abstraction has 947 states and 1201 transitions. [2022-04-07 14:03:06,024 INFO L479 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-07 14:03:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1201 transitions. [2022-04-07 14:03:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:03:06,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:06,028 INFO L499 BasicCegarLoop]: 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-07 14:03:06,053 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-07 14:03:06,253 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-07 14:03:06,253 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:06,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:06,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1408642227, now seen corresponding path program 4 times [2022-04-07 14:03:06,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:06,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595690102] [2022-04-07 14:03:06,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:06,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:06,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:06,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21594928] [2022-04-07 14:03:06,282 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 14:03:06,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:06,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:06,283 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-07 14:03:06,284 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-07 14:03:06,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 14:03:06,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:06,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2022-04-07 14:03:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:06,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:06,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {32222#true} call ULTIMATE.init(); {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {32222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32222#true} {32222#true} #102#return; {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {32222#true} call #t~ret9 := main(); {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {32222#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; {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {32222#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32222#true} {32222#true} #90#return; {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L272 TraceCheckUtils]: 11: Hoare triple {32222#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)); {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32222#true} {32222#true} #92#return; {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {32222#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32222#true} is VALID [2022-04-07 14:03:06,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {32222#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {32222#true} assume !!(#t~post6 < 50);havoc #t~post6; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L272 TraceCheckUtils]: 19: Hoare triple {32222#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)); {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {32222#true} {32222#true} #94#return; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {32222#true} assume !!(0 != ~r~0); {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {32222#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {32222#true} assume !!(#t~post7 < 50);havoc #t~post7; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L272 TraceCheckUtils]: 27: Hoare triple {32222#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)); {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {32222#true} {32222#true} #96#return; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {32222#true} assume !(~r~0 > 0); {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {32222#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {32222#true} assume !!(#t~post8 < 50);havoc #t~post8; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L272 TraceCheckUtils]: 35: Hoare triple {32222#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)); {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-07 14:03:06,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {32222#true} {32222#true} #98#return; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {32222#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {32222#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {32222#true} assume !!(#t~post8 < 50);havoc #t~post8; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L272 TraceCheckUtils]: 43: Hoare triple {32222#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)); {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {32222#true} {32222#true} #98#return; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {32222#true} assume !(~r~0 < 0); {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {32222#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {32222#true} assume !!(#t~post6 < 50);havoc #t~post6; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L272 TraceCheckUtils]: 51: Hoare triple {32222#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)); {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {32222#true} {32222#true} #94#return; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 56: Hoare triple {32222#true} assume !!(0 != ~r~0); {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 57: Hoare triple {32222#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L290 TraceCheckUtils]: 58: Hoare triple {32222#true} assume !!(#t~post7 < 50);havoc #t~post7; {32222#true} is VALID [2022-04-07 14:03:06,812 INFO L272 TraceCheckUtils]: 59: Hoare triple {32222#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)); {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L290 TraceCheckUtils]: 60: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L290 TraceCheckUtils]: 61: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {32222#true} {32222#true} #96#return; {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L290 TraceCheckUtils]: 64: Hoare triple {32222#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L290 TraceCheckUtils]: 65: Hoare triple {32222#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L290 TraceCheckUtils]: 66: Hoare triple {32222#true} assume !!(#t~post7 < 50);havoc #t~post7; {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L272 TraceCheckUtils]: 67: Hoare triple {32222#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)); {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L290 TraceCheckUtils]: 68: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L290 TraceCheckUtils]: 69: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L290 TraceCheckUtils]: 70: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32222#true} {32222#true} #96#return; {32222#true} is VALID [2022-04-07 14:03:06,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {32222#true} assume !(~r~0 > 0); {32443#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:06,814 INFO L290 TraceCheckUtils]: 73: Hoare triple {32443#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:06,814 INFO L290 TraceCheckUtils]: 74: Hoare triple {32443#(not (< 0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:06,815 INFO L272 TraceCheckUtils]: 75: Hoare triple {32443#(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)); {32222#true} is VALID [2022-04-07 14:03:06,815 INFO L290 TraceCheckUtils]: 76: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-07 14:03:06,815 INFO L290 TraceCheckUtils]: 77: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-07 14:03:06,815 INFO L290 TraceCheckUtils]: 78: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,816 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {32222#true} {32443#(not (< 0 main_~r~0))} #98#return; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:06,816 INFO L290 TraceCheckUtils]: 80: Hoare triple {32443#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {32443#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:06,816 INFO L290 TraceCheckUtils]: 81: Hoare triple {32443#(not (< 0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:06,817 INFO L290 TraceCheckUtils]: 82: Hoare triple {32443#(not (< 0 main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:06,817 INFO L272 TraceCheckUtils]: 83: Hoare triple {32443#(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)); {32222#true} is VALID [2022-04-07 14:03:06,817 INFO L290 TraceCheckUtils]: 84: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-07 14:03:06,817 INFO L290 TraceCheckUtils]: 85: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-07 14:03:06,817 INFO L290 TraceCheckUtils]: 86: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,817 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32222#true} {32443#(not (< 0 main_~r~0))} #94#return; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:06,818 INFO L290 TraceCheckUtils]: 88: Hoare triple {32443#(not (< 0 main_~r~0))} assume !!(0 != ~r~0); {32443#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:06,818 INFO L290 TraceCheckUtils]: 89: Hoare triple {32443#(not (< 0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:06,818 INFO L290 TraceCheckUtils]: 90: Hoare triple {32443#(not (< 0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:06,818 INFO L272 TraceCheckUtils]: 91: Hoare triple {32443#(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)); {32222#true} is VALID [2022-04-07 14:03:06,818 INFO L290 TraceCheckUtils]: 92: Hoare triple {32222#true} ~cond := #in~cond; {32222#true} is VALID [2022-04-07 14:03:06,818 INFO L290 TraceCheckUtils]: 93: Hoare triple {32222#true} assume !(0 == ~cond); {32222#true} is VALID [2022-04-07 14:03:06,818 INFO L290 TraceCheckUtils]: 94: Hoare triple {32222#true} assume true; {32222#true} is VALID [2022-04-07 14:03:06,835 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {32222#true} {32443#(not (< 0 main_~r~0))} #96#return; {32443#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:06,835 INFO L290 TraceCheckUtils]: 96: Hoare triple {32443#(not (< 0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32223#false} is VALID [2022-04-07 14:03:06,835 INFO L290 TraceCheckUtils]: 97: Hoare triple {32223#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32223#false} is VALID [2022-04-07 14:03:06,835 INFO L290 TraceCheckUtils]: 98: Hoare triple {32223#false} assume !!(#t~post7 < 50);havoc #t~post7; {32223#false} is VALID [2022-04-07 14:03:06,835 INFO L272 TraceCheckUtils]: 99: Hoare triple {32223#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)); {32223#false} is VALID [2022-04-07 14:03:06,835 INFO L290 TraceCheckUtils]: 100: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-07 14:03:06,835 INFO L290 TraceCheckUtils]: 101: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-07 14:03:06,835 INFO L290 TraceCheckUtils]: 102: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-07 14:03:06,835 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {32223#false} {32223#false} #96#return; {32223#false} is VALID [2022-04-07 14:03:06,835 INFO L290 TraceCheckUtils]: 104: Hoare triple {32223#false} assume !(~r~0 > 0); {32223#false} is VALID [2022-04-07 14:03:06,835 INFO L290 TraceCheckUtils]: 105: Hoare triple {32223#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 106: Hoare triple {32223#false} assume !!(#t~post8 < 50);havoc #t~post8; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L272 TraceCheckUtils]: 107: Hoare triple {32223#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)); {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 108: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 109: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 110: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {32223#false} {32223#false} #98#return; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 112: Hoare triple {32223#false} assume !(~r~0 < 0); {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 113: Hoare triple {32223#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 114: Hoare triple {32223#false} assume !!(#t~post6 < 50);havoc #t~post6; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L272 TraceCheckUtils]: 115: Hoare triple {32223#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)); {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 116: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 117: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 118: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {32223#false} {32223#false} #94#return; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 120: Hoare triple {32223#false} assume !!(0 != ~r~0); {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 121: Hoare triple {32223#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 122: Hoare triple {32223#false} assume !!(#t~post7 < 50);havoc #t~post7; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L272 TraceCheckUtils]: 123: Hoare triple {32223#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)); {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 124: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 125: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L290 TraceCheckUtils]: 126: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-07 14:03:06,836 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {32223#false} {32223#false} #96#return; {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L290 TraceCheckUtils]: 128: Hoare triple {32223#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L290 TraceCheckUtils]: 129: Hoare triple {32223#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L290 TraceCheckUtils]: 130: Hoare triple {32223#false} assume !!(#t~post7 < 50);havoc #t~post7; {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L272 TraceCheckUtils]: 131: Hoare triple {32223#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)); {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L290 TraceCheckUtils]: 132: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L290 TraceCheckUtils]: 133: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L290 TraceCheckUtils]: 134: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {32223#false} {32223#false} #96#return; {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L290 TraceCheckUtils]: 136: Hoare triple {32223#false} assume !(~r~0 > 0); {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L290 TraceCheckUtils]: 137: Hoare triple {32223#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L290 TraceCheckUtils]: 138: Hoare triple {32223#false} assume !!(#t~post8 < 50);havoc #t~post8; {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L272 TraceCheckUtils]: 139: Hoare triple {32223#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)); {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L290 TraceCheckUtils]: 140: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L290 TraceCheckUtils]: 141: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L290 TraceCheckUtils]: 142: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-07 14:03:06,837 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {32223#false} {32223#false} #98#return; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 144: Hoare triple {32223#false} assume !(~r~0 < 0); {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 145: Hoare triple {32223#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 146: Hoare triple {32223#false} assume !!(#t~post6 < 50);havoc #t~post6; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L272 TraceCheckUtils]: 147: Hoare triple {32223#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)); {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 148: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 149: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 150: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {32223#false} {32223#false} #94#return; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 152: Hoare triple {32223#false} assume !!(0 != ~r~0); {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 153: Hoare triple {32223#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 154: Hoare triple {32223#false} assume !!(#t~post7 < 50);havoc #t~post7; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L272 TraceCheckUtils]: 155: Hoare triple {32223#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)); {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 156: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 157: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 158: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {32223#false} {32223#false} #96#return; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 160: Hoare triple {32223#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 161: Hoare triple {32223#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 162: Hoare triple {32223#false} assume !(#t~post7 < 50);havoc #t~post7; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 163: Hoare triple {32223#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32223#false} is VALID [2022-04-07 14:03:06,838 INFO L290 TraceCheckUtils]: 164: Hoare triple {32223#false} assume !!(#t~post8 < 50);havoc #t~post8; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L272 TraceCheckUtils]: 165: Hoare triple {32223#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)); {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 166: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 167: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 168: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {32223#false} {32223#false} #98#return; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 170: Hoare triple {32223#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 171: Hoare triple {32223#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 172: Hoare triple {32223#false} assume !!(#t~post8 < 50);havoc #t~post8; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L272 TraceCheckUtils]: 173: Hoare triple {32223#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)); {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 174: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 175: Hoare triple {32223#false} assume !(0 == ~cond); {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 176: Hoare triple {32223#false} assume true; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L284 TraceCheckUtils]: 177: Hoare quadruple {32223#false} {32223#false} #98#return; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 178: Hoare triple {32223#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 179: Hoare triple {32223#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 180: Hoare triple {32223#false} assume !(#t~post8 < 50);havoc #t~post8; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 181: Hoare triple {32223#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 182: Hoare triple {32223#false} assume !(#t~post6 < 50);havoc #t~post6; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L272 TraceCheckUtils]: 183: Hoare triple {32223#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 184: Hoare triple {32223#false} ~cond := #in~cond; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 185: Hoare triple {32223#false} assume 0 == ~cond; {32223#false} is VALID [2022-04-07 14:03:06,839 INFO L290 TraceCheckUtils]: 186: Hoare triple {32223#false} assume !false; {32223#false} is VALID [2022-04-07 14:03:06,840 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-07 14:03:06,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:03:06,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:06,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595690102] [2022-04-07 14:03:06,840 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:06,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21594928] [2022-04-07 14:03:06,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21594928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:03:06,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:03:06,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 14:03:06,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740139182] [2022-04-07 14:03:06,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:03:06,842 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-07 14:03:06,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:06,842 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-07 14:03:06,906 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-07 14:03:06,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 14:03:06,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:06,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 14:03:06,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 14:03:06,907 INFO L87 Difference]: Start difference. First operand 947 states and 1201 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-07 14:03:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:07,838 INFO L93 Difference]: Finished difference Result 1548 states and 1989 transitions. [2022-04-07 14:03:07,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 14:03:07,838 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-07 14:03:07,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:07,839 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-07 14:03:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-04-07 14:03:07,840 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-07 14:03:07,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-04-07 14:03:07,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2022-04-07 14:03:07,906 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-07 14:03:07,980 INFO L225 Difference]: With dead ends: 1548 [2022-04-07 14:03:07,980 INFO L226 Difference]: Without dead ends: 1005 [2022-04-07 14:03:07,981 INFO L912 BasicCegarLoop]: 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-07 14:03:07,982 INFO L913 BasicCegarLoop]: 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-07 14:03:07,982 INFO L914 BasicCegarLoop]: 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-07 14:03:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2022-04-07 14:03:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 953. [2022-04-07 14:03:08,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:08,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1005 states. Second operand has 953 states, 717 states have (on average 1.1617852161785216) internal successors, (833), 726 states have internal predecessors, (833), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 177 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-07 14:03:08,614 INFO L74 IsIncluded]: Start isIncluded. First operand 1005 states. Second operand has 953 states, 717 states have (on average 1.1617852161785216) internal successors, (833), 726 states have internal predecessors, (833), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 177 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-07 14:03:08,614 INFO L87 Difference]: Start difference. First operand 1005 states. Second operand has 953 states, 717 states have (on average 1.1617852161785216) internal successors, (833), 726 states have internal predecessors, (833), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 177 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-07 14:03:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:08,656 INFO L93 Difference]: Finished difference Result 1005 states and 1275 transitions. [2022-04-07 14:03:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1275 transitions. [2022-04-07 14:03:08,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:08,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:08,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 953 states, 717 states have (on average 1.1617852161785216) internal successors, (833), 726 states have internal predecessors, (833), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 177 states have call predecessors, (186), 186 states have call successors, (186) Second operand 1005 states. [2022-04-07 14:03:08,661 INFO L87 Difference]: Start difference. First operand has 953 states, 717 states have (on average 1.1617852161785216) internal successors, (833), 726 states have internal predecessors, (833), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 177 states have call predecessors, (186), 186 states have call successors, (186) Second operand 1005 states. [2022-04-07 14:03:08,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:08,707 INFO L93 Difference]: Finished difference Result 1005 states and 1275 transitions. [2022-04-07 14:03:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1275 transitions. [2022-04-07 14:03:08,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:08,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:08,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:08,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 717 states have (on average 1.1617852161785216) internal successors, (833), 726 states have internal predecessors, (833), 188 states have call successors, (188), 49 states have call predecessors, (188), 47 states have return successors, (186), 177 states have call predecessors, (186), 186 states have call successors, (186) [2022-04-07 14:03:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1207 transitions. [2022-04-07 14:03:08,774 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1207 transitions. Word has length 187 [2022-04-07 14:03:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:08,774 INFO L478 AbstractCegarLoop]: Abstraction has 953 states and 1207 transitions. [2022-04-07 14:03:08,775 INFO L479 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-07 14:03:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1207 transitions. [2022-04-07 14:03:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:03:08,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:08,779 INFO L499 BasicCegarLoop]: 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-07 14:03:08,812 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-07 14:03:08,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-07 14:03:08,991 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:08,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:08,992 INFO L85 PathProgramCache]: Analyzing trace with hash -464040263, now seen corresponding path program 5 times [2022-04-07 14:03:08,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:08,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092026566] [2022-04-07 14:03:08,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:08,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:09,017 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:09,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575989106] [2022-04-07 14:03:09,018 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 14:03:09,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:09,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:09,019 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-07 14:03:09,040 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-07 14:03:09,364 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-04-07 14:03:09,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:09,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-07 14:03:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:09,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:09,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {38259#true} call ULTIMATE.init(); {38259#true} is VALID [2022-04-07 14:03:09,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {38259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38259#true} is VALID [2022-04-07 14:03:09,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38259#true} {38259#true} #102#return; {38259#true} is VALID [2022-04-07 14:03:09,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {38259#true} call #t~ret9 := main(); {38259#true} is VALID [2022-04-07 14:03:09,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {38259#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; {38259#true} is VALID [2022-04-07 14:03:09,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {38259#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38259#true} {38259#true} #90#return; {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L272 TraceCheckUtils]: 11: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38259#true} {38259#true} #92#return; {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {38259#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {38259#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {38259#true} assume !!(#t~post6 < 50);havoc #t~post6; {38259#true} is VALID [2022-04-07 14:03:09,756 INFO L272 TraceCheckUtils]: 19: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {38259#true} {38259#true} #94#return; {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {38259#true} assume !!(0 != ~r~0); {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {38259#true} assume !!(#t~post7 < 50);havoc #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L272 TraceCheckUtils]: 27: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {38259#true} assume !(~r~0 > 0); {38259#true} is VALID [2022-04-07 14:03:09,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {38259#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {38259#true} assume !!(#t~post8 < 50);havoc #t~post8; {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L272 TraceCheckUtils]: 35: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38259#true} {38259#true} #98#return; {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {38259#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {38259#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {38259#true} assume !!(#t~post8 < 50);havoc #t~post8; {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L272 TraceCheckUtils]: 43: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {38259#true} {38259#true} #98#return; {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {38259#true} assume !(~r~0 < 0); {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {38259#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {38259#true} assume !!(#t~post6 < 50);havoc #t~post6; {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L272 TraceCheckUtils]: 51: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L290 TraceCheckUtils]: 52: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L290 TraceCheckUtils]: 53: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L290 TraceCheckUtils]: 54: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {38259#true} {38259#true} #94#return; {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L290 TraceCheckUtils]: 56: Hoare triple {38259#true} assume !!(0 != ~r~0); {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L290 TraceCheckUtils]: 58: Hoare triple {38259#true} assume !!(#t~post7 < 50);havoc #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L272 TraceCheckUtils]: 59: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,759 INFO L290 TraceCheckUtils]: 60: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L290 TraceCheckUtils]: 61: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L290 TraceCheckUtils]: 62: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L290 TraceCheckUtils]: 64: Hoare triple {38259#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L290 TraceCheckUtils]: 65: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L290 TraceCheckUtils]: 66: Hoare triple {38259#true} assume !!(#t~post7 < 50);havoc #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L272 TraceCheckUtils]: 67: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L290 TraceCheckUtils]: 68: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L290 TraceCheckUtils]: 69: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L290 TraceCheckUtils]: 70: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {38259#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L290 TraceCheckUtils]: 73: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,760 INFO L290 TraceCheckUtils]: 74: Hoare triple {38259#true} assume !!(#t~post7 < 50);havoc #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L272 TraceCheckUtils]: 75: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L290 TraceCheckUtils]: 76: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L290 TraceCheckUtils]: 77: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L290 TraceCheckUtils]: 78: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L290 TraceCheckUtils]: 80: Hoare triple {38259#true} assume !(~r~0 > 0); {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L290 TraceCheckUtils]: 81: Hoare triple {38259#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L290 TraceCheckUtils]: 82: Hoare triple {38259#true} assume !!(#t~post8 < 50);havoc #t~post8; {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L272 TraceCheckUtils]: 83: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L290 TraceCheckUtils]: 84: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L290 TraceCheckUtils]: 85: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L290 TraceCheckUtils]: 86: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {38259#true} {38259#true} #98#return; {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L290 TraceCheckUtils]: 88: Hoare triple {38259#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38259#true} is VALID [2022-04-07 14:03:09,761 INFO L290 TraceCheckUtils]: 89: Hoare triple {38259#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L290 TraceCheckUtils]: 90: Hoare triple {38259#true} assume !!(#t~post8 < 50);havoc #t~post8; {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L272 TraceCheckUtils]: 91: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L290 TraceCheckUtils]: 92: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L290 TraceCheckUtils]: 93: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L290 TraceCheckUtils]: 94: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {38259#true} {38259#true} #98#return; {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L290 TraceCheckUtils]: 96: Hoare triple {38259#true} assume !(~r~0 < 0); {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L290 TraceCheckUtils]: 97: Hoare triple {38259#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L290 TraceCheckUtils]: 98: Hoare triple {38259#true} assume !!(#t~post6 < 50);havoc #t~post6; {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L272 TraceCheckUtils]: 99: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L290 TraceCheckUtils]: 100: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L290 TraceCheckUtils]: 101: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L290 TraceCheckUtils]: 102: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,762 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {38259#true} {38259#true} #94#return; {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L290 TraceCheckUtils]: 104: Hoare triple {38259#true} assume !!(0 != ~r~0); {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L290 TraceCheckUtils]: 105: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L290 TraceCheckUtils]: 106: Hoare triple {38259#true} assume !!(#t~post7 < 50);havoc #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L272 TraceCheckUtils]: 107: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L290 TraceCheckUtils]: 108: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L290 TraceCheckUtils]: 109: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L290 TraceCheckUtils]: 110: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L290 TraceCheckUtils]: 112: Hoare triple {38259#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L290 TraceCheckUtils]: 113: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L290 TraceCheckUtils]: 114: Hoare triple {38259#true} assume !!(#t~post7 < 50);havoc #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L272 TraceCheckUtils]: 115: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L290 TraceCheckUtils]: 116: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L290 TraceCheckUtils]: 117: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,763 INFO L290 TraceCheckUtils]: 118: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 120: Hoare triple {38259#true} assume !(~r~0 > 0); {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 121: Hoare triple {38259#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 122: Hoare triple {38259#true} assume !!(#t~post8 < 50);havoc #t~post8; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L272 TraceCheckUtils]: 123: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 124: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 125: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 126: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {38259#true} {38259#true} #98#return; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 128: Hoare triple {38259#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 129: Hoare triple {38259#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 130: Hoare triple {38259#true} assume !!(#t~post8 < 50);havoc #t~post8; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L272 TraceCheckUtils]: 131: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 132: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 133: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 134: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {38259#true} {38259#true} #98#return; {38259#true} is VALID [2022-04-07 14:03:09,764 INFO L290 TraceCheckUtils]: 136: Hoare triple {38259#true} assume !(~r~0 < 0); {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L290 TraceCheckUtils]: 137: Hoare triple {38259#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L290 TraceCheckUtils]: 138: Hoare triple {38259#true} assume !!(#t~post6 < 50);havoc #t~post6; {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L272 TraceCheckUtils]: 139: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L290 TraceCheckUtils]: 140: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L290 TraceCheckUtils]: 141: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L290 TraceCheckUtils]: 142: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {38259#true} {38259#true} #94#return; {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L290 TraceCheckUtils]: 144: Hoare triple {38259#true} assume !!(0 != ~r~0); {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L290 TraceCheckUtils]: 145: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L290 TraceCheckUtils]: 146: Hoare triple {38259#true} assume !!(#t~post7 < 50);havoc #t~post7; {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L272 TraceCheckUtils]: 147: Hoare triple {38259#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)); {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L290 TraceCheckUtils]: 148: Hoare triple {38259#true} ~cond := #in~cond; {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L290 TraceCheckUtils]: 149: Hoare triple {38259#true} assume !(0 == ~cond); {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L290 TraceCheckUtils]: 150: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {38259#true} {38259#true} #96#return; {38259#true} is VALID [2022-04-07 14:03:09,765 INFO L290 TraceCheckUtils]: 152: Hoare triple {38259#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38259#true} is VALID [2022-04-07 14:03:09,766 INFO L290 TraceCheckUtils]: 153: Hoare triple {38259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38723#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-07 14:03:09,766 INFO L290 TraceCheckUtils]: 154: Hoare triple {38723#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 50);havoc #t~post7; {38727#(<= 51 ~counter~0)} is VALID [2022-04-07 14:03:09,767 INFO L290 TraceCheckUtils]: 155: Hoare triple {38727#(<= 51 ~counter~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38731#(<= 51 |main_#t~post8|)} is VALID [2022-04-07 14:03:09,767 INFO L290 TraceCheckUtils]: 156: Hoare triple {38731#(<= 51 |main_#t~post8|)} assume !!(#t~post8 < 50);havoc #t~post8; {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L272 TraceCheckUtils]: 157: Hoare triple {38260#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)); {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L290 TraceCheckUtils]: 158: Hoare triple {38260#false} ~cond := #in~cond; {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L290 TraceCheckUtils]: 159: Hoare triple {38260#false} assume !(0 == ~cond); {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L290 TraceCheckUtils]: 160: Hoare triple {38260#false} assume true; {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {38260#false} {38260#false} #98#return; {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L290 TraceCheckUtils]: 162: Hoare triple {38260#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L290 TraceCheckUtils]: 163: Hoare triple {38260#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L290 TraceCheckUtils]: 164: Hoare triple {38260#false} assume !!(#t~post8 < 50);havoc #t~post8; {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L272 TraceCheckUtils]: 165: Hoare triple {38260#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)); {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L290 TraceCheckUtils]: 166: Hoare triple {38260#false} ~cond := #in~cond; {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L290 TraceCheckUtils]: 167: Hoare triple {38260#false} assume !(0 == ~cond); {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L290 TraceCheckUtils]: 168: Hoare triple {38260#false} assume true; {38260#false} is VALID [2022-04-07 14:03:09,767 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {38260#false} {38260#false} #98#return; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 170: Hoare triple {38260#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 171: Hoare triple {38260#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 172: Hoare triple {38260#false} assume !!(#t~post8 < 50);havoc #t~post8; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L272 TraceCheckUtils]: 173: Hoare triple {38260#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)); {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 174: Hoare triple {38260#false} ~cond := #in~cond; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 175: Hoare triple {38260#false} assume !(0 == ~cond); {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 176: Hoare triple {38260#false} assume true; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L284 TraceCheckUtils]: 177: Hoare quadruple {38260#false} {38260#false} #98#return; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 178: Hoare triple {38260#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 179: Hoare triple {38260#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 180: Hoare triple {38260#false} assume !(#t~post8 < 50);havoc #t~post8; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 181: Hoare triple {38260#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 182: Hoare triple {38260#false} assume !(#t~post6 < 50);havoc #t~post6; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L272 TraceCheckUtils]: 183: Hoare triple {38260#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 184: Hoare triple {38260#false} ~cond := #in~cond; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 185: Hoare triple {38260#false} assume 0 == ~cond; {38260#false} is VALID [2022-04-07 14:03:09,768 INFO L290 TraceCheckUtils]: 186: Hoare triple {38260#false} assume !false; {38260#false} is VALID [2022-04-07 14:03:09,769 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-07 14:03:09,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:03:09,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:09,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092026566] [2022-04-07 14:03:09,769 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:09,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575989106] [2022-04-07 14:03:09,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575989106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:03:09,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:03:09,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:03:09,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137741178] [2022-04-07 14:03:09,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:03:09,770 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-07 14:03:09,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:09,770 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-07 14:03:09,810 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-07 14:03:09,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:03:09,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:09,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:03:09,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:03:09,810 INFO L87 Difference]: Start difference. First operand 953 states and 1207 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-07 14:03:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:10,511 INFO L93 Difference]: Finished difference Result 973 states and 1226 transitions. [2022-04-07 14:03:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:03:10,511 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-07 14:03:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:10,511 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-07 14:03:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 14:03:10,511 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-07 14:03:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 14:03:10,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 14:03:10,553 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-07 14:03:10,604 INFO L225 Difference]: With dead ends: 973 [2022-04-07 14:03:10,604 INFO L226 Difference]: Without dead ends: 917 [2022-04-07 14:03:10,605 INFO L912 BasicCegarLoop]: 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-07 14:03:10,605 INFO L913 BasicCegarLoop]: 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-07 14:03:10,605 INFO L914 BasicCegarLoop]: 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-07 14:03:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2022-04-07 14:03:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 892. [2022-04-07 14:03:11,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:11,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 917 states. Second operand has 892 states, 670 states have (on average 1.155223880597015) internal successors, (774), 678 states have internal predecessors, (774), 179 states have call successors, (179), 44 states have call predecessors, (179), 42 states have return successors, (177), 169 states have call predecessors, (177), 177 states have call successors, (177) [2022-04-07 14:03:11,191 INFO L74 IsIncluded]: Start isIncluded. First operand 917 states. Second operand has 892 states, 670 states have (on average 1.155223880597015) internal successors, (774), 678 states have internal predecessors, (774), 179 states have call successors, (179), 44 states have call predecessors, (179), 42 states have return successors, (177), 169 states have call predecessors, (177), 177 states have call successors, (177) [2022-04-07 14:03:11,191 INFO L87 Difference]: Start difference. First operand 917 states. Second operand has 892 states, 670 states have (on average 1.155223880597015) internal successors, (774), 678 states have internal predecessors, (774), 179 states have call successors, (179), 44 states have call predecessors, (179), 42 states have return successors, (177), 169 states have call predecessors, (177), 177 states have call successors, (177) [2022-04-07 14:03:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:11,225 INFO L93 Difference]: Finished difference Result 917 states and 1160 transitions. [2022-04-07 14:03:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1160 transitions. [2022-04-07 14:03:11,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:11,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:11,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 892 states, 670 states have (on average 1.155223880597015) internal successors, (774), 678 states have internal predecessors, (774), 179 states have call successors, (179), 44 states have call predecessors, (179), 42 states have return successors, (177), 169 states have call predecessors, (177), 177 states have call successors, (177) Second operand 917 states. [2022-04-07 14:03:11,229 INFO L87 Difference]: Start difference. First operand has 892 states, 670 states have (on average 1.155223880597015) internal successors, (774), 678 states have internal predecessors, (774), 179 states have call successors, (179), 44 states have call predecessors, (179), 42 states have return successors, (177), 169 states have call predecessors, (177), 177 states have call successors, (177) Second operand 917 states. [2022-04-07 14:03:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:11,269 INFO L93 Difference]: Finished difference Result 917 states and 1160 transitions. [2022-04-07 14:03:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1160 transitions. [2022-04-07 14:03:11,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:11,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:11,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:11,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 670 states have (on average 1.155223880597015) internal successors, (774), 678 states have internal predecessors, (774), 179 states have call successors, (179), 44 states have call predecessors, (179), 42 states have return successors, (177), 169 states have call predecessors, (177), 177 states have call successors, (177) [2022-04-07 14:03:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1130 transitions. [2022-04-07 14:03:11,320 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1130 transitions. Word has length 187 [2022-04-07 14:03:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:11,320 INFO L478 AbstractCegarLoop]: Abstraction has 892 states and 1130 transitions. [2022-04-07 14:03:11,320 INFO L479 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-07 14:03:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1130 transitions. [2022-04-07 14:03:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:03:11,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:11,324 INFO L499 BasicCegarLoop]: 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-07 14:03:11,331 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-07 14:03:11,529 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-07 14:03:11,530 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:11,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:11,530 INFO L85 PathProgramCache]: Analyzing trace with hash 372440269, now seen corresponding path program 6 times [2022-04-07 14:03:11,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:11,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748501493] [2022-04-07 14:03:11,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:11,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:11,553 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:11,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1075439242] [2022-04-07 14:03:11,553 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 14:03:11,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:11,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:11,554 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-07 14:03:11,559 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-07 14:03:11,744 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-07 14:03:11,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:11,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 14:03:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:11,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:12,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {43235#true} call ULTIMATE.init(); {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {43235#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43235#true} {43235#true} #102#return; {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {43235#true} call #t~ret9 := main(); {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {43235#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; {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L272 TraceCheckUtils]: 6: Hoare triple {43235#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43235#true} {43235#true} #90#return; {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L272 TraceCheckUtils]: 11: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,163 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43235#true} {43235#true} #92#return; {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {43235#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {43235#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {43235#true} assume !!(#t~post6 < 50);havoc #t~post6; {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L272 TraceCheckUtils]: 19: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43235#true} {43235#true} #94#return; {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {43235#true} assume !!(0 != ~r~0); {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {43235#true} assume !!(#t~post7 < 50);havoc #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L272 TraceCheckUtils]: 27: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {43235#true} assume !(~r~0 > 0); {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {43235#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {43235#true} assume !!(#t~post8 < 50);havoc #t~post8; {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L272 TraceCheckUtils]: 35: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43235#true} {43235#true} #98#return; {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {43235#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {43235#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43235#true} is VALID [2022-04-07 14:03:12,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {43235#true} assume !!(#t~post8 < 50);havoc #t~post8; {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L272 TraceCheckUtils]: 43: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {43235#true} {43235#true} #98#return; {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {43235#true} assume !(~r~0 < 0); {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {43235#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {43235#true} assume !!(#t~post6 < 50);havoc #t~post6; {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L272 TraceCheckUtils]: 51: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43235#true} {43235#true} #94#return; {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {43235#true} assume !!(0 != ~r~0); {43235#true} is VALID [2022-04-07 14:03:12,166 INFO L290 TraceCheckUtils]: 57: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {43235#true} assume !!(#t~post7 < 50);havoc #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L272 TraceCheckUtils]: 59: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L290 TraceCheckUtils]: 62: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L290 TraceCheckUtils]: 64: Hoare triple {43235#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L290 TraceCheckUtils]: 65: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L290 TraceCheckUtils]: 66: Hoare triple {43235#true} assume !!(#t~post7 < 50);havoc #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L272 TraceCheckUtils]: 67: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L290 TraceCheckUtils]: 68: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L290 TraceCheckUtils]: 69: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L290 TraceCheckUtils]: 70: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,167 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 72: Hoare triple {43235#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 73: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 74: Hoare triple {43235#true} assume !!(#t~post7 < 50);havoc #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L272 TraceCheckUtils]: 75: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 76: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 77: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 78: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 80: Hoare triple {43235#true} assume !(~r~0 > 0); {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 81: Hoare triple {43235#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 82: Hoare triple {43235#true} assume !!(#t~post8 < 50);havoc #t~post8; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L272 TraceCheckUtils]: 83: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 84: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 85: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 86: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {43235#true} {43235#true} #98#return; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 88: Hoare triple {43235#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 89: Hoare triple {43235#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 90: Hoare triple {43235#true} assume !!(#t~post8 < 50);havoc #t~post8; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L272 TraceCheckUtils]: 91: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 92: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,168 INFO L290 TraceCheckUtils]: 93: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 94: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {43235#true} {43235#true} #98#return; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 96: Hoare triple {43235#true} assume !(~r~0 < 0); {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 97: Hoare triple {43235#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 98: Hoare triple {43235#true} assume !!(#t~post6 < 50);havoc #t~post6; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L272 TraceCheckUtils]: 99: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 100: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 101: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 102: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {43235#true} {43235#true} #94#return; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 104: Hoare triple {43235#true} assume !!(0 != ~r~0); {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 105: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 106: Hoare triple {43235#true} assume !!(#t~post7 < 50);havoc #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L272 TraceCheckUtils]: 107: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 108: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 109: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 110: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 112: Hoare triple {43235#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 113: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L290 TraceCheckUtils]: 114: Hoare triple {43235#true} assume !!(#t~post7 < 50);havoc #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,169 INFO L272 TraceCheckUtils]: 115: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 116: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 117: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 118: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 120: Hoare triple {43235#true} assume !(~r~0 > 0); {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 121: Hoare triple {43235#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 122: Hoare triple {43235#true} assume !!(#t~post8 < 50);havoc #t~post8; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L272 TraceCheckUtils]: 123: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 124: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 125: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 126: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {43235#true} {43235#true} #98#return; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 128: Hoare triple {43235#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 129: Hoare triple {43235#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 130: Hoare triple {43235#true} assume !!(#t~post8 < 50);havoc #t~post8; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L272 TraceCheckUtils]: 131: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 132: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 133: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 134: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {43235#true} {43235#true} #98#return; {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 136: Hoare triple {43235#true} assume !(~r~0 < 0); {43235#true} is VALID [2022-04-07 14:03:12,170 INFO L290 TraceCheckUtils]: 137: Hoare triple {43235#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 138: Hoare triple {43235#true} assume !!(#t~post6 < 50);havoc #t~post6; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L272 TraceCheckUtils]: 139: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 140: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 141: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 142: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {43235#true} {43235#true} #94#return; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 144: Hoare triple {43235#true} assume !!(0 != ~r~0); {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 145: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 146: Hoare triple {43235#true} assume !!(#t~post7 < 50);havoc #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L272 TraceCheckUtils]: 147: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 148: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 149: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 150: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 152: Hoare triple {43235#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 153: Hoare triple {43235#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 154: Hoare triple {43235#true} assume !!(#t~post7 < 50);havoc #t~post7; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L272 TraceCheckUtils]: 155: Hoare triple {43235#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)); {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 156: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 157: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L290 TraceCheckUtils]: 158: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,171 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {43235#true} {43235#true} #96#return; {43235#true} is VALID [2022-04-07 14:03:12,172 INFO L290 TraceCheckUtils]: 160: Hoare triple {43235#true} assume !(~r~0 > 0); {43720#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:12,173 INFO L290 TraceCheckUtils]: 161: Hoare triple {43720#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43720#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:12,173 INFO L290 TraceCheckUtils]: 162: Hoare triple {43720#(not (< 0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {43720#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:12,173 INFO L272 TraceCheckUtils]: 163: Hoare triple {43720#(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)); {43235#true} is VALID [2022-04-07 14:03:12,173 INFO L290 TraceCheckUtils]: 164: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,173 INFO L290 TraceCheckUtils]: 165: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,173 INFO L290 TraceCheckUtils]: 166: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,174 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {43235#true} {43720#(not (< 0 main_~r~0))} #98#return; {43720#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:12,174 INFO L290 TraceCheckUtils]: 168: Hoare triple {43720#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-07 14:03:12,174 INFO L290 TraceCheckUtils]: 169: Hoare triple {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-07 14:03:12,175 INFO L290 TraceCheckUtils]: 170: Hoare triple {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 50);havoc #t~post6; {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-07 14:03:12,175 INFO L272 TraceCheckUtils]: 171: Hoare triple {43745#(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)); {43235#true} is VALID [2022-04-07 14:03:12,175 INFO L290 TraceCheckUtils]: 172: Hoare triple {43235#true} ~cond := #in~cond; {43235#true} is VALID [2022-04-07 14:03:12,175 INFO L290 TraceCheckUtils]: 173: Hoare triple {43235#true} assume !(0 == ~cond); {43235#true} is VALID [2022-04-07 14:03:12,175 INFO L290 TraceCheckUtils]: 174: Hoare triple {43235#true} assume true; {43235#true} is VALID [2022-04-07 14:03:12,175 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {43235#true} {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-07 14:03:12,176 INFO L290 TraceCheckUtils]: 176: Hoare triple {43745#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {43236#false} is VALID [2022-04-07 14:03:12,176 INFO L290 TraceCheckUtils]: 177: Hoare triple {43236#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43236#false} is VALID [2022-04-07 14:03:12,176 INFO L290 TraceCheckUtils]: 178: Hoare triple {43236#false} assume !(#t~post7 < 50);havoc #t~post7; {43236#false} is VALID [2022-04-07 14:03:12,176 INFO L290 TraceCheckUtils]: 179: Hoare triple {43236#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43236#false} is VALID [2022-04-07 14:03:12,176 INFO L290 TraceCheckUtils]: 180: Hoare triple {43236#false} assume !(#t~post8 < 50);havoc #t~post8; {43236#false} is VALID [2022-04-07 14:03:12,176 INFO L290 TraceCheckUtils]: 181: Hoare triple {43236#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43236#false} is VALID [2022-04-07 14:03:12,176 INFO L290 TraceCheckUtils]: 182: Hoare triple {43236#false} assume !(#t~post6 < 50);havoc #t~post6; {43236#false} is VALID [2022-04-07 14:03:12,176 INFO L272 TraceCheckUtils]: 183: Hoare triple {43236#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43236#false} is VALID [2022-04-07 14:03:12,176 INFO L290 TraceCheckUtils]: 184: Hoare triple {43236#false} ~cond := #in~cond; {43236#false} is VALID [2022-04-07 14:03:12,176 INFO L290 TraceCheckUtils]: 185: Hoare triple {43236#false} assume 0 == ~cond; {43236#false} is VALID [2022-04-07 14:03:12,176 INFO L290 TraceCheckUtils]: 186: Hoare triple {43236#false} assume !false; {43236#false} is VALID [2022-04-07 14:03:12,177 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-07 14:03:12,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:03:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:12,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748501493] [2022-04-07 14:03:12,177 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:12,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075439242] [2022-04-07 14:03:12,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075439242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:03:12,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:03:12,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 14:03:12,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46351085] [2022-04-07 14:03:12,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:03:12,178 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-07 14:03:12,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:12,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-07 14:03:12,215 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-07 14:03:12,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 14:03:12,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:12,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 14:03:12,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:03:12,215 INFO L87 Difference]: Start difference. First operand 892 states and 1130 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-07 14:03:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:12,932 INFO L93 Difference]: Finished difference Result 939 states and 1179 transitions. [2022-04-07 14:03:12,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 14:03:12,932 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-07 14:03:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:12,932 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-07 14:03:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-07 14:03:12,933 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-07 14:03:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-07 14:03:12,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-07 14:03:13,009 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-07 14:03:13,055 INFO L225 Difference]: With dead ends: 939 [2022-04-07 14:03:13,055 INFO L226 Difference]: Without dead ends: 868 [2022-04-07 14:03:13,056 INFO L912 BasicCegarLoop]: 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-07 14:03:13,057 INFO L913 BasicCegarLoop]: 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-07 14:03:13,057 INFO L914 BasicCegarLoop]: 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-07 14:03:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-04-07 14:03:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 841. [2022-04-07 14:03:13,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:13,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 868 states. Second operand has 841 states, 632 states have (on average 1.1487341772151898) internal successors, (726), 639 states have internal predecessors, (726), 166 states have call successors, (166), 44 states have call predecessors, (166), 42 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-07 14:03:13,643 INFO L74 IsIncluded]: Start isIncluded. First operand 868 states. Second operand has 841 states, 632 states have (on average 1.1487341772151898) internal successors, (726), 639 states have internal predecessors, (726), 166 states have call successors, (166), 44 states have call predecessors, (166), 42 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-07 14:03:13,644 INFO L87 Difference]: Start difference. First operand 868 states. Second operand has 841 states, 632 states have (on average 1.1487341772151898) internal successors, (726), 639 states have internal predecessors, (726), 166 states have call successors, (166), 44 states have call predecessors, (166), 42 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-07 14:03:13,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:13,679 INFO L93 Difference]: Finished difference Result 868 states and 1088 transitions. [2022-04-07 14:03:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1088 transitions. [2022-04-07 14:03:13,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:13,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:13,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 632 states have (on average 1.1487341772151898) internal successors, (726), 639 states have internal predecessors, (726), 166 states have call successors, (166), 44 states have call predecessors, (166), 42 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) Second operand 868 states. [2022-04-07 14:03:13,682 INFO L87 Difference]: Start difference. First operand has 841 states, 632 states have (on average 1.1487341772151898) internal successors, (726), 639 states have internal predecessors, (726), 166 states have call successors, (166), 44 states have call predecessors, (166), 42 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) Second operand 868 states. [2022-04-07 14:03:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:13,718 INFO L93 Difference]: Finished difference Result 868 states and 1088 transitions. [2022-04-07 14:03:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1088 transitions. [2022-04-07 14:03:13,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:13,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:13,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:13,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 632 states have (on average 1.1487341772151898) internal successors, (726), 639 states have internal predecessors, (726), 166 states have call successors, (166), 44 states have call predecessors, (166), 42 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-07 14:03:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1056 transitions. [2022-04-07 14:03:13,764 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1056 transitions. Word has length 187 [2022-04-07 14:03:13,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:13,764 INFO L478 AbstractCegarLoop]: Abstraction has 841 states and 1056 transitions. [2022-04-07 14:03:13,764 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-07 14:03:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1056 transitions. [2022-04-07 14:03:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:03:13,767 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:13,767 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:03:13,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-07 14:03:13,972 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-07 14:03:13,972 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash -288806385, now seen corresponding path program 7 times [2022-04-07 14:03:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102476795] [2022-04-07 14:03:13,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:13,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:13,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:13,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1012276840] [2022-04-07 14:03:13,992 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 14:03:13,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:13,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:13,993 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-07 14:03:14,003 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-07 14:03:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:14,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 14:03:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:14,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:14,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {47996#true} call ULTIMATE.init(); {47996#true} is VALID [2022-04-07 14:03:14,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {47996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47996#true} {47996#true} #102#return; {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {47996#true} call #t~ret9 := main(); {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {47996#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; {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {47996#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47996#true} {47996#true} #90#return; {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L272 TraceCheckUtils]: 11: Hoare triple {47996#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)); {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47996#true} {47996#true} #92#return; {47996#true} is VALID [2022-04-07 14:03:14,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {47996#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {48049#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,731 INFO L272 TraceCheckUtils]: 19: Hoare triple {48049#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:14,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,732 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #94#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {48049#(<= main_~v~0 1)} assume !!(0 != ~r~0); {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {48049#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,732 INFO L272 TraceCheckUtils]: 27: Hoare triple {48049#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:14,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,733 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #96#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {48049#(<= main_~v~0 1)} assume !(~r~0 > 0); {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {48049#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,734 INFO L272 TraceCheckUtils]: 35: Hoare triple {48049#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:14,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,734 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #98#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {48049#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {48049#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,735 INFO L272 TraceCheckUtils]: 43: Hoare triple {48049#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:14,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,736 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #98#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,736 INFO L290 TraceCheckUtils]: 48: Hoare triple {48049#(<= main_~v~0 1)} assume !(~r~0 < 0); {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,736 INFO L290 TraceCheckUtils]: 49: Hoare triple {48049#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,737 INFO L290 TraceCheckUtils]: 50: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,737 INFO L272 TraceCheckUtils]: 51: Hoare triple {48049#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:14,737 INFO L290 TraceCheckUtils]: 52: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,737 INFO L290 TraceCheckUtils]: 54: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,737 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #94#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,737 INFO L290 TraceCheckUtils]: 56: Hoare triple {48049#(<= main_~v~0 1)} assume !!(0 != ~r~0); {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {48049#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,738 INFO L272 TraceCheckUtils]: 59: Hoare triple {48049#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:14,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,738 INFO L290 TraceCheckUtils]: 62: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,739 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #96#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:14,739 INFO L290 TraceCheckUtils]: 64: Hoare triple {48049#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48194#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:14,739 INFO L290 TraceCheckUtils]: 65: Hoare triple {48194#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48194#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:14,740 INFO L290 TraceCheckUtils]: 66: Hoare triple {48194#(<= main_~v~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {48194#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:14,740 INFO L272 TraceCheckUtils]: 67: Hoare triple {48194#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:14,740 INFO L290 TraceCheckUtils]: 68: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,740 INFO L290 TraceCheckUtils]: 69: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,740 INFO L290 TraceCheckUtils]: 70: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,740 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47996#true} {48194#(<= main_~v~0 3)} #96#return; {48194#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:14,741 INFO L290 TraceCheckUtils]: 72: Hoare triple {48194#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:14,741 INFO L290 TraceCheckUtils]: 73: Hoare triple {48219#(< 0 (+ main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:14,741 INFO L290 TraceCheckUtils]: 74: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !!(#t~post7 < 50);havoc #t~post7; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:14,741 INFO L272 TraceCheckUtils]: 75: Hoare triple {48219#(< 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)); {47996#true} is VALID [2022-04-07 14:03:14,741 INFO L290 TraceCheckUtils]: 76: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,741 INFO L290 TraceCheckUtils]: 77: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,741 INFO L290 TraceCheckUtils]: 78: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,742 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47996#true} {48219#(< 0 (+ main_~r~0 3))} #96#return; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:14,742 INFO L290 TraceCheckUtils]: 80: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !(~r~0 > 0); {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:14,742 INFO L290 TraceCheckUtils]: 81: Hoare triple {48219#(< 0 (+ main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:14,743 INFO L290 TraceCheckUtils]: 82: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !!(#t~post8 < 50);havoc #t~post8; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:14,743 INFO L272 TraceCheckUtils]: 83: Hoare triple {48219#(< 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)); {47996#true} is VALID [2022-04-07 14:03:14,743 INFO L290 TraceCheckUtils]: 84: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,743 INFO L290 TraceCheckUtils]: 85: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,743 INFO L290 TraceCheckUtils]: 86: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,743 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47996#true} {48219#(< 0 (+ main_~r~0 3))} #98#return; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:14,744 INFO L290 TraceCheckUtils]: 88: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:14,744 INFO L290 TraceCheckUtils]: 89: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:14,745 INFO L290 TraceCheckUtils]: 90: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:14,745 INFO L272 TraceCheckUtils]: 91: Hoare triple {48268#(< 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)); {47996#true} is VALID [2022-04-07 14:03:14,745 INFO L290 TraceCheckUtils]: 92: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,745 INFO L290 TraceCheckUtils]: 93: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,745 INFO L290 TraceCheckUtils]: 94: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,745 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47996#true} {48268#(< main_~u~0 (+ 5 main_~r~0))} #98#return; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:14,745 INFO L290 TraceCheckUtils]: 96: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !(~r~0 < 0); {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:14,746 INFO L290 TraceCheckUtils]: 97: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:14,746 INFO L290 TraceCheckUtils]: 98: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:14,746 INFO L272 TraceCheckUtils]: 99: Hoare triple {48268#(< 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)); {47996#true} is VALID [2022-04-07 14:03:14,746 INFO L290 TraceCheckUtils]: 100: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,746 INFO L290 TraceCheckUtils]: 101: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,746 INFO L290 TraceCheckUtils]: 102: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,747 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {47996#true} {48268#(< main_~u~0 (+ 5 main_~r~0))} #94#return; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:14,747 INFO L290 TraceCheckUtils]: 104: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(0 != ~r~0); {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:14,747 INFO L290 TraceCheckUtils]: 105: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:14,747 INFO L290 TraceCheckUtils]: 106: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:14,747 INFO L272 TraceCheckUtils]: 107: Hoare triple {48268#(< 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)); {47996#true} is VALID [2022-04-07 14:03:14,747 INFO L290 TraceCheckUtils]: 108: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,748 INFO L290 TraceCheckUtils]: 109: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,748 INFO L290 TraceCheckUtils]: 110: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,748 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {47996#true} {48268#(< main_~u~0 (+ 5 main_~r~0))} #96#return; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:14,749 INFO L290 TraceCheckUtils]: 112: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-07 14:03:14,749 INFO L290 TraceCheckUtils]: 113: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-07 14:03:14,749 INFO L290 TraceCheckUtils]: 114: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(#t~post7 < 50);havoc #t~post7; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-07 14:03:14,749 INFO L272 TraceCheckUtils]: 115: Hoare triple {48341#(< 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)); {47996#true} is VALID [2022-04-07 14:03:14,749 INFO L290 TraceCheckUtils]: 116: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,749 INFO L290 TraceCheckUtils]: 117: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,749 INFO L290 TraceCheckUtils]: 118: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,750 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {47996#true} {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #96#return; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-07 14:03:14,750 INFO L290 TraceCheckUtils]: 120: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !(~r~0 > 0); {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-07 14:03:14,750 INFO L290 TraceCheckUtils]: 121: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-07 14:03:14,751 INFO L290 TraceCheckUtils]: 122: Hoare triple {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(#t~post8 < 50);havoc #t~post8; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-07 14:03:14,751 INFO L272 TraceCheckUtils]: 123: Hoare triple {48341#(< 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)); {47996#true} is VALID [2022-04-07 14:03:14,751 INFO L290 TraceCheckUtils]: 124: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,751 INFO L290 TraceCheckUtils]: 125: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,751 INFO L290 TraceCheckUtils]: 126: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,751 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {47996#true} {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #98#return; {48341#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-07 14:03:14,752 INFO L290 TraceCheckUtils]: 128: Hoare triple {48341#(< 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; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:14,752 INFO L290 TraceCheckUtils]: 129: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:14,752 INFO L290 TraceCheckUtils]: 130: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:14,752 INFO L272 TraceCheckUtils]: 131: Hoare triple {48390#(< 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)); {47996#true} is VALID [2022-04-07 14:03:14,752 INFO L290 TraceCheckUtils]: 132: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,752 INFO L290 TraceCheckUtils]: 133: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,753 INFO L290 TraceCheckUtils]: 134: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,753 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {47996#true} {48390#(< main_~r~0 (+ main_~v~0 1))} #98#return; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:14,753 INFO L290 TraceCheckUtils]: 136: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !(~r~0 < 0); {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:14,753 INFO L290 TraceCheckUtils]: 137: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:14,754 INFO L290 TraceCheckUtils]: 138: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:14,754 INFO L272 TraceCheckUtils]: 139: Hoare triple {48390#(< 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)); {47996#true} is VALID [2022-04-07 14:03:14,754 INFO L290 TraceCheckUtils]: 140: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,754 INFO L290 TraceCheckUtils]: 141: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,754 INFO L290 TraceCheckUtils]: 142: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,754 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {47996#true} {48390#(< main_~r~0 (+ main_~v~0 1))} #94#return; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:14,755 INFO L290 TraceCheckUtils]: 144: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(0 != ~r~0); {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:14,755 INFO L290 TraceCheckUtils]: 145: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:14,755 INFO L290 TraceCheckUtils]: 146: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:14,755 INFO L272 TraceCheckUtils]: 147: Hoare triple {48390#(< 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)); {47996#true} is VALID [2022-04-07 14:03:14,755 INFO L290 TraceCheckUtils]: 148: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,755 INFO L290 TraceCheckUtils]: 149: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,755 INFO L290 TraceCheckUtils]: 150: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,756 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {47996#true} {48390#(< main_~r~0 (+ main_~v~0 1))} #96#return; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:14,756 INFO L290 TraceCheckUtils]: 152: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48463#(< main_~r~0 1)} is VALID [2022-04-07 14:03:14,756 INFO L290 TraceCheckUtils]: 153: Hoare triple {48463#(< main_~r~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48463#(< main_~r~0 1)} is VALID [2022-04-07 14:03:14,757 INFO L290 TraceCheckUtils]: 154: Hoare triple {48463#(< main_~r~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {48463#(< main_~r~0 1)} is VALID [2022-04-07 14:03:14,757 INFO L272 TraceCheckUtils]: 155: Hoare triple {48463#(< 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)); {47996#true} is VALID [2022-04-07 14:03:14,757 INFO L290 TraceCheckUtils]: 156: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:14,757 INFO L290 TraceCheckUtils]: 157: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:14,757 INFO L290 TraceCheckUtils]: 158: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:14,757 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {47996#true} {48463#(< main_~r~0 1)} #96#return; {48463#(< main_~r~0 1)} is VALID [2022-04-07 14:03:14,758 INFO L290 TraceCheckUtils]: 160: Hoare triple {48463#(< main_~r~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L290 TraceCheckUtils]: 161: Hoare triple {47997#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L290 TraceCheckUtils]: 162: Hoare triple {47997#false} assume !!(#t~post7 < 50);havoc #t~post7; {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L272 TraceCheckUtils]: 163: Hoare triple {47997#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)); {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L290 TraceCheckUtils]: 164: Hoare triple {47997#false} ~cond := #in~cond; {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L290 TraceCheckUtils]: 165: Hoare triple {47997#false} assume !(0 == ~cond); {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L290 TraceCheckUtils]: 166: Hoare triple {47997#false} assume true; {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {47997#false} {47997#false} #96#return; {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L290 TraceCheckUtils]: 168: Hoare triple {47997#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L290 TraceCheckUtils]: 169: Hoare triple {47997#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L290 TraceCheckUtils]: 170: Hoare triple {47997#false} assume !!(#t~post7 < 50);havoc #t~post7; {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L272 TraceCheckUtils]: 171: Hoare triple {47997#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)); {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L290 TraceCheckUtils]: 172: Hoare triple {47997#false} ~cond := #in~cond; {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L290 TraceCheckUtils]: 173: Hoare triple {47997#false} assume !(0 == ~cond); {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L290 TraceCheckUtils]: 174: Hoare triple {47997#false} assume true; {47997#false} is VALID [2022-04-07 14:03:14,758 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {47997#false} {47997#false} #96#return; {47997#false} is VALID [2022-04-07 14:03:14,759 INFO L290 TraceCheckUtils]: 176: Hoare triple {47997#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47997#false} is VALID [2022-04-07 14:03:14,759 INFO L290 TraceCheckUtils]: 177: Hoare triple {47997#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47997#false} is VALID [2022-04-07 14:03:14,759 INFO L290 TraceCheckUtils]: 178: Hoare triple {47997#false} assume !(#t~post7 < 50);havoc #t~post7; {47997#false} is VALID [2022-04-07 14:03:14,759 INFO L290 TraceCheckUtils]: 179: Hoare triple {47997#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47997#false} is VALID [2022-04-07 14:03:14,759 INFO L290 TraceCheckUtils]: 180: Hoare triple {47997#false} assume !(#t~post8 < 50);havoc #t~post8; {47997#false} is VALID [2022-04-07 14:03:14,759 INFO L290 TraceCheckUtils]: 181: Hoare triple {47997#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47997#false} is VALID [2022-04-07 14:03:14,759 INFO L290 TraceCheckUtils]: 182: Hoare triple {47997#false} assume !(#t~post6 < 50);havoc #t~post6; {47997#false} is VALID [2022-04-07 14:03:14,759 INFO L272 TraceCheckUtils]: 183: Hoare triple {47997#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47997#false} is VALID [2022-04-07 14:03:14,759 INFO L290 TraceCheckUtils]: 184: Hoare triple {47997#false} ~cond := #in~cond; {47997#false} is VALID [2022-04-07 14:03:14,759 INFO L290 TraceCheckUtils]: 185: Hoare triple {47997#false} assume 0 == ~cond; {47997#false} is VALID [2022-04-07 14:03:14,759 INFO L290 TraceCheckUtils]: 186: Hoare triple {47997#false} assume !false; {47997#false} is VALID [2022-04-07 14:03:14,760 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-07 14:03:14,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:03:15,411 INFO L290 TraceCheckUtils]: 186: Hoare triple {47997#false} assume !false; {47997#false} is VALID [2022-04-07 14:03:15,411 INFO L290 TraceCheckUtils]: 185: Hoare triple {47997#false} assume 0 == ~cond; {47997#false} is VALID [2022-04-07 14:03:15,411 INFO L290 TraceCheckUtils]: 184: Hoare triple {47997#false} ~cond := #in~cond; {47997#false} is VALID [2022-04-07 14:03:15,411 INFO L272 TraceCheckUtils]: 183: Hoare triple {47997#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47997#false} is VALID [2022-04-07 14:03:15,411 INFO L290 TraceCheckUtils]: 182: Hoare triple {47997#false} assume !(#t~post6 < 50);havoc #t~post6; {47997#false} is VALID [2022-04-07 14:03:15,411 INFO L290 TraceCheckUtils]: 181: Hoare triple {47997#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47997#false} is VALID [2022-04-07 14:03:15,411 INFO L290 TraceCheckUtils]: 180: Hoare triple {47997#false} assume !(#t~post8 < 50);havoc #t~post8; {47997#false} is VALID [2022-04-07 14:03:15,411 INFO L290 TraceCheckUtils]: 179: Hoare triple {47997#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47997#false} is VALID [2022-04-07 14:03:15,411 INFO L290 TraceCheckUtils]: 178: Hoare triple {47997#false} assume !(#t~post7 < 50);havoc #t~post7; {47997#false} is VALID [2022-04-07 14:03:15,411 INFO L290 TraceCheckUtils]: 177: Hoare triple {47997#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47997#false} is VALID [2022-04-07 14:03:15,412 INFO L290 TraceCheckUtils]: 176: Hoare triple {47997#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47997#false} is VALID [2022-04-07 14:03:15,412 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {47996#true} {47997#false} #96#return; {47997#false} is VALID [2022-04-07 14:03:15,412 INFO L290 TraceCheckUtils]: 174: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,412 INFO L290 TraceCheckUtils]: 173: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,412 INFO L290 TraceCheckUtils]: 172: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,412 INFO L272 TraceCheckUtils]: 171: Hoare triple {47997#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)); {47996#true} is VALID [2022-04-07 14:03:15,412 INFO L290 TraceCheckUtils]: 170: Hoare triple {47997#false} assume !!(#t~post7 < 50);havoc #t~post7; {47997#false} is VALID [2022-04-07 14:03:15,412 INFO L290 TraceCheckUtils]: 169: Hoare triple {47997#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47997#false} is VALID [2022-04-07 14:03:15,412 INFO L290 TraceCheckUtils]: 168: Hoare triple {47997#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47997#false} is VALID [2022-04-07 14:03:15,412 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {47996#true} {47997#false} #96#return; {47997#false} is VALID [2022-04-07 14:03:15,412 INFO L290 TraceCheckUtils]: 166: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,412 INFO L290 TraceCheckUtils]: 165: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,412 INFO L290 TraceCheckUtils]: 164: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,412 INFO L272 TraceCheckUtils]: 163: Hoare triple {47997#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)); {47996#true} is VALID [2022-04-07 14:03:15,412 INFO L290 TraceCheckUtils]: 162: Hoare triple {47997#false} assume !!(#t~post7 < 50);havoc #t~post7; {47997#false} is VALID [2022-04-07 14:03:15,412 INFO L290 TraceCheckUtils]: 161: Hoare triple {47997#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47997#false} is VALID [2022-04-07 14:03:15,413 INFO L290 TraceCheckUtils]: 160: Hoare triple {48463#(< main_~r~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47997#false} is VALID [2022-04-07 14:03:15,413 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {47996#true} {48463#(< main_~r~0 1)} #96#return; {48463#(< main_~r~0 1)} is VALID [2022-04-07 14:03:15,413 INFO L290 TraceCheckUtils]: 158: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,413 INFO L290 TraceCheckUtils]: 157: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,413 INFO L290 TraceCheckUtils]: 156: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,414 INFO L272 TraceCheckUtils]: 155: Hoare triple {48463#(< 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)); {47996#true} is VALID [2022-04-07 14:03:15,418 INFO L290 TraceCheckUtils]: 154: Hoare triple {48463#(< main_~r~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {48463#(< main_~r~0 1)} is VALID [2022-04-07 14:03:15,418 INFO L290 TraceCheckUtils]: 153: Hoare triple {48463#(< main_~r~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48463#(< main_~r~0 1)} is VALID [2022-04-07 14:03:15,419 INFO L290 TraceCheckUtils]: 152: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48463#(< main_~r~0 1)} is VALID [2022-04-07 14:03:15,420 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {47996#true} {48390#(< main_~r~0 (+ main_~v~0 1))} #96#return; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:15,420 INFO L290 TraceCheckUtils]: 150: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,420 INFO L290 TraceCheckUtils]: 149: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,420 INFO L290 TraceCheckUtils]: 148: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,420 INFO L272 TraceCheckUtils]: 147: Hoare triple {48390#(< 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)); {47996#true} is VALID [2022-04-07 14:03:15,420 INFO L290 TraceCheckUtils]: 146: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:15,420 INFO L290 TraceCheckUtils]: 145: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:15,421 INFO L290 TraceCheckUtils]: 144: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(0 != ~r~0); {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:15,421 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {47996#true} {48390#(< main_~r~0 (+ main_~v~0 1))} #94#return; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:15,421 INFO L290 TraceCheckUtils]: 142: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,421 INFO L290 TraceCheckUtils]: 141: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,421 INFO L290 TraceCheckUtils]: 140: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,421 INFO L272 TraceCheckUtils]: 139: Hoare triple {48390#(< 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)); {47996#true} is VALID [2022-04-07 14:03:15,421 INFO L290 TraceCheckUtils]: 138: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:15,422 INFO L290 TraceCheckUtils]: 137: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:15,422 INFO L290 TraceCheckUtils]: 136: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !(~r~0 < 0); {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:15,422 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {47996#true} {48390#(< main_~r~0 (+ main_~v~0 1))} #98#return; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:15,422 INFO L290 TraceCheckUtils]: 134: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,423 INFO L290 TraceCheckUtils]: 133: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,423 INFO L290 TraceCheckUtils]: 132: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,423 INFO L272 TraceCheckUtils]: 131: Hoare triple {48390#(< 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)); {47996#true} is VALID [2022-04-07 14:03:15,430 INFO L290 TraceCheckUtils]: 130: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:15,431 INFO L290 TraceCheckUtils]: 129: Hoare triple {48390#(< main_~r~0 (+ main_~v~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:15,432 INFO L290 TraceCheckUtils]: 128: Hoare triple {48740#(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; {48390#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-07 14:03:15,432 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {47996#true} {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #98#return; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-07 14:03:15,432 INFO L290 TraceCheckUtils]: 126: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,432 INFO L290 TraceCheckUtils]: 125: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,433 INFO L290 TraceCheckUtils]: 124: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,433 INFO L272 TraceCheckUtils]: 123: Hoare triple {48740#(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)); {47996#true} is VALID [2022-04-07 14:03:15,439 INFO L290 TraceCheckUtils]: 122: Hoare triple {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !!(#t~post8 < 50);havoc #t~post8; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-07 14:03:15,440 INFO L290 TraceCheckUtils]: 121: Hoare triple {48740#(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; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-07 14:03:15,440 INFO L290 TraceCheckUtils]: 120: Hoare triple {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !(~r~0 > 0); {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-07 14:03:15,441 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {47996#true} {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #96#return; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-07 14:03:15,441 INFO L290 TraceCheckUtils]: 118: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,441 INFO L290 TraceCheckUtils]: 117: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,442 INFO L290 TraceCheckUtils]: 116: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,442 INFO L272 TraceCheckUtils]: 115: Hoare triple {48740#(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)); {47996#true} is VALID [2022-04-07 14:03:15,442 INFO L290 TraceCheckUtils]: 114: Hoare triple {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !!(#t~post7 < 50);havoc #t~post7; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-07 14:03:15,443 INFO L290 TraceCheckUtils]: 113: Hoare triple {48740#(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; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-07 14:03:15,444 INFO L290 TraceCheckUtils]: 112: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48740#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-07 14:03:15,444 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {47996#true} {48268#(< main_~u~0 (+ 5 main_~r~0))} #96#return; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:15,445 INFO L290 TraceCheckUtils]: 110: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,445 INFO L290 TraceCheckUtils]: 109: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,445 INFO L290 TraceCheckUtils]: 108: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,445 INFO L272 TraceCheckUtils]: 107: Hoare triple {48268#(< 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)); {47996#true} is VALID [2022-04-07 14:03:15,445 INFO L290 TraceCheckUtils]: 106: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:15,446 INFO L290 TraceCheckUtils]: 105: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:15,446 INFO L290 TraceCheckUtils]: 104: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(0 != ~r~0); {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:15,447 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {47996#true} {48268#(< main_~u~0 (+ 5 main_~r~0))} #94#return; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:15,447 INFO L290 TraceCheckUtils]: 102: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,447 INFO L290 TraceCheckUtils]: 101: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,447 INFO L290 TraceCheckUtils]: 100: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,447 INFO L272 TraceCheckUtils]: 99: Hoare triple {48268#(< 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)); {47996#true} is VALID [2022-04-07 14:03:15,448 INFO L290 TraceCheckUtils]: 98: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:15,448 INFO L290 TraceCheckUtils]: 97: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:15,449 INFO L290 TraceCheckUtils]: 96: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !(~r~0 < 0); {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:15,450 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47996#true} {48268#(< main_~u~0 (+ 5 main_~r~0))} #98#return; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:15,450 INFO L290 TraceCheckUtils]: 94: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,450 INFO L290 TraceCheckUtils]: 93: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,450 INFO L290 TraceCheckUtils]: 92: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,450 INFO L272 TraceCheckUtils]: 91: Hoare triple {48268#(< 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)); {47996#true} is VALID [2022-04-07 14:03:15,450 INFO L290 TraceCheckUtils]: 90: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:15,451 INFO L290 TraceCheckUtils]: 89: Hoare triple {48268#(< main_~u~0 (+ 5 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:15,451 INFO L290 TraceCheckUtils]: 88: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48268#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-07 14:03:15,452 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47996#true} {48219#(< 0 (+ main_~r~0 3))} #98#return; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:15,452 INFO L290 TraceCheckUtils]: 86: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,452 INFO L290 TraceCheckUtils]: 85: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,452 INFO L290 TraceCheckUtils]: 84: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,452 INFO L272 TraceCheckUtils]: 83: Hoare triple {48219#(< 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)); {47996#true} is VALID [2022-04-07 14:03:15,452 INFO L290 TraceCheckUtils]: 82: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !!(#t~post8 < 50);havoc #t~post8; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:15,453 INFO L290 TraceCheckUtils]: 81: Hoare triple {48219#(< 0 (+ main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:15,453 INFO L290 TraceCheckUtils]: 80: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !(~r~0 > 0); {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:15,453 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47996#true} {48219#(< 0 (+ main_~r~0 3))} #96#return; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:15,453 INFO L290 TraceCheckUtils]: 78: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,453 INFO L290 TraceCheckUtils]: 77: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,454 INFO L290 TraceCheckUtils]: 76: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,454 INFO L272 TraceCheckUtils]: 75: Hoare triple {48219#(< 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)); {47996#true} is VALID [2022-04-07 14:03:15,454 INFO L290 TraceCheckUtils]: 74: Hoare triple {48219#(< 0 (+ main_~r~0 3))} assume !!(#t~post7 < 50);havoc #t~post7; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:15,454 INFO L290 TraceCheckUtils]: 73: Hoare triple {48219#(< 0 (+ main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:15,455 INFO L290 TraceCheckUtils]: 72: Hoare triple {48194#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48219#(< 0 (+ main_~r~0 3))} is VALID [2022-04-07 14:03:15,455 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47996#true} {48194#(<= main_~v~0 3)} #96#return; {48194#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:15,455 INFO L290 TraceCheckUtils]: 70: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,455 INFO L290 TraceCheckUtils]: 69: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,455 INFO L290 TraceCheckUtils]: 68: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,455 INFO L272 TraceCheckUtils]: 67: Hoare triple {48194#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:15,456 INFO L290 TraceCheckUtils]: 66: Hoare triple {48194#(<= main_~v~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {48194#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:15,456 INFO L290 TraceCheckUtils]: 65: Hoare triple {48194#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48194#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:15,456 INFO L290 TraceCheckUtils]: 64: Hoare triple {48049#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48194#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:15,457 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #96#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,457 INFO L290 TraceCheckUtils]: 62: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,457 INFO L290 TraceCheckUtils]: 60: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,457 INFO L272 TraceCheckUtils]: 59: Hoare triple {48049#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:15,457 INFO L290 TraceCheckUtils]: 58: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,457 INFO L290 TraceCheckUtils]: 57: Hoare triple {48049#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,458 INFO L290 TraceCheckUtils]: 56: Hoare triple {48049#(<= main_~v~0 1)} assume !!(0 != ~r~0); {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,458 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #94#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,458 INFO L290 TraceCheckUtils]: 54: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,458 INFO L290 TraceCheckUtils]: 53: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,458 INFO L290 TraceCheckUtils]: 52: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,458 INFO L272 TraceCheckUtils]: 51: Hoare triple {48049#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:15,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {48049#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {48049#(<= main_~v~0 1)} assume !(~r~0 < 0); {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,459 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #98#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,460 INFO L272 TraceCheckUtils]: 43: Hoare triple {48049#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:15,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {48049#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {48049#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,461 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #98#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,461 INFO L272 TraceCheckUtils]: 35: Hoare triple {48049#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:15,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {48049#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {48049#(<= main_~v~0 1)} assume !(~r~0 > 0); {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,463 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #96#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,463 INFO L272 TraceCheckUtils]: 27: Hoare triple {48049#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:15,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {48049#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {48049#(<= main_~v~0 1)} assume !!(0 != ~r~0); {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,464 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47996#true} {48049#(<= main_~v~0 1)} #94#return; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,464 INFO L272 TraceCheckUtils]: 19: Hoare triple {48049#(<= 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)); {47996#true} is VALID [2022-04-07 14:03:15,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {48049#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {48049#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {47996#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {48049#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:15,465 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47996#true} {47996#true} #92#return; {47996#true} is VALID [2022-04-07 14:03:15,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,465 INFO L272 TraceCheckUtils]: 11: Hoare triple {47996#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)); {47996#true} is VALID [2022-04-07 14:03:15,465 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47996#true} {47996#true} #90#return; {47996#true} is VALID [2022-04-07 14:03:15,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {47996#true} assume !(0 == ~cond); {47996#true} is VALID [2022-04-07 14:03:15,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {47996#true} ~cond := #in~cond; {47996#true} is VALID [2022-04-07 14:03:15,465 INFO L272 TraceCheckUtils]: 6: Hoare triple {47996#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47996#true} is VALID [2022-04-07 14:03:15,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {47996#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; {47996#true} is VALID [2022-04-07 14:03:15,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {47996#true} call #t~ret9 := main(); {47996#true} is VALID [2022-04-07 14:03:15,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47996#true} {47996#true} #102#return; {47996#true} is VALID [2022-04-07 14:03:15,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {47996#true} assume true; {47996#true} is VALID [2022-04-07 14:03:15,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {47996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47996#true} is VALID [2022-04-07 14:03:15,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {47996#true} call ULTIMATE.init(); {47996#true} is VALID [2022-04-07 14:03:15,466 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-07 14:03:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:15,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102476795] [2022-04-07 14:03:15,467 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:15,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012276840] [2022-04-07 14:03:15,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012276840] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:03:15,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:03:15,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2022-04-07 14:03:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838693118] [2022-04-07 14:03:15,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:03:15,468 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-07 14:03:15,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:15,468 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-07 14:03:15,567 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-07 14:03:15,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 14:03:15,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:15,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 14:03:15,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:03:15,568 INFO L87 Difference]: Start difference. First operand 841 states and 1056 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-07 14:03:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:19,959 INFO L93 Difference]: Finished difference Result 1792 states and 2329 transitions. [2022-04-07 14:03:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-07 14:03:19,959 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-07 14:03:19,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:19,959 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-07 14:03:19,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 430 transitions. [2022-04-07 14:03:19,965 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-07 14:03:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 430 transitions. [2022-04-07 14:03:19,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 430 transitions. [2022-04-07 14:03:20,327 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-07 14:03:20,425 INFO L225 Difference]: With dead ends: 1792 [2022-04-07 14:03:20,426 INFO L226 Difference]: Without dead ends: 1595 [2022-04-07 14:03:20,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2022-04-07 14:03:20,427 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 138 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:20,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 905 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-07 14:03:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2022-04-07 14:03:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1400. [2022-04-07 14:03:21,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:21,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1595 states. Second operand has 1400 states, 1052 states have (on average 1.170152091254753) internal successors, (1231), 1068 states have internal predecessors, (1231), 305 states have call successors, (305), 44 states have call predecessors, (305), 42 states have return successors, (303), 287 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 14:03:21,764 INFO L74 IsIncluded]: Start isIncluded. First operand 1595 states. Second operand has 1400 states, 1052 states have (on average 1.170152091254753) internal successors, (1231), 1068 states have internal predecessors, (1231), 305 states have call successors, (305), 44 states have call predecessors, (305), 42 states have return successors, (303), 287 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 14:03:21,765 INFO L87 Difference]: Start difference. First operand 1595 states. Second operand has 1400 states, 1052 states have (on average 1.170152091254753) internal successors, (1231), 1068 states have internal predecessors, (1231), 305 states have call successors, (305), 44 states have call predecessors, (305), 42 states have return successors, (303), 287 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 14:03:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:21,857 INFO L93 Difference]: Finished difference Result 1595 states and 2066 transitions. [2022-04-07 14:03:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2066 transitions. [2022-04-07 14:03:21,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:21,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:21,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 1400 states, 1052 states have (on average 1.170152091254753) internal successors, (1231), 1068 states have internal predecessors, (1231), 305 states have call successors, (305), 44 states have call predecessors, (305), 42 states have return successors, (303), 287 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1595 states. [2022-04-07 14:03:21,861 INFO L87 Difference]: Start difference. First operand has 1400 states, 1052 states have (on average 1.170152091254753) internal successors, (1231), 1068 states have internal predecessors, (1231), 305 states have call successors, (305), 44 states have call predecessors, (305), 42 states have return successors, (303), 287 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1595 states. [2022-04-07 14:03:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:21,957 INFO L93 Difference]: Finished difference Result 1595 states and 2066 transitions. [2022-04-07 14:03:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2066 transitions. [2022-04-07 14:03:21,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:21,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:21,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:21,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1052 states have (on average 1.170152091254753) internal successors, (1231), 1068 states have internal predecessors, (1231), 305 states have call successors, (305), 44 states have call predecessors, (305), 42 states have return successors, (303), 287 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 14:03:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1839 transitions. [2022-04-07 14:03:22,062 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1839 transitions. Word has length 187 [2022-04-07 14:03:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:22,062 INFO L478 AbstractCegarLoop]: Abstraction has 1400 states and 1839 transitions. [2022-04-07 14:03:22,062 INFO L479 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-07 14:03:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1839 transitions. [2022-04-07 14:03:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:03:22,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:22,066 INFO L499 BasicCegarLoop]: 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-07 14:03:22,088 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-07 14:03:22,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:22,279 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:22,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:22,280 INFO L85 PathProgramCache]: Analyzing trace with hash -719610275, now seen corresponding path program 8 times [2022-04-07 14:03:22,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:22,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924872646] [2022-04-07 14:03:22,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:22,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:22,299 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:22,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606858091] [2022-04-07 14:03:22,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:03:22,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:22,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:22,300 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-07 14:03:22,301 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-07 14:03:22,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:03:22,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:22,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 14:03:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:22,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:23,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {56805#true} call ULTIMATE.init(); {56805#true} is VALID [2022-04-07 14:03:23,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {56805#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {56805#true} is VALID [2022-04-07 14:03:23,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56805#true} {56805#true} #102#return; {56805#true} is VALID [2022-04-07 14:03:23,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {56805#true} call #t~ret9 := main(); {56805#true} is VALID [2022-04-07 14:03:23,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {56805#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; {56805#true} is VALID [2022-04-07 14:03:23,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {56805#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {56805#true} is VALID [2022-04-07 14:03:23,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56805#true} {56805#true} #90#return; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L272 TraceCheckUtils]: 11: Hoare triple {56805#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)); {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56805#true} {56805#true} #92#return; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {56805#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {56805#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {56805#true} assume !!(#t~post6 < 50);havoc #t~post6; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L272 TraceCheckUtils]: 19: Hoare triple {56805#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)); {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56805#true} {56805#true} #94#return; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {56805#true} assume !!(0 != ~r~0); {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {56805#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {56805#true} assume !!(#t~post7 < 50);havoc #t~post7; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L272 TraceCheckUtils]: 27: Hoare triple {56805#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)); {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,126 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56805#true} {56805#true} #96#return; {56805#true} is VALID [2022-04-07 14:03:23,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {56805#true} assume !(~r~0 > 0); {56805#true} is VALID [2022-04-07 14:03:23,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {56805#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56805#true} is VALID [2022-04-07 14:03:23,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {56805#true} assume !!(#t~post8 < 50);havoc #t~post8; {56805#true} is VALID [2022-04-07 14:03:23,126 INFO L272 TraceCheckUtils]: 35: Hoare triple {56805#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)); {56805#true} is VALID [2022-04-07 14:03:23,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,126 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56805#true} {56805#true} #98#return; {56805#true} is VALID [2022-04-07 14:03:23,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {56805#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-07 14:03:23,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-07 14:03:23,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 50);havoc #t~post8; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-07 14:03:23,128 INFO L272 TraceCheckUtils]: 43: Hoare triple {56930#(< (+ 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)); {56805#true} is VALID [2022-04-07 14:03:23,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,128 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56805#true} {56930#(< (+ main_~r~0 2) main_~u~0)} #98#return; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-07 14:03:23,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-07 14:03:23,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-07 14:03:23,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 50);havoc #t~post6; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-07 14:03:23,129 INFO L272 TraceCheckUtils]: 51: Hoare triple {56930#(< (+ 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)); {56805#true} is VALID [2022-04-07 14:03:23,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,129 INFO L290 TraceCheckUtils]: 53: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,130 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56805#true} {56930#(< (+ main_~r~0 2) main_~u~0)} #94#return; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-07 14:03:23,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-07 14:03:23,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-07 14:03:23,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-07 14:03:23,131 INFO L272 TraceCheckUtils]: 59: Hoare triple {56930#(< (+ 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)); {56805#true} is VALID [2022-04-07 14:03:23,131 INFO L290 TraceCheckUtils]: 60: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,131 INFO L290 TraceCheckUtils]: 61: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,131 INFO L290 TraceCheckUtils]: 62: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,131 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56805#true} {56930#(< (+ main_~r~0 2) main_~u~0)} #96#return; {56930#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-07 14:03:23,132 INFO L290 TraceCheckUtils]: 64: Hoare triple {56930#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-07 14:03:23,132 INFO L290 TraceCheckUtils]: 65: Hoare triple {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-07 14:03:23,133 INFO L290 TraceCheckUtils]: 66: Hoare triple {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-07 14:03:23,133 INFO L272 TraceCheckUtils]: 67: Hoare triple {57003#(< (+ 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)); {56805#true} is VALID [2022-04-07 14:03:23,133 INFO L290 TraceCheckUtils]: 68: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,133 INFO L290 TraceCheckUtils]: 69: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,133 INFO L290 TraceCheckUtils]: 70: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,133 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56805#true} {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-07 14:03:23,134 INFO L290 TraceCheckUtils]: 72: Hoare triple {57003#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-07 14:03:23,134 INFO L290 TraceCheckUtils]: 73: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-07 14:03:23,135 INFO L290 TraceCheckUtils]: 74: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !!(#t~post7 < 50);havoc #t~post7; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-07 14:03:23,135 INFO L272 TraceCheckUtils]: 75: Hoare triple {57028#(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)); {56805#true} is VALID [2022-04-07 14:03:23,135 INFO L290 TraceCheckUtils]: 76: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,135 INFO L290 TraceCheckUtils]: 77: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,135 INFO L290 TraceCheckUtils]: 78: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,135 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56805#true} {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #96#return; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-07 14:03:23,135 INFO L290 TraceCheckUtils]: 80: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !(~r~0 > 0); {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-07 14:03:23,136 INFO L290 TraceCheckUtils]: 81: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-07 14:03:23,136 INFO L290 TraceCheckUtils]: 82: Hoare triple {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !!(#t~post8 < 50);havoc #t~post8; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-07 14:03:23,136 INFO L272 TraceCheckUtils]: 83: Hoare triple {57028#(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)); {56805#true} is VALID [2022-04-07 14:03:23,136 INFO L290 TraceCheckUtils]: 84: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,136 INFO L290 TraceCheckUtils]: 85: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,136 INFO L290 TraceCheckUtils]: 86: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,137 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56805#true} {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #98#return; {57028#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-07 14:03:23,137 INFO L290 TraceCheckUtils]: 88: Hoare triple {57028#(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; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-07 14:03:23,138 INFO L290 TraceCheckUtils]: 89: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-07 14:03:23,138 INFO L290 TraceCheckUtils]: 90: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(#t~post8 < 50);havoc #t~post8; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-07 14:03:23,138 INFO L272 TraceCheckUtils]: 91: Hoare triple {57077#(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)); {56805#true} is VALID [2022-04-07 14:03:23,138 INFO L290 TraceCheckUtils]: 92: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,138 INFO L290 TraceCheckUtils]: 93: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,138 INFO L290 TraceCheckUtils]: 94: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,139 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56805#true} {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #98#return; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-07 14:03:23,139 INFO L290 TraceCheckUtils]: 96: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !(~r~0 < 0); {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-07 14:03:23,139 INFO L290 TraceCheckUtils]: 97: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-07 14:03:23,140 INFO L290 TraceCheckUtils]: 98: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(#t~post6 < 50);havoc #t~post6; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-07 14:03:23,140 INFO L272 TraceCheckUtils]: 99: Hoare triple {57077#(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)); {56805#true} is VALID [2022-04-07 14:03:23,140 INFO L290 TraceCheckUtils]: 100: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,140 INFO L290 TraceCheckUtils]: 101: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,140 INFO L290 TraceCheckUtils]: 102: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,140 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56805#true} {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #94#return; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-07 14:03:23,141 INFO L290 TraceCheckUtils]: 104: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(0 != ~r~0); {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-07 14:03:23,141 INFO L290 TraceCheckUtils]: 105: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-07 14:03:23,141 INFO L290 TraceCheckUtils]: 106: Hoare triple {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(#t~post7 < 50);havoc #t~post7; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-07 14:03:23,142 INFO L272 TraceCheckUtils]: 107: Hoare triple {57077#(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)); {56805#true} is VALID [2022-04-07 14:03:23,142 INFO L290 TraceCheckUtils]: 108: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,142 INFO L290 TraceCheckUtils]: 109: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,142 INFO L290 TraceCheckUtils]: 110: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,142 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {56805#true} {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #96#return; {57077#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-07 14:03:23,143 INFO L290 TraceCheckUtils]: 112: Hoare triple {57077#(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; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,143 INFO L290 TraceCheckUtils]: 113: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,143 INFO L290 TraceCheckUtils]: 114: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,143 INFO L272 TraceCheckUtils]: 115: Hoare triple {57150#(< 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)); {56805#true} is VALID [2022-04-07 14:03:23,145 INFO L290 TraceCheckUtils]: 116: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,145 INFO L290 TraceCheckUtils]: 117: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,145 INFO L290 TraceCheckUtils]: 118: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,146 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {56805#true} {57150#(< 4 (+ main_~u~0 main_~r~0))} #96#return; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,146 INFO L290 TraceCheckUtils]: 120: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,146 INFO L290 TraceCheckUtils]: 121: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,147 INFO L290 TraceCheckUtils]: 122: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,147 INFO L272 TraceCheckUtils]: 123: Hoare triple {57150#(< 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)); {56805#true} is VALID [2022-04-07 14:03:23,147 INFO L290 TraceCheckUtils]: 124: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,147 INFO L290 TraceCheckUtils]: 125: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,147 INFO L290 TraceCheckUtils]: 126: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,147 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {56805#true} {57150#(< 4 (+ main_~u~0 main_~r~0))} #98#return; {57150#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,164 INFO L290 TraceCheckUtils]: 128: Hoare triple {57150#(< 4 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {57199#(< 4 main_~r~0)} is VALID [2022-04-07 14:03:23,164 INFO L290 TraceCheckUtils]: 129: Hoare triple {57199#(< 4 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57199#(< 4 main_~r~0)} is VALID [2022-04-07 14:03:23,165 INFO L290 TraceCheckUtils]: 130: Hoare triple {57199#(< 4 main_~r~0)} assume !!(#t~post8 < 50);havoc #t~post8; {57199#(< 4 main_~r~0)} is VALID [2022-04-07 14:03:23,165 INFO L272 TraceCheckUtils]: 131: Hoare triple {57199#(< 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)); {56805#true} is VALID [2022-04-07 14:03:23,165 INFO L290 TraceCheckUtils]: 132: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,165 INFO L290 TraceCheckUtils]: 133: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,165 INFO L290 TraceCheckUtils]: 134: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,166 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {56805#true} {57199#(< 4 main_~r~0)} #98#return; {57199#(< 4 main_~r~0)} is VALID [2022-04-07 14:03:23,167 INFO L290 TraceCheckUtils]: 136: Hoare triple {57199#(< 4 main_~r~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56806#false} is VALID [2022-04-07 14:03:23,167 INFO L290 TraceCheckUtils]: 137: Hoare triple {56806#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56806#false} is VALID [2022-04-07 14:03:23,167 INFO L290 TraceCheckUtils]: 138: Hoare triple {56806#false} assume !!(#t~post8 < 50);havoc #t~post8; {56806#false} is VALID [2022-04-07 14:03:23,167 INFO L272 TraceCheckUtils]: 139: Hoare triple {56806#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)); {56806#false} is VALID [2022-04-07 14:03:23,167 INFO L290 TraceCheckUtils]: 140: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-07 14:03:23,167 INFO L290 TraceCheckUtils]: 141: Hoare triple {56806#false} assume !(0 == ~cond); {56806#false} is VALID [2022-04-07 14:03:23,167 INFO L290 TraceCheckUtils]: 142: Hoare triple {56806#false} assume true; {56806#false} is VALID [2022-04-07 14:03:23,167 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {56806#false} {56806#false} #98#return; {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L290 TraceCheckUtils]: 144: Hoare triple {56806#false} assume !(~r~0 < 0); {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L290 TraceCheckUtils]: 145: Hoare triple {56806#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L290 TraceCheckUtils]: 146: Hoare triple {56806#false} assume !!(#t~post6 < 50);havoc #t~post6; {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L272 TraceCheckUtils]: 147: Hoare triple {56806#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)); {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L290 TraceCheckUtils]: 148: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L290 TraceCheckUtils]: 149: Hoare triple {56806#false} assume !(0 == ~cond); {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L290 TraceCheckUtils]: 150: Hoare triple {56806#false} assume true; {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {56806#false} {56806#false} #94#return; {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L290 TraceCheckUtils]: 152: Hoare triple {56806#false} assume !!(0 != ~r~0); {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L290 TraceCheckUtils]: 153: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L290 TraceCheckUtils]: 154: Hoare triple {56806#false} assume !!(#t~post7 < 50);havoc #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L272 TraceCheckUtils]: 155: Hoare triple {56806#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)); {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L290 TraceCheckUtils]: 156: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L290 TraceCheckUtils]: 157: Hoare triple {56806#false} assume !(0 == ~cond); {56806#false} is VALID [2022-04-07 14:03:23,168 INFO L290 TraceCheckUtils]: 158: Hoare triple {56806#false} assume true; {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {56806#false} {56806#false} #96#return; {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L290 TraceCheckUtils]: 160: Hoare triple {56806#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L290 TraceCheckUtils]: 161: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L290 TraceCheckUtils]: 162: Hoare triple {56806#false} assume !!(#t~post7 < 50);havoc #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L272 TraceCheckUtils]: 163: Hoare triple {56806#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)); {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L290 TraceCheckUtils]: 164: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L290 TraceCheckUtils]: 165: Hoare triple {56806#false} assume !(0 == ~cond); {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L290 TraceCheckUtils]: 166: Hoare triple {56806#false} assume true; {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {56806#false} {56806#false} #96#return; {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L290 TraceCheckUtils]: 168: Hoare triple {56806#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L290 TraceCheckUtils]: 169: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L290 TraceCheckUtils]: 170: Hoare triple {56806#false} assume !!(#t~post7 < 50);havoc #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L272 TraceCheckUtils]: 171: Hoare triple {56806#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)); {56806#false} is VALID [2022-04-07 14:03:23,169 INFO L290 TraceCheckUtils]: 172: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L290 TraceCheckUtils]: 173: Hoare triple {56806#false} assume !(0 == ~cond); {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L290 TraceCheckUtils]: 174: Hoare triple {56806#false} assume true; {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {56806#false} {56806#false} #96#return; {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L290 TraceCheckUtils]: 176: Hoare triple {56806#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L290 TraceCheckUtils]: 177: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L290 TraceCheckUtils]: 178: Hoare triple {56806#false} assume !(#t~post7 < 50);havoc #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L290 TraceCheckUtils]: 179: Hoare triple {56806#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L290 TraceCheckUtils]: 180: Hoare triple {56806#false} assume !(#t~post8 < 50);havoc #t~post8; {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L290 TraceCheckUtils]: 181: Hoare triple {56806#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L290 TraceCheckUtils]: 182: Hoare triple {56806#false} assume !(#t~post6 < 50);havoc #t~post6; {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L272 TraceCheckUtils]: 183: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L290 TraceCheckUtils]: 184: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L290 TraceCheckUtils]: 185: Hoare triple {56806#false} assume 0 == ~cond; {56806#false} is VALID [2022-04-07 14:03:23,170 INFO L290 TraceCheckUtils]: 186: Hoare triple {56806#false} assume !false; {56806#false} is VALID [2022-04-07 14:03:23,171 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-07 14:03:23,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 186: Hoare triple {56806#false} assume !false; {56806#false} is VALID [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 185: Hoare triple {56806#false} assume 0 == ~cond; {56806#false} is VALID [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 184: Hoare triple {56806#false} ~cond := #in~cond; {56806#false} is VALID [2022-04-07 14:03:23,873 INFO L272 TraceCheckUtils]: 183: Hoare triple {56806#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56806#false} is VALID [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 182: Hoare triple {56806#false} assume !(#t~post6 < 50);havoc #t~post6; {56806#false} is VALID [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 181: Hoare triple {56806#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56806#false} is VALID [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 180: Hoare triple {56806#false} assume !(#t~post8 < 50);havoc #t~post8; {56806#false} is VALID [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 179: Hoare triple {56806#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56806#false} is VALID [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 178: Hoare triple {56806#false} assume !(#t~post7 < 50);havoc #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 177: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 176: Hoare triple {56806#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56806#false} is VALID [2022-04-07 14:03:23,873 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {56805#true} {56806#false} #96#return; {56806#false} is VALID [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 174: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 173: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,873 INFO L290 TraceCheckUtils]: 172: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,874 INFO L272 TraceCheckUtils]: 171: Hoare triple {56806#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)); {56805#true} is VALID [2022-04-07 14:03:23,874 INFO L290 TraceCheckUtils]: 170: Hoare triple {56806#false} assume !!(#t~post7 < 50);havoc #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,874 INFO L290 TraceCheckUtils]: 169: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,874 INFO L290 TraceCheckUtils]: 168: Hoare triple {56806#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56806#false} is VALID [2022-04-07 14:03:23,874 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {56805#true} {56806#false} #96#return; {56806#false} is VALID [2022-04-07 14:03:23,874 INFO L290 TraceCheckUtils]: 166: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,874 INFO L290 TraceCheckUtils]: 165: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,874 INFO L290 TraceCheckUtils]: 164: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,874 INFO L272 TraceCheckUtils]: 163: Hoare triple {56806#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)); {56805#true} is VALID [2022-04-07 14:03:23,874 INFO L290 TraceCheckUtils]: 162: Hoare triple {56806#false} assume !!(#t~post7 < 50);havoc #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,874 INFO L290 TraceCheckUtils]: 161: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,874 INFO L290 TraceCheckUtils]: 160: Hoare triple {56806#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56806#false} is VALID [2022-04-07 14:03:23,874 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {56805#true} {56806#false} #96#return; {56806#false} is VALID [2022-04-07 14:03:23,874 INFO L290 TraceCheckUtils]: 158: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,875 INFO L290 TraceCheckUtils]: 157: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,875 INFO L290 TraceCheckUtils]: 156: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,875 INFO L272 TraceCheckUtils]: 155: Hoare triple {56806#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)); {56805#true} is VALID [2022-04-07 14:03:23,875 INFO L290 TraceCheckUtils]: 154: Hoare triple {56806#false} assume !!(#t~post7 < 50);havoc #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,875 INFO L290 TraceCheckUtils]: 153: Hoare triple {56806#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56806#false} is VALID [2022-04-07 14:03:23,875 INFO L290 TraceCheckUtils]: 152: Hoare triple {56806#false} assume !!(0 != ~r~0); {56806#false} is VALID [2022-04-07 14:03:23,875 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {56805#true} {56806#false} #94#return; {56806#false} is VALID [2022-04-07 14:03:23,875 INFO L290 TraceCheckUtils]: 150: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,875 INFO L290 TraceCheckUtils]: 149: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,875 INFO L290 TraceCheckUtils]: 148: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,875 INFO L272 TraceCheckUtils]: 147: Hoare triple {56806#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)); {56805#true} is VALID [2022-04-07 14:03:23,875 INFO L290 TraceCheckUtils]: 146: Hoare triple {56806#false} assume !!(#t~post6 < 50);havoc #t~post6; {56806#false} is VALID [2022-04-07 14:03:23,875 INFO L290 TraceCheckUtils]: 145: Hoare triple {56806#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56806#false} is VALID [2022-04-07 14:03:23,875 INFO L290 TraceCheckUtils]: 144: Hoare triple {56806#false} assume !(~r~0 < 0); {56806#false} is VALID [2022-04-07 14:03:23,876 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {56805#true} {56806#false} #98#return; {56806#false} is VALID [2022-04-07 14:03:23,876 INFO L290 TraceCheckUtils]: 142: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,876 INFO L290 TraceCheckUtils]: 141: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,876 INFO L290 TraceCheckUtils]: 140: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,876 INFO L272 TraceCheckUtils]: 139: Hoare triple {56806#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)); {56805#true} is VALID [2022-04-07 14:03:23,876 INFO L290 TraceCheckUtils]: 138: Hoare triple {56806#false} assume !!(#t~post8 < 50);havoc #t~post8; {56806#false} is VALID [2022-04-07 14:03:23,876 INFO L290 TraceCheckUtils]: 137: Hoare triple {56806#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56806#false} is VALID [2022-04-07 14:03:23,880 INFO L290 TraceCheckUtils]: 136: Hoare triple {57524#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56806#false} is VALID [2022-04-07 14:03:23,880 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {56805#true} {57524#(not (< main_~r~0 0))} #98#return; {57524#(not (< main_~r~0 0))} is VALID [2022-04-07 14:03:23,880 INFO L290 TraceCheckUtils]: 134: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,881 INFO L290 TraceCheckUtils]: 133: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,881 INFO L290 TraceCheckUtils]: 132: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,881 INFO L272 TraceCheckUtils]: 131: Hoare triple {57524#(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)); {56805#true} is VALID [2022-04-07 14:03:23,881 INFO L290 TraceCheckUtils]: 130: Hoare triple {57524#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {57524#(not (< main_~r~0 0))} is VALID [2022-04-07 14:03:23,881 INFO L290 TraceCheckUtils]: 129: Hoare triple {57524#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57524#(not (< main_~r~0 0))} is VALID [2022-04-07 14:03:23,882 INFO L290 TraceCheckUtils]: 128: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {57524#(not (< main_~r~0 0))} is VALID [2022-04-07 14:03:23,882 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {56805#true} {57549#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,882 INFO L290 TraceCheckUtils]: 126: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,882 INFO L290 TraceCheckUtils]: 125: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,882 INFO L290 TraceCheckUtils]: 124: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,882 INFO L272 TraceCheckUtils]: 123: Hoare triple {57549#(<= 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)); {56805#true} is VALID [2022-04-07 14:03:23,883 INFO L290 TraceCheckUtils]: 122: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,883 INFO L290 TraceCheckUtils]: 121: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,883 INFO L290 TraceCheckUtils]: 120: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,884 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {56805#true} {57549#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,884 INFO L290 TraceCheckUtils]: 118: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,884 INFO L290 TraceCheckUtils]: 117: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,884 INFO L290 TraceCheckUtils]: 116: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,884 INFO L272 TraceCheckUtils]: 115: Hoare triple {57549#(<= 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)); {56805#true} is VALID [2022-04-07 14:03:23,884 INFO L290 TraceCheckUtils]: 114: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,884 INFO L290 TraceCheckUtils]: 113: Hoare triple {57549#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,885 INFO L290 TraceCheckUtils]: 112: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57549#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,885 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {56805#true} {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,885 INFO L290 TraceCheckUtils]: 110: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,885 INFO L290 TraceCheckUtils]: 109: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,886 INFO L290 TraceCheckUtils]: 108: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,886 INFO L272 TraceCheckUtils]: 107: Hoare triple {57598#(<= 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)); {56805#true} is VALID [2022-04-07 14:03:23,886 INFO L290 TraceCheckUtils]: 106: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,886 INFO L290 TraceCheckUtils]: 105: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,886 INFO L290 TraceCheckUtils]: 104: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(0 != ~r~0); {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,887 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56805#true} {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #94#return; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,887 INFO L290 TraceCheckUtils]: 102: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,887 INFO L290 TraceCheckUtils]: 101: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,887 INFO L290 TraceCheckUtils]: 100: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,887 INFO L272 TraceCheckUtils]: 99: Hoare triple {57598#(<= 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)); {56805#true} is VALID [2022-04-07 14:03:23,889 INFO L290 TraceCheckUtils]: 98: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,889 INFO L290 TraceCheckUtils]: 97: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,889 INFO L290 TraceCheckUtils]: 96: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 < 0); {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,890 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56805#true} {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,890 INFO L290 TraceCheckUtils]: 94: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,890 INFO L290 TraceCheckUtils]: 93: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,890 INFO L290 TraceCheckUtils]: 92: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,890 INFO L272 TraceCheckUtils]: 91: Hoare triple {57598#(<= 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)); {56805#true} is VALID [2022-04-07 14:03:23,891 INFO L290 TraceCheckUtils]: 90: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,891 INFO L290 TraceCheckUtils]: 89: Hoare triple {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,892 INFO L290 TraceCheckUtils]: 88: Hoare triple {57671#(<= 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; {57598#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-07 14:03:23,892 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56805#true} {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #98#return; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-07 14:03:23,892 INFO L290 TraceCheckUtils]: 86: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,892 INFO L290 TraceCheckUtils]: 85: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,893 INFO L290 TraceCheckUtils]: 84: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,893 INFO L272 TraceCheckUtils]: 83: Hoare triple {57671#(<= 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)); {56805#true} is VALID [2022-04-07 14:03:23,893 INFO L290 TraceCheckUtils]: 82: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !!(#t~post8 < 50);havoc #t~post8; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-07 14:03:23,893 INFO L290 TraceCheckUtils]: 81: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-07 14:03:23,894 INFO L290 TraceCheckUtils]: 80: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !(~r~0 > 0); {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-07 14:03:23,894 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56805#true} {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #96#return; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-07 14:03:23,894 INFO L290 TraceCheckUtils]: 78: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,894 INFO L290 TraceCheckUtils]: 77: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,894 INFO L290 TraceCheckUtils]: 76: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,895 INFO L272 TraceCheckUtils]: 75: Hoare triple {57671#(<= 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)); {56805#true} is VALID [2022-04-07 14:03:23,897 INFO L290 TraceCheckUtils]: 74: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !!(#t~post7 < 50);havoc #t~post7; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-07 14:03:23,898 INFO L290 TraceCheckUtils]: 73: Hoare triple {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-07 14:03:23,898 INFO L290 TraceCheckUtils]: 72: Hoare triple {57720#(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; {57671#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-07 14:03:23,899 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56805#true} {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} #96#return; {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-07 14:03:23,899 INFO L290 TraceCheckUtils]: 70: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,899 INFO L290 TraceCheckUtils]: 69: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,899 INFO L290 TraceCheckUtils]: 68: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,899 INFO L272 TraceCheckUtils]: 67: Hoare triple {57720#(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)); {56805#true} is VALID [2022-04-07 14:03:23,899 INFO L290 TraceCheckUtils]: 66: Hoare triple {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} assume !!(#t~post7 < 50);havoc #t~post7; {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-07 14:03:23,900 INFO L290 TraceCheckUtils]: 65: Hoare triple {57720#(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; {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-07 14:03:23,901 INFO L290 TraceCheckUtils]: 64: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57720#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-07 14:03:23,901 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56805#true} {57745#(<= (+ main_~r~0 1) main_~u~0)} #96#return; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-07 14:03:23,901 INFO L290 TraceCheckUtils]: 62: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,901 INFO L290 TraceCheckUtils]: 61: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,901 INFO L290 TraceCheckUtils]: 60: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,901 INFO L272 TraceCheckUtils]: 59: Hoare triple {57745#(<= (+ 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)); {56805#true} is VALID [2022-04-07 14:03:23,901 INFO L290 TraceCheckUtils]: 58: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-07 14:03:23,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-07 14:03:23,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} assume !!(0 != ~r~0); {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-07 14:03:23,902 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56805#true} {57745#(<= (+ main_~r~0 1) main_~u~0)} #94#return; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-07 14:03:23,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,903 INFO L290 TraceCheckUtils]: 53: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,903 INFO L290 TraceCheckUtils]: 52: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,903 INFO L272 TraceCheckUtils]: 51: Hoare triple {57745#(<= (+ 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)); {56805#true} is VALID [2022-04-07 14:03:23,903 INFO L290 TraceCheckUtils]: 50: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} assume !!(#t~post6 < 50);havoc #t~post6; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-07 14:03:23,903 INFO L290 TraceCheckUtils]: 49: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-07 14:03:23,903 INFO L290 TraceCheckUtils]: 48: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} assume !(~r~0 < 0); {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-07 14:03:23,904 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56805#true} {57745#(<= (+ main_~r~0 1) main_~u~0)} #98#return; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-07 14:03:23,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,904 INFO L272 TraceCheckUtils]: 43: Hoare triple {57745#(<= (+ 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)); {56805#true} is VALID [2022-04-07 14:03:23,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} assume !!(#t~post8 < 50);havoc #t~post8; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-07 14:03:23,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {57745#(<= (+ main_~r~0 1) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-07 14:03:23,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {56805#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {57745#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-07 14:03:23,905 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56805#true} {56805#true} #98#return; {56805#true} is VALID [2022-04-07 14:03:23,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,905 INFO L272 TraceCheckUtils]: 35: Hoare triple {56805#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)); {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {56805#true} assume !!(#t~post8 < 50);havoc #t~post8; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {56805#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {56805#true} assume !(~r~0 > 0); {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56805#true} {56805#true} #96#return; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L272 TraceCheckUtils]: 27: Hoare triple {56805#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)); {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {56805#true} assume !!(#t~post7 < 50);havoc #t~post7; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {56805#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {56805#true} assume !!(0 != ~r~0); {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56805#true} {56805#true} #94#return; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L272 TraceCheckUtils]: 19: Hoare triple {56805#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)); {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {56805#true} assume !!(#t~post6 < 50);havoc #t~post6; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {56805#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {56805#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56805#true} {56805#true} #92#return; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L272 TraceCheckUtils]: 11: Hoare triple {56805#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)); {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56805#true} {56805#true} #90#return; {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {56805#true} assume !(0 == ~cond); {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {56805#true} ~cond := #in~cond; {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L272 TraceCheckUtils]: 6: Hoare triple {56805#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {56805#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; {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {56805#true} call #t~ret9 := main(); {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56805#true} {56805#true} #102#return; {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {56805#true} assume true; {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {56805#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {56805#true} is VALID [2022-04-07 14:03:23,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {56805#true} call ULTIMATE.init(); {56805#true} is VALID [2022-04-07 14:03:23,908 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-07 14:03:23,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:23,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924872646] [2022-04-07 14:03:23,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:23,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606858091] [2022-04-07 14:03:23,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606858091] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:03:23,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:03:23,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-07 14:03:23,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56999454] [2022-04-07 14:03:23,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:03:23,909 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-07 14:03:23,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:23,910 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-07 14:03:24,060 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-07 14:03:24,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 14:03:24,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:24,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 14:03:24,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-07 14:03:24,061 INFO L87 Difference]: Start difference. First operand 1400 states and 1839 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-07 14:03:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:30,713 INFO L93 Difference]: Finished difference Result 2810 states and 3761 transitions. [2022-04-07 14:03:30,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-07 14:03:30,713 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-07 14:03:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:30,713 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-07 14:03:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 442 transitions. [2022-04-07 14:03:30,719 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-07 14:03:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 442 transitions. [2022-04-07 14:03:30,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 442 transitions. [2022-04-07 14:03:31,108 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-07 14:03:31,355 INFO L225 Difference]: With dead ends: 2810 [2022-04-07 14:03:31,355 INFO L226 Difference]: Without dead ends: 2513 [2022-04-07 14:03:31,356 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=1097, Unknown=0, NotChecked=0, Total=1482 [2022-04-07 14:03:31,357 INFO L913 BasicCegarLoop]: 158 mSDtfsCounter, 208 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:31,357 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 804 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-07 14:03:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2022-04-07 14:03:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2054. [2022-04-07 14:03:33,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:33,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2513 states. Second operand has 2054 states, 1541 states have (on average 1.1570408825438028) internal successors, (1783), 1569 states have internal predecessors, (1783), 470 states have call successors, (470), 44 states have call predecessors, (470), 42 states have return successors, (468), 440 states have call predecessors, (468), 468 states have call successors, (468) [2022-04-07 14:03:33,974 INFO L74 IsIncluded]: Start isIncluded. First operand 2513 states. Second operand has 2054 states, 1541 states have (on average 1.1570408825438028) internal successors, (1783), 1569 states have internal predecessors, (1783), 470 states have call successors, (470), 44 states have call predecessors, (470), 42 states have return successors, (468), 440 states have call predecessors, (468), 468 states have call successors, (468) [2022-04-07 14:03:33,975 INFO L87 Difference]: Start difference. First operand 2513 states. Second operand has 2054 states, 1541 states have (on average 1.1570408825438028) internal successors, (1783), 1569 states have internal predecessors, (1783), 470 states have call successors, (470), 44 states have call predecessors, (470), 42 states have return successors, (468), 440 states have call predecessors, (468), 468 states have call successors, (468) [2022-04-07 14:03:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:34,163 INFO L93 Difference]: Finished difference Result 2513 states and 3307 transitions. [2022-04-07 14:03:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3307 transitions. [2022-04-07 14:03:34,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:34,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:34,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 2054 states, 1541 states have (on average 1.1570408825438028) internal successors, (1783), 1569 states have internal predecessors, (1783), 470 states have call successors, (470), 44 states have call predecessors, (470), 42 states have return successors, (468), 440 states have call predecessors, (468), 468 states have call successors, (468) Second operand 2513 states. [2022-04-07 14:03:34,170 INFO L87 Difference]: Start difference. First operand has 2054 states, 1541 states have (on average 1.1570408825438028) internal successors, (1783), 1569 states have internal predecessors, (1783), 470 states have call successors, (470), 44 states have call predecessors, (470), 42 states have return successors, (468), 440 states have call predecessors, (468), 468 states have call successors, (468) Second operand 2513 states. [2022-04-07 14:03:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:34,377 INFO L93 Difference]: Finished difference Result 2513 states and 3307 transitions. [2022-04-07 14:03:34,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3307 transitions. [2022-04-07 14:03:34,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:34,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:34,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:34,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 1541 states have (on average 1.1570408825438028) internal successors, (1783), 1569 states have internal predecessors, (1783), 470 states have call successors, (470), 44 states have call predecessors, (470), 42 states have return successors, (468), 440 states have call predecessors, (468), 468 states have call successors, (468) [2022-04-07 14:03:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2721 transitions. [2022-04-07 14:03:34,549 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2721 transitions. Word has length 187 [2022-04-07 14:03:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:34,549 INFO L478 AbstractCegarLoop]: Abstraction has 2054 states and 2721 transitions. [2022-04-07 14:03:34,549 INFO L479 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-07 14:03:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2721 transitions. [2022-04-07 14:03:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:03:34,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:34,553 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:03:34,569 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-07 14:03:34,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:34,754 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:34,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1188230671, now seen corresponding path program 9 times [2022-04-07 14:03:34,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:34,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077889794] [2022-04-07 14:03:34,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:34,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:34,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:34,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257677345] [2022-04-07 14:03:34,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 14:03:34,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:34,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:34,775 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-07 14:03:34,775 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-07 14:03:35,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-04-07 14:03:35,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:35,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 14:03:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:35,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:36,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {69859#true} call ULTIMATE.init(); {69859#true} is VALID [2022-04-07 14:03:36,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {69859#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {69859#true} is VALID [2022-04-07 14:03:36,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69859#true} {69859#true} #102#return; {69859#true} is VALID [2022-04-07 14:03:36,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {69859#true} call #t~ret9 := main(); {69859#true} is VALID [2022-04-07 14:03:36,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {69859#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; {69859#true} is VALID [2022-04-07 14:03:36,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {69859#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69859#true} is VALID [2022-04-07 14:03:36,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69859#true} {69859#true} #90#return; {69859#true} is VALID [2022-04-07 14:03:36,385 INFO L272 TraceCheckUtils]: 11: Hoare triple {69859#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)); {69859#true} is VALID [2022-04-07 14:03:36,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,386 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69859#true} {69859#true} #92#return; {69859#true} is VALID [2022-04-07 14:03:36,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {69859#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {69912#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,387 INFO L272 TraceCheckUtils]: 19: Hoare triple {69912#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:36,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,387 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #94#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {69912#(<= main_~v~0 1)} assume !!(0 != ~r~0); {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {69912#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,388 INFO L272 TraceCheckUtils]: 27: Hoare triple {69912#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:36,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,389 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #96#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {69912#(<= main_~v~0 1)} assume !(~r~0 > 0); {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {69912#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,389 INFO L272 TraceCheckUtils]: 35: Hoare triple {69912#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:36,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,390 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #98#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {69912#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {69912#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,391 INFO L272 TraceCheckUtils]: 43: Hoare triple {69912#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:36,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,391 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #98#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {69912#(<= main_~v~0 1)} assume !(~r~0 < 0); {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {69912#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,392 INFO L272 TraceCheckUtils]: 51: Hoare triple {69912#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:36,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,393 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #94#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {69912#(<= main_~v~0 1)} assume !!(0 != ~r~0); {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {69912#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,394 INFO L272 TraceCheckUtils]: 59: Hoare triple {69912#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:36,394 INFO L290 TraceCheckUtils]: 60: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,394 INFO L290 TraceCheckUtils]: 62: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,394 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #96#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:36,395 INFO L290 TraceCheckUtils]: 64: Hoare triple {69912#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70057#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:36,395 INFO L290 TraceCheckUtils]: 65: Hoare triple {70057#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70057#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:36,395 INFO L290 TraceCheckUtils]: 66: Hoare triple {70057#(<= main_~v~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {70057#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:36,395 INFO L272 TraceCheckUtils]: 67: Hoare triple {70057#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:36,396 INFO L290 TraceCheckUtils]: 68: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,396 INFO L290 TraceCheckUtils]: 69: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,396 INFO L290 TraceCheckUtils]: 70: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,396 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69859#true} {70057#(<= main_~v~0 3)} #96#return; {70057#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:36,397 INFO L290 TraceCheckUtils]: 72: Hoare triple {70057#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-07 14:03:36,397 INFO L290 TraceCheckUtils]: 73: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-07 14:03:36,397 INFO L290 TraceCheckUtils]: 74: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post7 < 50);havoc #t~post7; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-07 14:03:36,398 INFO L272 TraceCheckUtils]: 75: Hoare triple {70082#(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)); {69859#true} is VALID [2022-04-07 14:03:36,398 INFO L290 TraceCheckUtils]: 76: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,398 INFO L290 TraceCheckUtils]: 77: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,398 INFO L290 TraceCheckUtils]: 78: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,398 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69859#true} {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #96#return; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-07 14:03:36,398 INFO L290 TraceCheckUtils]: 80: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !(~r~0 > 0); {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-07 14:03:36,399 INFO L290 TraceCheckUtils]: 81: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-07 14:03:36,399 INFO L290 TraceCheckUtils]: 82: Hoare triple {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post8 < 50);havoc #t~post8; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-07 14:03:36,399 INFO L272 TraceCheckUtils]: 83: Hoare triple {70082#(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)); {69859#true} is VALID [2022-04-07 14:03:36,399 INFO L290 TraceCheckUtils]: 84: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,399 INFO L290 TraceCheckUtils]: 85: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,399 INFO L290 TraceCheckUtils]: 86: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,400 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69859#true} {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #98#return; {70082#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-07 14:03:36,401 INFO L290 TraceCheckUtils]: 88: Hoare triple {70082#(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; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-07 14:03:36,401 INFO L290 TraceCheckUtils]: 89: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-07 14:03:36,402 INFO L290 TraceCheckUtils]: 90: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(#t~post8 < 50);havoc #t~post8; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-07 14:03:36,402 INFO L272 TraceCheckUtils]: 91: Hoare triple {70131#(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)); {69859#true} is VALID [2022-04-07 14:03:36,402 INFO L290 TraceCheckUtils]: 92: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,402 INFO L290 TraceCheckUtils]: 93: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,402 INFO L290 TraceCheckUtils]: 94: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,402 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69859#true} {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #98#return; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-07 14:03:36,403 INFO L290 TraceCheckUtils]: 96: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !(~r~0 < 0); {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-07 14:03:36,403 INFO L290 TraceCheckUtils]: 97: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-07 14:03:36,403 INFO L290 TraceCheckUtils]: 98: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-07 14:03:36,403 INFO L272 TraceCheckUtils]: 99: Hoare triple {70131#(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)); {69859#true} is VALID [2022-04-07 14:03:36,403 INFO L290 TraceCheckUtils]: 100: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,404 INFO L290 TraceCheckUtils]: 101: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,404 INFO L290 TraceCheckUtils]: 102: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,404 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69859#true} {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #94#return; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-07 14:03:36,404 INFO L290 TraceCheckUtils]: 104: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(0 != ~r~0); {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-07 14:03:36,405 INFO L290 TraceCheckUtils]: 105: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-07 14:03:36,405 INFO L290 TraceCheckUtils]: 106: Hoare triple {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-07 14:03:36,405 INFO L272 TraceCheckUtils]: 107: Hoare triple {70131#(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)); {69859#true} is VALID [2022-04-07 14:03:36,405 INFO L290 TraceCheckUtils]: 108: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,405 INFO L290 TraceCheckUtils]: 109: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,405 INFO L290 TraceCheckUtils]: 110: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,406 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {69859#true} {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #96#return; {70131#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-07 14:03:36,406 INFO L290 TraceCheckUtils]: 112: Hoare triple {70131#(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; {70204#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-07 14:03:36,407 INFO L290 TraceCheckUtils]: 113: Hoare triple {70204#(< main_~u~0 (+ main_~r~0 10))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70204#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-07 14:03:36,407 INFO L290 TraceCheckUtils]: 114: Hoare triple {70204#(< main_~u~0 (+ main_~r~0 10))} assume !!(#t~post7 < 50);havoc #t~post7; {70204#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-07 14:03:36,407 INFO L272 TraceCheckUtils]: 115: Hoare triple {70204#(< 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)); {69859#true} is VALID [2022-04-07 14:03:36,407 INFO L290 TraceCheckUtils]: 116: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,407 INFO L290 TraceCheckUtils]: 117: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,407 INFO L290 TraceCheckUtils]: 118: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,408 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {69859#true} {70204#(< main_~u~0 (+ main_~r~0 10))} #96#return; {70204#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-07 14:03:36,408 INFO L290 TraceCheckUtils]: 120: Hoare triple {70204#(< main_~u~0 (+ main_~r~0 10))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-07 14:03:36,409 INFO L290 TraceCheckUtils]: 121: Hoare triple {70229#(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; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-07 14:03:36,409 INFO L290 TraceCheckUtils]: 122: Hoare triple {70229#(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; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-07 14:03:36,409 INFO L272 TraceCheckUtils]: 123: Hoare triple {70229#(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)); {69859#true} is VALID [2022-04-07 14:03:36,409 INFO L290 TraceCheckUtils]: 124: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,409 INFO L290 TraceCheckUtils]: 125: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,409 INFO L290 TraceCheckUtils]: 126: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,410 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {69859#true} {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #96#return; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-07 14:03:36,410 INFO L290 TraceCheckUtils]: 128: Hoare triple {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !(~r~0 > 0); {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-07 14:03:36,410 INFO L290 TraceCheckUtils]: 129: Hoare triple {70229#(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; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-07 14:03:36,411 INFO L290 TraceCheckUtils]: 130: Hoare triple {70229#(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; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-07 14:03:36,411 INFO L272 TraceCheckUtils]: 131: Hoare triple {70229#(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)); {69859#true} is VALID [2022-04-07 14:03:36,411 INFO L290 TraceCheckUtils]: 132: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,411 INFO L290 TraceCheckUtils]: 133: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,411 INFO L290 TraceCheckUtils]: 134: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,411 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {69859#true} {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #98#return; {70229#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-07 14:03:36,412 INFO L290 TraceCheckUtils]: 136: Hoare triple {70229#(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; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-07 14:03:36,412 INFO L290 TraceCheckUtils]: 137: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-07 14:03:36,413 INFO L290 TraceCheckUtils]: 138: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(#t~post8 < 50);havoc #t~post8; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-07 14:03:36,413 INFO L272 TraceCheckUtils]: 139: Hoare triple {70278#(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)); {69859#true} is VALID [2022-04-07 14:03:36,413 INFO L290 TraceCheckUtils]: 140: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,413 INFO L290 TraceCheckUtils]: 141: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,413 INFO L290 TraceCheckUtils]: 142: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,413 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {69859#true} {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #98#return; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-07 14:03:36,414 INFO L290 TraceCheckUtils]: 144: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !(~r~0 < 0); {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-07 14:03:36,414 INFO L290 TraceCheckUtils]: 145: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-07 14:03:36,414 INFO L290 TraceCheckUtils]: 146: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(#t~post6 < 50);havoc #t~post6; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-07 14:03:36,414 INFO L272 TraceCheckUtils]: 147: Hoare triple {70278#(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)); {69859#true} is VALID [2022-04-07 14:03:36,414 INFO L290 TraceCheckUtils]: 148: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,415 INFO L290 TraceCheckUtils]: 149: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,415 INFO L290 TraceCheckUtils]: 150: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,415 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {69859#true} {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #94#return; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-07 14:03:36,415 INFO L290 TraceCheckUtils]: 152: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(0 != ~r~0); {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-07 14:03:36,416 INFO L290 TraceCheckUtils]: 153: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-07 14:03:36,416 INFO L290 TraceCheckUtils]: 154: Hoare triple {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(#t~post7 < 50);havoc #t~post7; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-07 14:03:36,416 INFO L272 TraceCheckUtils]: 155: Hoare triple {70278#(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)); {69859#true} is VALID [2022-04-07 14:03:36,416 INFO L290 TraceCheckUtils]: 156: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,416 INFO L290 TraceCheckUtils]: 157: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,416 INFO L290 TraceCheckUtils]: 158: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,417 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {69859#true} {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #96#return; {70278#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-07 14:03:36,417 INFO L290 TraceCheckUtils]: 160: Hoare triple {70278#(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; {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-07 14:03:36,418 INFO L290 TraceCheckUtils]: 161: Hoare triple {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-07 14:03:36,418 INFO L290 TraceCheckUtils]: 162: Hoare triple {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} assume !!(#t~post7 < 50);havoc #t~post7; {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-07 14:03:36,418 INFO L272 TraceCheckUtils]: 163: Hoare triple {70351#(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)); {69859#true} is VALID [2022-04-07 14:03:36,418 INFO L290 TraceCheckUtils]: 164: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,418 INFO L290 TraceCheckUtils]: 165: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,418 INFO L290 TraceCheckUtils]: 166: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,419 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {69859#true} {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} #96#return; {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-07 14:03:36,427 INFO L290 TraceCheckUtils]: 168: Hoare triple {70351#(and (< 5 main_~v~0) (< main_~r~0 6))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70376#(< main_~r~0 0)} is VALID [2022-04-07 14:03:36,427 INFO L290 TraceCheckUtils]: 169: Hoare triple {70376#(< main_~r~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70376#(< main_~r~0 0)} is VALID [2022-04-07 14:03:36,428 INFO L290 TraceCheckUtils]: 170: Hoare triple {70376#(< main_~r~0 0)} assume !!(#t~post7 < 50);havoc #t~post7; {70376#(< main_~r~0 0)} is VALID [2022-04-07 14:03:36,428 INFO L272 TraceCheckUtils]: 171: Hoare triple {70376#(< 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)); {69859#true} is VALID [2022-04-07 14:03:36,428 INFO L290 TraceCheckUtils]: 172: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:36,428 INFO L290 TraceCheckUtils]: 173: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:36,428 INFO L290 TraceCheckUtils]: 174: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:36,429 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {69859#true} {70376#(< main_~r~0 0)} #96#return; {70376#(< main_~r~0 0)} is VALID [2022-04-07 14:03:36,429 INFO L290 TraceCheckUtils]: 176: Hoare triple {70376#(< main_~r~0 0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69860#false} is VALID [2022-04-07 14:03:36,429 INFO L290 TraceCheckUtils]: 177: Hoare triple {69860#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69860#false} is VALID [2022-04-07 14:03:36,429 INFO L290 TraceCheckUtils]: 178: Hoare triple {69860#false} assume !(#t~post7 < 50);havoc #t~post7; {69860#false} is VALID [2022-04-07 14:03:36,429 INFO L290 TraceCheckUtils]: 179: Hoare triple {69860#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69860#false} is VALID [2022-04-07 14:03:36,429 INFO L290 TraceCheckUtils]: 180: Hoare triple {69860#false} assume !(#t~post8 < 50);havoc #t~post8; {69860#false} is VALID [2022-04-07 14:03:36,430 INFO L290 TraceCheckUtils]: 181: Hoare triple {69860#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69860#false} is VALID [2022-04-07 14:03:36,430 INFO L290 TraceCheckUtils]: 182: Hoare triple {69860#false} assume !(#t~post6 < 50);havoc #t~post6; {69860#false} is VALID [2022-04-07 14:03:36,430 INFO L272 TraceCheckUtils]: 183: Hoare triple {69860#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69860#false} is VALID [2022-04-07 14:03:36,430 INFO L290 TraceCheckUtils]: 184: Hoare triple {69860#false} ~cond := #in~cond; {69860#false} is VALID [2022-04-07 14:03:36,430 INFO L290 TraceCheckUtils]: 185: Hoare triple {69860#false} assume 0 == ~cond; {69860#false} is VALID [2022-04-07 14:03:36,430 INFO L290 TraceCheckUtils]: 186: Hoare triple {69860#false} assume !false; {69860#false} is VALID [2022-04-07 14:03:36,431 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-07 14:03:36,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:03:37,732 INFO L290 TraceCheckUtils]: 186: Hoare triple {69860#false} assume !false; {69860#false} is VALID [2022-04-07 14:03:37,732 INFO L290 TraceCheckUtils]: 185: Hoare triple {69860#false} assume 0 == ~cond; {69860#false} is VALID [2022-04-07 14:03:37,732 INFO L290 TraceCheckUtils]: 184: Hoare triple {69860#false} ~cond := #in~cond; {69860#false} is VALID [2022-04-07 14:03:37,732 INFO L272 TraceCheckUtils]: 183: Hoare triple {69860#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69860#false} is VALID [2022-04-07 14:03:37,732 INFO L290 TraceCheckUtils]: 182: Hoare triple {69860#false} assume !(#t~post6 < 50);havoc #t~post6; {69860#false} is VALID [2022-04-07 14:03:37,732 INFO L290 TraceCheckUtils]: 181: Hoare triple {69860#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69860#false} is VALID [2022-04-07 14:03:37,732 INFO L290 TraceCheckUtils]: 180: Hoare triple {69860#false} assume !(#t~post8 < 50);havoc #t~post8; {69860#false} is VALID [2022-04-07 14:03:37,732 INFO L290 TraceCheckUtils]: 179: Hoare triple {69860#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69860#false} is VALID [2022-04-07 14:03:37,732 INFO L290 TraceCheckUtils]: 178: Hoare triple {69860#false} assume !(#t~post7 < 50);havoc #t~post7; {69860#false} is VALID [2022-04-07 14:03:37,732 INFO L290 TraceCheckUtils]: 177: Hoare triple {69860#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69860#false} is VALID [2022-04-07 14:03:37,733 INFO L290 TraceCheckUtils]: 176: Hoare triple {70461#(not (< 0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69860#false} is VALID [2022-04-07 14:03:37,733 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {69859#true} {70461#(not (< 0 main_~r~0))} #96#return; {70461#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:37,733 INFO L290 TraceCheckUtils]: 174: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,733 INFO L290 TraceCheckUtils]: 173: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,733 INFO L290 TraceCheckUtils]: 172: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,733 INFO L272 TraceCheckUtils]: 171: Hoare triple {70461#(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)); {69859#true} is VALID [2022-04-07 14:03:37,734 INFO L290 TraceCheckUtils]: 170: Hoare triple {70461#(not (< 0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {70461#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:37,734 INFO L290 TraceCheckUtils]: 169: Hoare triple {70461#(not (< 0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70461#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:37,735 INFO L290 TraceCheckUtils]: 168: Hoare triple {70486#(<= main_~r~0 main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70461#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:03:37,735 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {69859#true} {70486#(<= main_~r~0 main_~v~0)} #96#return; {70486#(<= main_~r~0 main_~v~0)} is VALID [2022-04-07 14:03:37,735 INFO L290 TraceCheckUtils]: 166: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,735 INFO L290 TraceCheckUtils]: 165: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,735 INFO L290 TraceCheckUtils]: 164: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,735 INFO L272 TraceCheckUtils]: 163: Hoare triple {70486#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,736 INFO L290 TraceCheckUtils]: 162: Hoare triple {70486#(<= main_~r~0 main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {70486#(<= main_~r~0 main_~v~0)} is VALID [2022-04-07 14:03:37,736 INFO L290 TraceCheckUtils]: 161: Hoare triple {70486#(<= main_~r~0 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70486#(<= main_~r~0 main_~v~0)} is VALID [2022-04-07 14:03:37,736 INFO L290 TraceCheckUtils]: 160: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70486#(<= main_~r~0 main_~v~0)} is VALID [2022-04-07 14:03:37,737 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {69859#true} {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #96#return; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-07 14:03:37,737 INFO L290 TraceCheckUtils]: 158: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,737 INFO L290 TraceCheckUtils]: 157: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,737 INFO L290 TraceCheckUtils]: 156: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,737 INFO L272 TraceCheckUtils]: 155: Hoare triple {70511#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,737 INFO L290 TraceCheckUtils]: 154: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post7 < 50);havoc #t~post7; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-07 14:03:37,738 INFO L290 TraceCheckUtils]: 153: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-07 14:03:37,738 INFO L290 TraceCheckUtils]: 152: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(0 != ~r~0); {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-07 14:03:37,738 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {69859#true} {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #94#return; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-07 14:03:37,739 INFO L290 TraceCheckUtils]: 150: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,739 INFO L290 TraceCheckUtils]: 149: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,739 INFO L290 TraceCheckUtils]: 148: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,739 INFO L272 TraceCheckUtils]: 147: Hoare triple {70511#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,739 INFO L290 TraceCheckUtils]: 146: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post6 < 50);havoc #t~post6; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-07 14:03:37,739 INFO L290 TraceCheckUtils]: 145: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-07 14:03:37,740 INFO L290 TraceCheckUtils]: 144: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !(~r~0 < 0); {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-07 14:03:37,740 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {69859#true} {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #98#return; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-07 14:03:37,740 INFO L290 TraceCheckUtils]: 142: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,740 INFO L290 TraceCheckUtils]: 141: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,740 INFO L290 TraceCheckUtils]: 140: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,740 INFO L272 TraceCheckUtils]: 139: Hoare triple {70511#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,741 INFO L290 TraceCheckUtils]: 138: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-07 14:03:37,741 INFO L290 TraceCheckUtils]: 137: Hoare triple {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-07 14:03:37,742 INFO L290 TraceCheckUtils]: 136: Hoare triple {70584#(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; {70511#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-07 14:03:37,743 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {69859#true} {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #98#return; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-07 14:03:37,743 INFO L290 TraceCheckUtils]: 134: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,743 INFO L290 TraceCheckUtils]: 133: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,743 INFO L290 TraceCheckUtils]: 132: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,743 INFO L272 TraceCheckUtils]: 131: Hoare triple {70584#(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)); {69859#true} is VALID [2022-04-07 14:03:37,743 INFO L290 TraceCheckUtils]: 130: Hoare triple {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(#t~post8 < 50);havoc #t~post8; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-07 14:03:37,744 INFO L290 TraceCheckUtils]: 129: Hoare triple {70584#(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; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-07 14:03:37,744 INFO L290 TraceCheckUtils]: 128: Hoare triple {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-07 14:03:37,744 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {69859#true} {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #96#return; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-07 14:03:37,744 INFO L290 TraceCheckUtils]: 126: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,744 INFO L290 TraceCheckUtils]: 125: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,745 INFO L290 TraceCheckUtils]: 124: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,745 INFO L272 TraceCheckUtils]: 123: Hoare triple {70584#(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)); {69859#true} is VALID [2022-04-07 14:03:37,745 INFO L290 TraceCheckUtils]: 122: Hoare triple {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 50);havoc #t~post7; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-07 14:03:37,745 INFO L290 TraceCheckUtils]: 121: Hoare triple {70584#(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; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-07 14:03:37,746 INFO L290 TraceCheckUtils]: 120: Hoare triple {70633#(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; {70584#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-07 14:03:37,746 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {69859#true} {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} #96#return; {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-07 14:03:37,746 INFO L290 TraceCheckUtils]: 118: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,747 INFO L290 TraceCheckUtils]: 117: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,747 INFO L290 TraceCheckUtils]: 116: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,747 INFO L272 TraceCheckUtils]: 115: Hoare triple {70633#(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)); {69859#true} is VALID [2022-04-07 14:03:37,747 INFO L290 TraceCheckUtils]: 114: Hoare triple {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} assume !!(#t~post7 < 50);havoc #t~post7; {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-07 14:03:37,747 INFO L290 TraceCheckUtils]: 113: Hoare triple {70633#(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; {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-07 14:03:37,748 INFO L290 TraceCheckUtils]: 112: Hoare triple {70658#(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; {70633#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-07 14:03:37,748 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {69859#true} {70658#(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; {70658#(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-07 14:03:37,748 INFO L290 TraceCheckUtils]: 110: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,749 INFO L290 TraceCheckUtils]: 109: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,757 INFO L290 TraceCheckUtils]: 108: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,757 INFO L272 TraceCheckUtils]: 107: Hoare triple {70658#(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)); {69859#true} is VALID [2022-04-07 14:03:37,759 INFO L290 TraceCheckUtils]: 106: Hoare triple {70658#(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; {70658#(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-07 14:03:37,759 INFO L290 TraceCheckUtils]: 105: Hoare triple {70658#(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; {70658#(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-07 14:03:37,759 INFO L290 TraceCheckUtils]: 104: Hoare triple {70658#(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); {70658#(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-07 14:03:37,760 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69859#true} {70658#(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; {70658#(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-07 14:03:37,760 INFO L290 TraceCheckUtils]: 102: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,760 INFO L290 TraceCheckUtils]: 101: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,760 INFO L290 TraceCheckUtils]: 100: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,760 INFO L272 TraceCheckUtils]: 99: Hoare triple {70658#(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)); {69859#true} is VALID [2022-04-07 14:03:37,760 INFO L290 TraceCheckUtils]: 98: Hoare triple {70658#(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; {70658#(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-07 14:03:37,761 INFO L290 TraceCheckUtils]: 97: Hoare triple {70658#(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; {70658#(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-07 14:03:37,761 INFO L290 TraceCheckUtils]: 96: Hoare triple {70658#(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); {70658#(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-07 14:03:37,762 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69859#true} {70658#(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; {70658#(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-07 14:03:37,762 INFO L290 TraceCheckUtils]: 94: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,762 INFO L290 TraceCheckUtils]: 93: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,762 INFO L290 TraceCheckUtils]: 92: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,762 INFO L272 TraceCheckUtils]: 91: Hoare triple {70658#(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)); {69859#true} is VALID [2022-04-07 14:03:37,762 INFO L290 TraceCheckUtils]: 90: Hoare triple {70658#(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; {70658#(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-07 14:03:37,763 INFO L290 TraceCheckUtils]: 89: Hoare triple {70658#(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; {70658#(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-07 14:03:37,764 INFO L290 TraceCheckUtils]: 88: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70658#(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-07 14:03:37,765 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69859#true} {70731#(<= main_~v~0 (+ main_~r~0 8))} #98#return; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-07 14:03:37,765 INFO L290 TraceCheckUtils]: 86: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,765 INFO L290 TraceCheckUtils]: 85: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,765 INFO L290 TraceCheckUtils]: 84: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,765 INFO L272 TraceCheckUtils]: 83: Hoare triple {70731#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,765 INFO L290 TraceCheckUtils]: 82: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} assume !!(#t~post8 < 50);havoc #t~post8; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-07 14:03:37,765 INFO L290 TraceCheckUtils]: 81: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-07 14:03:37,765 INFO L290 TraceCheckUtils]: 80: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} assume !(~r~0 > 0); {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-07 14:03:37,766 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69859#true} {70731#(<= main_~v~0 (+ main_~r~0 8))} #96#return; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-07 14:03:37,766 INFO L290 TraceCheckUtils]: 78: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,766 INFO L290 TraceCheckUtils]: 77: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,766 INFO L290 TraceCheckUtils]: 76: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,766 INFO L272 TraceCheckUtils]: 75: Hoare triple {70731#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,766 INFO L290 TraceCheckUtils]: 74: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} assume !!(#t~post7 < 50);havoc #t~post7; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-07 14:03:37,767 INFO L290 TraceCheckUtils]: 73: Hoare triple {70731#(<= main_~v~0 (+ main_~r~0 8))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-07 14:03:37,767 INFO L290 TraceCheckUtils]: 72: Hoare triple {70057#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70731#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-07 14:03:37,768 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69859#true} {70057#(<= main_~v~0 3)} #96#return; {70057#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:37,768 INFO L290 TraceCheckUtils]: 70: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,768 INFO L290 TraceCheckUtils]: 69: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,768 INFO L290 TraceCheckUtils]: 68: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,768 INFO L272 TraceCheckUtils]: 67: Hoare triple {70057#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,768 INFO L290 TraceCheckUtils]: 66: Hoare triple {70057#(<= main_~v~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {70057#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:37,768 INFO L290 TraceCheckUtils]: 65: Hoare triple {70057#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70057#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:37,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {69912#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70057#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:37,769 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #96#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,770 INFO L272 TraceCheckUtils]: 59: Hoare triple {69912#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {69912#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,770 INFO L290 TraceCheckUtils]: 56: Hoare triple {69912#(<= main_~v~0 1)} assume !!(0 != ~r~0); {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,771 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #94#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,771 INFO L290 TraceCheckUtils]: 54: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,771 INFO L290 TraceCheckUtils]: 52: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,771 INFO L272 TraceCheckUtils]: 51: Hoare triple {69912#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {69912#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {69912#(<= main_~v~0 1)} assume !(~r~0 < 0); {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,772 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #98#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,772 INFO L272 TraceCheckUtils]: 43: Hoare triple {69912#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {69912#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {69912#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,774 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #98#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,774 INFO L272 TraceCheckUtils]: 35: Hoare triple {69912#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {69912#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {69912#(<= main_~v~0 1)} assume !(~r~0 > 0); {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,775 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #96#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,775 INFO L272 TraceCheckUtils]: 27: Hoare triple {69912#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {69912#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {69912#(<= main_~v~0 1)} assume !!(0 != ~r~0); {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,776 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69859#true} {69912#(<= main_~v~0 1)} #94#return; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,777 INFO L272 TraceCheckUtils]: 19: Hoare triple {69912#(<= 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)); {69859#true} is VALID [2022-04-07 14:03:37,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {69912#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {69912#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {69859#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {69912#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:37,777 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69859#true} {69859#true} #92#return; {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L272 TraceCheckUtils]: 11: Hoare triple {69859#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)); {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69859#true} {69859#true} #90#return; {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {69859#true} assume !(0 == ~cond); {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {69859#true} ~cond := #in~cond; {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L272 TraceCheckUtils]: 6: Hoare triple {69859#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {69859#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; {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {69859#true} call #t~ret9 := main(); {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69859#true} {69859#true} #102#return; {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {69859#true} assume true; {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {69859#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {69859#true} is VALID [2022-04-07 14:03:37,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {69859#true} call ULTIMATE.init(); {69859#true} is VALID [2022-04-07 14:03:37,779 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-07 14:03:37,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:37,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077889794] [2022-04-07 14:03:37,779 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:37,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257677345] [2022-04-07 14:03:37,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257677345] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:03:37,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:03:37,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-07 14:03:37,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467979954] [2022-04-07 14:03:37,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:03:37,780 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-07 14:03:37,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:37,780 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-07 14:03:37,930 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-07 14:03:37,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 14:03:37,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:37,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 14:03:37,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-07 14:03:37,931 INFO L87 Difference]: Start difference. First operand 2054 states and 2721 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-07 14:03:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:51,199 INFO L93 Difference]: Finished difference Result 3324 states and 4449 transitions. [2022-04-07 14:03:51,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-07 14:03:51,199 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-07 14:03:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:51,199 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-07 14:03:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 746 transitions. [2022-04-07 14:03:51,213 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-07 14:03:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 746 transitions. [2022-04-07 14:03:51,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 746 transitions. [2022-04-07 14:03:51,932 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-07 14:03:52,300 INFO L225 Difference]: With dead ends: 3324 [2022-04-07 14:03:52,300 INFO L226 Difference]: Without dead ends: 3065 [2022-04-07 14:03:52,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=507, Invalid=2573, Unknown=0, NotChecked=0, Total=3080 [2022-04-07 14:03:52,302 INFO L913 BasicCegarLoop]: 311 mSDtfsCounter, 319 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:52,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 1756 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 14:03:52,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2022-04-07 14:03:56,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 2548. [2022-04-07 14:03:56,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:56,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3065 states. Second operand has 2548 states, 1911 states have (on average 1.1669283097854526) internal successors, (2230), 1953 states have internal predecessors, (2230), 594 states have call successors, (594), 44 states have call predecessors, (594), 42 states have return successors, (592), 550 states have call predecessors, (592), 592 states have call successors, (592) [2022-04-07 14:03:56,274 INFO L74 IsIncluded]: Start isIncluded. First operand 3065 states. Second operand has 2548 states, 1911 states have (on average 1.1669283097854526) internal successors, (2230), 1953 states have internal predecessors, (2230), 594 states have call successors, (594), 44 states have call predecessors, (594), 42 states have return successors, (592), 550 states have call predecessors, (592), 592 states have call successors, (592) [2022-04-07 14:03:56,275 INFO L87 Difference]: Start difference. First operand 3065 states. Second operand has 2548 states, 1911 states have (on average 1.1669283097854526) internal successors, (2230), 1953 states have internal predecessors, (2230), 594 states have call successors, (594), 44 states have call predecessors, (594), 42 states have return successors, (592), 550 states have call predecessors, (592), 592 states have call successors, (592) [2022-04-07 14:03:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:56,538 INFO L93 Difference]: Finished difference Result 3065 states and 4071 transitions. [2022-04-07 14:03:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4071 transitions. [2022-04-07 14:03:56,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:56,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:56,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 2548 states, 1911 states have (on average 1.1669283097854526) internal successors, (2230), 1953 states have internal predecessors, (2230), 594 states have call successors, (594), 44 states have call predecessors, (594), 42 states have return successors, (592), 550 states have call predecessors, (592), 592 states have call successors, (592) Second operand 3065 states. [2022-04-07 14:03:56,547 INFO L87 Difference]: Start difference. First operand has 2548 states, 1911 states have (on average 1.1669283097854526) internal successors, (2230), 1953 states have internal predecessors, (2230), 594 states have call successors, (594), 44 states have call predecessors, (594), 42 states have return successors, (592), 550 states have call predecessors, (592), 592 states have call successors, (592) Second operand 3065 states. [2022-04-07 14:03:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:56,825 INFO L93 Difference]: Finished difference Result 3065 states and 4071 transitions. [2022-04-07 14:03:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4071 transitions. [2022-04-07 14:03:56,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:56,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:56,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:56,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 1911 states have (on average 1.1669283097854526) internal successors, (2230), 1953 states have internal predecessors, (2230), 594 states have call successors, (594), 44 states have call predecessors, (594), 42 states have return successors, (592), 550 states have call predecessors, (592), 592 states have call successors, (592) [2022-04-07 14:03:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3416 transitions. [2022-04-07 14:03:57,096 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3416 transitions. Word has length 187 [2022-04-07 14:03:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:57,096 INFO L478 AbstractCegarLoop]: Abstraction has 2548 states and 3416 transitions. [2022-04-07 14:03:57,096 INFO L479 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-07 14:03:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3416 transitions. [2022-04-07 14:03:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:03:57,100 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:57,100 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:03:57,106 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-07 14:03:57,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:57,306 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:57,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2070462991, now seen corresponding path program 10 times [2022-04-07 14:03:57,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:57,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426923974] [2022-04-07 14:03:57,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:57,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:57,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1687803411] [2022-04-07 14:03:57,325 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 14:03:57,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:57,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:57,326 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-07 14:03:57,326 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-07 14:03:57,524 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 14:03:57,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:57,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-07 14:03:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:57,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:58,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {85456#true} call ULTIMATE.init(); {85456#true} is VALID [2022-04-07 14:03:58,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {85456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {85464#(<= ~counter~0 0)} assume true; {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85464#(<= ~counter~0 0)} {85456#true} #102#return; {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {85464#(<= ~counter~0 0)} call #t~ret9 := main(); {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {85464#(<= ~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; {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,622 INFO L272 TraceCheckUtils]: 6: Hoare triple {85464#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {85464#(<= ~counter~0 0)} ~cond := #in~cond; {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {85464#(<= ~counter~0 0)} assume !(0 == ~cond); {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {85464#(<= ~counter~0 0)} assume true; {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,623 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {85464#(<= ~counter~0 0)} {85464#(<= ~counter~0 0)} #90#return; {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,623 INFO L272 TraceCheckUtils]: 11: Hoare triple {85464#(<= ~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)); {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {85464#(<= ~counter~0 0)} ~cond := #in~cond; {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {85464#(<= ~counter~0 0)} assume !(0 == ~cond); {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {85464#(<= ~counter~0 0)} assume true; {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,625 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {85464#(<= ~counter~0 0)} {85464#(<= ~counter~0 0)} #92#return; {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {85464#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {85464#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:58,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {85464#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85513#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:58,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {85513#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {85513#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:58,627 INFO L272 TraceCheckUtils]: 19: Hoare triple {85513#(<= ~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)); {85513#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:58,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {85513#(<= ~counter~0 1)} ~cond := #in~cond; {85513#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:58,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {85513#(<= ~counter~0 1)} assume !(0 == ~cond); {85513#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:58,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {85513#(<= ~counter~0 1)} assume true; {85513#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:58,628 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {85513#(<= ~counter~0 1)} {85513#(<= ~counter~0 1)} #94#return; {85513#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:58,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {85513#(<= ~counter~0 1)} assume !!(0 != ~r~0); {85513#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:58,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {85513#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85538#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:58,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {85538#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {85538#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:58,630 INFO L272 TraceCheckUtils]: 27: Hoare triple {85538#(<= ~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)); {85538#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:58,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {85538#(<= ~counter~0 2)} ~cond := #in~cond; {85538#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:58,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {85538#(<= ~counter~0 2)} assume !(0 == ~cond); {85538#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:58,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {85538#(<= ~counter~0 2)} assume true; {85538#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:58,631 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {85538#(<= ~counter~0 2)} {85538#(<= ~counter~0 2)} #96#return; {85538#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:58,631 INFO L290 TraceCheckUtils]: 32: Hoare triple {85538#(<= ~counter~0 2)} assume !(~r~0 > 0); {85538#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:58,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {85538#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85563#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:58,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {85563#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {85563#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:58,633 INFO L272 TraceCheckUtils]: 35: Hoare triple {85563#(<= ~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)); {85563#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:58,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {85563#(<= ~counter~0 3)} ~cond := #in~cond; {85563#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:58,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {85563#(<= ~counter~0 3)} assume !(0 == ~cond); {85563#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:58,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {85563#(<= ~counter~0 3)} assume true; {85563#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:58,634 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {85563#(<= ~counter~0 3)} {85563#(<= ~counter~0 3)} #98#return; {85563#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:58,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {85563#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85563#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:58,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {85563#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85588#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:58,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {85588#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {85588#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:58,636 INFO L272 TraceCheckUtils]: 43: Hoare triple {85588#(<= ~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)); {85588#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:58,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {85588#(<= ~counter~0 4)} ~cond := #in~cond; {85588#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:58,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {85588#(<= ~counter~0 4)} assume !(0 == ~cond); {85588#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:58,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {85588#(<= ~counter~0 4)} assume true; {85588#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:58,637 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {85588#(<= ~counter~0 4)} {85588#(<= ~counter~0 4)} #98#return; {85588#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:58,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {85588#(<= ~counter~0 4)} assume !(~r~0 < 0); {85588#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:58,638 INFO L290 TraceCheckUtils]: 49: Hoare triple {85588#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85613#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:58,638 INFO L290 TraceCheckUtils]: 50: Hoare triple {85613#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {85613#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:58,639 INFO L272 TraceCheckUtils]: 51: Hoare triple {85613#(<= ~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)); {85613#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:58,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {85613#(<= ~counter~0 5)} ~cond := #in~cond; {85613#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:58,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {85613#(<= ~counter~0 5)} assume !(0 == ~cond); {85613#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:58,639 INFO L290 TraceCheckUtils]: 54: Hoare triple {85613#(<= ~counter~0 5)} assume true; {85613#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:58,640 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {85613#(<= ~counter~0 5)} {85613#(<= ~counter~0 5)} #94#return; {85613#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:58,640 INFO L290 TraceCheckUtils]: 56: Hoare triple {85613#(<= ~counter~0 5)} assume !!(0 != ~r~0); {85613#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:58,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {85613#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85638#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:58,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {85638#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {85638#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:58,647 INFO L272 TraceCheckUtils]: 59: Hoare triple {85638#(<= ~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)); {85638#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:58,648 INFO L290 TraceCheckUtils]: 60: Hoare triple {85638#(<= ~counter~0 6)} ~cond := #in~cond; {85638#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:58,648 INFO L290 TraceCheckUtils]: 61: Hoare triple {85638#(<= ~counter~0 6)} assume !(0 == ~cond); {85638#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:58,649 INFO L290 TraceCheckUtils]: 62: Hoare triple {85638#(<= ~counter~0 6)} assume true; {85638#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:58,649 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {85638#(<= ~counter~0 6)} {85638#(<= ~counter~0 6)} #96#return; {85638#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:58,650 INFO L290 TraceCheckUtils]: 64: Hoare triple {85638#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85638#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:58,651 INFO L290 TraceCheckUtils]: 65: Hoare triple {85638#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85663#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:58,651 INFO L290 TraceCheckUtils]: 66: Hoare triple {85663#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {85663#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:58,652 INFO L272 TraceCheckUtils]: 67: Hoare triple {85663#(<= ~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)); {85663#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:58,652 INFO L290 TraceCheckUtils]: 68: Hoare triple {85663#(<= ~counter~0 7)} ~cond := #in~cond; {85663#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:58,653 INFO L290 TraceCheckUtils]: 69: Hoare triple {85663#(<= ~counter~0 7)} assume !(0 == ~cond); {85663#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:58,653 INFO L290 TraceCheckUtils]: 70: Hoare triple {85663#(<= ~counter~0 7)} assume true; {85663#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:58,666 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {85663#(<= ~counter~0 7)} {85663#(<= ~counter~0 7)} #96#return; {85663#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:58,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {85663#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85663#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:58,668 INFO L290 TraceCheckUtils]: 73: Hoare triple {85663#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85688#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:58,668 INFO L290 TraceCheckUtils]: 74: Hoare triple {85688#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {85688#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:58,669 INFO L272 TraceCheckUtils]: 75: Hoare triple {85688#(<= ~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)); {85688#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:58,669 INFO L290 TraceCheckUtils]: 76: Hoare triple {85688#(<= ~counter~0 8)} ~cond := #in~cond; {85688#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:58,670 INFO L290 TraceCheckUtils]: 77: Hoare triple {85688#(<= ~counter~0 8)} assume !(0 == ~cond); {85688#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:58,670 INFO L290 TraceCheckUtils]: 78: Hoare triple {85688#(<= ~counter~0 8)} assume true; {85688#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:58,671 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {85688#(<= ~counter~0 8)} {85688#(<= ~counter~0 8)} #96#return; {85688#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:58,671 INFO L290 TraceCheckUtils]: 80: Hoare triple {85688#(<= ~counter~0 8)} assume !(~r~0 > 0); {85688#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:58,672 INFO L290 TraceCheckUtils]: 81: Hoare triple {85688#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85713#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:58,673 INFO L290 TraceCheckUtils]: 82: Hoare triple {85713#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {85713#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:58,673 INFO L272 TraceCheckUtils]: 83: Hoare triple {85713#(<= ~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)); {85713#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:58,674 INFO L290 TraceCheckUtils]: 84: Hoare triple {85713#(<= ~counter~0 9)} ~cond := #in~cond; {85713#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:58,674 INFO L290 TraceCheckUtils]: 85: Hoare triple {85713#(<= ~counter~0 9)} assume !(0 == ~cond); {85713#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:58,674 INFO L290 TraceCheckUtils]: 86: Hoare triple {85713#(<= ~counter~0 9)} assume true; {85713#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:58,675 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {85713#(<= ~counter~0 9)} {85713#(<= ~counter~0 9)} #98#return; {85713#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:58,675 INFO L290 TraceCheckUtils]: 88: Hoare triple {85713#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85713#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:58,677 INFO L290 TraceCheckUtils]: 89: Hoare triple {85713#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85738#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:58,677 INFO L290 TraceCheckUtils]: 90: Hoare triple {85738#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {85738#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:58,678 INFO L272 TraceCheckUtils]: 91: Hoare triple {85738#(<= ~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)); {85738#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:58,678 INFO L290 TraceCheckUtils]: 92: Hoare triple {85738#(<= ~counter~0 10)} ~cond := #in~cond; {85738#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:58,678 INFO L290 TraceCheckUtils]: 93: Hoare triple {85738#(<= ~counter~0 10)} assume !(0 == ~cond); {85738#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:58,679 INFO L290 TraceCheckUtils]: 94: Hoare triple {85738#(<= ~counter~0 10)} assume true; {85738#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:58,680 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {85738#(<= ~counter~0 10)} {85738#(<= ~counter~0 10)} #98#return; {85738#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:58,680 INFO L290 TraceCheckUtils]: 96: Hoare triple {85738#(<= ~counter~0 10)} assume !(~r~0 < 0); {85738#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:58,681 INFO L290 TraceCheckUtils]: 97: Hoare triple {85738#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85763#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:58,681 INFO L290 TraceCheckUtils]: 98: Hoare triple {85763#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {85763#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:58,682 INFO L272 TraceCheckUtils]: 99: Hoare triple {85763#(<= ~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)); {85763#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:58,683 INFO L290 TraceCheckUtils]: 100: Hoare triple {85763#(<= ~counter~0 11)} ~cond := #in~cond; {85763#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:58,683 INFO L290 TraceCheckUtils]: 101: Hoare triple {85763#(<= ~counter~0 11)} assume !(0 == ~cond); {85763#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:58,683 INFO L290 TraceCheckUtils]: 102: Hoare triple {85763#(<= ~counter~0 11)} assume true; {85763#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:58,684 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {85763#(<= ~counter~0 11)} {85763#(<= ~counter~0 11)} #94#return; {85763#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:58,684 INFO L290 TraceCheckUtils]: 104: Hoare triple {85763#(<= ~counter~0 11)} assume !!(0 != ~r~0); {85763#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:58,685 INFO L290 TraceCheckUtils]: 105: Hoare triple {85763#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85788#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:58,686 INFO L290 TraceCheckUtils]: 106: Hoare triple {85788#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {85788#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:58,687 INFO L272 TraceCheckUtils]: 107: Hoare triple {85788#(<= ~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)); {85788#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:58,687 INFO L290 TraceCheckUtils]: 108: Hoare triple {85788#(<= ~counter~0 12)} ~cond := #in~cond; {85788#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:58,687 INFO L290 TraceCheckUtils]: 109: Hoare triple {85788#(<= ~counter~0 12)} assume !(0 == ~cond); {85788#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:58,688 INFO L290 TraceCheckUtils]: 110: Hoare triple {85788#(<= ~counter~0 12)} assume true; {85788#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:58,688 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {85788#(<= ~counter~0 12)} {85788#(<= ~counter~0 12)} #96#return; {85788#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:58,689 INFO L290 TraceCheckUtils]: 112: Hoare triple {85788#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85788#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:58,690 INFO L290 TraceCheckUtils]: 113: Hoare triple {85788#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85813#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:58,690 INFO L290 TraceCheckUtils]: 114: Hoare triple {85813#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {85813#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:58,691 INFO L272 TraceCheckUtils]: 115: Hoare triple {85813#(<= ~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)); {85813#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:58,691 INFO L290 TraceCheckUtils]: 116: Hoare triple {85813#(<= ~counter~0 13)} ~cond := #in~cond; {85813#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:58,692 INFO L290 TraceCheckUtils]: 117: Hoare triple {85813#(<= ~counter~0 13)} assume !(0 == ~cond); {85813#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:58,692 INFO L290 TraceCheckUtils]: 118: Hoare triple {85813#(<= ~counter~0 13)} assume true; {85813#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:58,693 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {85813#(<= ~counter~0 13)} {85813#(<= ~counter~0 13)} #96#return; {85813#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:58,693 INFO L290 TraceCheckUtils]: 120: Hoare triple {85813#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85813#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:58,694 INFO L290 TraceCheckUtils]: 121: Hoare triple {85813#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85838#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:58,695 INFO L290 TraceCheckUtils]: 122: Hoare triple {85838#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {85838#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:58,695 INFO L272 TraceCheckUtils]: 123: Hoare triple {85838#(<= ~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)); {85838#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:58,696 INFO L290 TraceCheckUtils]: 124: Hoare triple {85838#(<= ~counter~0 14)} ~cond := #in~cond; {85838#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:58,696 INFO L290 TraceCheckUtils]: 125: Hoare triple {85838#(<= ~counter~0 14)} assume !(0 == ~cond); {85838#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:58,697 INFO L290 TraceCheckUtils]: 126: Hoare triple {85838#(<= ~counter~0 14)} assume true; {85838#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:58,697 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {85838#(<= ~counter~0 14)} {85838#(<= ~counter~0 14)} #96#return; {85838#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:58,698 INFO L290 TraceCheckUtils]: 128: Hoare triple {85838#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85838#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:58,699 INFO L290 TraceCheckUtils]: 129: Hoare triple {85838#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85863#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:58,699 INFO L290 TraceCheckUtils]: 130: Hoare triple {85863#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {85863#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:58,700 INFO L272 TraceCheckUtils]: 131: Hoare triple {85863#(<= ~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)); {85863#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:58,700 INFO L290 TraceCheckUtils]: 132: Hoare triple {85863#(<= ~counter~0 15)} ~cond := #in~cond; {85863#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:58,701 INFO L290 TraceCheckUtils]: 133: Hoare triple {85863#(<= ~counter~0 15)} assume !(0 == ~cond); {85863#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:58,701 INFO L290 TraceCheckUtils]: 134: Hoare triple {85863#(<= ~counter~0 15)} assume true; {85863#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:58,702 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {85863#(<= ~counter~0 15)} {85863#(<= ~counter~0 15)} #96#return; {85863#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:58,702 INFO L290 TraceCheckUtils]: 136: Hoare triple {85863#(<= ~counter~0 15)} assume !(~r~0 > 0); {85863#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:58,703 INFO L290 TraceCheckUtils]: 137: Hoare triple {85863#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85888#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:58,704 INFO L290 TraceCheckUtils]: 138: Hoare triple {85888#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {85888#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:58,704 INFO L272 TraceCheckUtils]: 139: Hoare triple {85888#(<= ~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)); {85888#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:58,705 INFO L290 TraceCheckUtils]: 140: Hoare triple {85888#(<= ~counter~0 16)} ~cond := #in~cond; {85888#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:58,705 INFO L290 TraceCheckUtils]: 141: Hoare triple {85888#(<= ~counter~0 16)} assume !(0 == ~cond); {85888#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:58,705 INFO L290 TraceCheckUtils]: 142: Hoare triple {85888#(<= ~counter~0 16)} assume true; {85888#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:58,706 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {85888#(<= ~counter~0 16)} {85888#(<= ~counter~0 16)} #98#return; {85888#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:58,707 INFO L290 TraceCheckUtils]: 144: Hoare triple {85888#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85888#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:58,708 INFO L290 TraceCheckUtils]: 145: Hoare triple {85888#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85913#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:58,708 INFO L290 TraceCheckUtils]: 146: Hoare triple {85913#(<= ~counter~0 17)} assume !!(#t~post8 < 50);havoc #t~post8; {85913#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:58,709 INFO L272 TraceCheckUtils]: 147: Hoare triple {85913#(<= ~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)); {85913#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:58,709 INFO L290 TraceCheckUtils]: 148: Hoare triple {85913#(<= ~counter~0 17)} ~cond := #in~cond; {85913#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:58,709 INFO L290 TraceCheckUtils]: 149: Hoare triple {85913#(<= ~counter~0 17)} assume !(0 == ~cond); {85913#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:58,710 INFO L290 TraceCheckUtils]: 150: Hoare triple {85913#(<= ~counter~0 17)} assume true; {85913#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:58,711 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {85913#(<= ~counter~0 17)} {85913#(<= ~counter~0 17)} #98#return; {85913#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:58,711 INFO L290 TraceCheckUtils]: 152: Hoare triple {85913#(<= ~counter~0 17)} assume !(~r~0 < 0); {85913#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:58,712 INFO L290 TraceCheckUtils]: 153: Hoare triple {85913#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85938#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:58,712 INFO L290 TraceCheckUtils]: 154: Hoare triple {85938#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {85938#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:58,713 INFO L272 TraceCheckUtils]: 155: Hoare triple {85938#(<= ~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)); {85938#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:58,714 INFO L290 TraceCheckUtils]: 156: Hoare triple {85938#(<= ~counter~0 18)} ~cond := #in~cond; {85938#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:58,714 INFO L290 TraceCheckUtils]: 157: Hoare triple {85938#(<= ~counter~0 18)} assume !(0 == ~cond); {85938#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:58,714 INFO L290 TraceCheckUtils]: 158: Hoare triple {85938#(<= ~counter~0 18)} assume true; {85938#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:58,715 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {85938#(<= ~counter~0 18)} {85938#(<= ~counter~0 18)} #94#return; {85938#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:58,715 INFO L290 TraceCheckUtils]: 160: Hoare triple {85938#(<= ~counter~0 18)} assume !!(0 != ~r~0); {85938#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:58,716 INFO L290 TraceCheckUtils]: 161: Hoare triple {85938#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85963#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:58,717 INFO L290 TraceCheckUtils]: 162: Hoare triple {85963#(<= ~counter~0 19)} assume !!(#t~post7 < 50);havoc #t~post7; {85963#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:58,717 INFO L272 TraceCheckUtils]: 163: Hoare triple {85963#(<= ~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)); {85963#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:58,718 INFO L290 TraceCheckUtils]: 164: Hoare triple {85963#(<= ~counter~0 19)} ~cond := #in~cond; {85963#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:58,718 INFO L290 TraceCheckUtils]: 165: Hoare triple {85963#(<= ~counter~0 19)} assume !(0 == ~cond); {85963#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:58,719 INFO L290 TraceCheckUtils]: 166: Hoare triple {85963#(<= ~counter~0 19)} assume true; {85963#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:58,719 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {85963#(<= ~counter~0 19)} {85963#(<= ~counter~0 19)} #96#return; {85963#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:58,720 INFO L290 TraceCheckUtils]: 168: Hoare triple {85963#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85963#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:58,721 INFO L290 TraceCheckUtils]: 169: Hoare triple {85963#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85988#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:58,721 INFO L290 TraceCheckUtils]: 170: Hoare triple {85988#(<= ~counter~0 20)} assume !!(#t~post7 < 50);havoc #t~post7; {85988#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:58,722 INFO L272 TraceCheckUtils]: 171: Hoare triple {85988#(<= ~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)); {85988#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:58,722 INFO L290 TraceCheckUtils]: 172: Hoare triple {85988#(<= ~counter~0 20)} ~cond := #in~cond; {85988#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:58,723 INFO L290 TraceCheckUtils]: 173: Hoare triple {85988#(<= ~counter~0 20)} assume !(0 == ~cond); {85988#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:58,723 INFO L290 TraceCheckUtils]: 174: Hoare triple {85988#(<= ~counter~0 20)} assume true; {85988#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:58,724 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {85988#(<= ~counter~0 20)} {85988#(<= ~counter~0 20)} #96#return; {85988#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:58,724 INFO L290 TraceCheckUtils]: 176: Hoare triple {85988#(<= ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85988#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:58,724 INFO L290 TraceCheckUtils]: 177: Hoare triple {85988#(<= ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86013#(<= |main_#t~post7| 20)} is VALID [2022-04-07 14:03:58,725 INFO L290 TraceCheckUtils]: 178: Hoare triple {86013#(<= |main_#t~post7| 20)} assume !(#t~post7 < 50);havoc #t~post7; {85457#false} is VALID [2022-04-07 14:03:58,725 INFO L290 TraceCheckUtils]: 179: Hoare triple {85457#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85457#false} is VALID [2022-04-07 14:03:58,725 INFO L290 TraceCheckUtils]: 180: Hoare triple {85457#false} assume !(#t~post8 < 50);havoc #t~post8; {85457#false} is VALID [2022-04-07 14:03:58,725 INFO L290 TraceCheckUtils]: 181: Hoare triple {85457#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85457#false} is VALID [2022-04-07 14:03:58,725 INFO L290 TraceCheckUtils]: 182: Hoare triple {85457#false} assume !(#t~post6 < 50);havoc #t~post6; {85457#false} is VALID [2022-04-07 14:03:58,725 INFO L272 TraceCheckUtils]: 183: Hoare triple {85457#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85457#false} is VALID [2022-04-07 14:03:58,725 INFO L290 TraceCheckUtils]: 184: Hoare triple {85457#false} ~cond := #in~cond; {85457#false} is VALID [2022-04-07 14:03:58,725 INFO L290 TraceCheckUtils]: 185: Hoare triple {85457#false} assume 0 == ~cond; {85457#false} is VALID [2022-04-07 14:03:58,725 INFO L290 TraceCheckUtils]: 186: Hoare triple {85457#false} assume !false; {85457#false} is VALID [2022-04-07 14:03:58,726 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-07 14:03:58,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:04:00,076 INFO L290 TraceCheckUtils]: 186: Hoare triple {85457#false} assume !false; {85457#false} is VALID [2022-04-07 14:04:00,076 INFO L290 TraceCheckUtils]: 185: Hoare triple {85457#false} assume 0 == ~cond; {85457#false} is VALID [2022-04-07 14:04:00,076 INFO L290 TraceCheckUtils]: 184: Hoare triple {85457#false} ~cond := #in~cond; {85457#false} is VALID [2022-04-07 14:04:00,076 INFO L272 TraceCheckUtils]: 183: Hoare triple {85457#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85457#false} is VALID [2022-04-07 14:04:00,076 INFO L290 TraceCheckUtils]: 182: Hoare triple {85457#false} assume !(#t~post6 < 50);havoc #t~post6; {85457#false} is VALID [2022-04-07 14:04:00,077 INFO L290 TraceCheckUtils]: 181: Hoare triple {85457#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85457#false} is VALID [2022-04-07 14:04:00,077 INFO L290 TraceCheckUtils]: 180: Hoare triple {85457#false} assume !(#t~post8 < 50);havoc #t~post8; {85457#false} is VALID [2022-04-07 14:04:00,077 INFO L290 TraceCheckUtils]: 179: Hoare triple {85457#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85457#false} is VALID [2022-04-07 14:04:00,077 INFO L290 TraceCheckUtils]: 178: Hoare triple {86065#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {85457#false} is VALID [2022-04-07 14:04:00,077 INFO L290 TraceCheckUtils]: 177: Hoare triple {86069#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86065#(< |main_#t~post7| 50)} is VALID [2022-04-07 14:04:00,078 INFO L290 TraceCheckUtils]: 176: Hoare triple {86069#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86069#(< ~counter~0 50)} is VALID [2022-04-07 14:04:00,078 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {85456#true} {86069#(< ~counter~0 50)} #96#return; {86069#(< ~counter~0 50)} is VALID [2022-04-07 14:04:00,078 INFO L290 TraceCheckUtils]: 174: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,078 INFO L290 TraceCheckUtils]: 173: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,078 INFO L290 TraceCheckUtils]: 172: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,078 INFO L272 TraceCheckUtils]: 171: Hoare triple {86069#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,079 INFO L290 TraceCheckUtils]: 170: Hoare triple {86069#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {86069#(< ~counter~0 50)} is VALID [2022-04-07 14:04:00,080 INFO L290 TraceCheckUtils]: 169: Hoare triple {86094#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86069#(< ~counter~0 50)} is VALID [2022-04-07 14:04:00,080 INFO L290 TraceCheckUtils]: 168: Hoare triple {86094#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86094#(< ~counter~0 49)} is VALID [2022-04-07 14:04:00,081 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {85456#true} {86094#(< ~counter~0 49)} #96#return; {86094#(< ~counter~0 49)} is VALID [2022-04-07 14:04:00,081 INFO L290 TraceCheckUtils]: 166: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,081 INFO L290 TraceCheckUtils]: 165: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,081 INFO L290 TraceCheckUtils]: 164: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,081 INFO L272 TraceCheckUtils]: 163: Hoare triple {86094#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,081 INFO L290 TraceCheckUtils]: 162: Hoare triple {86094#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {86094#(< ~counter~0 49)} is VALID [2022-04-07 14:04:00,082 INFO L290 TraceCheckUtils]: 161: Hoare triple {86119#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86094#(< ~counter~0 49)} is VALID [2022-04-07 14:04:00,082 INFO L290 TraceCheckUtils]: 160: Hoare triple {86119#(< ~counter~0 48)} assume !!(0 != ~r~0); {86119#(< ~counter~0 48)} is VALID [2022-04-07 14:04:00,083 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {85456#true} {86119#(< ~counter~0 48)} #94#return; {86119#(< ~counter~0 48)} is VALID [2022-04-07 14:04:00,083 INFO L290 TraceCheckUtils]: 158: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,083 INFO L290 TraceCheckUtils]: 157: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,083 INFO L290 TraceCheckUtils]: 156: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,083 INFO L272 TraceCheckUtils]: 155: Hoare triple {86119#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,083 INFO L290 TraceCheckUtils]: 154: Hoare triple {86119#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {86119#(< ~counter~0 48)} is VALID [2022-04-07 14:04:00,084 INFO L290 TraceCheckUtils]: 153: Hoare triple {86144#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {86119#(< ~counter~0 48)} is VALID [2022-04-07 14:04:00,084 INFO L290 TraceCheckUtils]: 152: Hoare triple {86144#(< ~counter~0 47)} assume !(~r~0 < 0); {86144#(< ~counter~0 47)} is VALID [2022-04-07 14:04:00,084 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {85456#true} {86144#(< ~counter~0 47)} #98#return; {86144#(< ~counter~0 47)} is VALID [2022-04-07 14:04:00,085 INFO L290 TraceCheckUtils]: 150: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,085 INFO L290 TraceCheckUtils]: 149: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,085 INFO L290 TraceCheckUtils]: 148: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,085 INFO L272 TraceCheckUtils]: 147: Hoare triple {86144#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,085 INFO L290 TraceCheckUtils]: 146: Hoare triple {86144#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {86144#(< ~counter~0 47)} is VALID [2022-04-07 14:04:00,086 INFO L290 TraceCheckUtils]: 145: Hoare triple {86169#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {86144#(< ~counter~0 47)} is VALID [2022-04-07 14:04:00,086 INFO L290 TraceCheckUtils]: 144: Hoare triple {86169#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {86169#(< ~counter~0 46)} is VALID [2022-04-07 14:04:00,086 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {85456#true} {86169#(< ~counter~0 46)} #98#return; {86169#(< ~counter~0 46)} is VALID [2022-04-07 14:04:00,086 INFO L290 TraceCheckUtils]: 142: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,086 INFO L290 TraceCheckUtils]: 141: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,086 INFO L290 TraceCheckUtils]: 140: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,087 INFO L272 TraceCheckUtils]: 139: Hoare triple {86169#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,087 INFO L290 TraceCheckUtils]: 138: Hoare triple {86169#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {86169#(< ~counter~0 46)} is VALID [2022-04-07 14:04:00,087 INFO L290 TraceCheckUtils]: 137: Hoare triple {86194#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {86169#(< ~counter~0 46)} is VALID [2022-04-07 14:04:00,088 INFO L290 TraceCheckUtils]: 136: Hoare triple {86194#(< ~counter~0 45)} assume !(~r~0 > 0); {86194#(< ~counter~0 45)} is VALID [2022-04-07 14:04:00,088 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {85456#true} {86194#(< ~counter~0 45)} #96#return; {86194#(< ~counter~0 45)} is VALID [2022-04-07 14:04:00,088 INFO L290 TraceCheckUtils]: 134: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,088 INFO L290 TraceCheckUtils]: 133: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,088 INFO L290 TraceCheckUtils]: 132: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,088 INFO L272 TraceCheckUtils]: 131: Hoare triple {86194#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,089 INFO L290 TraceCheckUtils]: 130: Hoare triple {86194#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {86194#(< ~counter~0 45)} is VALID [2022-04-07 14:04:00,089 INFO L290 TraceCheckUtils]: 129: Hoare triple {86219#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86194#(< ~counter~0 45)} is VALID [2022-04-07 14:04:00,090 INFO L290 TraceCheckUtils]: 128: Hoare triple {86219#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86219#(< ~counter~0 44)} is VALID [2022-04-07 14:04:00,090 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {85456#true} {86219#(< ~counter~0 44)} #96#return; {86219#(< ~counter~0 44)} is VALID [2022-04-07 14:04:00,090 INFO L290 TraceCheckUtils]: 126: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,090 INFO L290 TraceCheckUtils]: 125: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,090 INFO L290 TraceCheckUtils]: 124: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,090 INFO L272 TraceCheckUtils]: 123: Hoare triple {86219#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,091 INFO L290 TraceCheckUtils]: 122: Hoare triple {86219#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {86219#(< ~counter~0 44)} is VALID [2022-04-07 14:04:00,091 INFO L290 TraceCheckUtils]: 121: Hoare triple {86244#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86219#(< ~counter~0 44)} is VALID [2022-04-07 14:04:00,092 INFO L290 TraceCheckUtils]: 120: Hoare triple {86244#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86244#(< ~counter~0 43)} is VALID [2022-04-07 14:04:00,092 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {85456#true} {86244#(< ~counter~0 43)} #96#return; {86244#(< ~counter~0 43)} is VALID [2022-04-07 14:04:00,092 INFO L290 TraceCheckUtils]: 118: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,092 INFO L290 TraceCheckUtils]: 117: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,092 INFO L290 TraceCheckUtils]: 116: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,092 INFO L272 TraceCheckUtils]: 115: Hoare triple {86244#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,093 INFO L290 TraceCheckUtils]: 114: Hoare triple {86244#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {86244#(< ~counter~0 43)} is VALID [2022-04-07 14:04:00,093 INFO L290 TraceCheckUtils]: 113: Hoare triple {86269#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86244#(< ~counter~0 43)} is VALID [2022-04-07 14:04:00,094 INFO L290 TraceCheckUtils]: 112: Hoare triple {86269#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86269#(< ~counter~0 42)} is VALID [2022-04-07 14:04:00,094 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {85456#true} {86269#(< ~counter~0 42)} #96#return; {86269#(< ~counter~0 42)} is VALID [2022-04-07 14:04:00,094 INFO L290 TraceCheckUtils]: 110: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,094 INFO L290 TraceCheckUtils]: 109: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,094 INFO L290 TraceCheckUtils]: 108: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,094 INFO L272 TraceCheckUtils]: 107: Hoare triple {86269#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,094 INFO L290 TraceCheckUtils]: 106: Hoare triple {86269#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {86269#(< ~counter~0 42)} is VALID [2022-04-07 14:04:00,095 INFO L290 TraceCheckUtils]: 105: Hoare triple {86294#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86269#(< ~counter~0 42)} is VALID [2022-04-07 14:04:00,095 INFO L290 TraceCheckUtils]: 104: Hoare triple {86294#(< ~counter~0 41)} assume !!(0 != ~r~0); {86294#(< ~counter~0 41)} is VALID [2022-04-07 14:04:00,096 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {85456#true} {86294#(< ~counter~0 41)} #94#return; {86294#(< ~counter~0 41)} is VALID [2022-04-07 14:04:00,096 INFO L290 TraceCheckUtils]: 102: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,096 INFO L290 TraceCheckUtils]: 101: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,096 INFO L290 TraceCheckUtils]: 100: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,096 INFO L272 TraceCheckUtils]: 99: Hoare triple {86294#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,096 INFO L290 TraceCheckUtils]: 98: Hoare triple {86294#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {86294#(< ~counter~0 41)} is VALID [2022-04-07 14:04:00,097 INFO L290 TraceCheckUtils]: 97: Hoare triple {86319#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {86294#(< ~counter~0 41)} is VALID [2022-04-07 14:04:00,097 INFO L290 TraceCheckUtils]: 96: Hoare triple {86319#(< ~counter~0 40)} assume !(~r~0 < 0); {86319#(< ~counter~0 40)} is VALID [2022-04-07 14:04:00,098 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {85456#true} {86319#(< ~counter~0 40)} #98#return; {86319#(< ~counter~0 40)} is VALID [2022-04-07 14:04:00,098 INFO L290 TraceCheckUtils]: 94: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,098 INFO L290 TraceCheckUtils]: 93: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,098 INFO L290 TraceCheckUtils]: 92: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,098 INFO L272 TraceCheckUtils]: 91: Hoare triple {86319#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,098 INFO L290 TraceCheckUtils]: 90: Hoare triple {86319#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {86319#(< ~counter~0 40)} is VALID [2022-04-07 14:04:00,099 INFO L290 TraceCheckUtils]: 89: Hoare triple {86344#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {86319#(< ~counter~0 40)} is VALID [2022-04-07 14:04:00,099 INFO L290 TraceCheckUtils]: 88: Hoare triple {86344#(< ~counter~0 39)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {86344#(< ~counter~0 39)} is VALID [2022-04-07 14:04:00,100 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {85456#true} {86344#(< ~counter~0 39)} #98#return; {86344#(< ~counter~0 39)} is VALID [2022-04-07 14:04:00,100 INFO L290 TraceCheckUtils]: 86: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,110 INFO L290 TraceCheckUtils]: 85: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,110 INFO L290 TraceCheckUtils]: 84: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,110 INFO L272 TraceCheckUtils]: 83: Hoare triple {86344#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,111 INFO L290 TraceCheckUtils]: 82: Hoare triple {86344#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {86344#(< ~counter~0 39)} is VALID [2022-04-07 14:04:00,112 INFO L290 TraceCheckUtils]: 81: Hoare triple {86369#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {86344#(< ~counter~0 39)} is VALID [2022-04-07 14:04:00,113 INFO L290 TraceCheckUtils]: 80: Hoare triple {86369#(< ~counter~0 38)} assume !(~r~0 > 0); {86369#(< ~counter~0 38)} is VALID [2022-04-07 14:04:00,113 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {85456#true} {86369#(< ~counter~0 38)} #96#return; {86369#(< ~counter~0 38)} is VALID [2022-04-07 14:04:00,113 INFO L290 TraceCheckUtils]: 78: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,113 INFO L290 TraceCheckUtils]: 77: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,114 INFO L290 TraceCheckUtils]: 76: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,114 INFO L272 TraceCheckUtils]: 75: Hoare triple {86369#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,114 INFO L290 TraceCheckUtils]: 74: Hoare triple {86369#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {86369#(< ~counter~0 38)} is VALID [2022-04-07 14:04:00,115 INFO L290 TraceCheckUtils]: 73: Hoare triple {86394#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86369#(< ~counter~0 38)} is VALID [2022-04-07 14:04:00,115 INFO L290 TraceCheckUtils]: 72: Hoare triple {86394#(< ~counter~0 37)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86394#(< ~counter~0 37)} is VALID [2022-04-07 14:04:00,115 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {85456#true} {86394#(< ~counter~0 37)} #96#return; {86394#(< ~counter~0 37)} is VALID [2022-04-07 14:04:00,115 INFO L290 TraceCheckUtils]: 70: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,116 INFO L272 TraceCheckUtils]: 67: Hoare triple {86394#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,124 INFO L290 TraceCheckUtils]: 66: Hoare triple {86394#(< ~counter~0 37)} assume !!(#t~post7 < 50);havoc #t~post7; {86394#(< ~counter~0 37)} is VALID [2022-04-07 14:04:00,125 INFO L290 TraceCheckUtils]: 65: Hoare triple {86419#(< ~counter~0 36)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86394#(< ~counter~0 37)} is VALID [2022-04-07 14:04:00,125 INFO L290 TraceCheckUtils]: 64: Hoare triple {86419#(< ~counter~0 36)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {86419#(< ~counter~0 36)} is VALID [2022-04-07 14:04:00,126 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {85456#true} {86419#(< ~counter~0 36)} #96#return; {86419#(< ~counter~0 36)} is VALID [2022-04-07 14:04:00,126 INFO L290 TraceCheckUtils]: 62: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,126 INFO L290 TraceCheckUtils]: 61: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,126 INFO L272 TraceCheckUtils]: 59: Hoare triple {86419#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {86419#(< ~counter~0 36)} assume !!(#t~post7 < 50);havoc #t~post7; {86419#(< ~counter~0 36)} is VALID [2022-04-07 14:04:00,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {86444#(< ~counter~0 35)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86419#(< ~counter~0 36)} is VALID [2022-04-07 14:04:00,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {86444#(< ~counter~0 35)} assume !!(0 != ~r~0); {86444#(< ~counter~0 35)} is VALID [2022-04-07 14:04:00,128 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {85456#true} {86444#(< ~counter~0 35)} #94#return; {86444#(< ~counter~0 35)} is VALID [2022-04-07 14:04:00,128 INFO L290 TraceCheckUtils]: 54: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,128 INFO L290 TraceCheckUtils]: 53: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,128 INFO L290 TraceCheckUtils]: 52: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,128 INFO L272 TraceCheckUtils]: 51: Hoare triple {86444#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {86444#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {86444#(< ~counter~0 35)} is VALID [2022-04-07 14:04:00,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {86469#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {86444#(< ~counter~0 35)} is VALID [2022-04-07 14:04:00,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {86469#(< ~counter~0 34)} assume !(~r~0 < 0); {86469#(< ~counter~0 34)} is VALID [2022-04-07 14:04:00,130 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {85456#true} {86469#(< ~counter~0 34)} #98#return; {86469#(< ~counter~0 34)} is VALID [2022-04-07 14:04:00,130 INFO L290 TraceCheckUtils]: 46: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,130 INFO L290 TraceCheckUtils]: 45: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,130 INFO L272 TraceCheckUtils]: 43: Hoare triple {86469#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {86469#(< ~counter~0 34)} assume !!(#t~post8 < 50);havoc #t~post8; {86469#(< ~counter~0 34)} is VALID [2022-04-07 14:04:00,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {86494#(< ~counter~0 33)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {86469#(< ~counter~0 34)} is VALID [2022-04-07 14:04:00,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {86494#(< ~counter~0 33)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {86494#(< ~counter~0 33)} is VALID [2022-04-07 14:04:00,132 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {85456#true} {86494#(< ~counter~0 33)} #98#return; {86494#(< ~counter~0 33)} is VALID [2022-04-07 14:04:00,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,132 INFO L290 TraceCheckUtils]: 37: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,132 INFO L272 TraceCheckUtils]: 35: Hoare triple {86494#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {86494#(< ~counter~0 33)} assume !!(#t~post8 < 50);havoc #t~post8; {86494#(< ~counter~0 33)} is VALID [2022-04-07 14:04:00,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {86519#(< ~counter~0 32)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {86494#(< ~counter~0 33)} is VALID [2022-04-07 14:04:00,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {86519#(< ~counter~0 32)} assume !(~r~0 > 0); {86519#(< ~counter~0 32)} is VALID [2022-04-07 14:04:00,134 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {85456#true} {86519#(< ~counter~0 32)} #96#return; {86519#(< ~counter~0 32)} is VALID [2022-04-07 14:04:00,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,134 INFO L272 TraceCheckUtils]: 27: Hoare triple {86519#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {86519#(< ~counter~0 32)} assume !!(#t~post7 < 50);havoc #t~post7; {86519#(< ~counter~0 32)} is VALID [2022-04-07 14:04:00,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {86544#(< ~counter~0 31)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {86519#(< ~counter~0 32)} is VALID [2022-04-07 14:04:00,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {86544#(< ~counter~0 31)} assume !!(0 != ~r~0); {86544#(< ~counter~0 31)} is VALID [2022-04-07 14:04:00,136 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {85456#true} {86544#(< ~counter~0 31)} #94#return; {86544#(< ~counter~0 31)} is VALID [2022-04-07 14:04:00,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,136 INFO L272 TraceCheckUtils]: 19: Hoare triple {86544#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {86544#(< ~counter~0 31)} assume !!(#t~post6 < 50);havoc #t~post6; {86544#(< ~counter~0 31)} is VALID [2022-04-07 14:04:00,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {86569#(< ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {86544#(< ~counter~0 31)} is VALID [2022-04-07 14:04:00,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {86569#(< ~counter~0 30)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {86569#(< ~counter~0 30)} is VALID [2022-04-07 14:04:00,138 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {85456#true} {86569#(< ~counter~0 30)} #92#return; {86569#(< ~counter~0 30)} is VALID [2022-04-07 14:04:00,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,138 INFO L272 TraceCheckUtils]: 11: Hoare triple {86569#(< ~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)); {85456#true} is VALID [2022-04-07 14:04:00,138 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {85456#true} {86569#(< ~counter~0 30)} #90#return; {86569#(< ~counter~0 30)} is VALID [2022-04-07 14:04:00,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {85456#true} assume true; {85456#true} is VALID [2022-04-07 14:04:00,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {85456#true} assume !(0 == ~cond); {85456#true} is VALID [2022-04-07 14:04:00,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {85456#true} ~cond := #in~cond; {85456#true} is VALID [2022-04-07 14:04:00,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {86569#(< ~counter~0 30)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {85456#true} is VALID [2022-04-07 14:04:00,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {86569#(< ~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; {86569#(< ~counter~0 30)} is VALID [2022-04-07 14:04:00,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {86569#(< ~counter~0 30)} call #t~ret9 := main(); {86569#(< ~counter~0 30)} is VALID [2022-04-07 14:04:00,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86569#(< ~counter~0 30)} {85456#true} #102#return; {86569#(< ~counter~0 30)} is VALID [2022-04-07 14:04:00,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {86569#(< ~counter~0 30)} assume true; {86569#(< ~counter~0 30)} is VALID [2022-04-07 14:04:00,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {85456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {86569#(< ~counter~0 30)} is VALID [2022-04-07 14:04:00,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {85456#true} call ULTIMATE.init(); {85456#true} is VALID [2022-04-07 14:04:00,141 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-07 14:04:00,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:04:00,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426923974] [2022-04-07 14:04:00,141 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:04:00,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687803411] [2022-04-07 14:04:00,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687803411] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:04:00,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:04:00,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-04-07 14:04:00,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647397588] [2022-04-07 14:04:00,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:04:00,143 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-07 14:04:00,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:04:00,143 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-07 14:04:00,390 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-07 14:04:00,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-07 14:04:00,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:04:00,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-07 14:04:00,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2022-04-07 14:04:00,391 INFO L87 Difference]: Start difference. First operand 2548 states and 3416 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-07 14:04:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:04:27,378 INFO L93 Difference]: Finished difference Result 10270 states and 15333 transitions. [2022-04-07 14:04:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-04-07 14:04:27,378 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-07 14:04:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:04:27,378 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-07 14:04:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 956 transitions. [2022-04-07 14:04:27,386 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-07 14:04:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 956 transitions. [2022-04-07 14:04:27,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 956 transitions. [2022-04-07 14:04:28,227 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-07 14:04:32,234 INFO L225 Difference]: With dead ends: 10270 [2022-04-07 14:04:32,234 INFO L226 Difference]: Without dead ends: 10261 [2022-04-07 14:04:32,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2691, Invalid=4619, Unknown=0, NotChecked=0, Total=7310 [2022-04-07 14:04:32,238 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 1666 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 1122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1122 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-07 14:04:32,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1666 Valid, 1002 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1122 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-07 14:04:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10261 states. [2022-04-07 14:04:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10261 to 10003. [2022-04-07 14:04:48,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:04:48,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10261 states. Second operand has 10003 states, 7524 states have (on average 1.257177033492823) internal successors, (9459), 7589 states have internal predecessors, (9459), 2396 states have call successors, (2396), 84 states have call predecessors, (2396), 82 states have return successors, (2394), 2329 states have call predecessors, (2394), 2394 states have call successors, (2394) [2022-04-07 14:04:48,730 INFO L74 IsIncluded]: Start isIncluded. First operand 10261 states. Second operand has 10003 states, 7524 states have (on average 1.257177033492823) internal successors, (9459), 7589 states have internal predecessors, (9459), 2396 states have call successors, (2396), 84 states have call predecessors, (2396), 82 states have return successors, (2394), 2329 states have call predecessors, (2394), 2394 states have call successors, (2394) [2022-04-07 14:04:48,739 INFO L87 Difference]: Start difference. First operand 10261 states. Second operand has 10003 states, 7524 states have (on average 1.257177033492823) internal successors, (9459), 7589 states have internal predecessors, (9459), 2396 states have call successors, (2396), 84 states have call predecessors, (2396), 82 states have return successors, (2394), 2329 states have call predecessors, (2394), 2394 states have call successors, (2394) [2022-04-07 14:04:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:04:51,435 INFO L93 Difference]: Finished difference Result 10261 states and 14499 transitions. [2022-04-07 14:04:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 10261 states and 14499 transitions. [2022-04-07 14:04:51,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:04:51,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:04:51,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 10003 states, 7524 states have (on average 1.257177033492823) internal successors, (9459), 7589 states have internal predecessors, (9459), 2396 states have call successors, (2396), 84 states have call predecessors, (2396), 82 states have return successors, (2394), 2329 states have call predecessors, (2394), 2394 states have call successors, (2394) Second operand 10261 states. [2022-04-07 14:04:51,465 INFO L87 Difference]: Start difference. First operand has 10003 states, 7524 states have (on average 1.257177033492823) internal successors, (9459), 7589 states have internal predecessors, (9459), 2396 states have call successors, (2396), 84 states have call predecessors, (2396), 82 states have return successors, (2394), 2329 states have call predecessors, (2394), 2394 states have call successors, (2394) Second operand 10261 states. [2022-04-07 14:04:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:04:54,103 INFO L93 Difference]: Finished difference Result 10261 states and 14499 transitions. [2022-04-07 14:04:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 10261 states and 14499 transitions. [2022-04-07 14:04:54,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:04:54,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:04:54,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:04:54,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:04:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10003 states, 7524 states have (on average 1.257177033492823) internal successors, (9459), 7589 states have internal predecessors, (9459), 2396 states have call successors, (2396), 84 states have call predecessors, (2396), 82 states have return successors, (2394), 2329 states have call predecessors, (2394), 2394 states have call successors, (2394) [2022-04-07 14:04:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10003 states to 10003 states and 14249 transitions. [2022-04-07 14:04:57,928 INFO L78 Accepts]: Start accepts. Automaton has 10003 states and 14249 transitions. Word has length 187 [2022-04-07 14:04:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:04:57,928 INFO L478 AbstractCegarLoop]: Abstraction has 10003 states and 14249 transitions. [2022-04-07 14:04:57,929 INFO L479 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-07 14:04:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 10003 states and 14249 transitions. [2022-04-07 14:04:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-07 14:04:57,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:04:57,932 INFO L499 BasicCegarLoop]: 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-07 14:04:57,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-07 14:04:58,133 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:04:58,133 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:04:58,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:04:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 179284923, now seen corresponding path program 2 times [2022-04-07 14:04:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:04:58,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702383520] [2022-04-07 14:04:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:04:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:04:58,157 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:04:58,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933369698] [2022-04-07 14:04:58,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:04:58,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:04:58,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:04:58,158 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-07 14:04:58,159 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-07 14:04:58,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:04:58,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:04:58,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-07 14:04:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:04:58,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:04:59,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {135802#true} call ULTIMATE.init(); {135802#true} is VALID [2022-04-07 14:04:59,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {135802#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {135810#(<= ~counter~0 0)} assume true; {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135810#(<= ~counter~0 0)} {135802#true} #102#return; {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {135810#(<= ~counter~0 0)} call #t~ret9 := main(); {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {135810#(<= ~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; {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,359 INFO L272 TraceCheckUtils]: 6: Hoare triple {135810#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {135810#(<= ~counter~0 0)} ~cond := #in~cond; {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {135810#(<= ~counter~0 0)} assume !(0 == ~cond); {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {135810#(<= ~counter~0 0)} assume true; {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,360 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {135810#(<= ~counter~0 0)} {135810#(<= ~counter~0 0)} #90#return; {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,360 INFO L272 TraceCheckUtils]: 11: Hoare triple {135810#(<= ~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)); {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {135810#(<= ~counter~0 0)} ~cond := #in~cond; {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {135810#(<= ~counter~0 0)} assume !(0 == ~cond); {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {135810#(<= ~counter~0 0)} assume true; {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,361 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {135810#(<= ~counter~0 0)} {135810#(<= ~counter~0 0)} #92#return; {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {135810#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {135810#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:59,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {135810#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {135859#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:59,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {135859#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {135859#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:59,364 INFO L272 TraceCheckUtils]: 19: Hoare triple {135859#(<= ~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)); {135859#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:59,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {135859#(<= ~counter~0 1)} ~cond := #in~cond; {135859#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:59,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {135859#(<= ~counter~0 1)} assume !(0 == ~cond); {135859#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:59,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {135859#(<= ~counter~0 1)} assume true; {135859#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:59,365 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {135859#(<= ~counter~0 1)} {135859#(<= ~counter~0 1)} #94#return; {135859#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:59,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {135859#(<= ~counter~0 1)} assume !!(0 != ~r~0); {135859#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:59,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {135859#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {135884#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:59,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {135884#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {135884#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:59,367 INFO L272 TraceCheckUtils]: 27: Hoare triple {135884#(<= ~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)); {135884#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:59,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {135884#(<= ~counter~0 2)} ~cond := #in~cond; {135884#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:59,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {135884#(<= ~counter~0 2)} assume !(0 == ~cond); {135884#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:59,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {135884#(<= ~counter~0 2)} assume true; {135884#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:59,368 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {135884#(<= ~counter~0 2)} {135884#(<= ~counter~0 2)} #96#return; {135884#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:59,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {135884#(<= ~counter~0 2)} assume !(~r~0 > 0); {135884#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:59,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {135884#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {135909#(<= ~counter~0 3)} is VALID [2022-04-07 14:04:59,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {135909#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {135909#(<= ~counter~0 3)} is VALID [2022-04-07 14:04:59,370 INFO L272 TraceCheckUtils]: 35: Hoare triple {135909#(<= ~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)); {135909#(<= ~counter~0 3)} is VALID [2022-04-07 14:04:59,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {135909#(<= ~counter~0 3)} ~cond := #in~cond; {135909#(<= ~counter~0 3)} is VALID [2022-04-07 14:04:59,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {135909#(<= ~counter~0 3)} assume !(0 == ~cond); {135909#(<= ~counter~0 3)} is VALID [2022-04-07 14:04:59,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {135909#(<= ~counter~0 3)} assume true; {135909#(<= ~counter~0 3)} is VALID [2022-04-07 14:04:59,371 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {135909#(<= ~counter~0 3)} {135909#(<= ~counter~0 3)} #98#return; {135909#(<= ~counter~0 3)} is VALID [2022-04-07 14:04:59,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {135909#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {135909#(<= ~counter~0 3)} is VALID [2022-04-07 14:04:59,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {135909#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {135934#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:59,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {135934#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {135934#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:59,372 INFO L272 TraceCheckUtils]: 43: Hoare triple {135934#(<= ~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)); {135934#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:59,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {135934#(<= ~counter~0 4)} ~cond := #in~cond; {135934#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:59,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {135934#(<= ~counter~0 4)} assume !(0 == ~cond); {135934#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:59,373 INFO L290 TraceCheckUtils]: 46: Hoare triple {135934#(<= ~counter~0 4)} assume true; {135934#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:59,374 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {135934#(<= ~counter~0 4)} {135934#(<= ~counter~0 4)} #98#return; {135934#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:59,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {135934#(<= ~counter~0 4)} assume !(~r~0 < 0); {135934#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:59,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {135934#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {135959#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:59,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {135959#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {135959#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:59,375 INFO L272 TraceCheckUtils]: 51: Hoare triple {135959#(<= ~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)); {135959#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:59,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {135959#(<= ~counter~0 5)} ~cond := #in~cond; {135959#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:59,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {135959#(<= ~counter~0 5)} assume !(0 == ~cond); {135959#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:59,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {135959#(<= ~counter~0 5)} assume true; {135959#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:59,377 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {135959#(<= ~counter~0 5)} {135959#(<= ~counter~0 5)} #94#return; {135959#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:59,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {135959#(<= ~counter~0 5)} assume !!(0 != ~r~0); {135959#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:59,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {135959#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {135984#(<= ~counter~0 6)} is VALID [2022-04-07 14:04:59,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {135984#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {135984#(<= ~counter~0 6)} is VALID [2022-04-07 14:04:59,378 INFO L272 TraceCheckUtils]: 59: Hoare triple {135984#(<= ~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)); {135984#(<= ~counter~0 6)} is VALID [2022-04-07 14:04:59,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {135984#(<= ~counter~0 6)} ~cond := #in~cond; {135984#(<= ~counter~0 6)} is VALID [2022-04-07 14:04:59,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {135984#(<= ~counter~0 6)} assume !(0 == ~cond); {135984#(<= ~counter~0 6)} is VALID [2022-04-07 14:04:59,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {135984#(<= ~counter~0 6)} assume true; {135984#(<= ~counter~0 6)} is VALID [2022-04-07 14:04:59,380 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {135984#(<= ~counter~0 6)} {135984#(<= ~counter~0 6)} #96#return; {135984#(<= ~counter~0 6)} is VALID [2022-04-07 14:04:59,380 INFO L290 TraceCheckUtils]: 64: Hoare triple {135984#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {135984#(<= ~counter~0 6)} is VALID [2022-04-07 14:04:59,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {135984#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136009#(<= ~counter~0 7)} is VALID [2022-04-07 14:04:59,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {136009#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {136009#(<= ~counter~0 7)} is VALID [2022-04-07 14:04:59,381 INFO L272 TraceCheckUtils]: 67: Hoare triple {136009#(<= ~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)); {136009#(<= ~counter~0 7)} is VALID [2022-04-07 14:04:59,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {136009#(<= ~counter~0 7)} ~cond := #in~cond; {136009#(<= ~counter~0 7)} is VALID [2022-04-07 14:04:59,382 INFO L290 TraceCheckUtils]: 69: Hoare triple {136009#(<= ~counter~0 7)} assume !(0 == ~cond); {136009#(<= ~counter~0 7)} is VALID [2022-04-07 14:04:59,382 INFO L290 TraceCheckUtils]: 70: Hoare triple {136009#(<= ~counter~0 7)} assume true; {136009#(<= ~counter~0 7)} is VALID [2022-04-07 14:04:59,382 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {136009#(<= ~counter~0 7)} {136009#(<= ~counter~0 7)} #96#return; {136009#(<= ~counter~0 7)} is VALID [2022-04-07 14:04:59,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {136009#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136009#(<= ~counter~0 7)} is VALID [2022-04-07 14:04:59,383 INFO L290 TraceCheckUtils]: 73: Hoare triple {136009#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136034#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:59,384 INFO L290 TraceCheckUtils]: 74: Hoare triple {136034#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {136034#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:59,384 INFO L272 TraceCheckUtils]: 75: Hoare triple {136034#(<= ~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)); {136034#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:59,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {136034#(<= ~counter~0 8)} ~cond := #in~cond; {136034#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:59,385 INFO L290 TraceCheckUtils]: 77: Hoare triple {136034#(<= ~counter~0 8)} assume !(0 == ~cond); {136034#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:59,385 INFO L290 TraceCheckUtils]: 78: Hoare triple {136034#(<= ~counter~0 8)} assume true; {136034#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:59,385 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {136034#(<= ~counter~0 8)} {136034#(<= ~counter~0 8)} #96#return; {136034#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:59,386 INFO L290 TraceCheckUtils]: 80: Hoare triple {136034#(<= ~counter~0 8)} assume !(~r~0 > 0); {136034#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:59,386 INFO L290 TraceCheckUtils]: 81: Hoare triple {136034#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136059#(<= ~counter~0 9)} is VALID [2022-04-07 14:04:59,387 INFO L290 TraceCheckUtils]: 82: Hoare triple {136059#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {136059#(<= ~counter~0 9)} is VALID [2022-04-07 14:04:59,387 INFO L272 TraceCheckUtils]: 83: Hoare triple {136059#(<= ~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)); {136059#(<= ~counter~0 9)} is VALID [2022-04-07 14:04:59,387 INFO L290 TraceCheckUtils]: 84: Hoare triple {136059#(<= ~counter~0 9)} ~cond := #in~cond; {136059#(<= ~counter~0 9)} is VALID [2022-04-07 14:04:59,388 INFO L290 TraceCheckUtils]: 85: Hoare triple {136059#(<= ~counter~0 9)} assume !(0 == ~cond); {136059#(<= ~counter~0 9)} is VALID [2022-04-07 14:04:59,388 INFO L290 TraceCheckUtils]: 86: Hoare triple {136059#(<= ~counter~0 9)} assume true; {136059#(<= ~counter~0 9)} is VALID [2022-04-07 14:04:59,388 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {136059#(<= ~counter~0 9)} {136059#(<= ~counter~0 9)} #98#return; {136059#(<= ~counter~0 9)} is VALID [2022-04-07 14:04:59,389 INFO L290 TraceCheckUtils]: 88: Hoare triple {136059#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136059#(<= ~counter~0 9)} is VALID [2022-04-07 14:04:59,389 INFO L290 TraceCheckUtils]: 89: Hoare triple {136059#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136084#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:59,390 INFO L290 TraceCheckUtils]: 90: Hoare triple {136084#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {136084#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:59,390 INFO L272 TraceCheckUtils]: 91: Hoare triple {136084#(<= ~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)); {136084#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:59,390 INFO L290 TraceCheckUtils]: 92: Hoare triple {136084#(<= ~counter~0 10)} ~cond := #in~cond; {136084#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:59,390 INFO L290 TraceCheckUtils]: 93: Hoare triple {136084#(<= ~counter~0 10)} assume !(0 == ~cond); {136084#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:59,391 INFO L290 TraceCheckUtils]: 94: Hoare triple {136084#(<= ~counter~0 10)} assume true; {136084#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:59,391 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {136084#(<= ~counter~0 10)} {136084#(<= ~counter~0 10)} #98#return; {136084#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:59,391 INFO L290 TraceCheckUtils]: 96: Hoare triple {136084#(<= ~counter~0 10)} assume !(~r~0 < 0); {136084#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:59,392 INFO L290 TraceCheckUtils]: 97: Hoare triple {136084#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {136109#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:59,392 INFO L290 TraceCheckUtils]: 98: Hoare triple {136109#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {136109#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:59,393 INFO L272 TraceCheckUtils]: 99: Hoare triple {136109#(<= ~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)); {136109#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:59,393 INFO L290 TraceCheckUtils]: 100: Hoare triple {136109#(<= ~counter~0 11)} ~cond := #in~cond; {136109#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:59,393 INFO L290 TraceCheckUtils]: 101: Hoare triple {136109#(<= ~counter~0 11)} assume !(0 == ~cond); {136109#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:59,394 INFO L290 TraceCheckUtils]: 102: Hoare triple {136109#(<= ~counter~0 11)} assume true; {136109#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:59,394 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {136109#(<= ~counter~0 11)} {136109#(<= ~counter~0 11)} #94#return; {136109#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:59,394 INFO L290 TraceCheckUtils]: 104: Hoare triple {136109#(<= ~counter~0 11)} assume !!(0 != ~r~0); {136109#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:59,395 INFO L290 TraceCheckUtils]: 105: Hoare triple {136109#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136134#(<= ~counter~0 12)} is VALID [2022-04-07 14:04:59,395 INFO L290 TraceCheckUtils]: 106: Hoare triple {136134#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {136134#(<= ~counter~0 12)} is VALID [2022-04-07 14:04:59,396 INFO L272 TraceCheckUtils]: 107: Hoare triple {136134#(<= ~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)); {136134#(<= ~counter~0 12)} is VALID [2022-04-07 14:04:59,396 INFO L290 TraceCheckUtils]: 108: Hoare triple {136134#(<= ~counter~0 12)} ~cond := #in~cond; {136134#(<= ~counter~0 12)} is VALID [2022-04-07 14:04:59,396 INFO L290 TraceCheckUtils]: 109: Hoare triple {136134#(<= ~counter~0 12)} assume !(0 == ~cond); {136134#(<= ~counter~0 12)} is VALID [2022-04-07 14:04:59,397 INFO L290 TraceCheckUtils]: 110: Hoare triple {136134#(<= ~counter~0 12)} assume true; {136134#(<= ~counter~0 12)} is VALID [2022-04-07 14:04:59,397 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {136134#(<= ~counter~0 12)} {136134#(<= ~counter~0 12)} #96#return; {136134#(<= ~counter~0 12)} is VALID [2022-04-07 14:04:59,397 INFO L290 TraceCheckUtils]: 112: Hoare triple {136134#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136134#(<= ~counter~0 12)} is VALID [2022-04-07 14:04:59,398 INFO L290 TraceCheckUtils]: 113: Hoare triple {136134#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136159#(<= ~counter~0 13)} is VALID [2022-04-07 14:04:59,398 INFO L290 TraceCheckUtils]: 114: Hoare triple {136159#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {136159#(<= ~counter~0 13)} is VALID [2022-04-07 14:04:59,399 INFO L272 TraceCheckUtils]: 115: Hoare triple {136159#(<= ~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)); {136159#(<= ~counter~0 13)} is VALID [2022-04-07 14:04:59,399 INFO L290 TraceCheckUtils]: 116: Hoare triple {136159#(<= ~counter~0 13)} ~cond := #in~cond; {136159#(<= ~counter~0 13)} is VALID [2022-04-07 14:04:59,399 INFO L290 TraceCheckUtils]: 117: Hoare triple {136159#(<= ~counter~0 13)} assume !(0 == ~cond); {136159#(<= ~counter~0 13)} is VALID [2022-04-07 14:04:59,399 INFO L290 TraceCheckUtils]: 118: Hoare triple {136159#(<= ~counter~0 13)} assume true; {136159#(<= ~counter~0 13)} is VALID [2022-04-07 14:04:59,400 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {136159#(<= ~counter~0 13)} {136159#(<= ~counter~0 13)} #96#return; {136159#(<= ~counter~0 13)} is VALID [2022-04-07 14:04:59,400 INFO L290 TraceCheckUtils]: 120: Hoare triple {136159#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136159#(<= ~counter~0 13)} is VALID [2022-04-07 14:04:59,401 INFO L290 TraceCheckUtils]: 121: Hoare triple {136159#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136184#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:59,401 INFO L290 TraceCheckUtils]: 122: Hoare triple {136184#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {136184#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:59,402 INFO L272 TraceCheckUtils]: 123: Hoare triple {136184#(<= ~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)); {136184#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:59,402 INFO L290 TraceCheckUtils]: 124: Hoare triple {136184#(<= ~counter~0 14)} ~cond := #in~cond; {136184#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:59,402 INFO L290 TraceCheckUtils]: 125: Hoare triple {136184#(<= ~counter~0 14)} assume !(0 == ~cond); {136184#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:59,402 INFO L290 TraceCheckUtils]: 126: Hoare triple {136184#(<= ~counter~0 14)} assume true; {136184#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:59,403 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {136184#(<= ~counter~0 14)} {136184#(<= ~counter~0 14)} #96#return; {136184#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:59,403 INFO L290 TraceCheckUtils]: 128: Hoare triple {136184#(<= ~counter~0 14)} assume !(~r~0 > 0); {136184#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:59,404 INFO L290 TraceCheckUtils]: 129: Hoare triple {136184#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136209#(<= ~counter~0 15)} is VALID [2022-04-07 14:04:59,404 INFO L290 TraceCheckUtils]: 130: Hoare triple {136209#(<= ~counter~0 15)} assume !!(#t~post8 < 50);havoc #t~post8; {136209#(<= ~counter~0 15)} is VALID [2022-04-07 14:04:59,405 INFO L272 TraceCheckUtils]: 131: Hoare triple {136209#(<= ~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)); {136209#(<= ~counter~0 15)} is VALID [2022-04-07 14:04:59,405 INFO L290 TraceCheckUtils]: 132: Hoare triple {136209#(<= ~counter~0 15)} ~cond := #in~cond; {136209#(<= ~counter~0 15)} is VALID [2022-04-07 14:04:59,405 INFO L290 TraceCheckUtils]: 133: Hoare triple {136209#(<= ~counter~0 15)} assume !(0 == ~cond); {136209#(<= ~counter~0 15)} is VALID [2022-04-07 14:04:59,405 INFO L290 TraceCheckUtils]: 134: Hoare triple {136209#(<= ~counter~0 15)} assume true; {136209#(<= ~counter~0 15)} is VALID [2022-04-07 14:04:59,406 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {136209#(<= ~counter~0 15)} {136209#(<= ~counter~0 15)} #98#return; {136209#(<= ~counter~0 15)} is VALID [2022-04-07 14:04:59,406 INFO L290 TraceCheckUtils]: 136: Hoare triple {136209#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136209#(<= ~counter~0 15)} is VALID [2022-04-07 14:04:59,407 INFO L290 TraceCheckUtils]: 137: Hoare triple {136209#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136234#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:59,407 INFO L290 TraceCheckUtils]: 138: Hoare triple {136234#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {136234#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:59,407 INFO L272 TraceCheckUtils]: 139: Hoare triple {136234#(<= ~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)); {136234#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:59,408 INFO L290 TraceCheckUtils]: 140: Hoare triple {136234#(<= ~counter~0 16)} ~cond := #in~cond; {136234#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:59,408 INFO L290 TraceCheckUtils]: 141: Hoare triple {136234#(<= ~counter~0 16)} assume !(0 == ~cond); {136234#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:59,408 INFO L290 TraceCheckUtils]: 142: Hoare triple {136234#(<= ~counter~0 16)} assume true; {136234#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:59,409 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {136234#(<= ~counter~0 16)} {136234#(<= ~counter~0 16)} #98#return; {136234#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:59,409 INFO L290 TraceCheckUtils]: 144: Hoare triple {136234#(<= ~counter~0 16)} assume !(~r~0 < 0); {136234#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:59,410 INFO L290 TraceCheckUtils]: 145: Hoare triple {136234#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {136259#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:59,410 INFO L290 TraceCheckUtils]: 146: Hoare triple {136259#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {136259#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:59,410 INFO L272 TraceCheckUtils]: 147: Hoare triple {136259#(<= ~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)); {136259#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:59,411 INFO L290 TraceCheckUtils]: 148: Hoare triple {136259#(<= ~counter~0 17)} ~cond := #in~cond; {136259#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:59,411 INFO L290 TraceCheckUtils]: 149: Hoare triple {136259#(<= ~counter~0 17)} assume !(0 == ~cond); {136259#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:59,411 INFO L290 TraceCheckUtils]: 150: Hoare triple {136259#(<= ~counter~0 17)} assume true; {136259#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:59,412 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {136259#(<= ~counter~0 17)} {136259#(<= ~counter~0 17)} #94#return; {136259#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:59,412 INFO L290 TraceCheckUtils]: 152: Hoare triple {136259#(<= ~counter~0 17)} assume !!(0 != ~r~0); {136259#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:59,413 INFO L290 TraceCheckUtils]: 153: Hoare triple {136259#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136284#(<= ~counter~0 18)} is VALID [2022-04-07 14:04:59,413 INFO L290 TraceCheckUtils]: 154: Hoare triple {136284#(<= ~counter~0 18)} assume !!(#t~post7 < 50);havoc #t~post7; {136284#(<= ~counter~0 18)} is VALID [2022-04-07 14:04:59,413 INFO L272 TraceCheckUtils]: 155: Hoare triple {136284#(<= ~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)); {136284#(<= ~counter~0 18)} is VALID [2022-04-07 14:04:59,413 INFO L290 TraceCheckUtils]: 156: Hoare triple {136284#(<= ~counter~0 18)} ~cond := #in~cond; {136284#(<= ~counter~0 18)} is VALID [2022-04-07 14:04:59,414 INFO L290 TraceCheckUtils]: 157: Hoare triple {136284#(<= ~counter~0 18)} assume !(0 == ~cond); {136284#(<= ~counter~0 18)} is VALID [2022-04-07 14:04:59,414 INFO L290 TraceCheckUtils]: 158: Hoare triple {136284#(<= ~counter~0 18)} assume true; {136284#(<= ~counter~0 18)} is VALID [2022-04-07 14:04:59,414 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {136284#(<= ~counter~0 18)} {136284#(<= ~counter~0 18)} #96#return; {136284#(<= ~counter~0 18)} is VALID [2022-04-07 14:04:59,415 INFO L290 TraceCheckUtils]: 160: Hoare triple {136284#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136284#(<= ~counter~0 18)} is VALID [2022-04-07 14:04:59,415 INFO L290 TraceCheckUtils]: 161: Hoare triple {136284#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136309#(<= ~counter~0 19)} is VALID [2022-04-07 14:04:59,416 INFO L290 TraceCheckUtils]: 162: Hoare triple {136309#(<= ~counter~0 19)} assume !!(#t~post7 < 50);havoc #t~post7; {136309#(<= ~counter~0 19)} is VALID [2022-04-07 14:04:59,416 INFO L272 TraceCheckUtils]: 163: Hoare triple {136309#(<= ~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)); {136309#(<= ~counter~0 19)} is VALID [2022-04-07 14:04:59,416 INFO L290 TraceCheckUtils]: 164: Hoare triple {136309#(<= ~counter~0 19)} ~cond := #in~cond; {136309#(<= ~counter~0 19)} is VALID [2022-04-07 14:04:59,417 INFO L290 TraceCheckUtils]: 165: Hoare triple {136309#(<= ~counter~0 19)} assume !(0 == ~cond); {136309#(<= ~counter~0 19)} is VALID [2022-04-07 14:04:59,417 INFO L290 TraceCheckUtils]: 166: Hoare triple {136309#(<= ~counter~0 19)} assume true; {136309#(<= ~counter~0 19)} is VALID [2022-04-07 14:04:59,417 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {136309#(<= ~counter~0 19)} {136309#(<= ~counter~0 19)} #96#return; {136309#(<= ~counter~0 19)} is VALID [2022-04-07 14:04:59,418 INFO L290 TraceCheckUtils]: 168: Hoare triple {136309#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136309#(<= ~counter~0 19)} is VALID [2022-04-07 14:04:59,418 INFO L290 TraceCheckUtils]: 169: Hoare triple {136309#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136334#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:59,419 INFO L290 TraceCheckUtils]: 170: Hoare triple {136334#(<= ~counter~0 20)} assume !!(#t~post7 < 50);havoc #t~post7; {136334#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:59,419 INFO L272 TraceCheckUtils]: 171: Hoare triple {136334#(<= ~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)); {136334#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:59,419 INFO L290 TraceCheckUtils]: 172: Hoare triple {136334#(<= ~counter~0 20)} ~cond := #in~cond; {136334#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:59,420 INFO L290 TraceCheckUtils]: 173: Hoare triple {136334#(<= ~counter~0 20)} assume !(0 == ~cond); {136334#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:59,420 INFO L290 TraceCheckUtils]: 174: Hoare triple {136334#(<= ~counter~0 20)} assume true; {136334#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:59,420 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {136334#(<= ~counter~0 20)} {136334#(<= ~counter~0 20)} #96#return; {136334#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:59,421 INFO L290 TraceCheckUtils]: 176: Hoare triple {136334#(<= ~counter~0 20)} assume !(~r~0 > 0); {136334#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:59,421 INFO L290 TraceCheckUtils]: 177: Hoare triple {136334#(<= ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136359#(<= ~counter~0 21)} is VALID [2022-04-07 14:04:59,422 INFO L290 TraceCheckUtils]: 178: Hoare triple {136359#(<= ~counter~0 21)} assume !!(#t~post8 < 50);havoc #t~post8; {136359#(<= ~counter~0 21)} is VALID [2022-04-07 14:04:59,422 INFO L272 TraceCheckUtils]: 179: Hoare triple {136359#(<= ~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)); {136359#(<= ~counter~0 21)} is VALID [2022-04-07 14:04:59,422 INFO L290 TraceCheckUtils]: 180: Hoare triple {136359#(<= ~counter~0 21)} ~cond := #in~cond; {136359#(<= ~counter~0 21)} is VALID [2022-04-07 14:04:59,423 INFO L290 TraceCheckUtils]: 181: Hoare triple {136359#(<= ~counter~0 21)} assume !(0 == ~cond); {136359#(<= ~counter~0 21)} is VALID [2022-04-07 14:04:59,423 INFO L290 TraceCheckUtils]: 182: Hoare triple {136359#(<= ~counter~0 21)} assume true; {136359#(<= ~counter~0 21)} is VALID [2022-04-07 14:04:59,423 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {136359#(<= ~counter~0 21)} {136359#(<= ~counter~0 21)} #98#return; {136359#(<= ~counter~0 21)} is VALID [2022-04-07 14:04:59,423 INFO L290 TraceCheckUtils]: 184: Hoare triple {136359#(<= ~counter~0 21)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136359#(<= ~counter~0 21)} is VALID [2022-04-07 14:04:59,424 INFO L290 TraceCheckUtils]: 185: Hoare triple {136359#(<= ~counter~0 21)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136384#(<= |main_#t~post8| 21)} is VALID [2022-04-07 14:04:59,424 INFO L290 TraceCheckUtils]: 186: Hoare triple {136384#(<= |main_#t~post8| 21)} assume !(#t~post8 < 50);havoc #t~post8; {135803#false} is VALID [2022-04-07 14:04:59,424 INFO L290 TraceCheckUtils]: 187: Hoare triple {135803#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {135803#false} is VALID [2022-04-07 14:04:59,424 INFO L290 TraceCheckUtils]: 188: Hoare triple {135803#false} assume !(#t~post6 < 50);havoc #t~post6; {135803#false} is VALID [2022-04-07 14:04:59,424 INFO L272 TraceCheckUtils]: 189: Hoare triple {135803#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {135803#false} is VALID [2022-04-07 14:04:59,424 INFO L290 TraceCheckUtils]: 190: Hoare triple {135803#false} ~cond := #in~cond; {135803#false} is VALID [2022-04-07 14:04:59,424 INFO L290 TraceCheckUtils]: 191: Hoare triple {135803#false} assume 0 == ~cond; {135803#false} is VALID [2022-04-07 14:04:59,424 INFO L290 TraceCheckUtils]: 192: Hoare triple {135803#false} assume !false; {135803#false} is VALID [2022-04-07 14:04:59,425 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-07 14:04:59,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:05:00,876 INFO L290 TraceCheckUtils]: 192: Hoare triple {135803#false} assume !false; {135803#false} is VALID [2022-04-07 14:05:00,876 INFO L290 TraceCheckUtils]: 191: Hoare triple {135803#false} assume 0 == ~cond; {135803#false} is VALID [2022-04-07 14:05:00,876 INFO L290 TraceCheckUtils]: 190: Hoare triple {135803#false} ~cond := #in~cond; {135803#false} is VALID [2022-04-07 14:05:00,876 INFO L272 TraceCheckUtils]: 189: Hoare triple {135803#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {135803#false} is VALID [2022-04-07 14:05:00,876 INFO L290 TraceCheckUtils]: 188: Hoare triple {135803#false} assume !(#t~post6 < 50);havoc #t~post6; {135803#false} is VALID [2022-04-07 14:05:00,876 INFO L290 TraceCheckUtils]: 187: Hoare triple {135803#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {135803#false} is VALID [2022-04-07 14:05:00,877 INFO L290 TraceCheckUtils]: 186: Hoare triple {136424#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {135803#false} is VALID [2022-04-07 14:05:00,877 INFO L290 TraceCheckUtils]: 185: Hoare triple {136428#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136424#(< |main_#t~post8| 50)} is VALID [2022-04-07 14:05:00,877 INFO L290 TraceCheckUtils]: 184: Hoare triple {136428#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136428#(< ~counter~0 50)} is VALID [2022-04-07 14:05:00,878 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {135802#true} {136428#(< ~counter~0 50)} #98#return; {136428#(< ~counter~0 50)} is VALID [2022-04-07 14:05:00,878 INFO L290 TraceCheckUtils]: 182: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,878 INFO L290 TraceCheckUtils]: 181: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,878 INFO L290 TraceCheckUtils]: 180: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,878 INFO L272 TraceCheckUtils]: 179: Hoare triple {136428#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,878 INFO L290 TraceCheckUtils]: 178: Hoare triple {136428#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {136428#(< ~counter~0 50)} is VALID [2022-04-07 14:05:00,880 INFO L290 TraceCheckUtils]: 177: Hoare triple {136453#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136428#(< ~counter~0 50)} is VALID [2022-04-07 14:05:00,880 INFO L290 TraceCheckUtils]: 176: Hoare triple {136453#(< ~counter~0 49)} assume !(~r~0 > 0); {136453#(< ~counter~0 49)} is VALID [2022-04-07 14:05:00,881 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {135802#true} {136453#(< ~counter~0 49)} #96#return; {136453#(< ~counter~0 49)} is VALID [2022-04-07 14:05:00,881 INFO L290 TraceCheckUtils]: 174: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,881 INFO L290 TraceCheckUtils]: 173: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,881 INFO L290 TraceCheckUtils]: 172: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,881 INFO L272 TraceCheckUtils]: 171: Hoare triple {136453#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,881 INFO L290 TraceCheckUtils]: 170: Hoare triple {136453#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {136453#(< ~counter~0 49)} is VALID [2022-04-07 14:05:00,882 INFO L290 TraceCheckUtils]: 169: Hoare triple {136478#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136453#(< ~counter~0 49)} is VALID [2022-04-07 14:05:00,882 INFO L290 TraceCheckUtils]: 168: Hoare triple {136478#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136478#(< ~counter~0 48)} is VALID [2022-04-07 14:05:00,882 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {135802#true} {136478#(< ~counter~0 48)} #96#return; {136478#(< ~counter~0 48)} is VALID [2022-04-07 14:05:00,882 INFO L290 TraceCheckUtils]: 166: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,883 INFO L290 TraceCheckUtils]: 165: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,883 INFO L290 TraceCheckUtils]: 164: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,883 INFO L272 TraceCheckUtils]: 163: Hoare triple {136478#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,883 INFO L290 TraceCheckUtils]: 162: Hoare triple {136478#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {136478#(< ~counter~0 48)} is VALID [2022-04-07 14:05:00,884 INFO L290 TraceCheckUtils]: 161: Hoare triple {136503#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136478#(< ~counter~0 48)} is VALID [2022-04-07 14:05:00,884 INFO L290 TraceCheckUtils]: 160: Hoare triple {136503#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136503#(< ~counter~0 47)} is VALID [2022-04-07 14:05:00,884 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {135802#true} {136503#(< ~counter~0 47)} #96#return; {136503#(< ~counter~0 47)} is VALID [2022-04-07 14:05:00,884 INFO L290 TraceCheckUtils]: 158: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,884 INFO L290 TraceCheckUtils]: 157: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,885 INFO L290 TraceCheckUtils]: 156: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,885 INFO L272 TraceCheckUtils]: 155: Hoare triple {136503#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,885 INFO L290 TraceCheckUtils]: 154: Hoare triple {136503#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {136503#(< ~counter~0 47)} is VALID [2022-04-07 14:05:00,886 INFO L290 TraceCheckUtils]: 153: Hoare triple {136528#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136503#(< ~counter~0 47)} is VALID [2022-04-07 14:05:00,886 INFO L290 TraceCheckUtils]: 152: Hoare triple {136528#(< ~counter~0 46)} assume !!(0 != ~r~0); {136528#(< ~counter~0 46)} is VALID [2022-04-07 14:05:00,886 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {135802#true} {136528#(< ~counter~0 46)} #94#return; {136528#(< ~counter~0 46)} is VALID [2022-04-07 14:05:00,886 INFO L290 TraceCheckUtils]: 150: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,886 INFO L290 TraceCheckUtils]: 149: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,886 INFO L290 TraceCheckUtils]: 148: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,886 INFO L272 TraceCheckUtils]: 147: Hoare triple {136528#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,887 INFO L290 TraceCheckUtils]: 146: Hoare triple {136528#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {136528#(< ~counter~0 46)} is VALID [2022-04-07 14:05:00,887 INFO L290 TraceCheckUtils]: 145: Hoare triple {136553#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {136528#(< ~counter~0 46)} is VALID [2022-04-07 14:05:00,888 INFO L290 TraceCheckUtils]: 144: Hoare triple {136553#(< ~counter~0 45)} assume !(~r~0 < 0); {136553#(< ~counter~0 45)} is VALID [2022-04-07 14:05:00,888 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {135802#true} {136553#(< ~counter~0 45)} #98#return; {136553#(< ~counter~0 45)} is VALID [2022-04-07 14:05:00,888 INFO L290 TraceCheckUtils]: 142: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,888 INFO L290 TraceCheckUtils]: 141: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,888 INFO L290 TraceCheckUtils]: 140: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,888 INFO L272 TraceCheckUtils]: 139: Hoare triple {136553#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,889 INFO L290 TraceCheckUtils]: 138: Hoare triple {136553#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {136553#(< ~counter~0 45)} is VALID [2022-04-07 14:05:00,889 INFO L290 TraceCheckUtils]: 137: Hoare triple {136578#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136553#(< ~counter~0 45)} is VALID [2022-04-07 14:05:00,890 INFO L290 TraceCheckUtils]: 136: Hoare triple {136578#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136578#(< ~counter~0 44)} is VALID [2022-04-07 14:05:00,890 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {135802#true} {136578#(< ~counter~0 44)} #98#return; {136578#(< ~counter~0 44)} is VALID [2022-04-07 14:05:00,890 INFO L290 TraceCheckUtils]: 134: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,890 INFO L290 TraceCheckUtils]: 133: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,890 INFO L290 TraceCheckUtils]: 132: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,890 INFO L272 TraceCheckUtils]: 131: Hoare triple {136578#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,890 INFO L290 TraceCheckUtils]: 130: Hoare triple {136578#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {136578#(< ~counter~0 44)} is VALID [2022-04-07 14:05:00,891 INFO L290 TraceCheckUtils]: 129: Hoare triple {136603#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136578#(< ~counter~0 44)} is VALID [2022-04-07 14:05:00,891 INFO L290 TraceCheckUtils]: 128: Hoare triple {136603#(< ~counter~0 43)} assume !(~r~0 > 0); {136603#(< ~counter~0 43)} is VALID [2022-04-07 14:05:00,892 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {135802#true} {136603#(< ~counter~0 43)} #96#return; {136603#(< ~counter~0 43)} is VALID [2022-04-07 14:05:00,892 INFO L290 TraceCheckUtils]: 126: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,892 INFO L290 TraceCheckUtils]: 125: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,892 INFO L290 TraceCheckUtils]: 124: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,892 INFO L272 TraceCheckUtils]: 123: Hoare triple {136603#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,892 INFO L290 TraceCheckUtils]: 122: Hoare triple {136603#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {136603#(< ~counter~0 43)} is VALID [2022-04-07 14:05:00,893 INFO L290 TraceCheckUtils]: 121: Hoare triple {136628#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136603#(< ~counter~0 43)} is VALID [2022-04-07 14:05:00,893 INFO L290 TraceCheckUtils]: 120: Hoare triple {136628#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136628#(< ~counter~0 42)} is VALID [2022-04-07 14:05:00,894 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {135802#true} {136628#(< ~counter~0 42)} #96#return; {136628#(< ~counter~0 42)} is VALID [2022-04-07 14:05:00,894 INFO L290 TraceCheckUtils]: 118: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,894 INFO L290 TraceCheckUtils]: 117: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,894 INFO L290 TraceCheckUtils]: 116: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,894 INFO L272 TraceCheckUtils]: 115: Hoare triple {136628#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,894 INFO L290 TraceCheckUtils]: 114: Hoare triple {136628#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {136628#(< ~counter~0 42)} is VALID [2022-04-07 14:05:00,895 INFO L290 TraceCheckUtils]: 113: Hoare triple {136653#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136628#(< ~counter~0 42)} is VALID [2022-04-07 14:05:00,895 INFO L290 TraceCheckUtils]: 112: Hoare triple {136653#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136653#(< ~counter~0 41)} is VALID [2022-04-07 14:05:00,896 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {135802#true} {136653#(< ~counter~0 41)} #96#return; {136653#(< ~counter~0 41)} is VALID [2022-04-07 14:05:00,896 INFO L290 TraceCheckUtils]: 110: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,896 INFO L290 TraceCheckUtils]: 109: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,896 INFO L290 TraceCheckUtils]: 108: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,896 INFO L272 TraceCheckUtils]: 107: Hoare triple {136653#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,896 INFO L290 TraceCheckUtils]: 106: Hoare triple {136653#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {136653#(< ~counter~0 41)} is VALID [2022-04-07 14:05:00,897 INFO L290 TraceCheckUtils]: 105: Hoare triple {136678#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136653#(< ~counter~0 41)} is VALID [2022-04-07 14:05:00,897 INFO L290 TraceCheckUtils]: 104: Hoare triple {136678#(< ~counter~0 40)} assume !!(0 != ~r~0); {136678#(< ~counter~0 40)} is VALID [2022-04-07 14:05:00,898 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {135802#true} {136678#(< ~counter~0 40)} #94#return; {136678#(< ~counter~0 40)} is VALID [2022-04-07 14:05:00,898 INFO L290 TraceCheckUtils]: 102: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,898 INFO L290 TraceCheckUtils]: 101: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,898 INFO L290 TraceCheckUtils]: 100: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,898 INFO L272 TraceCheckUtils]: 99: Hoare triple {136678#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,898 INFO L290 TraceCheckUtils]: 98: Hoare triple {136678#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {136678#(< ~counter~0 40)} is VALID [2022-04-07 14:05:00,899 INFO L290 TraceCheckUtils]: 97: Hoare triple {136703#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {136678#(< ~counter~0 40)} is VALID [2022-04-07 14:05:00,899 INFO L290 TraceCheckUtils]: 96: Hoare triple {136703#(< ~counter~0 39)} assume !(~r~0 < 0); {136703#(< ~counter~0 39)} is VALID [2022-04-07 14:05:00,904 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {135802#true} {136703#(< ~counter~0 39)} #98#return; {136703#(< ~counter~0 39)} is VALID [2022-04-07 14:05:00,904 INFO L290 TraceCheckUtils]: 94: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,904 INFO L290 TraceCheckUtils]: 93: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,904 INFO L290 TraceCheckUtils]: 92: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,905 INFO L272 TraceCheckUtils]: 91: Hoare triple {136703#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,905 INFO L290 TraceCheckUtils]: 90: Hoare triple {136703#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {136703#(< ~counter~0 39)} is VALID [2022-04-07 14:05:00,906 INFO L290 TraceCheckUtils]: 89: Hoare triple {136728#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136703#(< ~counter~0 39)} is VALID [2022-04-07 14:05:00,907 INFO L290 TraceCheckUtils]: 88: Hoare triple {136728#(< ~counter~0 38)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136728#(< ~counter~0 38)} is VALID [2022-04-07 14:05:00,907 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {135802#true} {136728#(< ~counter~0 38)} #98#return; {136728#(< ~counter~0 38)} is VALID [2022-04-07 14:05:00,907 INFO L290 TraceCheckUtils]: 86: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,907 INFO L290 TraceCheckUtils]: 85: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,907 INFO L290 TraceCheckUtils]: 84: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,908 INFO L272 TraceCheckUtils]: 83: Hoare triple {136728#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,908 INFO L290 TraceCheckUtils]: 82: Hoare triple {136728#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {136728#(< ~counter~0 38)} is VALID [2022-04-07 14:05:00,909 INFO L290 TraceCheckUtils]: 81: Hoare triple {136753#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136728#(< ~counter~0 38)} is VALID [2022-04-07 14:05:00,909 INFO L290 TraceCheckUtils]: 80: Hoare triple {136753#(< ~counter~0 37)} assume !(~r~0 > 0); {136753#(< ~counter~0 37)} is VALID [2022-04-07 14:05:00,910 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {135802#true} {136753#(< ~counter~0 37)} #96#return; {136753#(< ~counter~0 37)} is VALID [2022-04-07 14:05:00,910 INFO L290 TraceCheckUtils]: 78: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,910 INFO L290 TraceCheckUtils]: 77: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,910 INFO L290 TraceCheckUtils]: 76: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,910 INFO L272 TraceCheckUtils]: 75: Hoare triple {136753#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,911 INFO L290 TraceCheckUtils]: 74: Hoare triple {136753#(< ~counter~0 37)} assume !!(#t~post7 < 50);havoc #t~post7; {136753#(< ~counter~0 37)} is VALID [2022-04-07 14:05:00,912 INFO L290 TraceCheckUtils]: 73: Hoare triple {136778#(< ~counter~0 36)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136753#(< ~counter~0 37)} is VALID [2022-04-07 14:05:00,912 INFO L290 TraceCheckUtils]: 72: Hoare triple {136778#(< ~counter~0 36)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136778#(< ~counter~0 36)} is VALID [2022-04-07 14:05:00,913 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {135802#true} {136778#(< ~counter~0 36)} #96#return; {136778#(< ~counter~0 36)} is VALID [2022-04-07 14:05:00,913 INFO L290 TraceCheckUtils]: 70: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,913 INFO L290 TraceCheckUtils]: 69: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,913 INFO L290 TraceCheckUtils]: 68: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,913 INFO L272 TraceCheckUtils]: 67: Hoare triple {136778#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,913 INFO L290 TraceCheckUtils]: 66: Hoare triple {136778#(< ~counter~0 36)} assume !!(#t~post7 < 50);havoc #t~post7; {136778#(< ~counter~0 36)} is VALID [2022-04-07 14:05:00,914 INFO L290 TraceCheckUtils]: 65: Hoare triple {136803#(< ~counter~0 35)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136778#(< ~counter~0 36)} is VALID [2022-04-07 14:05:00,915 INFO L290 TraceCheckUtils]: 64: Hoare triple {136803#(< ~counter~0 35)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {136803#(< ~counter~0 35)} is VALID [2022-04-07 14:05:00,915 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {135802#true} {136803#(< ~counter~0 35)} #96#return; {136803#(< ~counter~0 35)} is VALID [2022-04-07 14:05:00,915 INFO L290 TraceCheckUtils]: 62: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,915 INFO L290 TraceCheckUtils]: 61: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,915 INFO L290 TraceCheckUtils]: 60: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,916 INFO L272 TraceCheckUtils]: 59: Hoare triple {136803#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {136803#(< ~counter~0 35)} assume !!(#t~post7 < 50);havoc #t~post7; {136803#(< ~counter~0 35)} is VALID [2022-04-07 14:05:00,917 INFO L290 TraceCheckUtils]: 57: Hoare triple {136828#(< ~counter~0 34)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136803#(< ~counter~0 35)} is VALID [2022-04-07 14:05:00,917 INFO L290 TraceCheckUtils]: 56: Hoare triple {136828#(< ~counter~0 34)} assume !!(0 != ~r~0); {136828#(< ~counter~0 34)} is VALID [2022-04-07 14:05:00,918 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {135802#true} {136828#(< ~counter~0 34)} #94#return; {136828#(< ~counter~0 34)} is VALID [2022-04-07 14:05:00,918 INFO L290 TraceCheckUtils]: 54: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,918 INFO L290 TraceCheckUtils]: 53: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,918 INFO L272 TraceCheckUtils]: 51: Hoare triple {136828#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {136828#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {136828#(< ~counter~0 34)} is VALID [2022-04-07 14:05:00,919 INFO L290 TraceCheckUtils]: 49: Hoare triple {136853#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {136828#(< ~counter~0 34)} is VALID [2022-04-07 14:05:00,920 INFO L290 TraceCheckUtils]: 48: Hoare triple {136853#(< ~counter~0 33)} assume !(~r~0 < 0); {136853#(< ~counter~0 33)} is VALID [2022-04-07 14:05:00,920 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {135802#true} {136853#(< ~counter~0 33)} #98#return; {136853#(< ~counter~0 33)} is VALID [2022-04-07 14:05:00,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,921 INFO L272 TraceCheckUtils]: 43: Hoare triple {136853#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {136853#(< ~counter~0 33)} assume !!(#t~post8 < 50);havoc #t~post8; {136853#(< ~counter~0 33)} is VALID [2022-04-07 14:05:00,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {136878#(< ~counter~0 32)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136853#(< ~counter~0 33)} is VALID [2022-04-07 14:05:00,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {136878#(< ~counter~0 32)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {136878#(< ~counter~0 32)} is VALID [2022-04-07 14:05:00,923 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {135802#true} {136878#(< ~counter~0 32)} #98#return; {136878#(< ~counter~0 32)} is VALID [2022-04-07 14:05:00,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,923 INFO L272 TraceCheckUtils]: 35: Hoare triple {136878#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {136878#(< ~counter~0 32)} assume !!(#t~post8 < 50);havoc #t~post8; {136878#(< ~counter~0 32)} is VALID [2022-04-07 14:05:00,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {136903#(< ~counter~0 31)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {136878#(< ~counter~0 32)} is VALID [2022-04-07 14:05:00,925 INFO L290 TraceCheckUtils]: 32: Hoare triple {136903#(< ~counter~0 31)} assume !(~r~0 > 0); {136903#(< ~counter~0 31)} is VALID [2022-04-07 14:05:00,926 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {135802#true} {136903#(< ~counter~0 31)} #96#return; {136903#(< ~counter~0 31)} is VALID [2022-04-07 14:05:00,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,926 INFO L272 TraceCheckUtils]: 27: Hoare triple {136903#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {136903#(< ~counter~0 31)} assume !!(#t~post7 < 50);havoc #t~post7; {136903#(< ~counter~0 31)} is VALID [2022-04-07 14:05:00,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {136928#(< ~counter~0 30)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {136903#(< ~counter~0 31)} is VALID [2022-04-07 14:05:00,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {136928#(< ~counter~0 30)} assume !!(0 != ~r~0); {136928#(< ~counter~0 30)} is VALID [2022-04-07 14:05:00,928 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {135802#true} {136928#(< ~counter~0 30)} #94#return; {136928#(< ~counter~0 30)} is VALID [2022-04-07 14:05:00,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,929 INFO L272 TraceCheckUtils]: 19: Hoare triple {136928#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {136928#(< ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {136928#(< ~counter~0 30)} is VALID [2022-04-07 14:05:00,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {136953#(< ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {136928#(< ~counter~0 30)} is VALID [2022-04-07 14:05:00,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {136953#(< ~counter~0 29)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {136953#(< ~counter~0 29)} is VALID [2022-04-07 14:05:00,931 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {135802#true} {136953#(< ~counter~0 29)} #92#return; {136953#(< ~counter~0 29)} is VALID [2022-04-07 14:05:00,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,931 INFO L272 TraceCheckUtils]: 11: Hoare triple {136953#(< ~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)); {135802#true} is VALID [2022-04-07 14:05:00,932 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {135802#true} {136953#(< ~counter~0 29)} #90#return; {136953#(< ~counter~0 29)} is VALID [2022-04-07 14:05:00,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {135802#true} assume true; {135802#true} is VALID [2022-04-07 14:05:00,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {135802#true} assume !(0 == ~cond); {135802#true} is VALID [2022-04-07 14:05:00,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {135802#true} ~cond := #in~cond; {135802#true} is VALID [2022-04-07 14:05:00,932 INFO L272 TraceCheckUtils]: 6: Hoare triple {136953#(< ~counter~0 29)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {135802#true} is VALID [2022-04-07 14:05:00,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {136953#(< ~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; {136953#(< ~counter~0 29)} is VALID [2022-04-07 14:05:00,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {136953#(< ~counter~0 29)} call #t~ret9 := main(); {136953#(< ~counter~0 29)} is VALID [2022-04-07 14:05:00,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136953#(< ~counter~0 29)} {135802#true} #102#return; {136953#(< ~counter~0 29)} is VALID [2022-04-07 14:05:00,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {136953#(< ~counter~0 29)} assume true; {136953#(< ~counter~0 29)} is VALID [2022-04-07 14:05:00,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {135802#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {136953#(< ~counter~0 29)} is VALID [2022-04-07 14:05:00,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {135802#true} call ULTIMATE.init(); {135802#true} is VALID [2022-04-07 14:05:00,935 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-07 14:05:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:05:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702383520] [2022-04-07 14:05:00,935 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:05:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933369698] [2022-04-07 14:05:00,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933369698] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:05:00,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:05:00,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2022-04-07 14:05:00,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033233610] [2022-04-07 14:05:00,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:05:00,938 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-07 14:05:00,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:05:00,938 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-07 14:05:01,202 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-07 14:05:01,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-07 14:05:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:05:01,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-07 14:05:01,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2022-04-07 14:05:01,203 INFO L87 Difference]: Start difference. First operand 10003 states and 14249 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-07 14:05:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:05:29,184 INFO L93 Difference]: Finished difference Result 15294 states and 21970 transitions. [2022-04-07 14:05:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-04-07 14:05:29,184 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-07 14:05:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:05:29,184 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-07 14:05:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1004 transitions. [2022-04-07 14:05:29,192 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-07 14:05:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1004 transitions. [2022-04-07 14:05:29,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 1004 transitions. [2022-04-07 14:05:30,057 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-07 14:05:32,480 INFO L225 Difference]: With dead ends: 15294 [2022-04-07 14:05:32,480 INFO L226 Difference]: Without dead ends: 7867 [2022-04-07 14:05:32,498 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2864, Invalid=4968, Unknown=0, NotChecked=0, Total=7832 [2022-04-07 14:05:32,498 INFO L913 BasicCegarLoop]: 159 mSDtfsCounter, 1682 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 982 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 982 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-07 14:05:32,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1682 Valid, 850 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [982 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-07 14:05:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7867 states. [2022-04-07 14:05:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7867 to 7640. [2022-04-07 14:05:44,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:05:44,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7867 states. Second operand has 7640 states, 5728 states have (on average 1.1784217877094971) internal successors, (6750), 5772 states have internal predecessors, (6750), 1825 states have call successors, (1825), 88 states have call predecessors, (1825), 86 states have return successors, (1823), 1779 states have call predecessors, (1823), 1823 states have call successors, (1823) [2022-04-07 14:05:44,945 INFO L74 IsIncluded]: Start isIncluded. First operand 7867 states. Second operand has 7640 states, 5728 states have (on average 1.1784217877094971) internal successors, (6750), 5772 states have internal predecessors, (6750), 1825 states have call successors, (1825), 88 states have call predecessors, (1825), 86 states have return successors, (1823), 1779 states have call predecessors, (1823), 1823 states have call successors, (1823) [2022-04-07 14:05:44,950 INFO L87 Difference]: Start difference. First operand 7867 states. Second operand has 7640 states, 5728 states have (on average 1.1784217877094971) internal successors, (6750), 5772 states have internal predecessors, (6750), 1825 states have call successors, (1825), 88 states have call predecessors, (1825), 86 states have return successors, (1823), 1779 states have call predecessors, (1823), 1823 states have call successors, (1823) [2022-04-07 14:05:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:05:46,485 INFO L93 Difference]: Finished difference Result 7867 states and 10604 transitions. [2022-04-07 14:05:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 10604 transitions. [2022-04-07 14:05:46,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:05:46,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:05:46,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 7640 states, 5728 states have (on average 1.1784217877094971) internal successors, (6750), 5772 states have internal predecessors, (6750), 1825 states have call successors, (1825), 88 states have call predecessors, (1825), 86 states have return successors, (1823), 1779 states have call predecessors, (1823), 1823 states have call successors, (1823) Second operand 7867 states. [2022-04-07 14:05:46,515 INFO L87 Difference]: Start difference. First operand has 7640 states, 5728 states have (on average 1.1784217877094971) internal successors, (6750), 5772 states have internal predecessors, (6750), 1825 states have call successors, (1825), 88 states have call predecessors, (1825), 86 states have return successors, (1823), 1779 states have call predecessors, (1823), 1823 states have call successors, (1823) Second operand 7867 states. [2022-04-07 14:05:48,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:05:48,339 INFO L93 Difference]: Finished difference Result 7867 states and 10604 transitions. [2022-04-07 14:05:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 10604 transitions. [2022-04-07 14:05:48,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:05:48,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:05:48,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:05:48,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:05:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7640 states, 5728 states have (on average 1.1784217877094971) internal successors, (6750), 5772 states have internal predecessors, (6750), 1825 states have call successors, (1825), 88 states have call predecessors, (1825), 86 states have return successors, (1823), 1779 states have call predecessors, (1823), 1823 states have call successors, (1823) [2022-04-07 14:05:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7640 states to 7640 states and 10398 transitions. [2022-04-07 14:05:50,524 INFO L78 Accepts]: Start accepts. Automaton has 7640 states and 10398 transitions. Word has length 193 [2022-04-07 14:05:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:05:50,524 INFO L478 AbstractCegarLoop]: Abstraction has 7640 states and 10398 transitions. [2022-04-07 14:05:50,525 INFO L479 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-07 14:05:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 7640 states and 10398 transitions. [2022-04-07 14:05:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-04-07 14:05:50,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:05:50,530 INFO L499 BasicCegarLoop]: 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-07 14:05:50,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-07 14:05:50,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:05:50,731 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:05:50,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:05:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1172412185, now seen corresponding path program 2 times [2022-04-07 14:05:50,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:05:50,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662331489] [2022-04-07 14:05:50,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:05:50,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:05:50,749 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:05:50,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339445185] [2022-04-07 14:05:50,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:05:50,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:05:50,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:05:50,750 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-07 14:05:50,751 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-07 14:05:50,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:05:50,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:05:50,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-07 14:05:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:05:50,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:05:51,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {185034#true} call ULTIMATE.init(); {185034#true} is VALID [2022-04-07 14:05:51,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {185034#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {185042#(<= ~counter~0 0)} assume true; {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185042#(<= ~counter~0 0)} {185034#true} #102#return; {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {185042#(<= ~counter~0 0)} call #t~ret9 := main(); {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {185042#(<= ~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; {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,988 INFO L272 TraceCheckUtils]: 6: Hoare triple {185042#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {185042#(<= ~counter~0 0)} ~cond := #in~cond; {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {185042#(<= ~counter~0 0)} assume !(0 == ~cond); {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {185042#(<= ~counter~0 0)} assume true; {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,989 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {185042#(<= ~counter~0 0)} {185042#(<= ~counter~0 0)} #90#return; {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,989 INFO L272 TraceCheckUtils]: 11: Hoare triple {185042#(<= ~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)); {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {185042#(<= ~counter~0 0)} ~cond := #in~cond; {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {185042#(<= ~counter~0 0)} assume !(0 == ~cond); {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {185042#(<= ~counter~0 0)} assume true; {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,990 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {185042#(<= ~counter~0 0)} {185042#(<= ~counter~0 0)} #92#return; {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {185042#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {185042#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:51,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {185042#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185091#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:51,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {185091#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {185091#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:51,993 INFO L272 TraceCheckUtils]: 19: Hoare triple {185091#(<= ~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)); {185091#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:51,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {185091#(<= ~counter~0 1)} ~cond := #in~cond; {185091#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:51,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {185091#(<= ~counter~0 1)} assume !(0 == ~cond); {185091#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:51,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {185091#(<= ~counter~0 1)} assume true; {185091#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:51,994 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {185091#(<= ~counter~0 1)} {185091#(<= ~counter~0 1)} #94#return; {185091#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:51,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {185091#(<= ~counter~0 1)} assume !!(0 != ~r~0); {185091#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:51,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {185091#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185116#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:51,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {185116#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {185116#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:51,996 INFO L272 TraceCheckUtils]: 27: Hoare triple {185116#(<= ~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)); {185116#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:51,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {185116#(<= ~counter~0 2)} ~cond := #in~cond; {185116#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:51,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {185116#(<= ~counter~0 2)} assume !(0 == ~cond); {185116#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:51,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {185116#(<= ~counter~0 2)} assume true; {185116#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:51,997 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {185116#(<= ~counter~0 2)} {185116#(<= ~counter~0 2)} #96#return; {185116#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:51,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {185116#(<= ~counter~0 2)} assume !(~r~0 > 0); {185116#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:51,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {185116#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185141#(<= ~counter~0 3)} is VALID [2022-04-07 14:05:51,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {185141#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {185141#(<= ~counter~0 3)} is VALID [2022-04-07 14:05:51,999 INFO L272 TraceCheckUtils]: 35: Hoare triple {185141#(<= ~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)); {185141#(<= ~counter~0 3)} is VALID [2022-04-07 14:05:51,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {185141#(<= ~counter~0 3)} ~cond := #in~cond; {185141#(<= ~counter~0 3)} is VALID [2022-04-07 14:05:51,999 INFO L290 TraceCheckUtils]: 37: Hoare triple {185141#(<= ~counter~0 3)} assume !(0 == ~cond); {185141#(<= ~counter~0 3)} is VALID [2022-04-07 14:05:52,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {185141#(<= ~counter~0 3)} assume true; {185141#(<= ~counter~0 3)} is VALID [2022-04-07 14:05:52,000 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {185141#(<= ~counter~0 3)} {185141#(<= ~counter~0 3)} #98#return; {185141#(<= ~counter~0 3)} is VALID [2022-04-07 14:05:52,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {185141#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185141#(<= ~counter~0 3)} is VALID [2022-04-07 14:05:52,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {185141#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185166#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:52,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {185166#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {185166#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:52,002 INFO L272 TraceCheckUtils]: 43: Hoare triple {185166#(<= ~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)); {185166#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:52,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {185166#(<= ~counter~0 4)} ~cond := #in~cond; {185166#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:52,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {185166#(<= ~counter~0 4)} assume !(0 == ~cond); {185166#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:52,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {185166#(<= ~counter~0 4)} assume true; {185166#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:52,003 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {185166#(<= ~counter~0 4)} {185166#(<= ~counter~0 4)} #98#return; {185166#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:52,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {185166#(<= ~counter~0 4)} assume !(~r~0 < 0); {185166#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:52,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {185166#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185191#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:52,004 INFO L290 TraceCheckUtils]: 50: Hoare triple {185191#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {185191#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:52,005 INFO L272 TraceCheckUtils]: 51: Hoare triple {185191#(<= ~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)); {185191#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:52,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {185191#(<= ~counter~0 5)} ~cond := #in~cond; {185191#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:52,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {185191#(<= ~counter~0 5)} assume !(0 == ~cond); {185191#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:52,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {185191#(<= ~counter~0 5)} assume true; {185191#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:52,006 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {185191#(<= ~counter~0 5)} {185191#(<= ~counter~0 5)} #94#return; {185191#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:52,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {185191#(<= ~counter~0 5)} assume !!(0 != ~r~0); {185191#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:52,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {185191#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185216#(<= ~counter~0 6)} is VALID [2022-04-07 14:05:52,007 INFO L290 TraceCheckUtils]: 58: Hoare triple {185216#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {185216#(<= ~counter~0 6)} is VALID [2022-04-07 14:05:52,008 INFO L272 TraceCheckUtils]: 59: Hoare triple {185216#(<= ~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)); {185216#(<= ~counter~0 6)} is VALID [2022-04-07 14:05:52,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {185216#(<= ~counter~0 6)} ~cond := #in~cond; {185216#(<= ~counter~0 6)} is VALID [2022-04-07 14:05:52,008 INFO L290 TraceCheckUtils]: 61: Hoare triple {185216#(<= ~counter~0 6)} assume !(0 == ~cond); {185216#(<= ~counter~0 6)} is VALID [2022-04-07 14:05:52,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {185216#(<= ~counter~0 6)} assume true; {185216#(<= ~counter~0 6)} is VALID [2022-04-07 14:05:52,009 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {185216#(<= ~counter~0 6)} {185216#(<= ~counter~0 6)} #96#return; {185216#(<= ~counter~0 6)} is VALID [2022-04-07 14:05:52,009 INFO L290 TraceCheckUtils]: 64: Hoare triple {185216#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185216#(<= ~counter~0 6)} is VALID [2022-04-07 14:05:52,010 INFO L290 TraceCheckUtils]: 65: Hoare triple {185216#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185241#(<= ~counter~0 7)} is VALID [2022-04-07 14:05:52,010 INFO L290 TraceCheckUtils]: 66: Hoare triple {185241#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {185241#(<= ~counter~0 7)} is VALID [2022-04-07 14:05:52,011 INFO L272 TraceCheckUtils]: 67: Hoare triple {185241#(<= ~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)); {185241#(<= ~counter~0 7)} is VALID [2022-04-07 14:05:52,011 INFO L290 TraceCheckUtils]: 68: Hoare triple {185241#(<= ~counter~0 7)} ~cond := #in~cond; {185241#(<= ~counter~0 7)} is VALID [2022-04-07 14:05:52,011 INFO L290 TraceCheckUtils]: 69: Hoare triple {185241#(<= ~counter~0 7)} assume !(0 == ~cond); {185241#(<= ~counter~0 7)} is VALID [2022-04-07 14:05:52,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {185241#(<= ~counter~0 7)} assume true; {185241#(<= ~counter~0 7)} is VALID [2022-04-07 14:05:52,012 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {185241#(<= ~counter~0 7)} {185241#(<= ~counter~0 7)} #96#return; {185241#(<= ~counter~0 7)} is VALID [2022-04-07 14:05:52,012 INFO L290 TraceCheckUtils]: 72: Hoare triple {185241#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185241#(<= ~counter~0 7)} is VALID [2022-04-07 14:05:52,013 INFO L290 TraceCheckUtils]: 73: Hoare triple {185241#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185266#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:52,013 INFO L290 TraceCheckUtils]: 74: Hoare triple {185266#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {185266#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:52,014 INFO L272 TraceCheckUtils]: 75: Hoare triple {185266#(<= ~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)); {185266#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:52,014 INFO L290 TraceCheckUtils]: 76: Hoare triple {185266#(<= ~counter~0 8)} ~cond := #in~cond; {185266#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:52,014 INFO L290 TraceCheckUtils]: 77: Hoare triple {185266#(<= ~counter~0 8)} assume !(0 == ~cond); {185266#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:52,015 INFO L290 TraceCheckUtils]: 78: Hoare triple {185266#(<= ~counter~0 8)} assume true; {185266#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:52,015 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {185266#(<= ~counter~0 8)} {185266#(<= ~counter~0 8)} #96#return; {185266#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:52,015 INFO L290 TraceCheckUtils]: 80: Hoare triple {185266#(<= ~counter~0 8)} assume !(~r~0 > 0); {185266#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:52,016 INFO L290 TraceCheckUtils]: 81: Hoare triple {185266#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185291#(<= ~counter~0 9)} is VALID [2022-04-07 14:05:52,016 INFO L290 TraceCheckUtils]: 82: Hoare triple {185291#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {185291#(<= ~counter~0 9)} is VALID [2022-04-07 14:05:52,017 INFO L272 TraceCheckUtils]: 83: Hoare triple {185291#(<= ~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)); {185291#(<= ~counter~0 9)} is VALID [2022-04-07 14:05:52,017 INFO L290 TraceCheckUtils]: 84: Hoare triple {185291#(<= ~counter~0 9)} ~cond := #in~cond; {185291#(<= ~counter~0 9)} is VALID [2022-04-07 14:05:52,017 INFO L290 TraceCheckUtils]: 85: Hoare triple {185291#(<= ~counter~0 9)} assume !(0 == ~cond); {185291#(<= ~counter~0 9)} is VALID [2022-04-07 14:05:52,018 INFO L290 TraceCheckUtils]: 86: Hoare triple {185291#(<= ~counter~0 9)} assume true; {185291#(<= ~counter~0 9)} is VALID [2022-04-07 14:05:52,018 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {185291#(<= ~counter~0 9)} {185291#(<= ~counter~0 9)} #98#return; {185291#(<= ~counter~0 9)} is VALID [2022-04-07 14:05:52,018 INFO L290 TraceCheckUtils]: 88: Hoare triple {185291#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185291#(<= ~counter~0 9)} is VALID [2022-04-07 14:05:52,019 INFO L290 TraceCheckUtils]: 89: Hoare triple {185291#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185316#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:52,019 INFO L290 TraceCheckUtils]: 90: Hoare triple {185316#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {185316#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:52,020 INFO L272 TraceCheckUtils]: 91: Hoare triple {185316#(<= ~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)); {185316#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:52,020 INFO L290 TraceCheckUtils]: 92: Hoare triple {185316#(<= ~counter~0 10)} ~cond := #in~cond; {185316#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:52,020 INFO L290 TraceCheckUtils]: 93: Hoare triple {185316#(<= ~counter~0 10)} assume !(0 == ~cond); {185316#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:52,021 INFO L290 TraceCheckUtils]: 94: Hoare triple {185316#(<= ~counter~0 10)} assume true; {185316#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:52,021 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {185316#(<= ~counter~0 10)} {185316#(<= ~counter~0 10)} #98#return; {185316#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:52,021 INFO L290 TraceCheckUtils]: 96: Hoare triple {185316#(<= ~counter~0 10)} assume !(~r~0 < 0); {185316#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:52,022 INFO L290 TraceCheckUtils]: 97: Hoare triple {185316#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185341#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:52,022 INFO L290 TraceCheckUtils]: 98: Hoare triple {185341#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {185341#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:52,023 INFO L272 TraceCheckUtils]: 99: Hoare triple {185341#(<= ~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)); {185341#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:52,023 INFO L290 TraceCheckUtils]: 100: Hoare triple {185341#(<= ~counter~0 11)} ~cond := #in~cond; {185341#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:52,023 INFO L290 TraceCheckUtils]: 101: Hoare triple {185341#(<= ~counter~0 11)} assume !(0 == ~cond); {185341#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:52,024 INFO L290 TraceCheckUtils]: 102: Hoare triple {185341#(<= ~counter~0 11)} assume true; {185341#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:52,024 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {185341#(<= ~counter~0 11)} {185341#(<= ~counter~0 11)} #94#return; {185341#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:52,024 INFO L290 TraceCheckUtils]: 104: Hoare triple {185341#(<= ~counter~0 11)} assume !!(0 != ~r~0); {185341#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:52,025 INFO L290 TraceCheckUtils]: 105: Hoare triple {185341#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185366#(<= ~counter~0 12)} is VALID [2022-04-07 14:05:52,025 INFO L290 TraceCheckUtils]: 106: Hoare triple {185366#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {185366#(<= ~counter~0 12)} is VALID [2022-04-07 14:05:52,026 INFO L272 TraceCheckUtils]: 107: Hoare triple {185366#(<= ~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)); {185366#(<= ~counter~0 12)} is VALID [2022-04-07 14:05:52,026 INFO L290 TraceCheckUtils]: 108: Hoare triple {185366#(<= ~counter~0 12)} ~cond := #in~cond; {185366#(<= ~counter~0 12)} is VALID [2022-04-07 14:05:52,026 INFO L290 TraceCheckUtils]: 109: Hoare triple {185366#(<= ~counter~0 12)} assume !(0 == ~cond); {185366#(<= ~counter~0 12)} is VALID [2022-04-07 14:05:52,027 INFO L290 TraceCheckUtils]: 110: Hoare triple {185366#(<= ~counter~0 12)} assume true; {185366#(<= ~counter~0 12)} is VALID [2022-04-07 14:05:52,027 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {185366#(<= ~counter~0 12)} {185366#(<= ~counter~0 12)} #96#return; {185366#(<= ~counter~0 12)} is VALID [2022-04-07 14:05:52,027 INFO L290 TraceCheckUtils]: 112: Hoare triple {185366#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185366#(<= ~counter~0 12)} is VALID [2022-04-07 14:05:52,028 INFO L290 TraceCheckUtils]: 113: Hoare triple {185366#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185391#(<= ~counter~0 13)} is VALID [2022-04-07 14:05:52,028 INFO L290 TraceCheckUtils]: 114: Hoare triple {185391#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {185391#(<= ~counter~0 13)} is VALID [2022-04-07 14:05:52,029 INFO L272 TraceCheckUtils]: 115: Hoare triple {185391#(<= ~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)); {185391#(<= ~counter~0 13)} is VALID [2022-04-07 14:05:52,029 INFO L290 TraceCheckUtils]: 116: Hoare triple {185391#(<= ~counter~0 13)} ~cond := #in~cond; {185391#(<= ~counter~0 13)} is VALID [2022-04-07 14:05:52,029 INFO L290 TraceCheckUtils]: 117: Hoare triple {185391#(<= ~counter~0 13)} assume !(0 == ~cond); {185391#(<= ~counter~0 13)} is VALID [2022-04-07 14:05:52,030 INFO L290 TraceCheckUtils]: 118: Hoare triple {185391#(<= ~counter~0 13)} assume true; {185391#(<= ~counter~0 13)} is VALID [2022-04-07 14:05:52,030 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {185391#(<= ~counter~0 13)} {185391#(<= ~counter~0 13)} #96#return; {185391#(<= ~counter~0 13)} is VALID [2022-04-07 14:05:52,030 INFO L290 TraceCheckUtils]: 120: Hoare triple {185391#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185391#(<= ~counter~0 13)} is VALID [2022-04-07 14:05:52,031 INFO L290 TraceCheckUtils]: 121: Hoare triple {185391#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185416#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:52,031 INFO L290 TraceCheckUtils]: 122: Hoare triple {185416#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {185416#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:52,032 INFO L272 TraceCheckUtils]: 123: Hoare triple {185416#(<= ~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)); {185416#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:52,032 INFO L290 TraceCheckUtils]: 124: Hoare triple {185416#(<= ~counter~0 14)} ~cond := #in~cond; {185416#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:52,032 INFO L290 TraceCheckUtils]: 125: Hoare triple {185416#(<= ~counter~0 14)} assume !(0 == ~cond); {185416#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:52,033 INFO L290 TraceCheckUtils]: 126: Hoare triple {185416#(<= ~counter~0 14)} assume true; {185416#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:52,033 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {185416#(<= ~counter~0 14)} {185416#(<= ~counter~0 14)} #96#return; {185416#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:52,033 INFO L290 TraceCheckUtils]: 128: Hoare triple {185416#(<= ~counter~0 14)} assume !(~r~0 > 0); {185416#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:52,034 INFO L290 TraceCheckUtils]: 129: Hoare triple {185416#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185441#(<= ~counter~0 15)} is VALID [2022-04-07 14:05:52,034 INFO L290 TraceCheckUtils]: 130: Hoare triple {185441#(<= ~counter~0 15)} assume !!(#t~post8 < 50);havoc #t~post8; {185441#(<= ~counter~0 15)} is VALID [2022-04-07 14:05:52,035 INFO L272 TraceCheckUtils]: 131: Hoare triple {185441#(<= ~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)); {185441#(<= ~counter~0 15)} is VALID [2022-04-07 14:05:52,035 INFO L290 TraceCheckUtils]: 132: Hoare triple {185441#(<= ~counter~0 15)} ~cond := #in~cond; {185441#(<= ~counter~0 15)} is VALID [2022-04-07 14:05:52,035 INFO L290 TraceCheckUtils]: 133: Hoare triple {185441#(<= ~counter~0 15)} assume !(0 == ~cond); {185441#(<= ~counter~0 15)} is VALID [2022-04-07 14:05:52,035 INFO L290 TraceCheckUtils]: 134: Hoare triple {185441#(<= ~counter~0 15)} assume true; {185441#(<= ~counter~0 15)} is VALID [2022-04-07 14:05:52,036 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {185441#(<= ~counter~0 15)} {185441#(<= ~counter~0 15)} #98#return; {185441#(<= ~counter~0 15)} is VALID [2022-04-07 14:05:52,036 INFO L290 TraceCheckUtils]: 136: Hoare triple {185441#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185441#(<= ~counter~0 15)} is VALID [2022-04-07 14:05:52,037 INFO L290 TraceCheckUtils]: 137: Hoare triple {185441#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185466#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:52,037 INFO L290 TraceCheckUtils]: 138: Hoare triple {185466#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {185466#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:52,038 INFO L272 TraceCheckUtils]: 139: Hoare triple {185466#(<= ~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)); {185466#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:52,038 INFO L290 TraceCheckUtils]: 140: Hoare triple {185466#(<= ~counter~0 16)} ~cond := #in~cond; {185466#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:52,038 INFO L290 TraceCheckUtils]: 141: Hoare triple {185466#(<= ~counter~0 16)} assume !(0 == ~cond); {185466#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:52,038 INFO L290 TraceCheckUtils]: 142: Hoare triple {185466#(<= ~counter~0 16)} assume true; {185466#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:52,039 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {185466#(<= ~counter~0 16)} {185466#(<= ~counter~0 16)} #98#return; {185466#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:52,039 INFO L290 TraceCheckUtils]: 144: Hoare triple {185466#(<= ~counter~0 16)} assume !(~r~0 < 0); {185466#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:52,040 INFO L290 TraceCheckUtils]: 145: Hoare triple {185466#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185491#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:52,040 INFO L290 TraceCheckUtils]: 146: Hoare triple {185491#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {185491#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:52,041 INFO L272 TraceCheckUtils]: 147: Hoare triple {185491#(<= ~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)); {185491#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:52,041 INFO L290 TraceCheckUtils]: 148: Hoare triple {185491#(<= ~counter~0 17)} ~cond := #in~cond; {185491#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:52,041 INFO L290 TraceCheckUtils]: 149: Hoare triple {185491#(<= ~counter~0 17)} assume !(0 == ~cond); {185491#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:52,041 INFO L290 TraceCheckUtils]: 150: Hoare triple {185491#(<= ~counter~0 17)} assume true; {185491#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:52,042 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {185491#(<= ~counter~0 17)} {185491#(<= ~counter~0 17)} #94#return; {185491#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:52,042 INFO L290 TraceCheckUtils]: 152: Hoare triple {185491#(<= ~counter~0 17)} assume !!(0 != ~r~0); {185491#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:52,043 INFO L290 TraceCheckUtils]: 153: Hoare triple {185491#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185516#(<= ~counter~0 18)} is VALID [2022-04-07 14:05:52,043 INFO L290 TraceCheckUtils]: 154: Hoare triple {185516#(<= ~counter~0 18)} assume !!(#t~post7 < 50);havoc #t~post7; {185516#(<= ~counter~0 18)} is VALID [2022-04-07 14:05:52,044 INFO L272 TraceCheckUtils]: 155: Hoare triple {185516#(<= ~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)); {185516#(<= ~counter~0 18)} is VALID [2022-04-07 14:05:52,044 INFO L290 TraceCheckUtils]: 156: Hoare triple {185516#(<= ~counter~0 18)} ~cond := #in~cond; {185516#(<= ~counter~0 18)} is VALID [2022-04-07 14:05:52,044 INFO L290 TraceCheckUtils]: 157: Hoare triple {185516#(<= ~counter~0 18)} assume !(0 == ~cond); {185516#(<= ~counter~0 18)} is VALID [2022-04-07 14:05:52,044 INFO L290 TraceCheckUtils]: 158: Hoare triple {185516#(<= ~counter~0 18)} assume true; {185516#(<= ~counter~0 18)} is VALID [2022-04-07 14:05:52,045 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {185516#(<= ~counter~0 18)} {185516#(<= ~counter~0 18)} #96#return; {185516#(<= ~counter~0 18)} is VALID [2022-04-07 14:05:52,045 INFO L290 TraceCheckUtils]: 160: Hoare triple {185516#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185516#(<= ~counter~0 18)} is VALID [2022-04-07 14:05:52,046 INFO L290 TraceCheckUtils]: 161: Hoare triple {185516#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185541#(<= ~counter~0 19)} is VALID [2022-04-07 14:05:52,046 INFO L290 TraceCheckUtils]: 162: Hoare triple {185541#(<= ~counter~0 19)} assume !!(#t~post7 < 50);havoc #t~post7; {185541#(<= ~counter~0 19)} is VALID [2022-04-07 14:05:52,047 INFO L272 TraceCheckUtils]: 163: Hoare triple {185541#(<= ~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)); {185541#(<= ~counter~0 19)} is VALID [2022-04-07 14:05:52,047 INFO L290 TraceCheckUtils]: 164: Hoare triple {185541#(<= ~counter~0 19)} ~cond := #in~cond; {185541#(<= ~counter~0 19)} is VALID [2022-04-07 14:05:52,047 INFO L290 TraceCheckUtils]: 165: Hoare triple {185541#(<= ~counter~0 19)} assume !(0 == ~cond); {185541#(<= ~counter~0 19)} is VALID [2022-04-07 14:05:52,047 INFO L290 TraceCheckUtils]: 166: Hoare triple {185541#(<= ~counter~0 19)} assume true; {185541#(<= ~counter~0 19)} is VALID [2022-04-07 14:05:52,048 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {185541#(<= ~counter~0 19)} {185541#(<= ~counter~0 19)} #96#return; {185541#(<= ~counter~0 19)} is VALID [2022-04-07 14:05:52,048 INFO L290 TraceCheckUtils]: 168: Hoare triple {185541#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185541#(<= ~counter~0 19)} is VALID [2022-04-07 14:05:52,049 INFO L290 TraceCheckUtils]: 169: Hoare triple {185541#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185566#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:52,049 INFO L290 TraceCheckUtils]: 170: Hoare triple {185566#(<= ~counter~0 20)} assume !!(#t~post7 < 50);havoc #t~post7; {185566#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:52,050 INFO L272 TraceCheckUtils]: 171: Hoare triple {185566#(<= ~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)); {185566#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:52,050 INFO L290 TraceCheckUtils]: 172: Hoare triple {185566#(<= ~counter~0 20)} ~cond := #in~cond; {185566#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:52,050 INFO L290 TraceCheckUtils]: 173: Hoare triple {185566#(<= ~counter~0 20)} assume !(0 == ~cond); {185566#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:52,050 INFO L290 TraceCheckUtils]: 174: Hoare triple {185566#(<= ~counter~0 20)} assume true; {185566#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:52,051 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {185566#(<= ~counter~0 20)} {185566#(<= ~counter~0 20)} #96#return; {185566#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:52,051 INFO L290 TraceCheckUtils]: 176: Hoare triple {185566#(<= ~counter~0 20)} assume !(~r~0 > 0); {185566#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:52,052 INFO L290 TraceCheckUtils]: 177: Hoare triple {185566#(<= ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185591#(<= ~counter~0 21)} is VALID [2022-04-07 14:05:52,052 INFO L290 TraceCheckUtils]: 178: Hoare triple {185591#(<= ~counter~0 21)} assume !!(#t~post8 < 50);havoc #t~post8; {185591#(<= ~counter~0 21)} is VALID [2022-04-07 14:05:52,053 INFO L272 TraceCheckUtils]: 179: Hoare triple {185591#(<= ~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)); {185591#(<= ~counter~0 21)} is VALID [2022-04-07 14:05:52,053 INFO L290 TraceCheckUtils]: 180: Hoare triple {185591#(<= ~counter~0 21)} ~cond := #in~cond; {185591#(<= ~counter~0 21)} is VALID [2022-04-07 14:05:52,053 INFO L290 TraceCheckUtils]: 181: Hoare triple {185591#(<= ~counter~0 21)} assume !(0 == ~cond); {185591#(<= ~counter~0 21)} is VALID [2022-04-07 14:05:52,053 INFO L290 TraceCheckUtils]: 182: Hoare triple {185591#(<= ~counter~0 21)} assume true; {185591#(<= ~counter~0 21)} is VALID [2022-04-07 14:05:52,054 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {185591#(<= ~counter~0 21)} {185591#(<= ~counter~0 21)} #98#return; {185591#(<= ~counter~0 21)} is VALID [2022-04-07 14:05:52,054 INFO L290 TraceCheckUtils]: 184: Hoare triple {185591#(<= ~counter~0 21)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185591#(<= ~counter~0 21)} is VALID [2022-04-07 14:05:52,055 INFO L290 TraceCheckUtils]: 185: Hoare triple {185591#(<= ~counter~0 21)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185616#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:52,055 INFO L290 TraceCheckUtils]: 186: Hoare triple {185616#(<= ~counter~0 22)} assume !!(#t~post8 < 50);havoc #t~post8; {185616#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:52,056 INFO L272 TraceCheckUtils]: 187: Hoare triple {185616#(<= ~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)); {185616#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:52,056 INFO L290 TraceCheckUtils]: 188: Hoare triple {185616#(<= ~counter~0 22)} ~cond := #in~cond; {185616#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:52,056 INFO L290 TraceCheckUtils]: 189: Hoare triple {185616#(<= ~counter~0 22)} assume !(0 == ~cond); {185616#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:52,056 INFO L290 TraceCheckUtils]: 190: Hoare triple {185616#(<= ~counter~0 22)} assume true; {185616#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:52,057 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {185616#(<= ~counter~0 22)} {185616#(<= ~counter~0 22)} #98#return; {185616#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:52,057 INFO L290 TraceCheckUtils]: 192: Hoare triple {185616#(<= ~counter~0 22)} assume !(~r~0 < 0); {185616#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:52,057 INFO L290 TraceCheckUtils]: 193: Hoare triple {185616#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185641#(<= |main_#t~post6| 22)} is VALID [2022-04-07 14:05:52,058 INFO L290 TraceCheckUtils]: 194: Hoare triple {185641#(<= |main_#t~post6| 22)} assume !(#t~post6 < 50);havoc #t~post6; {185035#false} is VALID [2022-04-07 14:05:52,058 INFO L272 TraceCheckUtils]: 195: Hoare triple {185035#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185035#false} is VALID [2022-04-07 14:05:52,058 INFO L290 TraceCheckUtils]: 196: Hoare triple {185035#false} ~cond := #in~cond; {185035#false} is VALID [2022-04-07 14:05:52,058 INFO L290 TraceCheckUtils]: 197: Hoare triple {185035#false} assume 0 == ~cond; {185035#false} is VALID [2022-04-07 14:05:52,058 INFO L290 TraceCheckUtils]: 198: Hoare triple {185035#false} assume !false; {185035#false} is VALID [2022-04-07 14:05:52,059 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-07 14:05:52,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:05:53,437 INFO L290 TraceCheckUtils]: 198: Hoare triple {185035#false} assume !false; {185035#false} is VALID [2022-04-07 14:05:53,438 INFO L290 TraceCheckUtils]: 197: Hoare triple {185035#false} assume 0 == ~cond; {185035#false} is VALID [2022-04-07 14:05:53,438 INFO L290 TraceCheckUtils]: 196: Hoare triple {185035#false} ~cond := #in~cond; {185035#false} is VALID [2022-04-07 14:05:53,438 INFO L272 TraceCheckUtils]: 195: Hoare triple {185035#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {185035#false} is VALID [2022-04-07 14:05:53,438 INFO L290 TraceCheckUtils]: 194: Hoare triple {185669#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {185035#false} is VALID [2022-04-07 14:05:53,439 INFO L290 TraceCheckUtils]: 193: Hoare triple {185673#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185669#(< |main_#t~post6| 50)} is VALID [2022-04-07 14:05:53,439 INFO L290 TraceCheckUtils]: 192: Hoare triple {185673#(< ~counter~0 50)} assume !(~r~0 < 0); {185673#(< ~counter~0 50)} is VALID [2022-04-07 14:05:53,439 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {185034#true} {185673#(< ~counter~0 50)} #98#return; {185673#(< ~counter~0 50)} is VALID [2022-04-07 14:05:53,439 INFO L290 TraceCheckUtils]: 190: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,440 INFO L290 TraceCheckUtils]: 189: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,440 INFO L290 TraceCheckUtils]: 188: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,440 INFO L272 TraceCheckUtils]: 187: Hoare triple {185673#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,440 INFO L290 TraceCheckUtils]: 186: Hoare triple {185673#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {185673#(< ~counter~0 50)} is VALID [2022-04-07 14:05:53,442 INFO L290 TraceCheckUtils]: 185: Hoare triple {185698#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185673#(< ~counter~0 50)} is VALID [2022-04-07 14:05:53,442 INFO L290 TraceCheckUtils]: 184: Hoare triple {185698#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185698#(< ~counter~0 49)} is VALID [2022-04-07 14:05:53,442 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {185034#true} {185698#(< ~counter~0 49)} #98#return; {185698#(< ~counter~0 49)} is VALID [2022-04-07 14:05:53,443 INFO L290 TraceCheckUtils]: 182: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,443 INFO L290 TraceCheckUtils]: 181: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,443 INFO L290 TraceCheckUtils]: 180: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,443 INFO L272 TraceCheckUtils]: 179: Hoare triple {185698#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,443 INFO L290 TraceCheckUtils]: 178: Hoare triple {185698#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {185698#(< ~counter~0 49)} is VALID [2022-04-07 14:05:53,444 INFO L290 TraceCheckUtils]: 177: Hoare triple {185723#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185698#(< ~counter~0 49)} is VALID [2022-04-07 14:05:53,444 INFO L290 TraceCheckUtils]: 176: Hoare triple {185723#(< ~counter~0 48)} assume !(~r~0 > 0); {185723#(< ~counter~0 48)} is VALID [2022-04-07 14:05:53,444 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {185034#true} {185723#(< ~counter~0 48)} #96#return; {185723#(< ~counter~0 48)} is VALID [2022-04-07 14:05:53,445 INFO L290 TraceCheckUtils]: 174: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,445 INFO L290 TraceCheckUtils]: 173: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,445 INFO L290 TraceCheckUtils]: 172: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,445 INFO L272 TraceCheckUtils]: 171: Hoare triple {185723#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,445 INFO L290 TraceCheckUtils]: 170: Hoare triple {185723#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {185723#(< ~counter~0 48)} is VALID [2022-04-07 14:05:53,446 INFO L290 TraceCheckUtils]: 169: Hoare triple {185748#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185723#(< ~counter~0 48)} is VALID [2022-04-07 14:05:53,446 INFO L290 TraceCheckUtils]: 168: Hoare triple {185748#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185748#(< ~counter~0 47)} is VALID [2022-04-07 14:05:53,446 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {185034#true} {185748#(< ~counter~0 47)} #96#return; {185748#(< ~counter~0 47)} is VALID [2022-04-07 14:05:53,447 INFO L290 TraceCheckUtils]: 166: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,447 INFO L290 TraceCheckUtils]: 165: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,447 INFO L290 TraceCheckUtils]: 164: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,447 INFO L272 TraceCheckUtils]: 163: Hoare triple {185748#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,447 INFO L290 TraceCheckUtils]: 162: Hoare triple {185748#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {185748#(< ~counter~0 47)} is VALID [2022-04-07 14:05:53,448 INFO L290 TraceCheckUtils]: 161: Hoare triple {185773#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185748#(< ~counter~0 47)} is VALID [2022-04-07 14:05:53,448 INFO L290 TraceCheckUtils]: 160: Hoare triple {185773#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185773#(< ~counter~0 46)} is VALID [2022-04-07 14:05:53,448 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {185034#true} {185773#(< ~counter~0 46)} #96#return; {185773#(< ~counter~0 46)} is VALID [2022-04-07 14:05:53,449 INFO L290 TraceCheckUtils]: 158: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,449 INFO L290 TraceCheckUtils]: 157: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,449 INFO L290 TraceCheckUtils]: 156: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,449 INFO L272 TraceCheckUtils]: 155: Hoare triple {185773#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,449 INFO L290 TraceCheckUtils]: 154: Hoare triple {185773#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {185773#(< ~counter~0 46)} is VALID [2022-04-07 14:05:53,450 INFO L290 TraceCheckUtils]: 153: Hoare triple {185798#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185773#(< ~counter~0 46)} is VALID [2022-04-07 14:05:53,450 INFO L290 TraceCheckUtils]: 152: Hoare triple {185798#(< ~counter~0 45)} assume !!(0 != ~r~0); {185798#(< ~counter~0 45)} is VALID [2022-04-07 14:05:53,450 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {185034#true} {185798#(< ~counter~0 45)} #94#return; {185798#(< ~counter~0 45)} is VALID [2022-04-07 14:05:53,451 INFO L290 TraceCheckUtils]: 150: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,451 INFO L290 TraceCheckUtils]: 149: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,451 INFO L290 TraceCheckUtils]: 148: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,451 INFO L272 TraceCheckUtils]: 147: Hoare triple {185798#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,451 INFO L290 TraceCheckUtils]: 146: Hoare triple {185798#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {185798#(< ~counter~0 45)} is VALID [2022-04-07 14:05:53,452 INFO L290 TraceCheckUtils]: 145: Hoare triple {185823#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185798#(< ~counter~0 45)} is VALID [2022-04-07 14:05:53,452 INFO L290 TraceCheckUtils]: 144: Hoare triple {185823#(< ~counter~0 44)} assume !(~r~0 < 0); {185823#(< ~counter~0 44)} is VALID [2022-04-07 14:05:53,452 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {185034#true} {185823#(< ~counter~0 44)} #98#return; {185823#(< ~counter~0 44)} is VALID [2022-04-07 14:05:53,453 INFO L290 TraceCheckUtils]: 142: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,453 INFO L290 TraceCheckUtils]: 141: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,453 INFO L290 TraceCheckUtils]: 140: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,453 INFO L272 TraceCheckUtils]: 139: Hoare triple {185823#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,453 INFO L290 TraceCheckUtils]: 138: Hoare triple {185823#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {185823#(< ~counter~0 44)} is VALID [2022-04-07 14:05:53,454 INFO L290 TraceCheckUtils]: 137: Hoare triple {185848#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185823#(< ~counter~0 44)} is VALID [2022-04-07 14:05:53,454 INFO L290 TraceCheckUtils]: 136: Hoare triple {185848#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185848#(< ~counter~0 43)} is VALID [2022-04-07 14:05:53,454 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {185034#true} {185848#(< ~counter~0 43)} #98#return; {185848#(< ~counter~0 43)} is VALID [2022-04-07 14:05:53,455 INFO L290 TraceCheckUtils]: 134: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,455 INFO L290 TraceCheckUtils]: 133: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,455 INFO L290 TraceCheckUtils]: 132: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,455 INFO L272 TraceCheckUtils]: 131: Hoare triple {185848#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,455 INFO L290 TraceCheckUtils]: 130: Hoare triple {185848#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {185848#(< ~counter~0 43)} is VALID [2022-04-07 14:05:53,456 INFO L290 TraceCheckUtils]: 129: Hoare triple {185873#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185848#(< ~counter~0 43)} is VALID [2022-04-07 14:05:53,456 INFO L290 TraceCheckUtils]: 128: Hoare triple {185873#(< ~counter~0 42)} assume !(~r~0 > 0); {185873#(< ~counter~0 42)} is VALID [2022-04-07 14:05:53,457 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {185034#true} {185873#(< ~counter~0 42)} #96#return; {185873#(< ~counter~0 42)} is VALID [2022-04-07 14:05:53,457 INFO L290 TraceCheckUtils]: 126: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,457 INFO L290 TraceCheckUtils]: 125: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,457 INFO L290 TraceCheckUtils]: 124: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,457 INFO L272 TraceCheckUtils]: 123: Hoare triple {185873#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,457 INFO L290 TraceCheckUtils]: 122: Hoare triple {185873#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {185873#(< ~counter~0 42)} is VALID [2022-04-07 14:05:53,458 INFO L290 TraceCheckUtils]: 121: Hoare triple {185898#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185873#(< ~counter~0 42)} is VALID [2022-04-07 14:05:53,458 INFO L290 TraceCheckUtils]: 120: Hoare triple {185898#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185898#(< ~counter~0 41)} is VALID [2022-04-07 14:05:53,459 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {185034#true} {185898#(< ~counter~0 41)} #96#return; {185898#(< ~counter~0 41)} is VALID [2022-04-07 14:05:53,459 INFO L290 TraceCheckUtils]: 118: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,459 INFO L290 TraceCheckUtils]: 117: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,459 INFO L290 TraceCheckUtils]: 116: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,459 INFO L272 TraceCheckUtils]: 115: Hoare triple {185898#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,459 INFO L290 TraceCheckUtils]: 114: Hoare triple {185898#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {185898#(< ~counter~0 41)} is VALID [2022-04-07 14:05:53,460 INFO L290 TraceCheckUtils]: 113: Hoare triple {185923#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185898#(< ~counter~0 41)} is VALID [2022-04-07 14:05:53,460 INFO L290 TraceCheckUtils]: 112: Hoare triple {185923#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185923#(< ~counter~0 40)} is VALID [2022-04-07 14:05:53,461 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {185034#true} {185923#(< ~counter~0 40)} #96#return; {185923#(< ~counter~0 40)} is VALID [2022-04-07 14:05:53,461 INFO L290 TraceCheckUtils]: 110: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,461 INFO L290 TraceCheckUtils]: 109: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,461 INFO L290 TraceCheckUtils]: 108: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,461 INFO L272 TraceCheckUtils]: 107: Hoare triple {185923#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,461 INFO L290 TraceCheckUtils]: 106: Hoare triple {185923#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {185923#(< ~counter~0 40)} is VALID [2022-04-07 14:05:53,462 INFO L290 TraceCheckUtils]: 105: Hoare triple {185948#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185923#(< ~counter~0 40)} is VALID [2022-04-07 14:05:53,462 INFO L290 TraceCheckUtils]: 104: Hoare triple {185948#(< ~counter~0 39)} assume !!(0 != ~r~0); {185948#(< ~counter~0 39)} is VALID [2022-04-07 14:05:53,463 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {185034#true} {185948#(< ~counter~0 39)} #94#return; {185948#(< ~counter~0 39)} is VALID [2022-04-07 14:05:53,463 INFO L290 TraceCheckUtils]: 102: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,463 INFO L290 TraceCheckUtils]: 101: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,463 INFO L290 TraceCheckUtils]: 100: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,463 INFO L272 TraceCheckUtils]: 99: Hoare triple {185948#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,463 INFO L290 TraceCheckUtils]: 98: Hoare triple {185948#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {185948#(< ~counter~0 39)} is VALID [2022-04-07 14:05:53,464 INFO L290 TraceCheckUtils]: 97: Hoare triple {185973#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185948#(< ~counter~0 39)} is VALID [2022-04-07 14:05:53,464 INFO L290 TraceCheckUtils]: 96: Hoare triple {185973#(< ~counter~0 38)} assume !(~r~0 < 0); {185973#(< ~counter~0 38)} is VALID [2022-04-07 14:05:53,465 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {185034#true} {185973#(< ~counter~0 38)} #98#return; {185973#(< ~counter~0 38)} is VALID [2022-04-07 14:05:53,465 INFO L290 TraceCheckUtils]: 94: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,465 INFO L290 TraceCheckUtils]: 93: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,465 INFO L290 TraceCheckUtils]: 92: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,465 INFO L272 TraceCheckUtils]: 91: Hoare triple {185973#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,465 INFO L290 TraceCheckUtils]: 90: Hoare triple {185973#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {185973#(< ~counter~0 38)} is VALID [2022-04-07 14:05:53,466 INFO L290 TraceCheckUtils]: 89: Hoare triple {185998#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185973#(< ~counter~0 38)} is VALID [2022-04-07 14:05:53,466 INFO L290 TraceCheckUtils]: 88: Hoare triple {185998#(< ~counter~0 37)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185998#(< ~counter~0 37)} is VALID [2022-04-07 14:05:53,467 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {185034#true} {185998#(< ~counter~0 37)} #98#return; {185998#(< ~counter~0 37)} is VALID [2022-04-07 14:05:53,467 INFO L290 TraceCheckUtils]: 86: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,467 INFO L290 TraceCheckUtils]: 85: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,467 INFO L290 TraceCheckUtils]: 84: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,467 INFO L272 TraceCheckUtils]: 83: Hoare triple {185998#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,467 INFO L290 TraceCheckUtils]: 82: Hoare triple {185998#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {185998#(< ~counter~0 37)} is VALID [2022-04-07 14:05:53,468 INFO L290 TraceCheckUtils]: 81: Hoare triple {186023#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185998#(< ~counter~0 37)} is VALID [2022-04-07 14:05:53,468 INFO L290 TraceCheckUtils]: 80: Hoare triple {186023#(< ~counter~0 36)} assume !(~r~0 > 0); {186023#(< ~counter~0 36)} is VALID [2022-04-07 14:05:53,469 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {185034#true} {186023#(< ~counter~0 36)} #96#return; {186023#(< ~counter~0 36)} is VALID [2022-04-07 14:05:53,469 INFO L290 TraceCheckUtils]: 78: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,469 INFO L290 TraceCheckUtils]: 77: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,469 INFO L290 TraceCheckUtils]: 76: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,469 INFO L272 TraceCheckUtils]: 75: Hoare triple {186023#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,469 INFO L290 TraceCheckUtils]: 74: Hoare triple {186023#(< ~counter~0 36)} assume !!(#t~post7 < 50);havoc #t~post7; {186023#(< ~counter~0 36)} is VALID [2022-04-07 14:05:53,470 INFO L290 TraceCheckUtils]: 73: Hoare triple {186048#(< ~counter~0 35)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {186023#(< ~counter~0 36)} is VALID [2022-04-07 14:05:53,470 INFO L290 TraceCheckUtils]: 72: Hoare triple {186048#(< ~counter~0 35)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {186048#(< ~counter~0 35)} is VALID [2022-04-07 14:05:53,471 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {185034#true} {186048#(< ~counter~0 35)} #96#return; {186048#(< ~counter~0 35)} is VALID [2022-04-07 14:05:53,471 INFO L290 TraceCheckUtils]: 70: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,471 INFO L290 TraceCheckUtils]: 69: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,471 INFO L290 TraceCheckUtils]: 68: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,471 INFO L272 TraceCheckUtils]: 67: Hoare triple {186048#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,471 INFO L290 TraceCheckUtils]: 66: Hoare triple {186048#(< ~counter~0 35)} assume !!(#t~post7 < 50);havoc #t~post7; {186048#(< ~counter~0 35)} is VALID [2022-04-07 14:05:53,472 INFO L290 TraceCheckUtils]: 65: Hoare triple {186073#(< ~counter~0 34)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {186048#(< ~counter~0 35)} is VALID [2022-04-07 14:05:53,472 INFO L290 TraceCheckUtils]: 64: Hoare triple {186073#(< ~counter~0 34)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {186073#(< ~counter~0 34)} is VALID [2022-04-07 14:05:53,473 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {185034#true} {186073#(< ~counter~0 34)} #96#return; {186073#(< ~counter~0 34)} is VALID [2022-04-07 14:05:53,473 INFO L290 TraceCheckUtils]: 62: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,473 INFO L290 TraceCheckUtils]: 60: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,473 INFO L272 TraceCheckUtils]: 59: Hoare triple {186073#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,473 INFO L290 TraceCheckUtils]: 58: Hoare triple {186073#(< ~counter~0 34)} assume !!(#t~post7 < 50);havoc #t~post7; {186073#(< ~counter~0 34)} is VALID [2022-04-07 14:05:53,474 INFO L290 TraceCheckUtils]: 57: Hoare triple {186098#(< ~counter~0 33)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {186073#(< ~counter~0 34)} is VALID [2022-04-07 14:05:53,474 INFO L290 TraceCheckUtils]: 56: Hoare triple {186098#(< ~counter~0 33)} assume !!(0 != ~r~0); {186098#(< ~counter~0 33)} is VALID [2022-04-07 14:05:53,475 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {185034#true} {186098#(< ~counter~0 33)} #94#return; {186098#(< ~counter~0 33)} is VALID [2022-04-07 14:05:53,475 INFO L290 TraceCheckUtils]: 54: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,475 INFO L272 TraceCheckUtils]: 51: Hoare triple {186098#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {186098#(< ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {186098#(< ~counter~0 33)} is VALID [2022-04-07 14:05:53,476 INFO L290 TraceCheckUtils]: 49: Hoare triple {186123#(< ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {186098#(< ~counter~0 33)} is VALID [2022-04-07 14:05:53,476 INFO L290 TraceCheckUtils]: 48: Hoare triple {186123#(< ~counter~0 32)} assume !(~r~0 < 0); {186123#(< ~counter~0 32)} is VALID [2022-04-07 14:05:53,477 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {185034#true} {186123#(< ~counter~0 32)} #98#return; {186123#(< ~counter~0 32)} is VALID [2022-04-07 14:05:53,477 INFO L290 TraceCheckUtils]: 46: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,477 INFO L290 TraceCheckUtils]: 45: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,477 INFO L272 TraceCheckUtils]: 43: Hoare triple {186123#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {186123#(< ~counter~0 32)} assume !!(#t~post8 < 50);havoc #t~post8; {186123#(< ~counter~0 32)} is VALID [2022-04-07 14:05:53,478 INFO L290 TraceCheckUtils]: 41: Hoare triple {186148#(< ~counter~0 31)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {186123#(< ~counter~0 32)} is VALID [2022-04-07 14:05:53,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {186148#(< ~counter~0 31)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {186148#(< ~counter~0 31)} is VALID [2022-04-07 14:05:53,479 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {185034#true} {186148#(< ~counter~0 31)} #98#return; {186148#(< ~counter~0 31)} is VALID [2022-04-07 14:05:53,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,479 INFO L272 TraceCheckUtils]: 35: Hoare triple {186148#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {186148#(< ~counter~0 31)} assume !!(#t~post8 < 50);havoc #t~post8; {186148#(< ~counter~0 31)} is VALID [2022-04-07 14:05:53,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {186173#(< ~counter~0 30)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {186148#(< ~counter~0 31)} is VALID [2022-04-07 14:05:53,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {186173#(< ~counter~0 30)} assume !(~r~0 > 0); {186173#(< ~counter~0 30)} is VALID [2022-04-07 14:05:53,481 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {185034#true} {186173#(< ~counter~0 30)} #96#return; {186173#(< ~counter~0 30)} is VALID [2022-04-07 14:05:53,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,481 INFO L272 TraceCheckUtils]: 27: Hoare triple {186173#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {186173#(< ~counter~0 30)} assume !!(#t~post7 < 50);havoc #t~post7; {186173#(< ~counter~0 30)} is VALID [2022-04-07 14:05:53,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {186198#(< ~counter~0 29)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {186173#(< ~counter~0 30)} is VALID [2022-04-07 14:05:53,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {186198#(< ~counter~0 29)} assume !!(0 != ~r~0); {186198#(< ~counter~0 29)} is VALID [2022-04-07 14:05:53,483 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {185034#true} {186198#(< ~counter~0 29)} #94#return; {186198#(< ~counter~0 29)} is VALID [2022-04-07 14:05:53,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,483 INFO L272 TraceCheckUtils]: 19: Hoare triple {186198#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {186198#(< ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {186198#(< ~counter~0 29)} is VALID [2022-04-07 14:05:53,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {186223#(< ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {186198#(< ~counter~0 29)} is VALID [2022-04-07 14:05:53,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {186223#(< ~counter~0 28)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {186223#(< ~counter~0 28)} is VALID [2022-04-07 14:05:53,485 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {185034#true} {186223#(< ~counter~0 28)} #92#return; {186223#(< ~counter~0 28)} is VALID [2022-04-07 14:05:53,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,485 INFO L272 TraceCheckUtils]: 11: Hoare triple {186223#(< ~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)); {185034#true} is VALID [2022-04-07 14:05:53,485 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {185034#true} {186223#(< ~counter~0 28)} #90#return; {186223#(< ~counter~0 28)} is VALID [2022-04-07 14:05:53,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {185034#true} assume true; {185034#true} is VALID [2022-04-07 14:05:53,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {185034#true} assume !(0 == ~cond); {185034#true} is VALID [2022-04-07 14:05:53,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {185034#true} ~cond := #in~cond; {185034#true} is VALID [2022-04-07 14:05:53,486 INFO L272 TraceCheckUtils]: 6: Hoare triple {186223#(< ~counter~0 28)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {185034#true} is VALID [2022-04-07 14:05:53,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {186223#(< ~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; {186223#(< ~counter~0 28)} is VALID [2022-04-07 14:05:53,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {186223#(< ~counter~0 28)} call #t~ret9 := main(); {186223#(< ~counter~0 28)} is VALID [2022-04-07 14:05:53,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186223#(< ~counter~0 28)} {185034#true} #102#return; {186223#(< ~counter~0 28)} is VALID [2022-04-07 14:05:53,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {186223#(< ~counter~0 28)} assume true; {186223#(< ~counter~0 28)} is VALID [2022-04-07 14:05:53,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {185034#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {186223#(< ~counter~0 28)} is VALID [2022-04-07 14:05:53,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {185034#true} call ULTIMATE.init(); {185034#true} is VALID [2022-04-07 14:05:53,488 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-07 14:05:53,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:05:53,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662331489] [2022-04-07 14:05:53,488 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:05:53,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339445185] [2022-04-07 14:05:53,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339445185] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:05:53,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:05:53,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-07 14:05:53,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922490435] [2022-04-07 14:05:53,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:05:53,489 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-07 14:05:53,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:05:53,490 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-07 14:05:53,769 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-07 14:05:53,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-07 14:05:53,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:05:53,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-07 14:05:53,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-07 14:05:53,771 INFO L87 Difference]: Start difference. First operand 7640 states and 10398 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-07 14:06:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:06:16,795 INFO L93 Difference]: Finished difference Result 8259 states and 11295 transitions. [2022-04-07 14:06:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-04-07 14:06:16,795 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-07 14:06:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:06:16,795 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-07 14:06:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 940 transitions. [2022-04-07 14:06:16,803 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-07 14:06:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 940 transitions. [2022-04-07 14:06:16,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 940 transitions. [2022-04-07 14:06:17,697 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-07 14:06:20,205 INFO L225 Difference]: With dead ends: 8259 [2022-04-07 14:06:20,205 INFO L226 Difference]: Without dead ends: 8110 [2022-04-07 14:06:20,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3046, Invalid=5326, Unknown=0, NotChecked=0, Total=8372 [2022-04-07 14:06:20,209 INFO L913 BasicCegarLoop]: 165 mSDtfsCounter, 1515 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 1145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1145 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:06:20,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1515 Valid, 986 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1145 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-07 14:06:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8110 states. [2022-04-07 14:06:32,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8110 to 7402. [2022-04-07 14:06:32,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:06:32,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8110 states. Second operand has 7402 states, 5551 states have (on average 1.1185372005044136) internal successors, (6209), 5595 states have internal predecessors, (6209), 1760 states have call successors, (1760), 92 states have call predecessors, (1760), 90 states have return successors, (1758), 1714 states have call predecessors, (1758), 1758 states have call successors, (1758) [2022-04-07 14:06:32,807 INFO L74 IsIncluded]: Start isIncluded. First operand 8110 states. Second operand has 7402 states, 5551 states have (on average 1.1185372005044136) internal successors, (6209), 5595 states have internal predecessors, (6209), 1760 states have call successors, (1760), 92 states have call predecessors, (1760), 90 states have return successors, (1758), 1714 states have call predecessors, (1758), 1758 states have call successors, (1758) [2022-04-07 14:06:32,812 INFO L87 Difference]: Start difference. First operand 8110 states. Second operand has 7402 states, 5551 states have (on average 1.1185372005044136) internal successors, (6209), 5595 states have internal predecessors, (6209), 1760 states have call successors, (1760), 92 states have call predecessors, (1760), 90 states have return successors, (1758), 1714 states have call predecessors, (1758), 1758 states have call successors, (1758) [2022-04-07 14:06:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:06:34,613 INFO L93 Difference]: Finished difference Result 8110 states and 10628 transitions. [2022-04-07 14:06:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 8110 states and 10628 transitions. [2022-04-07 14:06:34,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:06:34,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:06:34,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 7402 states, 5551 states have (on average 1.1185372005044136) internal successors, (6209), 5595 states have internal predecessors, (6209), 1760 states have call successors, (1760), 92 states have call predecessors, (1760), 90 states have return successors, (1758), 1714 states have call predecessors, (1758), 1758 states have call successors, (1758) Second operand 8110 states. [2022-04-07 14:06:34,634 INFO L87 Difference]: Start difference. First operand has 7402 states, 5551 states have (on average 1.1185372005044136) internal successors, (6209), 5595 states have internal predecessors, (6209), 1760 states have call successors, (1760), 92 states have call predecessors, (1760), 90 states have return successors, (1758), 1714 states have call predecessors, (1758), 1758 states have call successors, (1758) Second operand 8110 states. [2022-04-07 14:06:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:06:36,652 INFO L93 Difference]: Finished difference Result 8110 states and 10628 transitions. [2022-04-07 14:06:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 8110 states and 10628 transitions. [2022-04-07 14:06:36,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:06:36,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:06:36,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:06:36,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:06:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7402 states, 5551 states have (on average 1.1185372005044136) internal successors, (6209), 5595 states have internal predecessors, (6209), 1760 states have call successors, (1760), 92 states have call predecessors, (1760), 90 states have return successors, (1758), 1714 states have call predecessors, (1758), 1758 states have call successors, (1758) [2022-04-07 14:06:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 9727 transitions. [2022-04-07 14:06:38,861 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 9727 transitions. Word has length 199 [2022-04-07 14:06:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:06:38,861 INFO L478 AbstractCegarLoop]: Abstraction has 7402 states and 9727 transitions. [2022-04-07 14:06:38,861 INFO L479 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-07 14:06:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 9727 transitions. [2022-04-07 14:06:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2022-04-07 14:06:38,876 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:06:38,876 INFO L499 BasicCegarLoop]: 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-07 14:06:38,904 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-07 14:06:39,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:06:39,091 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:06:39,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:06:39,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2044709741, now seen corresponding path program 11 times [2022-04-07 14:06:39,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:06:39,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910758468] [2022-04-07 14:06:39,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:06:39,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:06:39,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:06:39,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797944650] [2022-04-07 14:06:39,135 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 14:06:39,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:06:39,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:06:39,136 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-07 14:06:39,142 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-07 14:06:39,588 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-07 14:06:39,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:06:39,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-07 14:06:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:06:39,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:07:22,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {224552#true} call ULTIMATE.init(); {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {224552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224552#true} {224552#true} #102#return; {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {224552#true} call #t~ret9 := main(); {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {224552#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; {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {224552#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224552#true} {224552#true} #90#return; {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L272 TraceCheckUtils]: 11: Hoare triple {224552#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)); {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {224552#true} {224552#true} #92#return; {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {224552#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {224552#true} is VALID [2022-04-07 14:07:22,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {224552#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {224552#true} assume !!(#t~post6 < 50);havoc #t~post6; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L272 TraceCheckUtils]: 19: Hoare triple {224552#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)); {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {224552#true} {224552#true} #94#return; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {224552#true} assume !!(0 != ~r~0); {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {224552#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {224552#true} assume !!(#t~post7 < 50);havoc #t~post7; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L272 TraceCheckUtils]: 27: Hoare triple {224552#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)); {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {224552#true} {224552#true} #96#return; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {224552#true} assume !(~r~0 > 0); {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {224552#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {224552#true} assume !!(#t~post8 < 50);havoc #t~post8; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L272 TraceCheckUtils]: 35: Hoare triple {224552#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)); {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,710 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {224552#true} {224552#true} #98#return; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {224552#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {224552#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {224552#true} assume !!(#t~post8 < 50);havoc #t~post8; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L272 TraceCheckUtils]: 43: Hoare triple {224552#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)); {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 45: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 46: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {224552#true} {224552#true} #98#return; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 48: Hoare triple {224552#true} assume !(~r~0 < 0); {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 49: Hoare triple {224552#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {224552#true} assume !!(#t~post6 < 50);havoc #t~post6; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L272 TraceCheckUtils]: 51: Hoare triple {224552#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)); {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 53: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 54: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {224552#true} {224552#true} #94#return; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 56: Hoare triple {224552#true} assume !!(0 != ~r~0); {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {224552#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 58: Hoare triple {224552#true} assume !!(#t~post7 < 50);havoc #t~post7; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L272 TraceCheckUtils]: 59: Hoare triple {224552#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)); {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 60: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 61: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,711 INFO L290 TraceCheckUtils]: 62: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,712 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {224552#true} {224552#true} #96#return; {224552#true} is VALID [2022-04-07 14:07:22,712 INFO L290 TraceCheckUtils]: 64: Hoare triple {224552#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {224749#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-07 14:07:22,713 INFO L290 TraceCheckUtils]: 65: Hoare triple {224749#(< 2 (+ main_~v~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224749#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-07 14:07:22,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {224749#(< 2 (+ main_~v~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {224749#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-07 14:07:22,713 INFO L272 TraceCheckUtils]: 67: Hoare triple {224749#(< 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)); {224552#true} is VALID [2022-04-07 14:07:22,713 INFO L290 TraceCheckUtils]: 68: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,713 INFO L290 TraceCheckUtils]: 69: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,713 INFO L290 TraceCheckUtils]: 70: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,713 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {224552#true} {224749#(< 2 (+ main_~v~0 main_~r~0))} #96#return; {224749#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-07 14:07:22,714 INFO L290 TraceCheckUtils]: 72: Hoare triple {224749#(< 2 (+ main_~v~0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,715 INFO L290 TraceCheckUtils]: 73: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,715 INFO L290 TraceCheckUtils]: 74: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,715 INFO L272 TraceCheckUtils]: 75: Hoare triple {224774#(< 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)); {224552#true} is VALID [2022-04-07 14:07:22,715 INFO L290 TraceCheckUtils]: 76: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,715 INFO L290 TraceCheckUtils]: 77: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,715 INFO L290 TraceCheckUtils]: 78: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,716 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {224552#true} {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} #96#return; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,716 INFO L290 TraceCheckUtils]: 80: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !(~r~0 > 0); {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,716 INFO L290 TraceCheckUtils]: 81: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,717 INFO L290 TraceCheckUtils]: 82: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,717 INFO L272 TraceCheckUtils]: 83: Hoare triple {224774#(< 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)); {224552#true} is VALID [2022-04-07 14:07:22,717 INFO L290 TraceCheckUtils]: 84: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,717 INFO L290 TraceCheckUtils]: 85: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,717 INFO L290 TraceCheckUtils]: 86: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,717 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {224552#true} {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} #98#return; {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,719 INFO L290 TraceCheckUtils]: 88: Hoare triple {224774#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,720 INFO L290 TraceCheckUtils]: 89: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,720 INFO L290 TraceCheckUtils]: 90: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,720 INFO L272 TraceCheckUtils]: 91: Hoare triple {224823#(< (+ 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)); {224552#true} is VALID [2022-04-07 14:07:22,720 INFO L290 TraceCheckUtils]: 92: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,720 INFO L290 TraceCheckUtils]: 93: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,720 INFO L290 TraceCheckUtils]: 94: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,721 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {224552#true} {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #98#return; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,721 INFO L290 TraceCheckUtils]: 96: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !(~r~0 < 0); {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,721 INFO L290 TraceCheckUtils]: 97: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,722 INFO L290 TraceCheckUtils]: 98: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,722 INFO L272 TraceCheckUtils]: 99: Hoare triple {224823#(< (+ 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)); {224552#true} is VALID [2022-04-07 14:07:22,722 INFO L290 TraceCheckUtils]: 100: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,722 INFO L290 TraceCheckUtils]: 101: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,722 INFO L290 TraceCheckUtils]: 102: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,722 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {224552#true} {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #94#return; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,723 INFO L290 TraceCheckUtils]: 104: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(0 != ~r~0); {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,723 INFO L290 TraceCheckUtils]: 105: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,723 INFO L290 TraceCheckUtils]: 106: Hoare triple {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,723 INFO L272 TraceCheckUtils]: 107: Hoare triple {224823#(< (+ 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)); {224552#true} is VALID [2022-04-07 14:07:22,723 INFO L290 TraceCheckUtils]: 108: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,723 INFO L290 TraceCheckUtils]: 109: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,723 INFO L290 TraceCheckUtils]: 110: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,724 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {224552#true} {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #96#return; {224823#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-07 14:07:22,725 INFO L290 TraceCheckUtils]: 112: Hoare triple {224823#(< (+ 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; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,725 INFO L290 TraceCheckUtils]: 113: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,725 INFO L290 TraceCheckUtils]: 114: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,725 INFO L272 TraceCheckUtils]: 115: Hoare triple {224896#(< (+ (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)); {224552#true} is VALID [2022-04-07 14:07:22,725 INFO L290 TraceCheckUtils]: 116: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,725 INFO L290 TraceCheckUtils]: 117: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,725 INFO L290 TraceCheckUtils]: 118: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,726 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {224552#true} {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #96#return; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,726 INFO L290 TraceCheckUtils]: 120: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !(~r~0 > 0); {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,727 INFO L290 TraceCheckUtils]: 121: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,727 INFO L290 TraceCheckUtils]: 122: Hoare triple {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !!(#t~post8 < 50);havoc #t~post8; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,727 INFO L272 TraceCheckUtils]: 123: Hoare triple {224896#(< (+ (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)); {224552#true} is VALID [2022-04-07 14:07:22,727 INFO L290 TraceCheckUtils]: 124: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,727 INFO L290 TraceCheckUtils]: 125: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,727 INFO L290 TraceCheckUtils]: 126: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,727 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {224552#true} {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #98#return; {224896#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,729 INFO L290 TraceCheckUtils]: 128: Hoare triple {224896#(< (+ (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; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,729 INFO L290 TraceCheckUtils]: 129: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,729 INFO L290 TraceCheckUtils]: 130: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(#t~post8 < 50);havoc #t~post8; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,729 INFO L272 TraceCheckUtils]: 131: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 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)); {224552#true} is VALID [2022-04-07 14:07:22,729 INFO L290 TraceCheckUtils]: 132: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,729 INFO L290 TraceCheckUtils]: 133: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,730 INFO L290 TraceCheckUtils]: 134: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,730 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {224552#true} {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #98#return; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,730 INFO L290 TraceCheckUtils]: 136: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !(~r~0 < 0); {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,731 INFO L290 TraceCheckUtils]: 137: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,731 INFO L290 TraceCheckUtils]: 138: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(#t~post6 < 50);havoc #t~post6; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,731 INFO L272 TraceCheckUtils]: 139: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 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)); {224552#true} is VALID [2022-04-07 14:07:22,731 INFO L290 TraceCheckUtils]: 140: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,731 INFO L290 TraceCheckUtils]: 141: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,731 INFO L290 TraceCheckUtils]: 142: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,732 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {224552#true} {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #94#return; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,732 INFO L290 TraceCheckUtils]: 144: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(0 != ~r~0); {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,732 INFO L290 TraceCheckUtils]: 145: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,733 INFO L290 TraceCheckUtils]: 146: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,733 INFO L272 TraceCheckUtils]: 147: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 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)); {224552#true} is VALID [2022-04-07 14:07:22,733 INFO L290 TraceCheckUtils]: 148: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,733 INFO L290 TraceCheckUtils]: 149: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,733 INFO L290 TraceCheckUtils]: 150: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,733 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {224552#true} {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #96#return; {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:07:22,734 INFO L290 TraceCheckUtils]: 152: Hoare triple {224945#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,734 INFO L290 TraceCheckUtils]: 153: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,735 INFO L290 TraceCheckUtils]: 154: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,735 INFO L272 TraceCheckUtils]: 155: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) 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)); {224552#true} is VALID [2022-04-07 14:07:22,735 INFO L290 TraceCheckUtils]: 156: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,735 INFO L290 TraceCheckUtils]: 157: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,735 INFO L290 TraceCheckUtils]: 158: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,735 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {224552#true} {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} #96#return; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,736 INFO L290 TraceCheckUtils]: 160: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} assume !(~r~0 > 0); {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,736 INFO L290 TraceCheckUtils]: 161: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,736 INFO L290 TraceCheckUtils]: 162: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} assume !!(#t~post8 < 50);havoc #t~post8; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,736 INFO L272 TraceCheckUtils]: 163: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) 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)); {224552#true} is VALID [2022-04-07 14:07:22,737 INFO L290 TraceCheckUtils]: 164: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,737 INFO L290 TraceCheckUtils]: 165: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,737 INFO L290 TraceCheckUtils]: 166: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,737 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {224552#true} {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} #98#return; {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,739 INFO L290 TraceCheckUtils]: 168: Hoare triple {225018#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,740 INFO L290 TraceCheckUtils]: 169: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,740 INFO L290 TraceCheckUtils]: 170: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(#t~post8 < 50);havoc #t~post8; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,740 INFO L272 TraceCheckUtils]: 171: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) 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)); {224552#true} is VALID [2022-04-07 14:07:22,740 INFO L290 TraceCheckUtils]: 172: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,740 INFO L290 TraceCheckUtils]: 173: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,740 INFO L290 TraceCheckUtils]: 174: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,740 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {224552#true} {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #98#return; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,741 INFO L290 TraceCheckUtils]: 176: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !(~r~0 < 0); {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,741 INFO L290 TraceCheckUtils]: 177: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,741 INFO L290 TraceCheckUtils]: 178: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(#t~post6 < 50);havoc #t~post6; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,742 INFO L272 TraceCheckUtils]: 179: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) 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)); {224552#true} is VALID [2022-04-07 14:07:22,742 INFO L290 TraceCheckUtils]: 180: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,742 INFO L290 TraceCheckUtils]: 181: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,742 INFO L290 TraceCheckUtils]: 182: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,742 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {224552#true} {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #94#return; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,742 INFO L290 TraceCheckUtils]: 184: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(0 != ~r~0); {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,743 INFO L290 TraceCheckUtils]: 185: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,743 INFO L290 TraceCheckUtils]: 186: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,743 INFO L272 TraceCheckUtils]: 187: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) 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)); {224552#true} is VALID [2022-04-07 14:07:22,743 INFO L290 TraceCheckUtils]: 188: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,743 INFO L290 TraceCheckUtils]: 189: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,743 INFO L290 TraceCheckUtils]: 190: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,744 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {224552#true} {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #96#return; {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:07:22,744 INFO L290 TraceCheckUtils]: 192: Hoare triple {225067#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:07:22,745 INFO L290 TraceCheckUtils]: 193: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:07:22,745 INFO L290 TraceCheckUtils]: 194: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:07:22,745 INFO L272 TraceCheckUtils]: 195: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) 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)); {224552#true} is VALID [2022-04-07 14:07:22,745 INFO L290 TraceCheckUtils]: 196: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,745 INFO L290 TraceCheckUtils]: 197: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,745 INFO L290 TraceCheckUtils]: 198: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,746 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {224552#true} {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} #96#return; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:07:22,746 INFO L290 TraceCheckUtils]: 200: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} assume !(~r~0 > 0); {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:07:22,746 INFO L290 TraceCheckUtils]: 201: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:07:22,747 INFO L290 TraceCheckUtils]: 202: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} assume !!(#t~post8 < 50);havoc #t~post8; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:07:22,747 INFO L272 TraceCheckUtils]: 203: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) 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)); {224552#true} is VALID [2022-04-07 14:07:22,747 INFO L290 TraceCheckUtils]: 204: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,747 INFO L290 TraceCheckUtils]: 205: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,747 INFO L290 TraceCheckUtils]: 206: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,747 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {224552#true} {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} #98#return; {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:07:22,748 INFO L290 TraceCheckUtils]: 208: Hoare triple {225140#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:07:22,749 INFO L290 TraceCheckUtils]: 209: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:07:22,749 INFO L290 TraceCheckUtils]: 210: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(#t~post8 < 50);havoc #t~post8; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:07:22,749 INFO L272 TraceCheckUtils]: 211: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-07 14:07:22,749 INFO L290 TraceCheckUtils]: 212: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,749 INFO L290 TraceCheckUtils]: 213: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,749 INFO L290 TraceCheckUtils]: 214: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,750 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {224552#true} {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #98#return; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:07:22,750 INFO L290 TraceCheckUtils]: 216: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !(~r~0 < 0); {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:07:22,751 INFO L290 TraceCheckUtils]: 217: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:07:22,751 INFO L290 TraceCheckUtils]: 218: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(#t~post6 < 50);havoc #t~post6; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:07:22,751 INFO L272 TraceCheckUtils]: 219: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-07 14:07:22,751 INFO L290 TraceCheckUtils]: 220: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,751 INFO L290 TraceCheckUtils]: 221: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,751 INFO L290 TraceCheckUtils]: 222: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,751 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {224552#true} {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #94#return; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:07:22,752 INFO L290 TraceCheckUtils]: 224: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(0 != ~r~0); {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:07:22,752 INFO L290 TraceCheckUtils]: 225: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:07:22,753 INFO L290 TraceCheckUtils]: 226: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:07:22,753 INFO L272 TraceCheckUtils]: 227: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-07 14:07:22,753 INFO L290 TraceCheckUtils]: 228: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,753 INFO L290 TraceCheckUtils]: 229: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,753 INFO L290 TraceCheckUtils]: 230: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,753 INFO L284 TraceCheckUtils]: 231: Hoare quadruple {224552#true} {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #96#return; {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:07:22,754 INFO L290 TraceCheckUtils]: 232: Hoare triple {225189#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,754 INFO L290 TraceCheckUtils]: 233: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,755 INFO L290 TraceCheckUtils]: 234: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} assume !!(#t~post7 < 50);havoc #t~post7; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,755 INFO L272 TraceCheckUtils]: 235: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-07 14:07:22,755 INFO L290 TraceCheckUtils]: 236: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,755 INFO L290 TraceCheckUtils]: 237: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,755 INFO L290 TraceCheckUtils]: 238: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,755 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {224552#true} {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} #96#return; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,756 INFO L290 TraceCheckUtils]: 240: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} assume !(~r~0 > 0); {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,756 INFO L290 TraceCheckUtils]: 241: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,756 INFO L290 TraceCheckUtils]: 242: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} assume !!(#t~post8 < 50);havoc #t~post8; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,756 INFO L272 TraceCheckUtils]: 243: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-07 14:07:22,757 INFO L290 TraceCheckUtils]: 244: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,757 INFO L290 TraceCheckUtils]: 245: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,757 INFO L290 TraceCheckUtils]: 246: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,757 INFO L284 TraceCheckUtils]: 247: Hoare quadruple {224552#true} {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} #98#return; {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,758 INFO L290 TraceCheckUtils]: 248: Hoare triple {225262#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,759 INFO L290 TraceCheckUtils]: 249: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,759 INFO L290 TraceCheckUtils]: 250: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(#t~post8 < 50);havoc #t~post8; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,759 INFO L272 TraceCheckUtils]: 251: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-07 14:07:22,759 INFO L290 TraceCheckUtils]: 252: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,759 INFO L290 TraceCheckUtils]: 253: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,759 INFO L290 TraceCheckUtils]: 254: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,760 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {224552#true} {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #98#return; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,760 INFO L290 TraceCheckUtils]: 256: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !(~r~0 < 0); {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,760 INFO L290 TraceCheckUtils]: 257: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,761 INFO L290 TraceCheckUtils]: 258: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(#t~post6 < 50);havoc #t~post6; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,761 INFO L272 TraceCheckUtils]: 259: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-07 14:07:22,761 INFO L290 TraceCheckUtils]: 260: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,761 INFO L290 TraceCheckUtils]: 261: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,761 INFO L290 TraceCheckUtils]: 262: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,761 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {224552#true} {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #94#return; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,762 INFO L290 TraceCheckUtils]: 264: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(0 != ~r~0); {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,762 INFO L290 TraceCheckUtils]: 265: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,762 INFO L290 TraceCheckUtils]: 266: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(#t~post7 < 50);havoc #t~post7; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,762 INFO L272 TraceCheckUtils]: 267: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-07 14:07:22,762 INFO L290 TraceCheckUtils]: 268: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,762 INFO L290 TraceCheckUtils]: 269: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,762 INFO L290 TraceCheckUtils]: 270: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,763 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {224552#true} {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #96#return; {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:07:22,770 INFO L290 TraceCheckUtils]: 272: Hoare triple {225311#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:07:22,771 INFO L290 TraceCheckUtils]: 273: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:07:22,772 INFO L290 TraceCheckUtils]: 274: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:07:22,772 INFO L272 TraceCheckUtils]: 275: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) 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)); {224552#true} is VALID [2022-04-07 14:07:22,772 INFO L290 TraceCheckUtils]: 276: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,772 INFO L290 TraceCheckUtils]: 277: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,772 INFO L290 TraceCheckUtils]: 278: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,775 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {224552#true} {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} #96#return; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:07:22,776 INFO L290 TraceCheckUtils]: 280: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} assume !(~r~0 > 0); {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:07:22,778 INFO L290 TraceCheckUtils]: 281: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:07:22,779 INFO L290 TraceCheckUtils]: 282: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} assume !!(#t~post8 < 50);havoc #t~post8; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:07:22,779 INFO L272 TraceCheckUtils]: 283: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) 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)); {224552#true} is VALID [2022-04-07 14:07:22,779 INFO L290 TraceCheckUtils]: 284: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:22,779 INFO L290 TraceCheckUtils]: 285: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:22,779 INFO L290 TraceCheckUtils]: 286: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:22,780 INFO L284 TraceCheckUtils]: 287: Hoare quadruple {224552#true} {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} #98#return; {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:07:24,788 WARN L290 TraceCheckUtils]: 288: Hoare triple {225384#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is UNKNOWN [2022-04-07 14:07:24,791 INFO L290 TraceCheckUtils]: 289: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:07:24,792 INFO L290 TraceCheckUtils]: 290: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(#t~post8 < 50);havoc #t~post8; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:07:24,792 INFO L272 TraceCheckUtils]: 291: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 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)); {224552#true} is VALID [2022-04-07 14:07:24,792 INFO L290 TraceCheckUtils]: 292: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:24,792 INFO L290 TraceCheckUtils]: 293: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:24,792 INFO L290 TraceCheckUtils]: 294: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:24,793 INFO L284 TraceCheckUtils]: 295: Hoare quadruple {224552#true} {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #98#return; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:07:24,794 INFO L290 TraceCheckUtils]: 296: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !(~r~0 < 0); {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:07:24,795 INFO L290 TraceCheckUtils]: 297: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:07:24,796 INFO L290 TraceCheckUtils]: 298: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(#t~post6 < 50);havoc #t~post6; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:07:24,796 INFO L272 TraceCheckUtils]: 299: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 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)); {224552#true} is VALID [2022-04-07 14:07:24,796 INFO L290 TraceCheckUtils]: 300: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:24,796 INFO L290 TraceCheckUtils]: 301: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:24,796 INFO L290 TraceCheckUtils]: 302: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:24,797 INFO L284 TraceCheckUtils]: 303: Hoare quadruple {224552#true} {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #94#return; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:07:24,798 INFO L290 TraceCheckUtils]: 304: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(0 != ~r~0); {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:07:24,799 INFO L290 TraceCheckUtils]: 305: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:07:24,800 INFO L290 TraceCheckUtils]: 306: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(#t~post7 < 50);havoc #t~post7; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:07:24,800 INFO L272 TraceCheckUtils]: 307: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 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)); {224552#true} is VALID [2022-04-07 14:07:24,800 INFO L290 TraceCheckUtils]: 308: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:24,800 INFO L290 TraceCheckUtils]: 309: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:24,800 INFO L290 TraceCheckUtils]: 310: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:24,800 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {224552#true} {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #96#return; {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:07:24,801 INFO L290 TraceCheckUtils]: 312: Hoare triple {225433#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:07:24,802 INFO L290 TraceCheckUtils]: 313: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:07:24,802 INFO L290 TraceCheckUtils]: 314: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} assume !!(#t~post7 < 50);havoc #t~post7; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:07:24,802 INFO L272 TraceCheckUtils]: 315: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 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)); {224552#true} is VALID [2022-04-07 14:07:24,802 INFO L290 TraceCheckUtils]: 316: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:24,802 INFO L290 TraceCheckUtils]: 317: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:24,802 INFO L290 TraceCheckUtils]: 318: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:24,803 INFO L284 TraceCheckUtils]: 319: Hoare quadruple {224552#true} {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} #96#return; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:07:24,803 INFO L290 TraceCheckUtils]: 320: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} assume !(~r~0 > 0); {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:07:24,803 INFO L290 TraceCheckUtils]: 321: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:07:24,804 INFO L290 TraceCheckUtils]: 322: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} assume !!(#t~post8 < 50);havoc #t~post8; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:07:24,804 INFO L272 TraceCheckUtils]: 323: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 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)); {224552#true} is VALID [2022-04-07 14:07:24,804 INFO L290 TraceCheckUtils]: 324: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:24,804 INFO L290 TraceCheckUtils]: 325: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:24,804 INFO L290 TraceCheckUtils]: 326: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:24,805 INFO L284 TraceCheckUtils]: 327: Hoare quadruple {224552#true} {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} #98#return; {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:07:24,808 INFO L290 TraceCheckUtils]: 328: Hoare triple {225506#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:07:24,808 INFO L290 TraceCheckUtils]: 329: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:07:24,809 INFO L290 TraceCheckUtils]: 330: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(#t~post8 < 50);havoc #t~post8; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:07:24,809 INFO L272 TraceCheckUtils]: 331: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 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)); {224552#true} is VALID [2022-04-07 14:07:24,809 INFO L290 TraceCheckUtils]: 332: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:24,809 INFO L290 TraceCheckUtils]: 333: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:24,809 INFO L290 TraceCheckUtils]: 334: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:24,810 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {224552#true} {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #98#return; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:07:24,810 INFO L290 TraceCheckUtils]: 336: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !(~r~0 < 0); {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:07:24,810 INFO L290 TraceCheckUtils]: 337: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:07:24,811 INFO L290 TraceCheckUtils]: 338: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(#t~post6 < 50);havoc #t~post6; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:07:24,811 INFO L272 TraceCheckUtils]: 339: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 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)); {224552#true} is VALID [2022-04-07 14:07:24,811 INFO L290 TraceCheckUtils]: 340: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:24,811 INFO L290 TraceCheckUtils]: 341: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:24,811 INFO L290 TraceCheckUtils]: 342: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:24,812 INFO L284 TraceCheckUtils]: 343: Hoare quadruple {224552#true} {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #94#return; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:07:24,812 INFO L290 TraceCheckUtils]: 344: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(0 != ~r~0); {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:07:24,813 INFO L290 TraceCheckUtils]: 345: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:07:24,813 INFO L290 TraceCheckUtils]: 346: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(#t~post7 < 50);havoc #t~post7; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:07:24,813 INFO L272 TraceCheckUtils]: 347: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 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)); {224552#true} is VALID [2022-04-07 14:07:24,813 INFO L290 TraceCheckUtils]: 348: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:24,813 INFO L290 TraceCheckUtils]: 349: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:24,813 INFO L290 TraceCheckUtils]: 350: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:24,814 INFO L284 TraceCheckUtils]: 351: Hoare quadruple {224552#true} {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #96#return; {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:07:26,818 WARN L290 TraceCheckUtils]: 352: Hoare triple {225555#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} is UNKNOWN [2022-04-07 14:07:28,826 WARN L290 TraceCheckUtils]: 353: Hoare triple {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} is UNKNOWN [2022-04-07 14:07:30,833 WARN L290 TraceCheckUtils]: 354: Hoare triple {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} assume !!(#t~post7 < 50);havoc #t~post7; {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} is UNKNOWN [2022-04-07 14:07:30,833 INFO L272 TraceCheckUtils]: 355: Hoare triple {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 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)); {224552#true} is VALID [2022-04-07 14:07:30,833 INFO L290 TraceCheckUtils]: 356: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:30,833 INFO L290 TraceCheckUtils]: 357: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:30,833 INFO L290 TraceCheckUtils]: 358: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:30,834 INFO L284 TraceCheckUtils]: 359: Hoare quadruple {224552#true} {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} #96#return; {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} is VALID [2022-04-07 14:07:30,848 INFO L290 TraceCheckUtils]: 360: Hoare triple {225628#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} is VALID [2022-04-07 14:07:30,860 INFO L290 TraceCheckUtils]: 361: Hoare triple {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} is VALID [2022-04-07 14:07:30,873 INFO L290 TraceCheckUtils]: 362: Hoare triple {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} assume !!(#t~post7 < 50);havoc #t~post7; {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} is VALID [2022-04-07 14:07:30,873 INFO L272 TraceCheckUtils]: 363: Hoare triple {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224552#true} is VALID [2022-04-07 14:07:30,873 INFO L290 TraceCheckUtils]: 364: Hoare triple {224552#true} ~cond := #in~cond; {224552#true} is VALID [2022-04-07 14:07:30,873 INFO L290 TraceCheckUtils]: 365: Hoare triple {224552#true} assume !(0 == ~cond); {224552#true} is VALID [2022-04-07 14:07:30,873 INFO L290 TraceCheckUtils]: 366: Hoare triple {224552#true} assume true; {224552#true} is VALID [2022-04-07 14:07:30,874 INFO L284 TraceCheckUtils]: 367: Hoare quadruple {224552#true} {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} #96#return; {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} is VALID [2022-04-07 14:07:30,875 INFO L290 TraceCheckUtils]: 368: Hoare triple {225653#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {224553#false} is VALID [2022-04-07 14:07:30,875 INFO L290 TraceCheckUtils]: 369: Hoare triple {224553#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {224553#false} is VALID [2022-04-07 14:07:30,875 INFO L290 TraceCheckUtils]: 370: Hoare triple {224553#false} assume !(#t~post7 < 50);havoc #t~post7; {224553#false} is VALID [2022-04-07 14:07:30,875 INFO L290 TraceCheckUtils]: 371: Hoare triple {224553#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {224553#false} is VALID [2022-04-07 14:07:30,875 INFO L290 TraceCheckUtils]: 372: Hoare triple {224553#false} assume !(#t~post8 < 50);havoc #t~post8; {224553#false} is VALID [2022-04-07 14:07:30,875 INFO L290 TraceCheckUtils]: 373: Hoare triple {224553#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {224553#false} is VALID [2022-04-07 14:07:30,875 INFO L290 TraceCheckUtils]: 374: Hoare triple {224553#false} assume !(#t~post6 < 50);havoc #t~post6; {224553#false} is VALID [2022-04-07 14:07:30,875 INFO L272 TraceCheckUtils]: 375: Hoare triple {224553#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {224553#false} is VALID [2022-04-07 14:07:30,875 INFO L290 TraceCheckUtils]: 376: Hoare triple {224553#false} ~cond := #in~cond; {224553#false} is VALID [2022-04-07 14:07:30,875 INFO L290 TraceCheckUtils]: 377: Hoare triple {224553#false} assume 0 == ~cond; {224553#false} is VALID [2022-04-07 14:07:30,875 INFO L290 TraceCheckUtils]: 378: Hoare triple {224553#false} assume !false; {224553#false} is VALID [2022-04-07 14:07:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5272 backedges. 480 proven. 988 refuted. 4 times theorem prover too weak. 3800 trivial. 0 not checked. [2022-04-07 14:07:30,878 INFO L328 TraceCheckSpWp]: Computing backward predicates...