/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/fermat2-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 14:03:13,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 14:03:13,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 14:03:13,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 14:03:13,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 14:03:13,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 14:03:13,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 14:03:13,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 14:03:13,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 14:03:13,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 14:03:13,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 14:03:13,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 14:03:13,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 14:03:13,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 14:03:13,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 14:03:13,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 14:03:13,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 14:03:13,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 14:03:13,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 14:03:13,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 14:03:13,853 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 14:03:13,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 14:03:13,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 14:03:13,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 14:03:13,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 14:03:13,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 14:03:13,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 14:03:13,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 14:03:13,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 14:03:13,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 14:03:13,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 14:03:13,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 14:03:13,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 14:03:13,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 14:03:13,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 14:03:13,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 14:03:13,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 14:03:13,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 14:03:13,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 14:03:13,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 14:03:13,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 14:03:13,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 14:03:13,864 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:03:13,877 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 14:03:13,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 14:03:13,878 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 14:03:13,878 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 14:03:13,878 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 14:03:13,878 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 14:03:13,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 14:03:13,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 14:03:13,879 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 14:03:13,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 14:03:13,879 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 14:03:13,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 14:03:13,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 14:03:13,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 14:03:13,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 14:03:13,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 14:03:13,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 14:03:13,880 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 14:03:13,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 14:03:13,880 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 14:03:13,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 14:03:13,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 14:03:13,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 14:03:13,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 14:03:13,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 14:03:13,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 14:03:13,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 14:03:13,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 14:03:13,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 14:03:13,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 14:03:13,882 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 14:03:13,882 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 14:03:13,882 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 14:03:13,882 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:03:14,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 14:03:14,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 14:03:14,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 14:03:14,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 14:03:14,066 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 14:03:14,067 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound100.c [2022-04-07 14:03:14,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819fa542c/2d47c3e845cf4791a92ec3c0b6d07360/FLAGfb88fcec9 [2022-04-07 14:03:14,454 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 14:03:14,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound100.c [2022-04-07 14:03:14,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819fa542c/2d47c3e845cf4791a92ec3c0b6d07360/FLAGfb88fcec9 [2022-04-07 14:03:14,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819fa542c/2d47c3e845cf4791a92ec3c0b6d07360 [2022-04-07 14:03:14,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 14:03:14,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 14:03:14,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 14:03:14,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 14:03:14,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 14:03:14,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:03:14" (1/1) ... [2022-04-07 14:03:14,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db74ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:03:14, skipping insertion in model container [2022-04-07 14:03:14,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:03:14" (1/1) ... [2022-04-07 14:03:14,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 14:03:14,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 14:03:15,016 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/fermat2-ll_unwindbound100.c[524,537] [2022-04-07 14:03:15,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 14:03:15,039 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 14:03:15,047 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/fermat2-ll_unwindbound100.c[524,537] [2022-04-07 14:03:15,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 14:03:15,061 INFO L208 MainTranslator]: Completed translation [2022-04-07 14:03:15,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:03:15 WrapperNode [2022-04-07 14:03:15,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 14:03:15,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 14:03:15,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 14:03:15,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 14:03:15,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:03:15" (1/1) ... [2022-04-07 14:03:15,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:03:15" (1/1) ... [2022-04-07 14:03:15,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:03:15" (1/1) ... [2022-04-07 14:03:15,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:03:15" (1/1) ... [2022-04-07 14:03:15,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:03:15" (1/1) ... [2022-04-07 14:03:15,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:03:15" (1/1) ... [2022-04-07 14:03:15,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:03:15" (1/1) ... [2022-04-07 14:03:15,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 14:03:15,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 14:03:15,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 14:03:15,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 14:03:15,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:03:15" (1/1) ... [2022-04-07 14:03:15,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 14:03:15,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:15,114 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:03:15,115 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:03:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 14:03:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 14:03:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 14:03:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 14:03:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 14:03:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 14:03:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 14:03:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 14:03:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 14:03:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 14:03:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 14:03:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 14:03:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 14:03:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 14:03:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 14:03:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 14:03:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 14:03:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 14:03:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 14:03:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 14:03:15,202 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 14:03:15,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 14:03:15,364 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 14:03:15,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 14:03:15,369 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 14:03:15,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:03:15 BoogieIcfgContainer [2022-04-07 14:03:15,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 14:03:15,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 14:03:15,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 14:03:15,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 14:03:15,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 02:03:14" (1/3) ... [2022-04-07 14:03:15,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2724ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:03:15, skipping insertion in model container [2022-04-07 14:03:15,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:03:15" (2/3) ... [2022-04-07 14:03:15,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2724ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:03:15, skipping insertion in model container [2022-04-07 14:03:15,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:03:15" (3/3) ... [2022-04-07 14:03:15,382 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound100.c [2022-04-07 14:03:15,386 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 14:03:15,386 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 14:03:15,417 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 14:03:15,421 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:03:15,422 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 14:03:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 14:03:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 14:03:15,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:15,439 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:03:15,440 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:15,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:15,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-07 14:03:15,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:15,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435060531] [2022-04-07 14:03:15,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:15,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:15,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:15,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236976386] [2022-04-07 14:03:15,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:15,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:15,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:15,534 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:03:15,535 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:03:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:15,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-07 14:03:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:15,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:15,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2022-04-07 14:03:15,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-07 14:03:15,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-07 14:03:15,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-07 14:03:15,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-07 14:03:15,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#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; {33#true} is VALID [2022-04-07 14:03:15,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33#true} is VALID [2022-04-07 14:03:15,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-07 14:03:15,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-07 14:03:15,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-07 14:03:15,669 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-07 14:03:15,670 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#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)); {34#false} is VALID [2022-04-07 14:03:15,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-07 14:03:15,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-07 14:03:15,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-07 14:03:15,670 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-07 14:03:15,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34#false} is VALID [2022-04-07 14:03:15,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-07 14:03:15,671 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34#false} is VALID [2022-04-07 14:03:15,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-07 14:03:15,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-07 14:03:15,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-07 14:03:15,672 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:03:15,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:03:15,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:15,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435060531] [2022-04-07 14:03:15,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:15,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236976386] [2022-04-07 14:03:15,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236976386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:03:15,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:03:15,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-07 14:03:15,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911175690] [2022-04-07 14:03:15,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:03:15,679 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:03:15,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:15,683 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:03:15,702 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:03:15,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-07 14:03:15,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:15,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-07 14:03:15,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-07 14:03:15,718 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:03:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:15,780 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-07 14:03:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-07 14:03:15,781 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:03:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:15,782 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:03:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-07 14:03:15,792 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:03:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-07 14:03:15,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-07 14:03:15,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:03:15,881 INFO L225 Difference]: With dead ends: 53 [2022-04-07 14:03:15,881 INFO L226 Difference]: Without dead ends: 25 [2022-04-07 14:03:15,884 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:03:15,887 INFO L913 BasicCegarLoop]: 34 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, 34 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:03:15,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:03:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-07 14:03:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-07 14:03:15,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:15,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 14:03:15,914 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 14:03:15,914 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 14:03:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:15,919 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-07 14:03:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-07 14:03:15,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:15,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:15,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-07 14:03:15,930 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-07 14:03:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:15,933 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-07 14:03:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-07 14:03:15,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:15,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:15,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:15,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 14:03:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-07 14:03:15,939 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-07 14:03:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:15,940 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-07 14:03:15,941 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:03:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-07 14:03:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 14:03:15,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:15,942 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:03:15,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 14:03:16,155 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:03:16,156 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-07 14:03:16,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:16,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928593424] [2022-04-07 14:03:16,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:16,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:16,172 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:16,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333488747] [2022-04-07 14:03:16,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:16,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:16,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:16,180 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:03:16,190 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:03:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:16,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 14:03:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:16,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:16,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-07 14:03:16,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#(<= ~counter~0 0)} {256#true} #67#return; {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#(<= ~counter~0 0)} call #t~ret7 := main(); {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#(<= ~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; {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,420 INFO L272 TraceCheckUtils]: 6: Hoare triple {264#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,423 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #59#return; {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,423 INFO L272 TraceCheckUtils]: 11: Hoare triple {264#(<= ~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)); {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,425 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #61#return; {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {264#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {264#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:16,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {264#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {313#(<= |main_#t~post6| 0)} is VALID [2022-04-07 14:03:16,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {313#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {257#false} is VALID [2022-04-07 14:03:16,426 INFO L272 TraceCheckUtils]: 19: Hoare triple {257#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {257#false} is VALID [2022-04-07 14:03:16,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2022-04-07 14:03:16,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2022-04-07 14:03:16,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-07 14:03:16,427 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:03:16,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:03:16,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:16,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928593424] [2022-04-07 14:03:16,428 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:16,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333488747] [2022-04-07 14:03:16,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333488747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:03:16,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:03:16,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 14:03:16,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866578476] [2022-04-07 14:03:16,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:03:16,429 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:03:16,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:16,430 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:03:16,445 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:03:16,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 14:03:16,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:16,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 14:03:16,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:03:16,446 INFO L87 Difference]: Start difference. First operand 25 states and 29 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:03:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:16,499 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-07 14:03:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 14:03:16,499 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:03:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:16,499 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:03:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-07 14:03:16,501 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:03:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-07 14:03:16,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-07 14:03:16,526 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:03:16,527 INFO L225 Difference]: With dead ends: 34 [2022-04-07 14:03:16,528 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 14:03:16,528 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:03:16,529 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:16,529 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:03:16,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 14:03:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-07 14:03:16,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:16,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 14:03:16,535 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 14:03:16,535 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 14:03:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:16,537 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 14:03:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 14:03:16,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:16,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:16,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-07 14:03:16,538 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-07 14:03:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:16,539 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 14:03:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 14:03:16,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:16,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:16,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:16,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 14:03:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-07 14:03:16,541 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-07 14:03:16,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:16,541 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-07 14:03:16,541 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:03:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 14:03:16,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 14:03:16,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:16,542 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:03:16,574 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:03:16,758 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:03:16,759 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-07 14:03:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:16,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159899867] [2022-04-07 14:03:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:16,791 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:16,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [340227451] [2022-04-07 14:03:16,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:16,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:16,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:16,792 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:03:16,793 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:03:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:16,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 14:03:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:16,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:17,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {469#true} is VALID [2022-04-07 14:03:17,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {469#true} is VALID [2022-04-07 14:03:17,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-07 14:03:17,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} #67#return; {469#true} is VALID [2022-04-07 14:03:17,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {469#true} call #t~ret7 := main(); {469#true} is VALID [2022-04-07 14:03:17,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {469#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; {469#true} is VALID [2022-04-07 14:03:17,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {469#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {469#true} is VALID [2022-04-07 14:03:17,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-07 14:03:17,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-07 14:03:17,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-07 14:03:17,152 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {469#true} {469#true} #59#return; {469#true} is VALID [2022-04-07 14:03:17,152 INFO L272 TraceCheckUtils]: 11: Hoare triple {469#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)); {469#true} is VALID [2022-04-07 14:03:17,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-07 14:03:17,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-07 14:03:17,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-07 14:03:17,153 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {469#true} {469#true} #61#return; {469#true} is VALID [2022-04-07 14:03:19,157 WARN L290 TraceCheckUtils]: 16: Hoare triple {469#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {522#(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 UNKNOWN [2022-04-07 14:03:19,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {522#(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; {522#(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:03:19,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {522#(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:03:20,355 INFO L272 TraceCheckUtils]: 19: Hoare triple {522#(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)); {532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 14:03:20,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:03:20,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {470#false} is VALID [2022-04-07 14:03:20,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-04-07 14:03:20,357 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:03:20,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:03:20,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:20,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159899867] [2022-04-07 14:03:20,357 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:20,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340227451] [2022-04-07 14:03:20,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340227451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:03:20,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:03:20,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:03:20,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77830926] [2022-04-07 14:03:20,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:03:20,358 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:03:20,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:20,359 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:03:22,322 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:03:22,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:03:22,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:22,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:03:22,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:03:22,323 INFO L87 Difference]: Start difference. First operand 27 states and 31 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:03:27,233 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:03:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:27,262 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-07 14:03:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:03:27,262 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:03:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:27,262 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:03:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-07 14:03:27,264 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:03:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-07 14:03:27,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-07 14:03:33,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 41 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-07 14:03:33,313 INFO L225 Difference]: With dead ends: 39 [2022-04-07 14:03:33,313 INFO L226 Difference]: Without dead ends: 37 [2022-04-07 14:03:33,313 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:03:33,314 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:33,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-07 14:03:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-07 14:03:33,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-07 14:03:33,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:33,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 14:03:33,321 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 14:03:33,322 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 14:03:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:33,323 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-07 14:03:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-07 14:03:33,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:33,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:33,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-07 14:03:33,324 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-07 14:03:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:33,325 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-07 14:03:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-07 14:03:33,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:33,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:33,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:33,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 14:03:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-07 14:03:33,327 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2022-04-07 14:03:33,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:33,327 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-07 14:03:33,327 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:03:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-07 14:03:33,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 14:03:33,328 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:33,328 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:03:33,346 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:03:33,548 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:03:33,550 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:33,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-07 14:03:33,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:33,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207986759] [2022-04-07 14:03:33,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:33,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:33,566 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:33,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676281766] [2022-04-07 14:03:33,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:33,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:33,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:33,573 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:03:33,574 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:03:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:33,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 14:03:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:33,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:33,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {724#true} is VALID [2022-04-07 14:03:33,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {724#true} is VALID [2022-04-07 14:03:33,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-07 14:03:33,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #67#return; {724#true} is VALID [2022-04-07 14:03:33,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret7 := main(); {724#true} is VALID [2022-04-07 14:03:33,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#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; {724#true} is VALID [2022-04-07 14:03:33,777 INFO L272 TraceCheckUtils]: 6: Hoare triple {724#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {724#true} is VALID [2022-04-07 14:03:33,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {724#true} ~cond := #in~cond; {724#true} is VALID [2022-04-07 14:03:33,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#true} assume !(0 == ~cond); {724#true} is VALID [2022-04-07 14:03:33,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-07 14:03:33,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {724#true} {724#true} #59#return; {724#true} is VALID [2022-04-07 14:03:33,777 INFO L272 TraceCheckUtils]: 11: Hoare triple {724#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)); {724#true} is VALID [2022-04-07 14:03:33,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#true} ~cond := #in~cond; {724#true} is VALID [2022-04-07 14:03:33,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#true} assume !(0 == ~cond); {724#true} is VALID [2022-04-07 14:03:33,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-07 14:03:33,777 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {724#true} {724#true} #61#return; {724#true} is VALID [2022-04-07 14:03:33,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {724#true} is VALID [2022-04-07 14:03:33,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {724#true} is VALID [2022-04-07 14:03:33,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {724#true} assume !!(#t~post6 < 100);havoc #t~post6; {724#true} is VALID [2022-04-07 14:03:33,778 INFO L272 TraceCheckUtils]: 19: Hoare triple {724#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)); {724#true} is VALID [2022-04-07 14:03:33,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#true} ~cond := #in~cond; {789#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:03:33,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 14:03:33,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 14:03:33,780 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} {724#true} #63#return; {800#(= (+ (* 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:03:33,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {800#(= (+ (* 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); {804#(= (+ (* 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:03:33,781 INFO L272 TraceCheckUtils]: 25: Hoare triple {804#(= (+ (* 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)); {808#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 14:03:33,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {808#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {812#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:03:33,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {812#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {725#false} is VALID [2022-04-07 14:03:33,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {725#false} assume !false; {725#false} is VALID [2022-04-07 14:03:33,782 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:03:33,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:03:34,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {725#false} assume !false; {725#false} is VALID [2022-04-07 14:03:34,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {812#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {725#false} is VALID [2022-04-07 14:03:34,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {808#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {812#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:03:34,182 INFO L272 TraceCheckUtils]: 25: Hoare triple {804#(= (+ (* 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)); {808#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 14:03:34,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {831#(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); {804#(= (+ (* 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:03:34,184 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} {724#true} #63#return; {831#(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:03:34,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 14:03:34,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {844#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 14:03:34,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#true} ~cond := #in~cond; {844#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 14:03:34,187 INFO L272 TraceCheckUtils]: 19: Hoare triple {724#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)); {724#true} is VALID [2022-04-07 14:03:34,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {724#true} assume !!(#t~post6 < 100);havoc #t~post6; {724#true} is VALID [2022-04-07 14:03:34,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {724#true} is VALID [2022-04-07 14:03:34,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {724#true} is VALID [2022-04-07 14:03:34,187 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {724#true} {724#true} #61#return; {724#true} is VALID [2022-04-07 14:03:34,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-07 14:03:34,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#true} assume !(0 == ~cond); {724#true} is VALID [2022-04-07 14:03:34,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#true} ~cond := #in~cond; {724#true} is VALID [2022-04-07 14:03:34,187 INFO L272 TraceCheckUtils]: 11: Hoare triple {724#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)); {724#true} is VALID [2022-04-07 14:03:34,187 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {724#true} {724#true} #59#return; {724#true} is VALID [2022-04-07 14:03:34,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-07 14:03:34,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#true} assume !(0 == ~cond); {724#true} is VALID [2022-04-07 14:03:34,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {724#true} ~cond := #in~cond; {724#true} is VALID [2022-04-07 14:03:34,188 INFO L272 TraceCheckUtils]: 6: Hoare triple {724#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {724#true} is VALID [2022-04-07 14:03:34,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#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; {724#true} is VALID [2022-04-07 14:03:34,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret7 := main(); {724#true} is VALID [2022-04-07 14:03:34,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #67#return; {724#true} is VALID [2022-04-07 14:03:34,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-07 14:03:34,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {724#true} is VALID [2022-04-07 14:03:34,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {724#true} is VALID [2022-04-07 14:03:34,190 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:03:34,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:34,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207986759] [2022-04-07 14:03:34,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:34,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676281766] [2022-04-07 14:03:34,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676281766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:03:34,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:03:34,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 14:03:34,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358122092] [2022-04-07 14:03:34,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:03:34,191 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:03:34,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:34,192 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:03:34,209 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:03:34,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 14:03:34,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:34,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 14:03:34,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:03:34,210 INFO L87 Difference]: Start difference. First operand 36 states and 43 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:03:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:34,456 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-07 14:03:34,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 14:03:34,456 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:03:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:34,456 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:03:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-07 14:03:34,457 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:03:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-07 14:03:34,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-07 14:03:34,492 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:03:34,493 INFO L225 Difference]: With dead ends: 43 [2022-04-07 14:03:34,493 INFO L226 Difference]: Without dead ends: 38 [2022-04-07 14:03:34,494 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:03:34,494 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:34,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 109 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 14:03:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-07 14:03:34,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2022-04-07 14:03:34,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:34,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 14:03:34,503 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 14:03:34,503 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 14:03:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:34,505 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-07 14:03:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-07 14:03:34,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:34,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:34,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 38 states. [2022-04-07 14:03:34,506 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 38 states. [2022-04-07 14:03:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:34,507 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-07 14:03:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-07 14:03:34,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:34,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:34,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:34,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 14:03:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-07 14:03:34,508 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-07 14:03:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:34,508 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-07 14:03:34,509 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:03:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-07 14:03:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 14:03:34,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:34,509 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] [2022-04-07 14:03:34,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 14:03:34,723 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:03:34,723 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:34,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:34,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-07 14:03:34,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:34,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610951270] [2022-04-07 14:03:34,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:34,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:34,744 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:34,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499227273] [2022-04-07 14:03:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:34,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:34,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:34,745 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:03:34,746 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:03:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:34,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 14:03:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:34,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:34,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {1091#true} call ULTIMATE.init(); {1091#true} is VALID [2022-04-07 14:03:34,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#(<= ~counter~0 0)} assume true; {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#(<= ~counter~0 0)} {1091#true} #67#return; {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#(<= ~counter~0 0)} call #t~ret7 := main(); {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#(<= ~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; {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,932 INFO L272 TraceCheckUtils]: 6: Hoare triple {1099#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#(<= ~counter~0 0)} ~cond := #in~cond; {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#(<= ~counter~0 0)} assume !(0 == ~cond); {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {1099#(<= ~counter~0 0)} assume true; {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,934 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1099#(<= ~counter~0 0)} {1099#(<= ~counter~0 0)} #59#return; {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,934 INFO L272 TraceCheckUtils]: 11: Hoare triple {1099#(<= ~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)); {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {1099#(<= ~counter~0 0)} ~cond := #in~cond; {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#(<= ~counter~0 0)} assume !(0 == ~cond); {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {1099#(<= ~counter~0 0)} assume true; {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,936 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1099#(<= ~counter~0 0)} {1099#(<= ~counter~0 0)} #61#return; {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {1099#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1099#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:34,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {1099#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1148#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:34,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {1148#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1148#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:34,938 INFO L272 TraceCheckUtils]: 19: Hoare triple {1148#(<= ~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)); {1148#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:34,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {1148#(<= ~counter~0 1)} ~cond := #in~cond; {1148#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:34,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {1148#(<= ~counter~0 1)} assume !(0 == ~cond); {1148#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:34,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {1148#(<= ~counter~0 1)} assume true; {1148#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:34,939 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1148#(<= ~counter~0 1)} {1148#(<= ~counter~0 1)} #63#return; {1148#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:34,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {1148#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1148#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:34,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {1148#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1148#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:34,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {1148#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1176#(<= |main_#t~post6| 1)} is VALID [2022-04-07 14:03:34,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {1176#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {1092#false} is VALID [2022-04-07 14:03:34,940 INFO L272 TraceCheckUtils]: 28: Hoare triple {1092#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1092#false} is VALID [2022-04-07 14:03:34,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#false} ~cond := #in~cond; {1092#false} is VALID [2022-04-07 14:03:34,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {1092#false} assume 0 == ~cond; {1092#false} is VALID [2022-04-07 14:03:34,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {1092#false} assume !false; {1092#false} is VALID [2022-04-07 14:03:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 14:03:34,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:03:35,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {1092#false} assume !false; {1092#false} is VALID [2022-04-07 14:03:35,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {1092#false} assume 0 == ~cond; {1092#false} is VALID [2022-04-07 14:03:35,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#false} ~cond := #in~cond; {1092#false} is VALID [2022-04-07 14:03:35,090 INFO L272 TraceCheckUtils]: 28: Hoare triple {1092#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1092#false} is VALID [2022-04-07 14:03:35,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {1204#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {1092#false} is VALID [2022-04-07 14:03:35,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {1208#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1204#(< |main_#t~post6| 100)} is VALID [2022-04-07 14:03:35,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {1208#(< ~counter~0 100)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1208#(< ~counter~0 100)} is VALID [2022-04-07 14:03:35,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {1208#(< ~counter~0 100)} assume !!(0 != ~r~0); {1208#(< ~counter~0 100)} is VALID [2022-04-07 14:03:35,092 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1091#true} {1208#(< ~counter~0 100)} #63#return; {1208#(< ~counter~0 100)} is VALID [2022-04-07 14:03:35,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-07 14:03:35,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {1091#true} assume !(0 == ~cond); {1091#true} is VALID [2022-04-07 14:03:35,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {1091#true} ~cond := #in~cond; {1091#true} is VALID [2022-04-07 14:03:35,092 INFO L272 TraceCheckUtils]: 19: Hoare triple {1208#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1091#true} is VALID [2022-04-07 14:03:35,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {1208#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {1208#(< ~counter~0 100)} is VALID [2022-04-07 14:03:35,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {1236#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1208#(< ~counter~0 100)} is VALID [2022-04-07 14:03:35,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {1236#(< ~counter~0 99)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1236#(< ~counter~0 99)} is VALID [2022-04-07 14:03:35,094 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1091#true} {1236#(< ~counter~0 99)} #61#return; {1236#(< ~counter~0 99)} is VALID [2022-04-07 14:03:35,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-07 14:03:35,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {1091#true} assume !(0 == ~cond); {1091#true} is VALID [2022-04-07 14:03:35,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {1091#true} ~cond := #in~cond; {1091#true} is VALID [2022-04-07 14:03:35,094 INFO L272 TraceCheckUtils]: 11: Hoare triple {1236#(< ~counter~0 99)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1091#true} is VALID [2022-04-07 14:03:35,095 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1091#true} {1236#(< ~counter~0 99)} #59#return; {1236#(< ~counter~0 99)} is VALID [2022-04-07 14:03:35,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-07 14:03:35,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {1091#true} assume !(0 == ~cond); {1091#true} is VALID [2022-04-07 14:03:35,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {1091#true} ~cond := #in~cond; {1091#true} is VALID [2022-04-07 14:03:35,095 INFO L272 TraceCheckUtils]: 6: Hoare triple {1236#(< ~counter~0 99)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1091#true} is VALID [2022-04-07 14:03:35,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {1236#(< ~counter~0 99)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1236#(< ~counter~0 99)} is VALID [2022-04-07 14:03:35,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {1236#(< ~counter~0 99)} call #t~ret7 := main(); {1236#(< ~counter~0 99)} is VALID [2022-04-07 14:03:35,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1236#(< ~counter~0 99)} {1091#true} #67#return; {1236#(< ~counter~0 99)} is VALID [2022-04-07 14:03:35,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#(< ~counter~0 99)} assume true; {1236#(< ~counter~0 99)} is VALID [2022-04-07 14:03:35,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1236#(< ~counter~0 99)} is VALID [2022-04-07 14:03:35,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {1091#true} call ULTIMATE.init(); {1091#true} is VALID [2022-04-07 14:03:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 14:03:35,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:35,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610951270] [2022-04-07 14:03:35,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:35,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499227273] [2022-04-07 14:03:35,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499227273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:03:35,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:03:35,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 14:03:35,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410005995] [2022-04-07 14:03:35,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:03:35,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-07 14:03:35,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:35,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-07 14:03:35,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:03:35,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 14:03:35,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:35,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 14:03:35,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 14:03:35,138 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-07 14:03:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:35,310 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-07 14:03:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 14:03:35,310 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-07 14:03:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-07 14:03:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-07 14:03:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-07 14:03:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-07 14:03:35,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-07 14:03:35,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:03:35,361 INFO L225 Difference]: With dead ends: 61 [2022-04-07 14:03:35,361 INFO L226 Difference]: Without dead ends: 56 [2022-04-07 14:03:35,361 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 14:03:35,362 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:35,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:03:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-07 14:03:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-07 14:03:35,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:35,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 14:03:35,377 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 14:03:35,377 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 14:03:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:35,379 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-07 14:03:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-07 14:03:35,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:35,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:35,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-07 14:03:35,380 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-07 14:03:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:35,382 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-07 14:03:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-07 14:03:35,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:35,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:35,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:35,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 14:03:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-07 14:03:35,384 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-07 14:03:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:35,385 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-07 14:03:35,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-07 14:03:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-07 14:03:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-07 14:03:35,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:35,386 INFO L499 BasicCegarLoop]: trace histogram [5, 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:03:35,414 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:03:35,599 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:03:35,599 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:35,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 2 times [2022-04-07 14:03:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:35,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158535029] [2022-04-07 14:03:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:35,610 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:35,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402995336] [2022-04-07 14:03:35,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:03:35,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:35,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:35,612 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:03:35,612 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:03:35,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:03:35,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:35,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 14:03:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:35,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:35,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {1571#true} call ULTIMATE.init(); {1571#true} is VALID [2022-04-07 14:03:35,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {1571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {1579#(<= ~counter~0 0)} assume true; {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1579#(<= ~counter~0 0)} {1571#true} #67#return; {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {1579#(<= ~counter~0 0)} call #t~ret7 := main(); {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {1579#(<= ~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; {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,972 INFO L272 TraceCheckUtils]: 6: Hoare triple {1579#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#(<= ~counter~0 0)} ~cond := #in~cond; {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#(<= ~counter~0 0)} assume !(0 == ~cond); {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#(<= ~counter~0 0)} assume true; {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,976 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1579#(<= ~counter~0 0)} {1579#(<= ~counter~0 0)} #59#return; {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,977 INFO L272 TraceCheckUtils]: 11: Hoare triple {1579#(<= ~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)); {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {1579#(<= ~counter~0 0)} ~cond := #in~cond; {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {1579#(<= ~counter~0 0)} assume !(0 == ~cond); {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {1579#(<= ~counter~0 0)} assume true; {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,978 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1579#(<= ~counter~0 0)} {1579#(<= ~counter~0 0)} #61#return; {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {1579#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1579#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:35,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {1579#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1628#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:35,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {1628#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1628#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:35,979 INFO L272 TraceCheckUtils]: 19: Hoare triple {1628#(<= ~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)); {1628#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:35,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {1628#(<= ~counter~0 1)} ~cond := #in~cond; {1628#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:35,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {1628#(<= ~counter~0 1)} assume !(0 == ~cond); {1628#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:35,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {1628#(<= ~counter~0 1)} assume true; {1628#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:35,981 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1628#(<= ~counter~0 1)} {1628#(<= ~counter~0 1)} #63#return; {1628#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:35,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {1628#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1628#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:35,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {1628#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1628#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:35,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {1628#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1656#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:35,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {1656#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {1656#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:35,982 INFO L272 TraceCheckUtils]: 28: Hoare triple {1656#(<= ~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)); {1656#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:35,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {1656#(<= ~counter~0 2)} ~cond := #in~cond; {1656#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:35,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {1656#(<= ~counter~0 2)} assume !(0 == ~cond); {1656#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:35,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {1656#(<= ~counter~0 2)} assume true; {1656#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:35,983 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1656#(<= ~counter~0 2)} {1656#(<= ~counter~0 2)} #63#return; {1656#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:35,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {1656#(<= ~counter~0 2)} assume !!(0 != ~r~0); {1656#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:35,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {1656#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1656#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:35,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {1656#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1684#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:35,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {1684#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {1684#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:35,985 INFO L272 TraceCheckUtils]: 37: Hoare triple {1684#(<= ~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)); {1684#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:35,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {1684#(<= ~counter~0 3)} ~cond := #in~cond; {1684#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:35,986 INFO L290 TraceCheckUtils]: 39: Hoare triple {1684#(<= ~counter~0 3)} assume !(0 == ~cond); {1684#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:35,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {1684#(<= ~counter~0 3)} assume true; {1684#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:35,986 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1684#(<= ~counter~0 3)} {1684#(<= ~counter~0 3)} #63#return; {1684#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:35,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {1684#(<= ~counter~0 3)} assume !!(0 != ~r~0); {1684#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:35,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {1684#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1684#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:35,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {1684#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1712#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:35,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {1712#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {1712#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:35,988 INFO L272 TraceCheckUtils]: 46: Hoare triple {1712#(<= ~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)); {1712#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:35,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {1712#(<= ~counter~0 4)} ~cond := #in~cond; {1712#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:35,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {1712#(<= ~counter~0 4)} assume !(0 == ~cond); {1712#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:35,989 INFO L290 TraceCheckUtils]: 49: Hoare triple {1712#(<= ~counter~0 4)} assume true; {1712#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:35,990 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1712#(<= ~counter~0 4)} {1712#(<= ~counter~0 4)} #63#return; {1712#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:35,990 INFO L290 TraceCheckUtils]: 51: Hoare triple {1712#(<= ~counter~0 4)} assume !!(0 != ~r~0); {1712#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:35,990 INFO L290 TraceCheckUtils]: 52: Hoare triple {1712#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1712#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:35,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {1712#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1740#(<= |main_#t~post6| 4)} is VALID [2022-04-07 14:03:35,991 INFO L290 TraceCheckUtils]: 54: Hoare triple {1740#(<= |main_#t~post6| 4)} assume !(#t~post6 < 100);havoc #t~post6; {1572#false} is VALID [2022-04-07 14:03:35,991 INFO L272 TraceCheckUtils]: 55: Hoare triple {1572#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1572#false} is VALID [2022-04-07 14:03:35,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {1572#false} ~cond := #in~cond; {1572#false} is VALID [2022-04-07 14:03:35,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {1572#false} assume 0 == ~cond; {1572#false} is VALID [2022-04-07 14:03:35,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {1572#false} assume !false; {1572#false} is VALID [2022-04-07 14:03:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 14:03:35,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:03:36,338 INFO L290 TraceCheckUtils]: 58: Hoare triple {1572#false} assume !false; {1572#false} is VALID [2022-04-07 14:03:36,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {1572#false} assume 0 == ~cond; {1572#false} is VALID [2022-04-07 14:03:36,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {1572#false} ~cond := #in~cond; {1572#false} is VALID [2022-04-07 14:03:36,339 INFO L272 TraceCheckUtils]: 55: Hoare triple {1572#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1572#false} is VALID [2022-04-07 14:03:36,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {1768#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {1572#false} is VALID [2022-04-07 14:03:36,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {1772#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1768#(< |main_#t~post6| 100)} is VALID [2022-04-07 14:03:36,341 INFO L290 TraceCheckUtils]: 52: Hoare triple {1772#(< ~counter~0 100)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1772#(< ~counter~0 100)} is VALID [2022-04-07 14:03:36,341 INFO L290 TraceCheckUtils]: 51: Hoare triple {1772#(< ~counter~0 100)} assume !!(0 != ~r~0); {1772#(< ~counter~0 100)} is VALID [2022-04-07 14:03:36,342 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1571#true} {1772#(< ~counter~0 100)} #63#return; {1772#(< ~counter~0 100)} is VALID [2022-04-07 14:03:36,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-07 14:03:36,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-07 14:03:36,342 INFO L290 TraceCheckUtils]: 47: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-07 14:03:36,342 INFO L272 TraceCheckUtils]: 46: Hoare triple {1772#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1571#true} is VALID [2022-04-07 14:03:36,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {1772#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {1772#(< ~counter~0 100)} is VALID [2022-04-07 14:03:36,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {1800#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1772#(< ~counter~0 100)} is VALID [2022-04-07 14:03:36,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {1800#(< ~counter~0 99)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1800#(< ~counter~0 99)} is VALID [2022-04-07 14:03:36,344 INFO L290 TraceCheckUtils]: 42: Hoare triple {1800#(< ~counter~0 99)} assume !!(0 != ~r~0); {1800#(< ~counter~0 99)} is VALID [2022-04-07 14:03:36,344 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1571#true} {1800#(< ~counter~0 99)} #63#return; {1800#(< ~counter~0 99)} is VALID [2022-04-07 14:03:36,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-07 14:03:36,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-07 14:03:36,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-07 14:03:36,345 INFO L272 TraceCheckUtils]: 37: Hoare triple {1800#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1571#true} is VALID [2022-04-07 14:03:36,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {1800#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {1800#(< ~counter~0 99)} is VALID [2022-04-07 14:03:36,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1800#(< ~counter~0 99)} is VALID [2022-04-07 14:03:36,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#(< ~counter~0 98)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1828#(< ~counter~0 98)} is VALID [2022-04-07 14:03:36,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#(< ~counter~0 98)} assume !!(0 != ~r~0); {1828#(< ~counter~0 98)} is VALID [2022-04-07 14:03:36,347 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1571#true} {1828#(< ~counter~0 98)} #63#return; {1828#(< ~counter~0 98)} is VALID [2022-04-07 14:03:36,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-07 14:03:36,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-07 14:03:36,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-07 14:03:36,347 INFO L272 TraceCheckUtils]: 28: Hoare triple {1828#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1571#true} is VALID [2022-04-07 14:03:36,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {1828#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {1828#(< ~counter~0 98)} is VALID [2022-04-07 14:03:36,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {1856#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1828#(< ~counter~0 98)} is VALID [2022-04-07 14:03:36,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {1856#(< ~counter~0 97)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1856#(< ~counter~0 97)} is VALID [2022-04-07 14:03:36,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {1856#(< ~counter~0 97)} assume !!(0 != ~r~0); {1856#(< ~counter~0 97)} is VALID [2022-04-07 14:03:36,349 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1571#true} {1856#(< ~counter~0 97)} #63#return; {1856#(< ~counter~0 97)} is VALID [2022-04-07 14:03:36,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-07 14:03:36,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-07 14:03:36,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-07 14:03:36,350 INFO L272 TraceCheckUtils]: 19: Hoare triple {1856#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1571#true} is VALID [2022-04-07 14:03:36,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {1856#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {1856#(< ~counter~0 97)} is VALID [2022-04-07 14:03:36,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {1884#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1856#(< ~counter~0 97)} is VALID [2022-04-07 14:03:36,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {1884#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1884#(< ~counter~0 96)} is VALID [2022-04-07 14:03:36,351 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1571#true} {1884#(< ~counter~0 96)} #61#return; {1884#(< ~counter~0 96)} is VALID [2022-04-07 14:03:36,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-07 14:03:36,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-07 14:03:36,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-07 14:03:36,352 INFO L272 TraceCheckUtils]: 11: Hoare triple {1884#(< ~counter~0 96)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1571#true} is VALID [2022-04-07 14:03:36,352 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1571#true} {1884#(< ~counter~0 96)} #59#return; {1884#(< ~counter~0 96)} is VALID [2022-04-07 14:03:36,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-07 14:03:36,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-07 14:03:36,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-07 14:03:36,352 INFO L272 TraceCheckUtils]: 6: Hoare triple {1884#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1571#true} is VALID [2022-04-07 14:03:36,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {1884#(< ~counter~0 96)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1884#(< ~counter~0 96)} is VALID [2022-04-07 14:03:36,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {1884#(< ~counter~0 96)} call #t~ret7 := main(); {1884#(< ~counter~0 96)} is VALID [2022-04-07 14:03:36,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1884#(< ~counter~0 96)} {1571#true} #67#return; {1884#(< ~counter~0 96)} is VALID [2022-04-07 14:03:36,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {1884#(< ~counter~0 96)} assume true; {1884#(< ~counter~0 96)} is VALID [2022-04-07 14:03:36,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {1571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1884#(< ~counter~0 96)} is VALID [2022-04-07 14:03:36,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {1571#true} call ULTIMATE.init(); {1571#true} is VALID [2022-04-07 14:03:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-07 14:03:36,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:36,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158535029] [2022-04-07 14:03:36,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:36,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402995336] [2022-04-07 14:03:36,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402995336] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:03:36,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:03:36,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-07 14:03:36,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626807720] [2022-04-07 14:03:36,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:03:36,356 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 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 59 [2022-04-07 14:03:36,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:36,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 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:03:36,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:03:36,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 14:03:36,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:36,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 14:03:36,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-07 14:03:36,421 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 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:03:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:36,801 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-04-07 14:03:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-07 14:03:36,801 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 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 59 [2022-04-07 14:03:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 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:03:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-07 14:03:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 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:03:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-07 14:03:36,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 130 transitions. [2022-04-07 14:03:36,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:03:36,903 INFO L225 Difference]: With dead ends: 115 [2022-04-07 14:03:36,904 INFO L226 Difference]: Without dead ends: 110 [2022-04-07 14:03:36,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-07 14:03:36,905 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 80 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:36,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 160 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 14:03:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-07 14:03:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-07 14:03:36,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:36,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 14:03:36,952 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 14:03:36,952 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 14:03:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:36,955 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-07 14:03:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-07 14:03:36,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:36,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:36,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-07 14:03:36,956 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-07 14:03:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:36,958 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-07 14:03:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-07 14:03:36,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:36,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:36,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:36,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 14:03:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-07 14:03:36,962 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-07 14:03:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:36,962 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-07 14:03:36,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 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:03:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-07 14:03:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-07 14:03:36,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:36,964 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:03:36,981 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:03:37,180 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:03:37,181 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:37,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:37,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 3 times [2022-04-07 14:03:37,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:37,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899199999] [2022-04-07 14:03:37,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:37,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:37,197 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:37,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1536511384] [2022-04-07 14:03:37,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 14:03:37,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:37,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:37,198 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:03:37,224 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:03:39,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-07 14:03:39,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:39,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 14:03:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:39,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:39,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {2483#true} call ULTIMATE.init(); {2483#true} is VALID [2022-04-07 14:03:39,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {2483#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {2491#(<= ~counter~0 0)} assume true; {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2491#(<= ~counter~0 0)} {2483#true} #67#return; {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {2491#(<= ~counter~0 0)} call #t~ret7 := main(); {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {2491#(<= ~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; {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {2491#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {2491#(<= ~counter~0 0)} ~cond := #in~cond; {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {2491#(<= ~counter~0 0)} assume !(0 == ~cond); {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {2491#(<= ~counter~0 0)} assume true; {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,943 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2491#(<= ~counter~0 0)} {2491#(<= ~counter~0 0)} #59#return; {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,944 INFO L272 TraceCheckUtils]: 11: Hoare triple {2491#(<= ~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)); {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {2491#(<= ~counter~0 0)} ~cond := #in~cond; {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {2491#(<= ~counter~0 0)} assume !(0 == ~cond); {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {2491#(<= ~counter~0 0)} assume true; {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,945 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2491#(<= ~counter~0 0)} {2491#(<= ~counter~0 0)} #61#return; {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {2491#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2491#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:39,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {2491#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2540#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:39,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {2540#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {2540#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:39,947 INFO L272 TraceCheckUtils]: 19: Hoare triple {2540#(<= ~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)); {2540#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:39,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {2540#(<= ~counter~0 1)} ~cond := #in~cond; {2540#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:39,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {2540#(<= ~counter~0 1)} assume !(0 == ~cond); {2540#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:39,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {2540#(<= ~counter~0 1)} assume true; {2540#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:39,948 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2540#(<= ~counter~0 1)} {2540#(<= ~counter~0 1)} #63#return; {2540#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:39,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {2540#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2540#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:39,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {2540#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2540#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:39,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {2540#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2568#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:39,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {2568#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {2568#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:39,950 INFO L272 TraceCheckUtils]: 28: Hoare triple {2568#(<= ~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)); {2568#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:39,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {2568#(<= ~counter~0 2)} ~cond := #in~cond; {2568#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:39,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {2568#(<= ~counter~0 2)} assume !(0 == ~cond); {2568#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:39,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {2568#(<= ~counter~0 2)} assume true; {2568#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:39,952 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2568#(<= ~counter~0 2)} {2568#(<= ~counter~0 2)} #63#return; {2568#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:39,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {2568#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2568#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:39,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {2568#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2568#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:39,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {2568#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2596#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:39,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {2596#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {2596#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:39,953 INFO L272 TraceCheckUtils]: 37: Hoare triple {2596#(<= ~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)); {2596#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:39,954 INFO L290 TraceCheckUtils]: 38: Hoare triple {2596#(<= ~counter~0 3)} ~cond := #in~cond; {2596#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:39,954 INFO L290 TraceCheckUtils]: 39: Hoare triple {2596#(<= ~counter~0 3)} assume !(0 == ~cond); {2596#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:39,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {2596#(<= ~counter~0 3)} assume true; {2596#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:39,955 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2596#(<= ~counter~0 3)} {2596#(<= ~counter~0 3)} #63#return; {2596#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:39,955 INFO L290 TraceCheckUtils]: 42: Hoare triple {2596#(<= ~counter~0 3)} assume !!(0 != ~r~0); {2596#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:39,955 INFO L290 TraceCheckUtils]: 43: Hoare triple {2596#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2596#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:39,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {2596#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2624#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:39,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {2624#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {2624#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:39,957 INFO L272 TraceCheckUtils]: 46: Hoare triple {2624#(<= ~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)); {2624#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:39,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {2624#(<= ~counter~0 4)} ~cond := #in~cond; {2624#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:39,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {2624#(<= ~counter~0 4)} assume !(0 == ~cond); {2624#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:39,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {2624#(<= ~counter~0 4)} assume true; {2624#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:39,958 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2624#(<= ~counter~0 4)} {2624#(<= ~counter~0 4)} #63#return; {2624#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:39,958 INFO L290 TraceCheckUtils]: 51: Hoare triple {2624#(<= ~counter~0 4)} assume !!(0 != ~r~0); {2624#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:39,958 INFO L290 TraceCheckUtils]: 52: Hoare triple {2624#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2624#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:39,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {2624#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2652#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:39,959 INFO L290 TraceCheckUtils]: 54: Hoare triple {2652#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {2652#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:39,960 INFO L272 TraceCheckUtils]: 55: Hoare triple {2652#(<= ~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)); {2652#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:39,960 INFO L290 TraceCheckUtils]: 56: Hoare triple {2652#(<= ~counter~0 5)} ~cond := #in~cond; {2652#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:39,960 INFO L290 TraceCheckUtils]: 57: Hoare triple {2652#(<= ~counter~0 5)} assume !(0 == ~cond); {2652#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:39,961 INFO L290 TraceCheckUtils]: 58: Hoare triple {2652#(<= ~counter~0 5)} assume true; {2652#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:39,961 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2652#(<= ~counter~0 5)} {2652#(<= ~counter~0 5)} #63#return; {2652#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:39,961 INFO L290 TraceCheckUtils]: 60: Hoare triple {2652#(<= ~counter~0 5)} assume !!(0 != ~r~0); {2652#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:39,963 INFO L290 TraceCheckUtils]: 61: Hoare triple {2652#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2652#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:39,963 INFO L290 TraceCheckUtils]: 62: Hoare triple {2652#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2680#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:39,963 INFO L290 TraceCheckUtils]: 63: Hoare triple {2680#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {2680#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:39,964 INFO L272 TraceCheckUtils]: 64: Hoare triple {2680#(<= ~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)); {2680#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:39,964 INFO L290 TraceCheckUtils]: 65: Hoare triple {2680#(<= ~counter~0 6)} ~cond := #in~cond; {2680#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:39,964 INFO L290 TraceCheckUtils]: 66: Hoare triple {2680#(<= ~counter~0 6)} assume !(0 == ~cond); {2680#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:39,965 INFO L290 TraceCheckUtils]: 67: Hoare triple {2680#(<= ~counter~0 6)} assume true; {2680#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:39,965 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2680#(<= ~counter~0 6)} {2680#(<= ~counter~0 6)} #63#return; {2680#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:39,966 INFO L290 TraceCheckUtils]: 69: Hoare triple {2680#(<= ~counter~0 6)} assume !!(0 != ~r~0); {2680#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:39,968 INFO L290 TraceCheckUtils]: 70: Hoare triple {2680#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2680#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:39,969 INFO L290 TraceCheckUtils]: 71: Hoare triple {2680#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2708#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:39,975 INFO L290 TraceCheckUtils]: 72: Hoare triple {2708#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {2708#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:39,978 INFO L272 TraceCheckUtils]: 73: Hoare triple {2708#(<= ~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)); {2708#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:39,980 INFO L290 TraceCheckUtils]: 74: Hoare triple {2708#(<= ~counter~0 7)} ~cond := #in~cond; {2708#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:39,980 INFO L290 TraceCheckUtils]: 75: Hoare triple {2708#(<= ~counter~0 7)} assume !(0 == ~cond); {2708#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:39,981 INFO L290 TraceCheckUtils]: 76: Hoare triple {2708#(<= ~counter~0 7)} assume true; {2708#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:39,981 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2708#(<= ~counter~0 7)} {2708#(<= ~counter~0 7)} #63#return; {2708#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:39,982 INFO L290 TraceCheckUtils]: 78: Hoare triple {2708#(<= ~counter~0 7)} assume !!(0 != ~r~0); {2708#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:39,982 INFO L290 TraceCheckUtils]: 79: Hoare triple {2708#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2708#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:39,982 INFO L290 TraceCheckUtils]: 80: Hoare triple {2708#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2736#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:39,983 INFO L290 TraceCheckUtils]: 81: Hoare triple {2736#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {2736#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:39,983 INFO L272 TraceCheckUtils]: 82: Hoare triple {2736#(<= ~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)); {2736#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:39,983 INFO L290 TraceCheckUtils]: 83: Hoare triple {2736#(<= ~counter~0 8)} ~cond := #in~cond; {2736#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:39,984 INFO L290 TraceCheckUtils]: 84: Hoare triple {2736#(<= ~counter~0 8)} assume !(0 == ~cond); {2736#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:39,984 INFO L290 TraceCheckUtils]: 85: Hoare triple {2736#(<= ~counter~0 8)} assume true; {2736#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:39,984 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2736#(<= ~counter~0 8)} {2736#(<= ~counter~0 8)} #63#return; {2736#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:39,985 INFO L290 TraceCheckUtils]: 87: Hoare triple {2736#(<= ~counter~0 8)} assume !!(0 != ~r~0); {2736#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:39,985 INFO L290 TraceCheckUtils]: 88: Hoare triple {2736#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2736#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:39,985 INFO L290 TraceCheckUtils]: 89: Hoare triple {2736#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2764#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:39,986 INFO L290 TraceCheckUtils]: 90: Hoare triple {2764#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {2764#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:39,986 INFO L272 TraceCheckUtils]: 91: Hoare triple {2764#(<= ~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)); {2764#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:39,986 INFO L290 TraceCheckUtils]: 92: Hoare triple {2764#(<= ~counter~0 9)} ~cond := #in~cond; {2764#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:39,987 INFO L290 TraceCheckUtils]: 93: Hoare triple {2764#(<= ~counter~0 9)} assume !(0 == ~cond); {2764#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:39,987 INFO L290 TraceCheckUtils]: 94: Hoare triple {2764#(<= ~counter~0 9)} assume true; {2764#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:39,987 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2764#(<= ~counter~0 9)} {2764#(<= ~counter~0 9)} #63#return; {2764#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:39,988 INFO L290 TraceCheckUtils]: 96: Hoare triple {2764#(<= ~counter~0 9)} assume !!(0 != ~r~0); {2764#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:39,988 INFO L290 TraceCheckUtils]: 97: Hoare triple {2764#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2764#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:39,988 INFO L290 TraceCheckUtils]: 98: Hoare triple {2764#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2792#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:39,989 INFO L290 TraceCheckUtils]: 99: Hoare triple {2792#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {2792#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:39,989 INFO L272 TraceCheckUtils]: 100: Hoare triple {2792#(<= ~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)); {2792#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:39,989 INFO L290 TraceCheckUtils]: 101: Hoare triple {2792#(<= ~counter~0 10)} ~cond := #in~cond; {2792#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:39,990 INFO L290 TraceCheckUtils]: 102: Hoare triple {2792#(<= ~counter~0 10)} assume !(0 == ~cond); {2792#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:39,990 INFO L290 TraceCheckUtils]: 103: Hoare triple {2792#(<= ~counter~0 10)} assume true; {2792#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:39,991 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2792#(<= ~counter~0 10)} {2792#(<= ~counter~0 10)} #63#return; {2792#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:39,991 INFO L290 TraceCheckUtils]: 105: Hoare triple {2792#(<= ~counter~0 10)} assume !!(0 != ~r~0); {2792#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:39,991 INFO L290 TraceCheckUtils]: 106: Hoare triple {2792#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2792#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:39,991 INFO L290 TraceCheckUtils]: 107: Hoare triple {2792#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2820#(<= |main_#t~post6| 10)} is VALID [2022-04-07 14:03:39,992 INFO L290 TraceCheckUtils]: 108: Hoare triple {2820#(<= |main_#t~post6| 10)} assume !(#t~post6 < 100);havoc #t~post6; {2484#false} is VALID [2022-04-07 14:03:39,992 INFO L272 TraceCheckUtils]: 109: Hoare triple {2484#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2484#false} is VALID [2022-04-07 14:03:39,992 INFO L290 TraceCheckUtils]: 110: Hoare triple {2484#false} ~cond := #in~cond; {2484#false} is VALID [2022-04-07 14:03:39,992 INFO L290 TraceCheckUtils]: 111: Hoare triple {2484#false} assume 0 == ~cond; {2484#false} is VALID [2022-04-07 14:03:39,992 INFO L290 TraceCheckUtils]: 112: Hoare triple {2484#false} assume !false; {2484#false} is VALID [2022-04-07 14:03:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 14:03:39,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:03:40,675 INFO L290 TraceCheckUtils]: 112: Hoare triple {2484#false} assume !false; {2484#false} is VALID [2022-04-07 14:03:40,676 INFO L290 TraceCheckUtils]: 111: Hoare triple {2484#false} assume 0 == ~cond; {2484#false} is VALID [2022-04-07 14:03:40,676 INFO L290 TraceCheckUtils]: 110: Hoare triple {2484#false} ~cond := #in~cond; {2484#false} is VALID [2022-04-07 14:03:40,676 INFO L272 TraceCheckUtils]: 109: Hoare triple {2484#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2484#false} is VALID [2022-04-07 14:03:40,676 INFO L290 TraceCheckUtils]: 108: Hoare triple {2848#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {2484#false} is VALID [2022-04-07 14:03:40,676 INFO L290 TraceCheckUtils]: 107: Hoare triple {2852#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2848#(< |main_#t~post6| 100)} is VALID [2022-04-07 14:03:40,677 INFO L290 TraceCheckUtils]: 106: Hoare triple {2852#(< ~counter~0 100)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2852#(< ~counter~0 100)} is VALID [2022-04-07 14:03:40,677 INFO L290 TraceCheckUtils]: 105: Hoare triple {2852#(< ~counter~0 100)} assume !!(0 != ~r~0); {2852#(< ~counter~0 100)} is VALID [2022-04-07 14:03:40,678 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2483#true} {2852#(< ~counter~0 100)} #63#return; {2852#(< ~counter~0 100)} is VALID [2022-04-07 14:03:40,678 INFO L290 TraceCheckUtils]: 103: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 14:03:40,678 INFO L290 TraceCheckUtils]: 102: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 14:03:40,678 INFO L290 TraceCheckUtils]: 101: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 14:03:40,678 INFO L272 TraceCheckUtils]: 100: Hoare triple {2852#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 14:03:40,678 INFO L290 TraceCheckUtils]: 99: Hoare triple {2852#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {2852#(< ~counter~0 100)} is VALID [2022-04-07 14:03:40,679 INFO L290 TraceCheckUtils]: 98: Hoare triple {2880#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2852#(< ~counter~0 100)} is VALID [2022-04-07 14:03:40,679 INFO L290 TraceCheckUtils]: 97: Hoare triple {2880#(< ~counter~0 99)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2880#(< ~counter~0 99)} is VALID [2022-04-07 14:03:40,679 INFO L290 TraceCheckUtils]: 96: Hoare triple {2880#(< ~counter~0 99)} assume !!(0 != ~r~0); {2880#(< ~counter~0 99)} is VALID [2022-04-07 14:03:40,680 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2483#true} {2880#(< ~counter~0 99)} #63#return; {2880#(< ~counter~0 99)} is VALID [2022-04-07 14:03:40,680 INFO L290 TraceCheckUtils]: 94: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 14:03:40,680 INFO L290 TraceCheckUtils]: 93: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 14:03:40,680 INFO L290 TraceCheckUtils]: 92: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 14:03:40,680 INFO L272 TraceCheckUtils]: 91: Hoare triple {2880#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 14:03:40,681 INFO L290 TraceCheckUtils]: 90: Hoare triple {2880#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {2880#(< ~counter~0 99)} is VALID [2022-04-07 14:03:40,681 INFO L290 TraceCheckUtils]: 89: Hoare triple {2908#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2880#(< ~counter~0 99)} is VALID [2022-04-07 14:03:40,681 INFO L290 TraceCheckUtils]: 88: Hoare triple {2908#(< ~counter~0 98)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2908#(< ~counter~0 98)} is VALID [2022-04-07 14:03:40,682 INFO L290 TraceCheckUtils]: 87: Hoare triple {2908#(< ~counter~0 98)} assume !!(0 != ~r~0); {2908#(< ~counter~0 98)} is VALID [2022-04-07 14:03:40,682 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2483#true} {2908#(< ~counter~0 98)} #63#return; {2908#(< ~counter~0 98)} is VALID [2022-04-07 14:03:40,682 INFO L290 TraceCheckUtils]: 85: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 14:03:40,682 INFO L290 TraceCheckUtils]: 84: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 14:03:40,682 INFO L290 TraceCheckUtils]: 83: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 14:03:40,682 INFO L272 TraceCheckUtils]: 82: Hoare triple {2908#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 14:03:40,683 INFO L290 TraceCheckUtils]: 81: Hoare triple {2908#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {2908#(< ~counter~0 98)} is VALID [2022-04-07 14:03:40,683 INFO L290 TraceCheckUtils]: 80: Hoare triple {2936#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2908#(< ~counter~0 98)} is VALID [2022-04-07 14:03:40,683 INFO L290 TraceCheckUtils]: 79: Hoare triple {2936#(< ~counter~0 97)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2936#(< ~counter~0 97)} is VALID [2022-04-07 14:03:40,684 INFO L290 TraceCheckUtils]: 78: Hoare triple {2936#(< ~counter~0 97)} assume !!(0 != ~r~0); {2936#(< ~counter~0 97)} is VALID [2022-04-07 14:03:40,684 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2483#true} {2936#(< ~counter~0 97)} #63#return; {2936#(< ~counter~0 97)} is VALID [2022-04-07 14:03:40,684 INFO L290 TraceCheckUtils]: 76: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 14:03:40,684 INFO L290 TraceCheckUtils]: 75: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 14:03:40,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 14:03:40,685 INFO L272 TraceCheckUtils]: 73: Hoare triple {2936#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 14:03:40,685 INFO L290 TraceCheckUtils]: 72: Hoare triple {2936#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {2936#(< ~counter~0 97)} is VALID [2022-04-07 14:03:40,685 INFO L290 TraceCheckUtils]: 71: Hoare triple {2964#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2936#(< ~counter~0 97)} is VALID [2022-04-07 14:03:40,686 INFO L290 TraceCheckUtils]: 70: Hoare triple {2964#(< ~counter~0 96)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2964#(< ~counter~0 96)} is VALID [2022-04-07 14:03:40,686 INFO L290 TraceCheckUtils]: 69: Hoare triple {2964#(< ~counter~0 96)} assume !!(0 != ~r~0); {2964#(< ~counter~0 96)} is VALID [2022-04-07 14:03:40,687 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2483#true} {2964#(< ~counter~0 96)} #63#return; {2964#(< ~counter~0 96)} is VALID [2022-04-07 14:03:40,687 INFO L290 TraceCheckUtils]: 67: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 14:03:40,687 INFO L290 TraceCheckUtils]: 66: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 14:03:40,687 INFO L290 TraceCheckUtils]: 65: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 14:03:40,687 INFO L272 TraceCheckUtils]: 64: Hoare triple {2964#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 14:03:40,687 INFO L290 TraceCheckUtils]: 63: Hoare triple {2964#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {2964#(< ~counter~0 96)} is VALID [2022-04-07 14:03:40,688 INFO L290 TraceCheckUtils]: 62: Hoare triple {2992#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2964#(< ~counter~0 96)} is VALID [2022-04-07 14:03:40,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {2992#(< ~counter~0 95)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2992#(< ~counter~0 95)} is VALID [2022-04-07 14:03:40,688 INFO L290 TraceCheckUtils]: 60: Hoare triple {2992#(< ~counter~0 95)} assume !!(0 != ~r~0); {2992#(< ~counter~0 95)} is VALID [2022-04-07 14:03:40,689 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2483#true} {2992#(< ~counter~0 95)} #63#return; {2992#(< ~counter~0 95)} is VALID [2022-04-07 14:03:40,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 14:03:40,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 14:03:40,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 14:03:40,689 INFO L272 TraceCheckUtils]: 55: Hoare triple {2992#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 14:03:40,689 INFO L290 TraceCheckUtils]: 54: Hoare triple {2992#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {2992#(< ~counter~0 95)} is VALID [2022-04-07 14:03:40,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {3020#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2992#(< ~counter~0 95)} is VALID [2022-04-07 14:03:40,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {3020#(< ~counter~0 94)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3020#(< ~counter~0 94)} is VALID [2022-04-07 14:03:40,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {3020#(< ~counter~0 94)} assume !!(0 != ~r~0); {3020#(< ~counter~0 94)} is VALID [2022-04-07 14:03:40,691 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2483#true} {3020#(< ~counter~0 94)} #63#return; {3020#(< ~counter~0 94)} is VALID [2022-04-07 14:03:40,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 14:03:40,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 14:03:40,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 14:03:40,691 INFO L272 TraceCheckUtils]: 46: Hoare triple {3020#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 14:03:40,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {3020#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {3020#(< ~counter~0 94)} is VALID [2022-04-07 14:03:40,692 INFO L290 TraceCheckUtils]: 44: Hoare triple {3048#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3020#(< ~counter~0 94)} is VALID [2022-04-07 14:03:40,692 INFO L290 TraceCheckUtils]: 43: Hoare triple {3048#(< ~counter~0 93)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3048#(< ~counter~0 93)} is VALID [2022-04-07 14:03:40,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {3048#(< ~counter~0 93)} assume !!(0 != ~r~0); {3048#(< ~counter~0 93)} is VALID [2022-04-07 14:03:40,693 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2483#true} {3048#(< ~counter~0 93)} #63#return; {3048#(< ~counter~0 93)} is VALID [2022-04-07 14:03:40,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 14:03:40,693 INFO L290 TraceCheckUtils]: 39: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 14:03:40,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 14:03:40,693 INFO L272 TraceCheckUtils]: 37: Hoare triple {3048#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 14:03:40,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {3048#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {3048#(< ~counter~0 93)} is VALID [2022-04-07 14:03:40,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {3076#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3048#(< ~counter~0 93)} is VALID [2022-04-07 14:03:40,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {3076#(< ~counter~0 92)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3076#(< ~counter~0 92)} is VALID [2022-04-07 14:03:40,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {3076#(< ~counter~0 92)} assume !!(0 != ~r~0); {3076#(< ~counter~0 92)} is VALID [2022-04-07 14:03:40,695 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2483#true} {3076#(< ~counter~0 92)} #63#return; {3076#(< ~counter~0 92)} is VALID [2022-04-07 14:03:40,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 14:03:40,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 14:03:40,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 14:03:40,695 INFO L272 TraceCheckUtils]: 28: Hoare triple {3076#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 14:03:40,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {3076#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {3076#(< ~counter~0 92)} is VALID [2022-04-07 14:03:40,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {3104#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3076#(< ~counter~0 92)} is VALID [2022-04-07 14:03:40,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {3104#(< ~counter~0 91)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3104#(< ~counter~0 91)} is VALID [2022-04-07 14:03:40,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {3104#(< ~counter~0 91)} assume !!(0 != ~r~0); {3104#(< ~counter~0 91)} is VALID [2022-04-07 14:03:40,697 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2483#true} {3104#(< ~counter~0 91)} #63#return; {3104#(< ~counter~0 91)} is VALID [2022-04-07 14:03:40,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 14:03:40,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 14:03:40,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 14:03:40,697 INFO L272 TraceCheckUtils]: 19: Hoare triple {3104#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 14:03:40,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {3104#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {3104#(< ~counter~0 91)} is VALID [2022-04-07 14:03:40,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {3132#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3104#(< ~counter~0 91)} is VALID [2022-04-07 14:03:40,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {3132#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3132#(< ~counter~0 90)} is VALID [2022-04-07 14:03:40,698 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2483#true} {3132#(< ~counter~0 90)} #61#return; {3132#(< ~counter~0 90)} is VALID [2022-04-07 14:03:40,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 14:03:40,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 14:03:40,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 14:03:40,699 INFO L272 TraceCheckUtils]: 11: Hoare triple {3132#(< ~counter~0 90)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2483#true} is VALID [2022-04-07 14:03:40,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2483#true} {3132#(< ~counter~0 90)} #59#return; {3132#(< ~counter~0 90)} is VALID [2022-04-07 14:03:40,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 14:03:40,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 14:03:40,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 14:03:40,699 INFO L272 TraceCheckUtils]: 6: Hoare triple {3132#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 14:03:40,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {3132#(< ~counter~0 90)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3132#(< ~counter~0 90)} is VALID [2022-04-07 14:03:40,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {3132#(< ~counter~0 90)} call #t~ret7 := main(); {3132#(< ~counter~0 90)} is VALID [2022-04-07 14:03:40,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3132#(< ~counter~0 90)} {2483#true} #67#return; {3132#(< ~counter~0 90)} is VALID [2022-04-07 14:03:40,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {3132#(< ~counter~0 90)} assume true; {3132#(< ~counter~0 90)} is VALID [2022-04-07 14:03:40,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {2483#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3132#(< ~counter~0 90)} is VALID [2022-04-07 14:03:40,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {2483#true} call ULTIMATE.init(); {2483#true} is VALID [2022-04-07 14:03:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-07 14:03:40,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:40,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899199999] [2022-04-07 14:03:40,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:40,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536511384] [2022-04-07 14:03:40,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536511384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:03:40,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:03:40,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-07 14:03:40,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39340950] [2022-04-07 14:03:40,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:03:40,706 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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 113 [2022-04-07 14:03:40,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:40,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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:40,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:03:40,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 14:03:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:40,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 14:03:40,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-07 14:03:40,831 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:41,885 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2022-04-07 14:03:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-07 14:03:41,886 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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 113 [2022-04-07 14:03:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 256 transitions. [2022-04-07 14:03:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 256 transitions. [2022-04-07 14:03:41,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 256 transitions. [2022-04-07 14:03:42,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:03:42,069 INFO L225 Difference]: With dead ends: 223 [2022-04-07 14:03:42,069 INFO L226 Difference]: Without dead ends: 218 [2022-04-07 14:03:42,070 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-07 14:03:42,070 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 232 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:42,070 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 302 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 14:03:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-07 14:03:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-04-07 14:03:42,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:42,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 14:03:42,129 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 14:03:42,130 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 14:03:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:42,135 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-04-07 14:03:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-07 14:03:42,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:42,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:42,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 218 states. [2022-04-07 14:03:42,137 INFO L87 Difference]: Start difference. First operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 218 states. [2022-04-07 14:03:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:42,144 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-04-07 14:03:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-07 14:03:42,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:42,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:42,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:42,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 14:03:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2022-04-07 14:03:42,149 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 113 [2022-04-07 14:03:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:42,150 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions. [2022-04-07 14:03:42,150 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-07 14:03:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-04-07 14:03:42,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:42,153 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:03:42,161 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:03:42,359 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:03:42,359 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:42,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:42,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1234385578, now seen corresponding path program 4 times [2022-04-07 14:03:42,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:42,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69689836] [2022-04-07 14:03:42,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:42,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:42,387 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:42,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [878902392] [2022-04-07 14:03:42,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 14:03:42,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:42,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:42,388 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:03:42,389 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:03:42,608 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 14:03:42,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:42,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-07 14:03:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:42,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:43,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {4259#true} call ULTIMATE.init(); {4259#true} is VALID [2022-04-07 14:03:43,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {4259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {4267#(<= ~counter~0 0)} assume true; {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4267#(<= ~counter~0 0)} {4259#true} #67#return; {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {4267#(<= ~counter~0 0)} call #t~ret7 := main(); {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {4267#(<= ~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; {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {4267#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {4267#(<= ~counter~0 0)} ~cond := #in~cond; {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {4267#(<= ~counter~0 0)} assume !(0 == ~cond); {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {4267#(<= ~counter~0 0)} assume true; {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,815 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4267#(<= ~counter~0 0)} {4267#(<= ~counter~0 0)} #59#return; {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,815 INFO L272 TraceCheckUtils]: 11: Hoare triple {4267#(<= ~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)); {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {4267#(<= ~counter~0 0)} ~cond := #in~cond; {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {4267#(<= ~counter~0 0)} assume !(0 == ~cond); {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {4267#(<= ~counter~0 0)} assume true; {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,817 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4267#(<= ~counter~0 0)} {4267#(<= ~counter~0 0)} #61#return; {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {4267#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4267#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:43,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {4267#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4316#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:43,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {4316#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {4316#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:43,818 INFO L272 TraceCheckUtils]: 19: Hoare triple {4316#(<= ~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)); {4316#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:43,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {4316#(<= ~counter~0 1)} ~cond := #in~cond; {4316#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:43,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {4316#(<= ~counter~0 1)} assume !(0 == ~cond); {4316#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:43,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {4316#(<= ~counter~0 1)} assume true; {4316#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:43,819 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4316#(<= ~counter~0 1)} {4316#(<= ~counter~0 1)} #63#return; {4316#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:43,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {4316#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4316#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:43,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {4316#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4316#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:43,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {4316#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4344#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:43,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {4344#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {4344#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:43,821 INFO L272 TraceCheckUtils]: 28: Hoare triple {4344#(<= ~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)); {4344#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:43,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {4344#(<= ~counter~0 2)} ~cond := #in~cond; {4344#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:43,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {4344#(<= ~counter~0 2)} assume !(0 == ~cond); {4344#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:43,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {4344#(<= ~counter~0 2)} assume true; {4344#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:43,822 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4344#(<= ~counter~0 2)} {4344#(<= ~counter~0 2)} #63#return; {4344#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:43,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {4344#(<= ~counter~0 2)} assume !!(0 != ~r~0); {4344#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:43,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {4344#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4344#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:43,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {4344#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4372#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:43,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {4372#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {4372#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:43,823 INFO L272 TraceCheckUtils]: 37: Hoare triple {4372#(<= ~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)); {4372#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:43,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {4372#(<= ~counter~0 3)} ~cond := #in~cond; {4372#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:43,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {4372#(<= ~counter~0 3)} assume !(0 == ~cond); {4372#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:43,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {4372#(<= ~counter~0 3)} assume true; {4372#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:43,825 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4372#(<= ~counter~0 3)} {4372#(<= ~counter~0 3)} #63#return; {4372#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:43,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {4372#(<= ~counter~0 3)} assume !!(0 != ~r~0); {4372#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:43,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {4372#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4372#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:43,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {4372#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4400#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:43,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {4400#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {4400#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:43,826 INFO L272 TraceCheckUtils]: 46: Hoare triple {4400#(<= ~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)); {4400#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:43,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {4400#(<= ~counter~0 4)} ~cond := #in~cond; {4400#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:43,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {4400#(<= ~counter~0 4)} assume !(0 == ~cond); {4400#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:43,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {4400#(<= ~counter~0 4)} assume true; {4400#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:43,827 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4400#(<= ~counter~0 4)} {4400#(<= ~counter~0 4)} #63#return; {4400#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:43,827 INFO L290 TraceCheckUtils]: 51: Hoare triple {4400#(<= ~counter~0 4)} assume !!(0 != ~r~0); {4400#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:43,828 INFO L290 TraceCheckUtils]: 52: Hoare triple {4400#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4400#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:43,828 INFO L290 TraceCheckUtils]: 53: Hoare triple {4400#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4428#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:43,828 INFO L290 TraceCheckUtils]: 54: Hoare triple {4428#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {4428#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:43,829 INFO L272 TraceCheckUtils]: 55: Hoare triple {4428#(<= ~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)); {4428#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:43,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {4428#(<= ~counter~0 5)} ~cond := #in~cond; {4428#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:43,829 INFO L290 TraceCheckUtils]: 57: Hoare triple {4428#(<= ~counter~0 5)} assume !(0 == ~cond); {4428#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:43,829 INFO L290 TraceCheckUtils]: 58: Hoare triple {4428#(<= ~counter~0 5)} assume true; {4428#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:43,830 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4428#(<= ~counter~0 5)} {4428#(<= ~counter~0 5)} #63#return; {4428#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:43,830 INFO L290 TraceCheckUtils]: 60: Hoare triple {4428#(<= ~counter~0 5)} assume !!(0 != ~r~0); {4428#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:43,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {4428#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4428#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:43,835 INFO L290 TraceCheckUtils]: 62: Hoare triple {4428#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4456#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:43,835 INFO L290 TraceCheckUtils]: 63: Hoare triple {4456#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {4456#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:43,836 INFO L272 TraceCheckUtils]: 64: Hoare triple {4456#(<= ~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)); {4456#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:43,836 INFO L290 TraceCheckUtils]: 65: Hoare triple {4456#(<= ~counter~0 6)} ~cond := #in~cond; {4456#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:43,836 INFO L290 TraceCheckUtils]: 66: Hoare triple {4456#(<= ~counter~0 6)} assume !(0 == ~cond); {4456#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:43,836 INFO L290 TraceCheckUtils]: 67: Hoare triple {4456#(<= ~counter~0 6)} assume true; {4456#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:43,837 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4456#(<= ~counter~0 6)} {4456#(<= ~counter~0 6)} #63#return; {4456#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:43,837 INFO L290 TraceCheckUtils]: 69: Hoare triple {4456#(<= ~counter~0 6)} assume !!(0 != ~r~0); {4456#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:43,837 INFO L290 TraceCheckUtils]: 70: Hoare triple {4456#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4456#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:43,838 INFO L290 TraceCheckUtils]: 71: Hoare triple {4456#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4484#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:43,838 INFO L290 TraceCheckUtils]: 72: Hoare triple {4484#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {4484#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:43,839 INFO L272 TraceCheckUtils]: 73: Hoare triple {4484#(<= ~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)); {4484#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:43,839 INFO L290 TraceCheckUtils]: 74: Hoare triple {4484#(<= ~counter~0 7)} ~cond := #in~cond; {4484#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:43,839 INFO L290 TraceCheckUtils]: 75: Hoare triple {4484#(<= ~counter~0 7)} assume !(0 == ~cond); {4484#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:43,839 INFO L290 TraceCheckUtils]: 76: Hoare triple {4484#(<= ~counter~0 7)} assume true; {4484#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:43,840 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4484#(<= ~counter~0 7)} {4484#(<= ~counter~0 7)} #63#return; {4484#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:43,840 INFO L290 TraceCheckUtils]: 78: Hoare triple {4484#(<= ~counter~0 7)} assume !!(0 != ~r~0); {4484#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:43,840 INFO L290 TraceCheckUtils]: 79: Hoare triple {4484#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4484#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:43,841 INFO L290 TraceCheckUtils]: 80: Hoare triple {4484#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4512#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:43,841 INFO L290 TraceCheckUtils]: 81: Hoare triple {4512#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {4512#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:43,841 INFO L272 TraceCheckUtils]: 82: Hoare triple {4512#(<= ~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)); {4512#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:43,841 INFO L290 TraceCheckUtils]: 83: Hoare triple {4512#(<= ~counter~0 8)} ~cond := #in~cond; {4512#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:43,842 INFO L290 TraceCheckUtils]: 84: Hoare triple {4512#(<= ~counter~0 8)} assume !(0 == ~cond); {4512#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:43,842 INFO L290 TraceCheckUtils]: 85: Hoare triple {4512#(<= ~counter~0 8)} assume true; {4512#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:43,842 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4512#(<= ~counter~0 8)} {4512#(<= ~counter~0 8)} #63#return; {4512#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:43,843 INFO L290 TraceCheckUtils]: 87: Hoare triple {4512#(<= ~counter~0 8)} assume !!(0 != ~r~0); {4512#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:43,843 INFO L290 TraceCheckUtils]: 88: Hoare triple {4512#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4512#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:43,843 INFO L290 TraceCheckUtils]: 89: Hoare triple {4512#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4540#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:43,844 INFO L290 TraceCheckUtils]: 90: Hoare triple {4540#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {4540#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:43,844 INFO L272 TraceCheckUtils]: 91: Hoare triple {4540#(<= ~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)); {4540#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:43,844 INFO L290 TraceCheckUtils]: 92: Hoare triple {4540#(<= ~counter~0 9)} ~cond := #in~cond; {4540#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:43,844 INFO L290 TraceCheckUtils]: 93: Hoare triple {4540#(<= ~counter~0 9)} assume !(0 == ~cond); {4540#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:43,845 INFO L290 TraceCheckUtils]: 94: Hoare triple {4540#(<= ~counter~0 9)} assume true; {4540#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:43,845 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {4540#(<= ~counter~0 9)} {4540#(<= ~counter~0 9)} #63#return; {4540#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:43,845 INFO L290 TraceCheckUtils]: 96: Hoare triple {4540#(<= ~counter~0 9)} assume !!(0 != ~r~0); {4540#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:43,846 INFO L290 TraceCheckUtils]: 97: Hoare triple {4540#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4540#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:43,846 INFO L290 TraceCheckUtils]: 98: Hoare triple {4540#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4568#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:43,846 INFO L290 TraceCheckUtils]: 99: Hoare triple {4568#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {4568#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:43,847 INFO L272 TraceCheckUtils]: 100: Hoare triple {4568#(<= ~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)); {4568#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:43,847 INFO L290 TraceCheckUtils]: 101: Hoare triple {4568#(<= ~counter~0 10)} ~cond := #in~cond; {4568#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:43,847 INFO L290 TraceCheckUtils]: 102: Hoare triple {4568#(<= ~counter~0 10)} assume !(0 == ~cond); {4568#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:43,847 INFO L290 TraceCheckUtils]: 103: Hoare triple {4568#(<= ~counter~0 10)} assume true; {4568#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:43,848 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {4568#(<= ~counter~0 10)} {4568#(<= ~counter~0 10)} #63#return; {4568#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:43,848 INFO L290 TraceCheckUtils]: 105: Hoare triple {4568#(<= ~counter~0 10)} assume !!(0 != ~r~0); {4568#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:43,848 INFO L290 TraceCheckUtils]: 106: Hoare triple {4568#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4568#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:43,849 INFO L290 TraceCheckUtils]: 107: Hoare triple {4568#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4596#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:43,849 INFO L290 TraceCheckUtils]: 108: Hoare triple {4596#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {4596#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:43,849 INFO L272 TraceCheckUtils]: 109: Hoare triple {4596#(<= ~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)); {4596#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:43,850 INFO L290 TraceCheckUtils]: 110: Hoare triple {4596#(<= ~counter~0 11)} ~cond := #in~cond; {4596#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:43,850 INFO L290 TraceCheckUtils]: 111: Hoare triple {4596#(<= ~counter~0 11)} assume !(0 == ~cond); {4596#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:43,850 INFO L290 TraceCheckUtils]: 112: Hoare triple {4596#(<= ~counter~0 11)} assume true; {4596#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:43,851 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {4596#(<= ~counter~0 11)} {4596#(<= ~counter~0 11)} #63#return; {4596#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:43,851 INFO L290 TraceCheckUtils]: 114: Hoare triple {4596#(<= ~counter~0 11)} assume !!(0 != ~r~0); {4596#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:43,859 INFO L290 TraceCheckUtils]: 115: Hoare triple {4596#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4596#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:43,867 INFO L290 TraceCheckUtils]: 116: Hoare triple {4596#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4624#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:43,867 INFO L290 TraceCheckUtils]: 117: Hoare triple {4624#(<= ~counter~0 12)} assume !!(#t~post6 < 100);havoc #t~post6; {4624#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:43,868 INFO L272 TraceCheckUtils]: 118: Hoare triple {4624#(<= ~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)); {4624#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:43,868 INFO L290 TraceCheckUtils]: 119: Hoare triple {4624#(<= ~counter~0 12)} ~cond := #in~cond; {4624#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:43,868 INFO L290 TraceCheckUtils]: 120: Hoare triple {4624#(<= ~counter~0 12)} assume !(0 == ~cond); {4624#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:43,869 INFO L290 TraceCheckUtils]: 121: Hoare triple {4624#(<= ~counter~0 12)} assume true; {4624#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:43,869 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {4624#(<= ~counter~0 12)} {4624#(<= ~counter~0 12)} #63#return; {4624#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:43,870 INFO L290 TraceCheckUtils]: 123: Hoare triple {4624#(<= ~counter~0 12)} assume !!(0 != ~r~0); {4624#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:43,870 INFO L290 TraceCheckUtils]: 124: Hoare triple {4624#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4624#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:43,870 INFO L290 TraceCheckUtils]: 125: Hoare triple {4624#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4652#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:43,871 INFO L290 TraceCheckUtils]: 126: Hoare triple {4652#(<= ~counter~0 13)} assume !!(#t~post6 < 100);havoc #t~post6; {4652#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:43,871 INFO L272 TraceCheckUtils]: 127: Hoare triple {4652#(<= ~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)); {4652#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:43,872 INFO L290 TraceCheckUtils]: 128: Hoare triple {4652#(<= ~counter~0 13)} ~cond := #in~cond; {4652#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:43,872 INFO L290 TraceCheckUtils]: 129: Hoare triple {4652#(<= ~counter~0 13)} assume !(0 == ~cond); {4652#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:43,872 INFO L290 TraceCheckUtils]: 130: Hoare triple {4652#(<= ~counter~0 13)} assume true; {4652#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:43,873 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {4652#(<= ~counter~0 13)} {4652#(<= ~counter~0 13)} #63#return; {4652#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:43,873 INFO L290 TraceCheckUtils]: 132: Hoare triple {4652#(<= ~counter~0 13)} assume !!(0 != ~r~0); {4652#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:43,873 INFO L290 TraceCheckUtils]: 133: Hoare triple {4652#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4652#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:43,873 INFO L290 TraceCheckUtils]: 134: Hoare triple {4652#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4680#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:43,874 INFO L290 TraceCheckUtils]: 135: Hoare triple {4680#(<= ~counter~0 14)} assume !!(#t~post6 < 100);havoc #t~post6; {4680#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:43,874 INFO L272 TraceCheckUtils]: 136: Hoare triple {4680#(<= ~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)); {4680#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:43,874 INFO L290 TraceCheckUtils]: 137: Hoare triple {4680#(<= ~counter~0 14)} ~cond := #in~cond; {4680#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:43,875 INFO L290 TraceCheckUtils]: 138: Hoare triple {4680#(<= ~counter~0 14)} assume !(0 == ~cond); {4680#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:43,875 INFO L290 TraceCheckUtils]: 139: Hoare triple {4680#(<= ~counter~0 14)} assume true; {4680#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:43,875 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {4680#(<= ~counter~0 14)} {4680#(<= ~counter~0 14)} #63#return; {4680#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:43,876 INFO L290 TraceCheckUtils]: 141: Hoare triple {4680#(<= ~counter~0 14)} assume !!(0 != ~r~0); {4680#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:43,876 INFO L290 TraceCheckUtils]: 142: Hoare triple {4680#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4680#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:43,876 INFO L290 TraceCheckUtils]: 143: Hoare triple {4680#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4708#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:43,876 INFO L290 TraceCheckUtils]: 144: Hoare triple {4708#(<= ~counter~0 15)} assume !!(#t~post6 < 100);havoc #t~post6; {4708#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:43,877 INFO L272 TraceCheckUtils]: 145: Hoare triple {4708#(<= ~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)); {4708#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:43,877 INFO L290 TraceCheckUtils]: 146: Hoare triple {4708#(<= ~counter~0 15)} ~cond := #in~cond; {4708#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:43,877 INFO L290 TraceCheckUtils]: 147: Hoare triple {4708#(<= ~counter~0 15)} assume !(0 == ~cond); {4708#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:43,878 INFO L290 TraceCheckUtils]: 148: Hoare triple {4708#(<= ~counter~0 15)} assume true; {4708#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:43,878 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {4708#(<= ~counter~0 15)} {4708#(<= ~counter~0 15)} #63#return; {4708#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:43,878 INFO L290 TraceCheckUtils]: 150: Hoare triple {4708#(<= ~counter~0 15)} assume !!(0 != ~r~0); {4708#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:43,879 INFO L290 TraceCheckUtils]: 151: Hoare triple {4708#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4708#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:43,879 INFO L290 TraceCheckUtils]: 152: Hoare triple {4708#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4736#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:43,879 INFO L290 TraceCheckUtils]: 153: Hoare triple {4736#(<= ~counter~0 16)} assume !!(#t~post6 < 100);havoc #t~post6; {4736#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:43,880 INFO L272 TraceCheckUtils]: 154: Hoare triple {4736#(<= ~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)); {4736#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:43,880 INFO L290 TraceCheckUtils]: 155: Hoare triple {4736#(<= ~counter~0 16)} ~cond := #in~cond; {4736#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:43,880 INFO L290 TraceCheckUtils]: 156: Hoare triple {4736#(<= ~counter~0 16)} assume !(0 == ~cond); {4736#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:43,880 INFO L290 TraceCheckUtils]: 157: Hoare triple {4736#(<= ~counter~0 16)} assume true; {4736#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:43,881 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4736#(<= ~counter~0 16)} {4736#(<= ~counter~0 16)} #63#return; {4736#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:43,881 INFO L290 TraceCheckUtils]: 159: Hoare triple {4736#(<= ~counter~0 16)} assume !!(0 != ~r~0); {4736#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:43,882 INFO L290 TraceCheckUtils]: 160: Hoare triple {4736#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4736#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:43,882 INFO L290 TraceCheckUtils]: 161: Hoare triple {4736#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4764#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:43,882 INFO L290 TraceCheckUtils]: 162: Hoare triple {4764#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {4764#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:43,883 INFO L272 TraceCheckUtils]: 163: Hoare triple {4764#(<= ~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)); {4764#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:43,883 INFO L290 TraceCheckUtils]: 164: Hoare triple {4764#(<= ~counter~0 17)} ~cond := #in~cond; {4764#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:43,883 INFO L290 TraceCheckUtils]: 165: Hoare triple {4764#(<= ~counter~0 17)} assume !(0 == ~cond); {4764#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:43,884 INFO L290 TraceCheckUtils]: 166: Hoare triple {4764#(<= ~counter~0 17)} assume true; {4764#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:43,884 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {4764#(<= ~counter~0 17)} {4764#(<= ~counter~0 17)} #63#return; {4764#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:43,884 INFO L290 TraceCheckUtils]: 168: Hoare triple {4764#(<= ~counter~0 17)} assume !!(0 != ~r~0); {4764#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:43,885 INFO L290 TraceCheckUtils]: 169: Hoare triple {4764#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4764#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:43,885 INFO L290 TraceCheckUtils]: 170: Hoare triple {4764#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4792#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:43,885 INFO L290 TraceCheckUtils]: 171: Hoare triple {4792#(<= ~counter~0 18)} assume !!(#t~post6 < 100);havoc #t~post6; {4792#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:43,886 INFO L272 TraceCheckUtils]: 172: Hoare triple {4792#(<= ~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)); {4792#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:43,886 INFO L290 TraceCheckUtils]: 173: Hoare triple {4792#(<= ~counter~0 18)} ~cond := #in~cond; {4792#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:43,886 INFO L290 TraceCheckUtils]: 174: Hoare triple {4792#(<= ~counter~0 18)} assume !(0 == ~cond); {4792#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:43,886 INFO L290 TraceCheckUtils]: 175: Hoare triple {4792#(<= ~counter~0 18)} assume true; {4792#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:43,887 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {4792#(<= ~counter~0 18)} {4792#(<= ~counter~0 18)} #63#return; {4792#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:43,887 INFO L290 TraceCheckUtils]: 177: Hoare triple {4792#(<= ~counter~0 18)} assume !!(0 != ~r~0); {4792#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:43,887 INFO L290 TraceCheckUtils]: 178: Hoare triple {4792#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4792#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:43,888 INFO L290 TraceCheckUtils]: 179: Hoare triple {4792#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4820#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:43,891 INFO L290 TraceCheckUtils]: 180: Hoare triple {4820#(<= ~counter~0 19)} assume !!(#t~post6 < 100);havoc #t~post6; {4820#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:43,892 INFO L272 TraceCheckUtils]: 181: Hoare triple {4820#(<= ~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)); {4820#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:43,892 INFO L290 TraceCheckUtils]: 182: Hoare triple {4820#(<= ~counter~0 19)} ~cond := #in~cond; {4820#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:43,892 INFO L290 TraceCheckUtils]: 183: Hoare triple {4820#(<= ~counter~0 19)} assume !(0 == ~cond); {4820#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:43,893 INFO L290 TraceCheckUtils]: 184: Hoare triple {4820#(<= ~counter~0 19)} assume true; {4820#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:43,893 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {4820#(<= ~counter~0 19)} {4820#(<= ~counter~0 19)} #63#return; {4820#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:43,894 INFO L290 TraceCheckUtils]: 186: Hoare triple {4820#(<= ~counter~0 19)} assume !!(0 != ~r~0); {4820#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:43,894 INFO L290 TraceCheckUtils]: 187: Hoare triple {4820#(<= ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4820#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:43,894 INFO L290 TraceCheckUtils]: 188: Hoare triple {4820#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4848#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:43,895 INFO L290 TraceCheckUtils]: 189: Hoare triple {4848#(<= ~counter~0 20)} assume !!(#t~post6 < 100);havoc #t~post6; {4848#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:43,895 INFO L272 TraceCheckUtils]: 190: Hoare triple {4848#(<= ~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)); {4848#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:43,896 INFO L290 TraceCheckUtils]: 191: Hoare triple {4848#(<= ~counter~0 20)} ~cond := #in~cond; {4848#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:43,896 INFO L290 TraceCheckUtils]: 192: Hoare triple {4848#(<= ~counter~0 20)} assume !(0 == ~cond); {4848#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:43,896 INFO L290 TraceCheckUtils]: 193: Hoare triple {4848#(<= ~counter~0 20)} assume true; {4848#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:43,897 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {4848#(<= ~counter~0 20)} {4848#(<= ~counter~0 20)} #63#return; {4848#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:43,897 INFO L290 TraceCheckUtils]: 195: Hoare triple {4848#(<= ~counter~0 20)} assume !!(0 != ~r~0); {4848#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:43,897 INFO L290 TraceCheckUtils]: 196: Hoare triple {4848#(<= ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4848#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:43,898 INFO L290 TraceCheckUtils]: 197: Hoare triple {4848#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4876#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:43,898 INFO L290 TraceCheckUtils]: 198: Hoare triple {4876#(<= ~counter~0 21)} assume !!(#t~post6 < 100);havoc #t~post6; {4876#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:43,899 INFO L272 TraceCheckUtils]: 199: Hoare triple {4876#(<= ~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)); {4876#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:43,899 INFO L290 TraceCheckUtils]: 200: Hoare triple {4876#(<= ~counter~0 21)} ~cond := #in~cond; {4876#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:43,899 INFO L290 TraceCheckUtils]: 201: Hoare triple {4876#(<= ~counter~0 21)} assume !(0 == ~cond); {4876#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:43,900 INFO L290 TraceCheckUtils]: 202: Hoare triple {4876#(<= ~counter~0 21)} assume true; {4876#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:43,900 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {4876#(<= ~counter~0 21)} {4876#(<= ~counter~0 21)} #63#return; {4876#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:43,901 INFO L290 TraceCheckUtils]: 204: Hoare triple {4876#(<= ~counter~0 21)} assume !!(0 != ~r~0); {4876#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:43,901 INFO L290 TraceCheckUtils]: 205: Hoare triple {4876#(<= ~counter~0 21)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4876#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:43,901 INFO L290 TraceCheckUtils]: 206: Hoare triple {4876#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4904#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:43,902 INFO L290 TraceCheckUtils]: 207: Hoare triple {4904#(<= ~counter~0 22)} assume !!(#t~post6 < 100);havoc #t~post6; {4904#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:43,902 INFO L272 TraceCheckUtils]: 208: Hoare triple {4904#(<= ~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)); {4904#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:43,903 INFO L290 TraceCheckUtils]: 209: Hoare triple {4904#(<= ~counter~0 22)} ~cond := #in~cond; {4904#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:43,903 INFO L290 TraceCheckUtils]: 210: Hoare triple {4904#(<= ~counter~0 22)} assume !(0 == ~cond); {4904#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:43,903 INFO L290 TraceCheckUtils]: 211: Hoare triple {4904#(<= ~counter~0 22)} assume true; {4904#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:43,904 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {4904#(<= ~counter~0 22)} {4904#(<= ~counter~0 22)} #63#return; {4904#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:43,904 INFO L290 TraceCheckUtils]: 213: Hoare triple {4904#(<= ~counter~0 22)} assume !!(0 != ~r~0); {4904#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:43,904 INFO L290 TraceCheckUtils]: 214: Hoare triple {4904#(<= ~counter~0 22)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4904#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:43,905 INFO L290 TraceCheckUtils]: 215: Hoare triple {4904#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4932#(<= |main_#t~post6| 22)} is VALID [2022-04-07 14:03:43,905 INFO L290 TraceCheckUtils]: 216: Hoare triple {4932#(<= |main_#t~post6| 22)} assume !(#t~post6 < 100);havoc #t~post6; {4260#false} is VALID [2022-04-07 14:03:43,905 INFO L272 TraceCheckUtils]: 217: Hoare triple {4260#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4260#false} is VALID [2022-04-07 14:03:43,905 INFO L290 TraceCheckUtils]: 218: Hoare triple {4260#false} ~cond := #in~cond; {4260#false} is VALID [2022-04-07 14:03:43,905 INFO L290 TraceCheckUtils]: 219: Hoare triple {4260#false} assume 0 == ~cond; {4260#false} is VALID [2022-04-07 14:03:43,905 INFO L290 TraceCheckUtils]: 220: Hoare triple {4260#false} assume !false; {4260#false} is VALID [2022-04-07 14:03:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 14:03:43,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:03:45,359 INFO L290 TraceCheckUtils]: 220: Hoare triple {4260#false} assume !false; {4260#false} is VALID [2022-04-07 14:03:45,359 INFO L290 TraceCheckUtils]: 219: Hoare triple {4260#false} assume 0 == ~cond; {4260#false} is VALID [2022-04-07 14:03:45,359 INFO L290 TraceCheckUtils]: 218: Hoare triple {4260#false} ~cond := #in~cond; {4260#false} is VALID [2022-04-07 14:03:45,359 INFO L272 TraceCheckUtils]: 217: Hoare triple {4260#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4260#false} is VALID [2022-04-07 14:03:45,360 INFO L290 TraceCheckUtils]: 216: Hoare triple {4960#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {4260#false} is VALID [2022-04-07 14:03:45,360 INFO L290 TraceCheckUtils]: 215: Hoare triple {4964#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4960#(< |main_#t~post6| 100)} is VALID [2022-04-07 14:03:45,360 INFO L290 TraceCheckUtils]: 214: Hoare triple {4964#(< ~counter~0 100)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4964#(< ~counter~0 100)} is VALID [2022-04-07 14:03:45,360 INFO L290 TraceCheckUtils]: 213: Hoare triple {4964#(< ~counter~0 100)} assume !!(0 != ~r~0); {4964#(< ~counter~0 100)} is VALID [2022-04-07 14:03:45,361 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {4259#true} {4964#(< ~counter~0 100)} #63#return; {4964#(< ~counter~0 100)} is VALID [2022-04-07 14:03:45,361 INFO L290 TraceCheckUtils]: 211: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,361 INFO L290 TraceCheckUtils]: 210: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,361 INFO L290 TraceCheckUtils]: 209: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,361 INFO L272 TraceCheckUtils]: 208: Hoare triple {4964#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,361 INFO L290 TraceCheckUtils]: 207: Hoare triple {4964#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {4964#(< ~counter~0 100)} is VALID [2022-04-07 14:03:45,362 INFO L290 TraceCheckUtils]: 206: Hoare triple {4992#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4964#(< ~counter~0 100)} is VALID [2022-04-07 14:03:45,362 INFO L290 TraceCheckUtils]: 205: Hoare triple {4992#(< ~counter~0 99)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4992#(< ~counter~0 99)} is VALID [2022-04-07 14:03:45,362 INFO L290 TraceCheckUtils]: 204: Hoare triple {4992#(< ~counter~0 99)} assume !!(0 != ~r~0); {4992#(< ~counter~0 99)} is VALID [2022-04-07 14:03:45,363 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {4259#true} {4992#(< ~counter~0 99)} #63#return; {4992#(< ~counter~0 99)} is VALID [2022-04-07 14:03:45,363 INFO L290 TraceCheckUtils]: 202: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,363 INFO L290 TraceCheckUtils]: 201: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,363 INFO L290 TraceCheckUtils]: 200: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,363 INFO L272 TraceCheckUtils]: 199: Hoare triple {4992#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,363 INFO L290 TraceCheckUtils]: 198: Hoare triple {4992#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {4992#(< ~counter~0 99)} is VALID [2022-04-07 14:03:45,363 INFO L290 TraceCheckUtils]: 197: Hoare triple {5020#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4992#(< ~counter~0 99)} is VALID [2022-04-07 14:03:45,364 INFO L290 TraceCheckUtils]: 196: Hoare triple {5020#(< ~counter~0 98)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5020#(< ~counter~0 98)} is VALID [2022-04-07 14:03:45,364 INFO L290 TraceCheckUtils]: 195: Hoare triple {5020#(< ~counter~0 98)} assume !!(0 != ~r~0); {5020#(< ~counter~0 98)} is VALID [2022-04-07 14:03:45,364 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {4259#true} {5020#(< ~counter~0 98)} #63#return; {5020#(< ~counter~0 98)} is VALID [2022-04-07 14:03:45,364 INFO L290 TraceCheckUtils]: 193: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,364 INFO L290 TraceCheckUtils]: 192: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,364 INFO L290 TraceCheckUtils]: 191: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,364 INFO L272 TraceCheckUtils]: 190: Hoare triple {5020#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,365 INFO L290 TraceCheckUtils]: 189: Hoare triple {5020#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {5020#(< ~counter~0 98)} is VALID [2022-04-07 14:03:45,365 INFO L290 TraceCheckUtils]: 188: Hoare triple {5048#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5020#(< ~counter~0 98)} is VALID [2022-04-07 14:03:45,365 INFO L290 TraceCheckUtils]: 187: Hoare triple {5048#(< ~counter~0 97)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5048#(< ~counter~0 97)} is VALID [2022-04-07 14:03:45,365 INFO L290 TraceCheckUtils]: 186: Hoare triple {5048#(< ~counter~0 97)} assume !!(0 != ~r~0); {5048#(< ~counter~0 97)} is VALID [2022-04-07 14:03:45,366 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {4259#true} {5048#(< ~counter~0 97)} #63#return; {5048#(< ~counter~0 97)} is VALID [2022-04-07 14:03:45,366 INFO L290 TraceCheckUtils]: 184: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,366 INFO L290 TraceCheckUtils]: 183: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,366 INFO L290 TraceCheckUtils]: 182: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,366 INFO L272 TraceCheckUtils]: 181: Hoare triple {5048#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,366 INFO L290 TraceCheckUtils]: 180: Hoare triple {5048#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {5048#(< ~counter~0 97)} is VALID [2022-04-07 14:03:45,367 INFO L290 TraceCheckUtils]: 179: Hoare triple {5076#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5048#(< ~counter~0 97)} is VALID [2022-04-07 14:03:45,367 INFO L290 TraceCheckUtils]: 178: Hoare triple {5076#(< ~counter~0 96)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5076#(< ~counter~0 96)} is VALID [2022-04-07 14:03:45,367 INFO L290 TraceCheckUtils]: 177: Hoare triple {5076#(< ~counter~0 96)} assume !!(0 != ~r~0); {5076#(< ~counter~0 96)} is VALID [2022-04-07 14:03:45,367 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {4259#true} {5076#(< ~counter~0 96)} #63#return; {5076#(< ~counter~0 96)} is VALID [2022-04-07 14:03:45,368 INFO L290 TraceCheckUtils]: 175: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,368 INFO L290 TraceCheckUtils]: 174: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,368 INFO L290 TraceCheckUtils]: 173: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,368 INFO L272 TraceCheckUtils]: 172: Hoare triple {5076#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,368 INFO L290 TraceCheckUtils]: 171: Hoare triple {5076#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {5076#(< ~counter~0 96)} is VALID [2022-04-07 14:03:45,368 INFO L290 TraceCheckUtils]: 170: Hoare triple {5104#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5076#(< ~counter~0 96)} is VALID [2022-04-07 14:03:45,368 INFO L290 TraceCheckUtils]: 169: Hoare triple {5104#(< ~counter~0 95)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5104#(< ~counter~0 95)} is VALID [2022-04-07 14:03:45,369 INFO L290 TraceCheckUtils]: 168: Hoare triple {5104#(< ~counter~0 95)} assume !!(0 != ~r~0); {5104#(< ~counter~0 95)} is VALID [2022-04-07 14:03:45,369 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {4259#true} {5104#(< ~counter~0 95)} #63#return; {5104#(< ~counter~0 95)} is VALID [2022-04-07 14:03:45,369 INFO L290 TraceCheckUtils]: 166: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,369 INFO L290 TraceCheckUtils]: 165: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,369 INFO L290 TraceCheckUtils]: 164: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,371 INFO L272 TraceCheckUtils]: 163: Hoare triple {5104#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,372 INFO L290 TraceCheckUtils]: 162: Hoare triple {5104#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {5104#(< ~counter~0 95)} is VALID [2022-04-07 14:03:45,372 INFO L290 TraceCheckUtils]: 161: Hoare triple {5132#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5104#(< ~counter~0 95)} is VALID [2022-04-07 14:03:45,372 INFO L290 TraceCheckUtils]: 160: Hoare triple {5132#(< ~counter~0 94)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5132#(< ~counter~0 94)} is VALID [2022-04-07 14:03:45,372 INFO L290 TraceCheckUtils]: 159: Hoare triple {5132#(< ~counter~0 94)} assume !!(0 != ~r~0); {5132#(< ~counter~0 94)} is VALID [2022-04-07 14:03:45,373 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4259#true} {5132#(< ~counter~0 94)} #63#return; {5132#(< ~counter~0 94)} is VALID [2022-04-07 14:03:45,373 INFO L290 TraceCheckUtils]: 157: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,373 INFO L290 TraceCheckUtils]: 156: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,373 INFO L290 TraceCheckUtils]: 155: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,373 INFO L272 TraceCheckUtils]: 154: Hoare triple {5132#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,373 INFO L290 TraceCheckUtils]: 153: Hoare triple {5132#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {5132#(< ~counter~0 94)} is VALID [2022-04-07 14:03:45,374 INFO L290 TraceCheckUtils]: 152: Hoare triple {5160#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5132#(< ~counter~0 94)} is VALID [2022-04-07 14:03:45,374 INFO L290 TraceCheckUtils]: 151: Hoare triple {5160#(< ~counter~0 93)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5160#(< ~counter~0 93)} is VALID [2022-04-07 14:03:45,374 INFO L290 TraceCheckUtils]: 150: Hoare triple {5160#(< ~counter~0 93)} assume !!(0 != ~r~0); {5160#(< ~counter~0 93)} is VALID [2022-04-07 14:03:45,374 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {4259#true} {5160#(< ~counter~0 93)} #63#return; {5160#(< ~counter~0 93)} is VALID [2022-04-07 14:03:45,375 INFO L290 TraceCheckUtils]: 148: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,375 INFO L290 TraceCheckUtils]: 147: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,375 INFO L290 TraceCheckUtils]: 146: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,375 INFO L272 TraceCheckUtils]: 145: Hoare triple {5160#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,375 INFO L290 TraceCheckUtils]: 144: Hoare triple {5160#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {5160#(< ~counter~0 93)} is VALID [2022-04-07 14:03:45,375 INFO L290 TraceCheckUtils]: 143: Hoare triple {5188#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5160#(< ~counter~0 93)} is VALID [2022-04-07 14:03:45,376 INFO L290 TraceCheckUtils]: 142: Hoare triple {5188#(< ~counter~0 92)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5188#(< ~counter~0 92)} is VALID [2022-04-07 14:03:45,376 INFO L290 TraceCheckUtils]: 141: Hoare triple {5188#(< ~counter~0 92)} assume !!(0 != ~r~0); {5188#(< ~counter~0 92)} is VALID [2022-04-07 14:03:45,376 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {4259#true} {5188#(< ~counter~0 92)} #63#return; {5188#(< ~counter~0 92)} is VALID [2022-04-07 14:03:45,376 INFO L290 TraceCheckUtils]: 139: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,376 INFO L290 TraceCheckUtils]: 138: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,376 INFO L290 TraceCheckUtils]: 137: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,376 INFO L272 TraceCheckUtils]: 136: Hoare triple {5188#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,377 INFO L290 TraceCheckUtils]: 135: Hoare triple {5188#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {5188#(< ~counter~0 92)} is VALID [2022-04-07 14:03:45,377 INFO L290 TraceCheckUtils]: 134: Hoare triple {5216#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5188#(< ~counter~0 92)} is VALID [2022-04-07 14:03:45,377 INFO L290 TraceCheckUtils]: 133: Hoare triple {5216#(< ~counter~0 91)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5216#(< ~counter~0 91)} is VALID [2022-04-07 14:03:45,377 INFO L290 TraceCheckUtils]: 132: Hoare triple {5216#(< ~counter~0 91)} assume !!(0 != ~r~0); {5216#(< ~counter~0 91)} is VALID [2022-04-07 14:03:45,378 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {4259#true} {5216#(< ~counter~0 91)} #63#return; {5216#(< ~counter~0 91)} is VALID [2022-04-07 14:03:45,378 INFO L290 TraceCheckUtils]: 130: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,378 INFO L290 TraceCheckUtils]: 129: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,378 INFO L290 TraceCheckUtils]: 128: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,378 INFO L272 TraceCheckUtils]: 127: Hoare triple {5216#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,378 INFO L290 TraceCheckUtils]: 126: Hoare triple {5216#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {5216#(< ~counter~0 91)} is VALID [2022-04-07 14:03:45,378 INFO L290 TraceCheckUtils]: 125: Hoare triple {5244#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5216#(< ~counter~0 91)} is VALID [2022-04-07 14:03:45,379 INFO L290 TraceCheckUtils]: 124: Hoare triple {5244#(< ~counter~0 90)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5244#(< ~counter~0 90)} is VALID [2022-04-07 14:03:45,379 INFO L290 TraceCheckUtils]: 123: Hoare triple {5244#(< ~counter~0 90)} assume !!(0 != ~r~0); {5244#(< ~counter~0 90)} is VALID [2022-04-07 14:03:45,379 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {4259#true} {5244#(< ~counter~0 90)} #63#return; {5244#(< ~counter~0 90)} is VALID [2022-04-07 14:03:45,379 INFO L290 TraceCheckUtils]: 121: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,379 INFO L290 TraceCheckUtils]: 120: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,379 INFO L290 TraceCheckUtils]: 119: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,380 INFO L272 TraceCheckUtils]: 118: Hoare triple {5244#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,380 INFO L290 TraceCheckUtils]: 117: Hoare triple {5244#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {5244#(< ~counter~0 90)} is VALID [2022-04-07 14:03:45,380 INFO L290 TraceCheckUtils]: 116: Hoare triple {5272#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5244#(< ~counter~0 90)} is VALID [2022-04-07 14:03:45,380 INFO L290 TraceCheckUtils]: 115: Hoare triple {5272#(< ~counter~0 89)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5272#(< ~counter~0 89)} is VALID [2022-04-07 14:03:45,381 INFO L290 TraceCheckUtils]: 114: Hoare triple {5272#(< ~counter~0 89)} assume !!(0 != ~r~0); {5272#(< ~counter~0 89)} is VALID [2022-04-07 14:03:45,381 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {4259#true} {5272#(< ~counter~0 89)} #63#return; {5272#(< ~counter~0 89)} is VALID [2022-04-07 14:03:45,381 INFO L290 TraceCheckUtils]: 112: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,381 INFO L290 TraceCheckUtils]: 111: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,381 INFO L290 TraceCheckUtils]: 110: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,381 INFO L272 TraceCheckUtils]: 109: Hoare triple {5272#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,381 INFO L290 TraceCheckUtils]: 108: Hoare triple {5272#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {5272#(< ~counter~0 89)} is VALID [2022-04-07 14:03:45,382 INFO L290 TraceCheckUtils]: 107: Hoare triple {5300#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5272#(< ~counter~0 89)} is VALID [2022-04-07 14:03:45,382 INFO L290 TraceCheckUtils]: 106: Hoare triple {5300#(< ~counter~0 88)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5300#(< ~counter~0 88)} is VALID [2022-04-07 14:03:45,382 INFO L290 TraceCheckUtils]: 105: Hoare triple {5300#(< ~counter~0 88)} assume !!(0 != ~r~0); {5300#(< ~counter~0 88)} is VALID [2022-04-07 14:03:45,383 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {4259#true} {5300#(< ~counter~0 88)} #63#return; {5300#(< ~counter~0 88)} is VALID [2022-04-07 14:03:45,383 INFO L290 TraceCheckUtils]: 103: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,383 INFO L290 TraceCheckUtils]: 102: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,383 INFO L290 TraceCheckUtils]: 101: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,383 INFO L272 TraceCheckUtils]: 100: Hoare triple {5300#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,383 INFO L290 TraceCheckUtils]: 99: Hoare triple {5300#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {5300#(< ~counter~0 88)} is VALID [2022-04-07 14:03:45,383 INFO L290 TraceCheckUtils]: 98: Hoare triple {5328#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5300#(< ~counter~0 88)} is VALID [2022-04-07 14:03:45,384 INFO L290 TraceCheckUtils]: 97: Hoare triple {5328#(< ~counter~0 87)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5328#(< ~counter~0 87)} is VALID [2022-04-07 14:03:45,384 INFO L290 TraceCheckUtils]: 96: Hoare triple {5328#(< ~counter~0 87)} assume !!(0 != ~r~0); {5328#(< ~counter~0 87)} is VALID [2022-04-07 14:03:45,384 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {4259#true} {5328#(< ~counter~0 87)} #63#return; {5328#(< ~counter~0 87)} is VALID [2022-04-07 14:03:45,384 INFO L290 TraceCheckUtils]: 94: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,384 INFO L290 TraceCheckUtils]: 93: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,384 INFO L290 TraceCheckUtils]: 92: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,384 INFO L272 TraceCheckUtils]: 91: Hoare triple {5328#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,385 INFO L290 TraceCheckUtils]: 90: Hoare triple {5328#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {5328#(< ~counter~0 87)} is VALID [2022-04-07 14:03:45,385 INFO L290 TraceCheckUtils]: 89: Hoare triple {5356#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5328#(< ~counter~0 87)} is VALID [2022-04-07 14:03:45,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {5356#(< ~counter~0 86)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5356#(< ~counter~0 86)} is VALID [2022-04-07 14:03:45,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {5356#(< ~counter~0 86)} assume !!(0 != ~r~0); {5356#(< ~counter~0 86)} is VALID [2022-04-07 14:03:45,386 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4259#true} {5356#(< ~counter~0 86)} #63#return; {5356#(< ~counter~0 86)} is VALID [2022-04-07 14:03:45,386 INFO L290 TraceCheckUtils]: 85: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,386 INFO L290 TraceCheckUtils]: 84: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,386 INFO L290 TraceCheckUtils]: 83: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,386 INFO L272 TraceCheckUtils]: 82: Hoare triple {5356#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,386 INFO L290 TraceCheckUtils]: 81: Hoare triple {5356#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {5356#(< ~counter~0 86)} is VALID [2022-04-07 14:03:45,387 INFO L290 TraceCheckUtils]: 80: Hoare triple {5384#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5356#(< ~counter~0 86)} is VALID [2022-04-07 14:03:45,387 INFO L290 TraceCheckUtils]: 79: Hoare triple {5384#(< ~counter~0 85)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5384#(< ~counter~0 85)} is VALID [2022-04-07 14:03:45,387 INFO L290 TraceCheckUtils]: 78: Hoare triple {5384#(< ~counter~0 85)} assume !!(0 != ~r~0); {5384#(< ~counter~0 85)} is VALID [2022-04-07 14:03:45,387 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4259#true} {5384#(< ~counter~0 85)} #63#return; {5384#(< ~counter~0 85)} is VALID [2022-04-07 14:03:45,388 INFO L290 TraceCheckUtils]: 76: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,388 INFO L290 TraceCheckUtils]: 75: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,388 INFO L290 TraceCheckUtils]: 74: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,388 INFO L272 TraceCheckUtils]: 73: Hoare triple {5384#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,388 INFO L290 TraceCheckUtils]: 72: Hoare triple {5384#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {5384#(< ~counter~0 85)} is VALID [2022-04-07 14:03:45,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {5412#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5384#(< ~counter~0 85)} is VALID [2022-04-07 14:03:45,388 INFO L290 TraceCheckUtils]: 70: Hoare triple {5412#(< ~counter~0 84)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5412#(< ~counter~0 84)} is VALID [2022-04-07 14:03:45,389 INFO L290 TraceCheckUtils]: 69: Hoare triple {5412#(< ~counter~0 84)} assume !!(0 != ~r~0); {5412#(< ~counter~0 84)} is VALID [2022-04-07 14:03:45,389 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4259#true} {5412#(< ~counter~0 84)} #63#return; {5412#(< ~counter~0 84)} is VALID [2022-04-07 14:03:45,389 INFO L290 TraceCheckUtils]: 67: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,389 INFO L290 TraceCheckUtils]: 66: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,389 INFO L290 TraceCheckUtils]: 65: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,389 INFO L272 TraceCheckUtils]: 64: Hoare triple {5412#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {5412#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {5412#(< ~counter~0 84)} is VALID [2022-04-07 14:03:45,390 INFO L290 TraceCheckUtils]: 62: Hoare triple {5440#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5412#(< ~counter~0 84)} is VALID [2022-04-07 14:03:45,390 INFO L290 TraceCheckUtils]: 61: Hoare triple {5440#(< ~counter~0 83)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5440#(< ~counter~0 83)} is VALID [2022-04-07 14:03:45,390 INFO L290 TraceCheckUtils]: 60: Hoare triple {5440#(< ~counter~0 83)} assume !!(0 != ~r~0); {5440#(< ~counter~0 83)} is VALID [2022-04-07 14:03:45,391 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4259#true} {5440#(< ~counter~0 83)} #63#return; {5440#(< ~counter~0 83)} is VALID [2022-04-07 14:03:45,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,391 INFO L272 TraceCheckUtils]: 55: Hoare triple {5440#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {5440#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {5440#(< ~counter~0 83)} is VALID [2022-04-07 14:03:45,391 INFO L290 TraceCheckUtils]: 53: Hoare triple {5468#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5440#(< ~counter~0 83)} is VALID [2022-04-07 14:03:45,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {5468#(< ~counter~0 82)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5468#(< ~counter~0 82)} is VALID [2022-04-07 14:03:45,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {5468#(< ~counter~0 82)} assume !!(0 != ~r~0); {5468#(< ~counter~0 82)} is VALID [2022-04-07 14:03:45,392 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4259#true} {5468#(< ~counter~0 82)} #63#return; {5468#(< ~counter~0 82)} is VALID [2022-04-07 14:03:45,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,393 INFO L272 TraceCheckUtils]: 46: Hoare triple {5468#(< ~counter~0 82)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {5468#(< ~counter~0 82)} assume !!(#t~post6 < 100);havoc #t~post6; {5468#(< ~counter~0 82)} is VALID [2022-04-07 14:03:45,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {5496#(< ~counter~0 81)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5468#(< ~counter~0 82)} is VALID [2022-04-07 14:03:45,393 INFO L290 TraceCheckUtils]: 43: Hoare triple {5496#(< ~counter~0 81)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5496#(< ~counter~0 81)} is VALID [2022-04-07 14:03:45,394 INFO L290 TraceCheckUtils]: 42: Hoare triple {5496#(< ~counter~0 81)} assume !!(0 != ~r~0); {5496#(< ~counter~0 81)} is VALID [2022-04-07 14:03:45,394 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4259#true} {5496#(< ~counter~0 81)} #63#return; {5496#(< ~counter~0 81)} is VALID [2022-04-07 14:03:45,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,394 INFO L272 TraceCheckUtils]: 37: Hoare triple {5496#(< ~counter~0 81)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {5496#(< ~counter~0 81)} assume !!(#t~post6 < 100);havoc #t~post6; {5496#(< ~counter~0 81)} is VALID [2022-04-07 14:03:45,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {5524#(< ~counter~0 80)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5496#(< ~counter~0 81)} is VALID [2022-04-07 14:03:45,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {5524#(< ~counter~0 80)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5524#(< ~counter~0 80)} is VALID [2022-04-07 14:03:45,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {5524#(< ~counter~0 80)} assume !!(0 != ~r~0); {5524#(< ~counter~0 80)} is VALID [2022-04-07 14:03:45,396 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4259#true} {5524#(< ~counter~0 80)} #63#return; {5524#(< ~counter~0 80)} is VALID [2022-04-07 14:03:45,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,396 INFO L272 TraceCheckUtils]: 28: Hoare triple {5524#(< ~counter~0 80)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {5524#(< ~counter~0 80)} assume !!(#t~post6 < 100);havoc #t~post6; {5524#(< ~counter~0 80)} is VALID [2022-04-07 14:03:45,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {5552#(< ~counter~0 79)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5524#(< ~counter~0 80)} is VALID [2022-04-07 14:03:45,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {5552#(< ~counter~0 79)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5552#(< ~counter~0 79)} is VALID [2022-04-07 14:03:45,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {5552#(< ~counter~0 79)} assume !!(0 != ~r~0); {5552#(< ~counter~0 79)} is VALID [2022-04-07 14:03:45,397 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4259#true} {5552#(< ~counter~0 79)} #63#return; {5552#(< ~counter~0 79)} is VALID [2022-04-07 14:03:45,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,397 INFO L272 TraceCheckUtils]: 19: Hoare triple {5552#(< ~counter~0 79)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {5552#(< ~counter~0 79)} assume !!(#t~post6 < 100);havoc #t~post6; {5552#(< ~counter~0 79)} is VALID [2022-04-07 14:03:45,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {5580#(< ~counter~0 78)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5552#(< ~counter~0 79)} is VALID [2022-04-07 14:03:45,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {5580#(< ~counter~0 78)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5580#(< ~counter~0 78)} is VALID [2022-04-07 14:03:45,398 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4259#true} {5580#(< ~counter~0 78)} #61#return; {5580#(< ~counter~0 78)} is VALID [2022-04-07 14:03:45,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,399 INFO L272 TraceCheckUtils]: 11: Hoare triple {5580#(< ~counter~0 78)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,399 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4259#true} {5580#(< ~counter~0 78)} #59#return; {5580#(< ~counter~0 78)} is VALID [2022-04-07 14:03:45,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-07 14:03:45,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-07 14:03:45,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-07 14:03:45,399 INFO L272 TraceCheckUtils]: 6: Hoare triple {5580#(< ~counter~0 78)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4259#true} is VALID [2022-04-07 14:03:45,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {5580#(< ~counter~0 78)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5580#(< ~counter~0 78)} is VALID [2022-04-07 14:03:45,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {5580#(< ~counter~0 78)} call #t~ret7 := main(); {5580#(< ~counter~0 78)} is VALID [2022-04-07 14:03:45,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5580#(< ~counter~0 78)} {4259#true} #67#return; {5580#(< ~counter~0 78)} is VALID [2022-04-07 14:03:45,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {5580#(< ~counter~0 78)} assume true; {5580#(< ~counter~0 78)} is VALID [2022-04-07 14:03:45,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {4259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5580#(< ~counter~0 78)} is VALID [2022-04-07 14:03:45,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {4259#true} call ULTIMATE.init(); {4259#true} is VALID [2022-04-07 14:03:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-04-07 14:03:45,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:45,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69689836] [2022-04-07 14:03:45,402 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:45,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878902392] [2022-04-07 14:03:45,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878902392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:03:45,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:03:45,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-07 14:03:45,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344795850] [2022-04-07 14:03:45,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:03:45,406 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 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 221 [2022-04-07 14:03:45,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:45,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 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:03:45,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:03:45,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-07 14:03:45,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:45,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-07 14:03:45,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-07 14:03:45,676 INFO L87 Difference]: Start difference. First operand 218 states and 241 transitions. Second operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 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:03:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:48,148 INFO L93 Difference]: Finished difference Result 439 states and 509 transitions. [2022-04-07 14:03:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-07 14:03:48,149 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 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 221 [2022-04-07 14:03:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 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:03:48,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 508 transitions. [2022-04-07 14:03:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 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:03:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 508 transitions. [2022-04-07 14:03:48,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 508 transitions. [2022-04-07 14:03:48,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:03:48,529 INFO L225 Difference]: With dead ends: 439 [2022-04-07 14:03:48,530 INFO L226 Difference]: Without dead ends: 434 [2022-04-07 14:03:48,532 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-04-07 14:03:48,532 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 753 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:48,532 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [753 Valid, 454 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 14:03:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-04-07 14:03:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-04-07 14:03:48,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:48,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 434 states. Second operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-07 14:03:48,668 INFO L74 IsIncluded]: Start isIncluded. First operand 434 states. Second operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-07 14:03:48,668 INFO L87 Difference]: Start difference. First operand 434 states. Second operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-07 14:03:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:48,679 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-04-07 14:03:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-07 14:03:48,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:48,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:48,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand 434 states. [2022-04-07 14:03:48,681 INFO L87 Difference]: Start difference. First operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand 434 states. [2022-04-07 14:03:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:48,692 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-04-07 14:03:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-07 14:03:48,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:48,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:48,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:48,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-07 14:03:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2022-04-07 14:03:48,705 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 221 [2022-04-07 14:03:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:48,705 INFO L478 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2022-04-07 14:03:48,705 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 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:03:48,706 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-07 14:03:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-04-07 14:03:48,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:48,710 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:03:48,729 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:03:48,927 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:03:48,927 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:48,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:48,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1876588118, now seen corresponding path program 5 times [2022-04-07 14:03:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:48,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438034415] [2022-04-07 14:03:48,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:48,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:48,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:48,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205670351] [2022-04-07 14:03:48,974 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 14:03:48,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:48,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:48,975 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:03:48,995 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:03:51,269 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-04-07 14:03:51,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:51,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-07 14:03:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:51,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:54,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {7763#true} call ULTIMATE.init(); {7763#true} is VALID [2022-04-07 14:03:54,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {7763#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {7771#(<= ~counter~0 0)} assume true; {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7771#(<= ~counter~0 0)} {7763#true} #67#return; {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {7771#(<= ~counter~0 0)} call #t~ret7 := main(); {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {7771#(<= ~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; {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,149 INFO L272 TraceCheckUtils]: 6: Hoare triple {7771#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {7771#(<= ~counter~0 0)} ~cond := #in~cond; {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {7771#(<= ~counter~0 0)} assume !(0 == ~cond); {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {7771#(<= ~counter~0 0)} assume true; {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7771#(<= ~counter~0 0)} {7771#(<= ~counter~0 0)} #59#return; {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,150 INFO L272 TraceCheckUtils]: 11: Hoare triple {7771#(<= ~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)); {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {7771#(<= ~counter~0 0)} ~cond := #in~cond; {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {7771#(<= ~counter~0 0)} assume !(0 == ~cond); {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {7771#(<= ~counter~0 0)} assume true; {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,151 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7771#(<= ~counter~0 0)} {7771#(<= ~counter~0 0)} #61#return; {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {7771#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7771#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:54,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {7771#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7820#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:54,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {7820#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {7820#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:54,153 INFO L272 TraceCheckUtils]: 19: Hoare triple {7820#(<= ~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)); {7820#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:54,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {7820#(<= ~counter~0 1)} ~cond := #in~cond; {7820#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:54,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {7820#(<= ~counter~0 1)} assume !(0 == ~cond); {7820#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:54,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {7820#(<= ~counter~0 1)} assume true; {7820#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:54,154 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7820#(<= ~counter~0 1)} {7820#(<= ~counter~0 1)} #63#return; {7820#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:54,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {7820#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7820#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:54,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {7820#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7820#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:54,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {7820#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7848#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:54,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {7848#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {7848#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:54,155 INFO L272 TraceCheckUtils]: 28: Hoare triple {7848#(<= ~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)); {7848#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:54,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {7848#(<= ~counter~0 2)} ~cond := #in~cond; {7848#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:54,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {7848#(<= ~counter~0 2)} assume !(0 == ~cond); {7848#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:54,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {7848#(<= ~counter~0 2)} assume true; {7848#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:54,156 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7848#(<= ~counter~0 2)} {7848#(<= ~counter~0 2)} #63#return; {7848#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:54,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {7848#(<= ~counter~0 2)} assume !!(0 != ~r~0); {7848#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:54,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {7848#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7848#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:54,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {7848#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7876#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:54,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {7876#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {7876#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:54,158 INFO L272 TraceCheckUtils]: 37: Hoare triple {7876#(<= ~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)); {7876#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:54,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {7876#(<= ~counter~0 3)} ~cond := #in~cond; {7876#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:54,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {7876#(<= ~counter~0 3)} assume !(0 == ~cond); {7876#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:54,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {7876#(<= ~counter~0 3)} assume true; {7876#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:54,159 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7876#(<= ~counter~0 3)} {7876#(<= ~counter~0 3)} #63#return; {7876#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:54,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {7876#(<= ~counter~0 3)} assume !!(0 != ~r~0); {7876#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:54,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {7876#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7876#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:54,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {7876#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7904#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:54,160 INFO L290 TraceCheckUtils]: 45: Hoare triple {7904#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {7904#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:54,161 INFO L272 TraceCheckUtils]: 46: Hoare triple {7904#(<= ~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)); {7904#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:54,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {7904#(<= ~counter~0 4)} ~cond := #in~cond; {7904#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:54,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {7904#(<= ~counter~0 4)} assume !(0 == ~cond); {7904#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:54,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {7904#(<= ~counter~0 4)} assume true; {7904#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:54,162 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7904#(<= ~counter~0 4)} {7904#(<= ~counter~0 4)} #63#return; {7904#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:54,163 INFO L290 TraceCheckUtils]: 51: Hoare triple {7904#(<= ~counter~0 4)} assume !!(0 != ~r~0); {7904#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:54,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {7904#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7904#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:54,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {7904#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7932#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:54,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {7932#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {7932#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:54,164 INFO L272 TraceCheckUtils]: 55: Hoare triple {7932#(<= ~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)); {7932#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:54,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {7932#(<= ~counter~0 5)} ~cond := #in~cond; {7932#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:54,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {7932#(<= ~counter~0 5)} assume !(0 == ~cond); {7932#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:54,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {7932#(<= ~counter~0 5)} assume true; {7932#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:54,165 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7932#(<= ~counter~0 5)} {7932#(<= ~counter~0 5)} #63#return; {7932#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:54,165 INFO L290 TraceCheckUtils]: 60: Hoare triple {7932#(<= ~counter~0 5)} assume !!(0 != ~r~0); {7932#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:54,166 INFO L290 TraceCheckUtils]: 61: Hoare triple {7932#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7932#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:54,166 INFO L290 TraceCheckUtils]: 62: Hoare triple {7932#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7960#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:54,166 INFO L290 TraceCheckUtils]: 63: Hoare triple {7960#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {7960#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:54,167 INFO L272 TraceCheckUtils]: 64: Hoare triple {7960#(<= ~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)); {7960#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:54,167 INFO L290 TraceCheckUtils]: 65: Hoare triple {7960#(<= ~counter~0 6)} ~cond := #in~cond; {7960#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:54,167 INFO L290 TraceCheckUtils]: 66: Hoare triple {7960#(<= ~counter~0 6)} assume !(0 == ~cond); {7960#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:54,167 INFO L290 TraceCheckUtils]: 67: Hoare triple {7960#(<= ~counter~0 6)} assume true; {7960#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:54,168 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7960#(<= ~counter~0 6)} {7960#(<= ~counter~0 6)} #63#return; {7960#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:54,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {7960#(<= ~counter~0 6)} assume !!(0 != ~r~0); {7960#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:54,168 INFO L290 TraceCheckUtils]: 70: Hoare triple {7960#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7960#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:54,169 INFO L290 TraceCheckUtils]: 71: Hoare triple {7960#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7988#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:54,169 INFO L290 TraceCheckUtils]: 72: Hoare triple {7988#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {7988#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:54,169 INFO L272 TraceCheckUtils]: 73: Hoare triple {7988#(<= ~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)); {7988#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:54,170 INFO L290 TraceCheckUtils]: 74: Hoare triple {7988#(<= ~counter~0 7)} ~cond := #in~cond; {7988#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:54,170 INFO L290 TraceCheckUtils]: 75: Hoare triple {7988#(<= ~counter~0 7)} assume !(0 == ~cond); {7988#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:54,170 INFO L290 TraceCheckUtils]: 76: Hoare triple {7988#(<= ~counter~0 7)} assume true; {7988#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:54,171 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7988#(<= ~counter~0 7)} {7988#(<= ~counter~0 7)} #63#return; {7988#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:54,171 INFO L290 TraceCheckUtils]: 78: Hoare triple {7988#(<= ~counter~0 7)} assume !!(0 != ~r~0); {7988#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:54,171 INFO L290 TraceCheckUtils]: 79: Hoare triple {7988#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7988#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:54,172 INFO L290 TraceCheckUtils]: 80: Hoare triple {7988#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8016#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:54,172 INFO L290 TraceCheckUtils]: 81: Hoare triple {8016#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {8016#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:54,172 INFO L272 TraceCheckUtils]: 82: Hoare triple {8016#(<= ~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)); {8016#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:54,172 INFO L290 TraceCheckUtils]: 83: Hoare triple {8016#(<= ~counter~0 8)} ~cond := #in~cond; {8016#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:54,173 INFO L290 TraceCheckUtils]: 84: Hoare triple {8016#(<= ~counter~0 8)} assume !(0 == ~cond); {8016#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:54,173 INFO L290 TraceCheckUtils]: 85: Hoare triple {8016#(<= ~counter~0 8)} assume true; {8016#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:54,173 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8016#(<= ~counter~0 8)} {8016#(<= ~counter~0 8)} #63#return; {8016#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:54,174 INFO L290 TraceCheckUtils]: 87: Hoare triple {8016#(<= ~counter~0 8)} assume !!(0 != ~r~0); {8016#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:54,174 INFO L290 TraceCheckUtils]: 88: Hoare triple {8016#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8016#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:54,174 INFO L290 TraceCheckUtils]: 89: Hoare triple {8016#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8044#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:54,175 INFO L290 TraceCheckUtils]: 90: Hoare triple {8044#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {8044#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:54,175 INFO L272 TraceCheckUtils]: 91: Hoare triple {8044#(<= ~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)); {8044#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:54,175 INFO L290 TraceCheckUtils]: 92: Hoare triple {8044#(<= ~counter~0 9)} ~cond := #in~cond; {8044#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:54,175 INFO L290 TraceCheckUtils]: 93: Hoare triple {8044#(<= ~counter~0 9)} assume !(0 == ~cond); {8044#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:54,178 INFO L290 TraceCheckUtils]: 94: Hoare triple {8044#(<= ~counter~0 9)} assume true; {8044#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:54,178 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8044#(<= ~counter~0 9)} {8044#(<= ~counter~0 9)} #63#return; {8044#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:54,178 INFO L290 TraceCheckUtils]: 96: Hoare triple {8044#(<= ~counter~0 9)} assume !!(0 != ~r~0); {8044#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:54,179 INFO L290 TraceCheckUtils]: 97: Hoare triple {8044#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8044#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:54,179 INFO L290 TraceCheckUtils]: 98: Hoare triple {8044#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8072#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:54,179 INFO L290 TraceCheckUtils]: 99: Hoare triple {8072#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {8072#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:54,180 INFO L272 TraceCheckUtils]: 100: Hoare triple {8072#(<= ~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)); {8072#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:54,180 INFO L290 TraceCheckUtils]: 101: Hoare triple {8072#(<= ~counter~0 10)} ~cond := #in~cond; {8072#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:54,180 INFO L290 TraceCheckUtils]: 102: Hoare triple {8072#(<= ~counter~0 10)} assume !(0 == ~cond); {8072#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:54,181 INFO L290 TraceCheckUtils]: 103: Hoare triple {8072#(<= ~counter~0 10)} assume true; {8072#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:54,181 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {8072#(<= ~counter~0 10)} {8072#(<= ~counter~0 10)} #63#return; {8072#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:54,181 INFO L290 TraceCheckUtils]: 105: Hoare triple {8072#(<= ~counter~0 10)} assume !!(0 != ~r~0); {8072#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:54,182 INFO L290 TraceCheckUtils]: 106: Hoare triple {8072#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8072#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:54,182 INFO L290 TraceCheckUtils]: 107: Hoare triple {8072#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8100#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:54,182 INFO L290 TraceCheckUtils]: 108: Hoare triple {8100#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {8100#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:54,183 INFO L272 TraceCheckUtils]: 109: Hoare triple {8100#(<= ~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)); {8100#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:54,183 INFO L290 TraceCheckUtils]: 110: Hoare triple {8100#(<= ~counter~0 11)} ~cond := #in~cond; {8100#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:54,184 INFO L290 TraceCheckUtils]: 111: Hoare triple {8100#(<= ~counter~0 11)} assume !(0 == ~cond); {8100#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:54,184 INFO L290 TraceCheckUtils]: 112: Hoare triple {8100#(<= ~counter~0 11)} assume true; {8100#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:54,184 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {8100#(<= ~counter~0 11)} {8100#(<= ~counter~0 11)} #63#return; {8100#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:54,185 INFO L290 TraceCheckUtils]: 114: Hoare triple {8100#(<= ~counter~0 11)} assume !!(0 != ~r~0); {8100#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:54,185 INFO L290 TraceCheckUtils]: 115: Hoare triple {8100#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8100#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:54,185 INFO L290 TraceCheckUtils]: 116: Hoare triple {8100#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8128#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:54,186 INFO L290 TraceCheckUtils]: 117: Hoare triple {8128#(<= ~counter~0 12)} assume !!(#t~post6 < 100);havoc #t~post6; {8128#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:54,186 INFO L272 TraceCheckUtils]: 118: Hoare triple {8128#(<= ~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)); {8128#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:54,186 INFO L290 TraceCheckUtils]: 119: Hoare triple {8128#(<= ~counter~0 12)} ~cond := #in~cond; {8128#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:54,186 INFO L290 TraceCheckUtils]: 120: Hoare triple {8128#(<= ~counter~0 12)} assume !(0 == ~cond); {8128#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:54,187 INFO L290 TraceCheckUtils]: 121: Hoare triple {8128#(<= ~counter~0 12)} assume true; {8128#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:54,187 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {8128#(<= ~counter~0 12)} {8128#(<= ~counter~0 12)} #63#return; {8128#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:54,187 INFO L290 TraceCheckUtils]: 123: Hoare triple {8128#(<= ~counter~0 12)} assume !!(0 != ~r~0); {8128#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:54,188 INFO L290 TraceCheckUtils]: 124: Hoare triple {8128#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8128#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:54,188 INFO L290 TraceCheckUtils]: 125: Hoare triple {8128#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8156#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:54,188 INFO L290 TraceCheckUtils]: 126: Hoare triple {8156#(<= ~counter~0 13)} assume !!(#t~post6 < 100);havoc #t~post6; {8156#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:54,199 INFO L272 TraceCheckUtils]: 127: Hoare triple {8156#(<= ~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)); {8156#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:54,200 INFO L290 TraceCheckUtils]: 128: Hoare triple {8156#(<= ~counter~0 13)} ~cond := #in~cond; {8156#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:54,200 INFO L290 TraceCheckUtils]: 129: Hoare triple {8156#(<= ~counter~0 13)} assume !(0 == ~cond); {8156#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:54,200 INFO L290 TraceCheckUtils]: 130: Hoare triple {8156#(<= ~counter~0 13)} assume true; {8156#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:54,201 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {8156#(<= ~counter~0 13)} {8156#(<= ~counter~0 13)} #63#return; {8156#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:54,201 INFO L290 TraceCheckUtils]: 132: Hoare triple {8156#(<= ~counter~0 13)} assume !!(0 != ~r~0); {8156#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:54,201 INFO L290 TraceCheckUtils]: 133: Hoare triple {8156#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8156#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:54,202 INFO L290 TraceCheckUtils]: 134: Hoare triple {8156#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8184#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:54,202 INFO L290 TraceCheckUtils]: 135: Hoare triple {8184#(<= ~counter~0 14)} assume !!(#t~post6 < 100);havoc #t~post6; {8184#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:54,202 INFO L272 TraceCheckUtils]: 136: Hoare triple {8184#(<= ~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)); {8184#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:54,203 INFO L290 TraceCheckUtils]: 137: Hoare triple {8184#(<= ~counter~0 14)} ~cond := #in~cond; {8184#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:54,203 INFO L290 TraceCheckUtils]: 138: Hoare triple {8184#(<= ~counter~0 14)} assume !(0 == ~cond); {8184#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:54,203 INFO L290 TraceCheckUtils]: 139: Hoare triple {8184#(<= ~counter~0 14)} assume true; {8184#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:54,204 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {8184#(<= ~counter~0 14)} {8184#(<= ~counter~0 14)} #63#return; {8184#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:54,204 INFO L290 TraceCheckUtils]: 141: Hoare triple {8184#(<= ~counter~0 14)} assume !!(0 != ~r~0); {8184#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:54,204 INFO L290 TraceCheckUtils]: 142: Hoare triple {8184#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8184#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:54,204 INFO L290 TraceCheckUtils]: 143: Hoare triple {8184#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8212#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:54,205 INFO L290 TraceCheckUtils]: 144: Hoare triple {8212#(<= ~counter~0 15)} assume !!(#t~post6 < 100);havoc #t~post6; {8212#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:54,205 INFO L272 TraceCheckUtils]: 145: Hoare triple {8212#(<= ~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)); {8212#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:54,205 INFO L290 TraceCheckUtils]: 146: Hoare triple {8212#(<= ~counter~0 15)} ~cond := #in~cond; {8212#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:54,206 INFO L290 TraceCheckUtils]: 147: Hoare triple {8212#(<= ~counter~0 15)} assume !(0 == ~cond); {8212#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:54,206 INFO L290 TraceCheckUtils]: 148: Hoare triple {8212#(<= ~counter~0 15)} assume true; {8212#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:54,206 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {8212#(<= ~counter~0 15)} {8212#(<= ~counter~0 15)} #63#return; {8212#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:54,207 INFO L290 TraceCheckUtils]: 150: Hoare triple {8212#(<= ~counter~0 15)} assume !!(0 != ~r~0); {8212#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:54,207 INFO L290 TraceCheckUtils]: 151: Hoare triple {8212#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8212#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:54,207 INFO L290 TraceCheckUtils]: 152: Hoare triple {8212#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8240#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:54,208 INFO L290 TraceCheckUtils]: 153: Hoare triple {8240#(<= ~counter~0 16)} assume !!(#t~post6 < 100);havoc #t~post6; {8240#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:54,208 INFO L272 TraceCheckUtils]: 154: Hoare triple {8240#(<= ~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)); {8240#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:54,208 INFO L290 TraceCheckUtils]: 155: Hoare triple {8240#(<= ~counter~0 16)} ~cond := #in~cond; {8240#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:54,209 INFO L290 TraceCheckUtils]: 156: Hoare triple {8240#(<= ~counter~0 16)} assume !(0 == ~cond); {8240#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:54,209 INFO L290 TraceCheckUtils]: 157: Hoare triple {8240#(<= ~counter~0 16)} assume true; {8240#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:54,209 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {8240#(<= ~counter~0 16)} {8240#(<= ~counter~0 16)} #63#return; {8240#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:54,209 INFO L290 TraceCheckUtils]: 159: Hoare triple {8240#(<= ~counter~0 16)} assume !!(0 != ~r~0); {8240#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:54,210 INFO L290 TraceCheckUtils]: 160: Hoare triple {8240#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8240#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:54,210 INFO L290 TraceCheckUtils]: 161: Hoare triple {8240#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8268#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:54,210 INFO L290 TraceCheckUtils]: 162: Hoare triple {8268#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {8268#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:54,211 INFO L272 TraceCheckUtils]: 163: Hoare triple {8268#(<= ~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)); {8268#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:54,211 INFO L290 TraceCheckUtils]: 164: Hoare triple {8268#(<= ~counter~0 17)} ~cond := #in~cond; {8268#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:54,211 INFO L290 TraceCheckUtils]: 165: Hoare triple {8268#(<= ~counter~0 17)} assume !(0 == ~cond); {8268#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:54,212 INFO L290 TraceCheckUtils]: 166: Hoare triple {8268#(<= ~counter~0 17)} assume true; {8268#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:54,212 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {8268#(<= ~counter~0 17)} {8268#(<= ~counter~0 17)} #63#return; {8268#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:54,212 INFO L290 TraceCheckUtils]: 168: Hoare triple {8268#(<= ~counter~0 17)} assume !!(0 != ~r~0); {8268#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:54,213 INFO L290 TraceCheckUtils]: 169: Hoare triple {8268#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8268#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:54,213 INFO L290 TraceCheckUtils]: 170: Hoare triple {8268#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8296#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:54,213 INFO L290 TraceCheckUtils]: 171: Hoare triple {8296#(<= ~counter~0 18)} assume !!(#t~post6 < 100);havoc #t~post6; {8296#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:54,219 INFO L272 TraceCheckUtils]: 172: Hoare triple {8296#(<= ~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)); {8296#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:54,220 INFO L290 TraceCheckUtils]: 173: Hoare triple {8296#(<= ~counter~0 18)} ~cond := #in~cond; {8296#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:54,220 INFO L290 TraceCheckUtils]: 174: Hoare triple {8296#(<= ~counter~0 18)} assume !(0 == ~cond); {8296#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:54,220 INFO L290 TraceCheckUtils]: 175: Hoare triple {8296#(<= ~counter~0 18)} assume true; {8296#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:54,221 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {8296#(<= ~counter~0 18)} {8296#(<= ~counter~0 18)} #63#return; {8296#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:54,221 INFO L290 TraceCheckUtils]: 177: Hoare triple {8296#(<= ~counter~0 18)} assume !!(0 != ~r~0); {8296#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:54,221 INFO L290 TraceCheckUtils]: 178: Hoare triple {8296#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8296#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:54,222 INFO L290 TraceCheckUtils]: 179: Hoare triple {8296#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8324#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:54,222 INFO L290 TraceCheckUtils]: 180: Hoare triple {8324#(<= ~counter~0 19)} assume !!(#t~post6 < 100);havoc #t~post6; {8324#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:54,223 INFO L272 TraceCheckUtils]: 181: Hoare triple {8324#(<= ~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)); {8324#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:54,223 INFO L290 TraceCheckUtils]: 182: Hoare triple {8324#(<= ~counter~0 19)} ~cond := #in~cond; {8324#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:54,224 INFO L290 TraceCheckUtils]: 183: Hoare triple {8324#(<= ~counter~0 19)} assume !(0 == ~cond); {8324#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:54,224 INFO L290 TraceCheckUtils]: 184: Hoare triple {8324#(<= ~counter~0 19)} assume true; {8324#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:54,226 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {8324#(<= ~counter~0 19)} {8324#(<= ~counter~0 19)} #63#return; {8324#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:54,226 INFO L290 TraceCheckUtils]: 186: Hoare triple {8324#(<= ~counter~0 19)} assume !!(0 != ~r~0); {8324#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:54,230 INFO L290 TraceCheckUtils]: 187: Hoare triple {8324#(<= ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8324#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:54,230 INFO L290 TraceCheckUtils]: 188: Hoare triple {8324#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8352#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:54,230 INFO L290 TraceCheckUtils]: 189: Hoare triple {8352#(<= ~counter~0 20)} assume !!(#t~post6 < 100);havoc #t~post6; {8352#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:54,231 INFO L272 TraceCheckUtils]: 190: Hoare triple {8352#(<= ~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)); {8352#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:54,231 INFO L290 TraceCheckUtils]: 191: Hoare triple {8352#(<= ~counter~0 20)} ~cond := #in~cond; {8352#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:54,231 INFO L290 TraceCheckUtils]: 192: Hoare triple {8352#(<= ~counter~0 20)} assume !(0 == ~cond); {8352#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:54,232 INFO L290 TraceCheckUtils]: 193: Hoare triple {8352#(<= ~counter~0 20)} assume true; {8352#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:54,232 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {8352#(<= ~counter~0 20)} {8352#(<= ~counter~0 20)} #63#return; {8352#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:54,233 INFO L290 TraceCheckUtils]: 195: Hoare triple {8352#(<= ~counter~0 20)} assume !!(0 != ~r~0); {8352#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:54,233 INFO L290 TraceCheckUtils]: 196: Hoare triple {8352#(<= ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8352#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:54,233 INFO L290 TraceCheckUtils]: 197: Hoare triple {8352#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8380#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:54,234 INFO L290 TraceCheckUtils]: 198: Hoare triple {8380#(<= ~counter~0 21)} assume !!(#t~post6 < 100);havoc #t~post6; {8380#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:54,234 INFO L272 TraceCheckUtils]: 199: Hoare triple {8380#(<= ~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)); {8380#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:54,234 INFO L290 TraceCheckUtils]: 200: Hoare triple {8380#(<= ~counter~0 21)} ~cond := #in~cond; {8380#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:54,235 INFO L290 TraceCheckUtils]: 201: Hoare triple {8380#(<= ~counter~0 21)} assume !(0 == ~cond); {8380#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:54,235 INFO L290 TraceCheckUtils]: 202: Hoare triple {8380#(<= ~counter~0 21)} assume true; {8380#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:54,235 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {8380#(<= ~counter~0 21)} {8380#(<= ~counter~0 21)} #63#return; {8380#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:54,236 INFO L290 TraceCheckUtils]: 204: Hoare triple {8380#(<= ~counter~0 21)} assume !!(0 != ~r~0); {8380#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:54,236 INFO L290 TraceCheckUtils]: 205: Hoare triple {8380#(<= ~counter~0 21)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8380#(<= ~counter~0 21)} is VALID [2022-04-07 14:03:54,236 INFO L290 TraceCheckUtils]: 206: Hoare triple {8380#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8408#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:54,237 INFO L290 TraceCheckUtils]: 207: Hoare triple {8408#(<= ~counter~0 22)} assume !!(#t~post6 < 100);havoc #t~post6; {8408#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:54,237 INFO L272 TraceCheckUtils]: 208: Hoare triple {8408#(<= ~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)); {8408#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:54,237 INFO L290 TraceCheckUtils]: 209: Hoare triple {8408#(<= ~counter~0 22)} ~cond := #in~cond; {8408#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:54,238 INFO L290 TraceCheckUtils]: 210: Hoare triple {8408#(<= ~counter~0 22)} assume !(0 == ~cond); {8408#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:54,238 INFO L290 TraceCheckUtils]: 211: Hoare triple {8408#(<= ~counter~0 22)} assume true; {8408#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:54,238 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {8408#(<= ~counter~0 22)} {8408#(<= ~counter~0 22)} #63#return; {8408#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:54,239 INFO L290 TraceCheckUtils]: 213: Hoare triple {8408#(<= ~counter~0 22)} assume !!(0 != ~r~0); {8408#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:54,239 INFO L290 TraceCheckUtils]: 214: Hoare triple {8408#(<= ~counter~0 22)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8408#(<= ~counter~0 22)} is VALID [2022-04-07 14:03:54,239 INFO L290 TraceCheckUtils]: 215: Hoare triple {8408#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8436#(<= ~counter~0 23)} is VALID [2022-04-07 14:03:54,240 INFO L290 TraceCheckUtils]: 216: Hoare triple {8436#(<= ~counter~0 23)} assume !!(#t~post6 < 100);havoc #t~post6; {8436#(<= ~counter~0 23)} is VALID [2022-04-07 14:03:54,240 INFO L272 TraceCheckUtils]: 217: Hoare triple {8436#(<= ~counter~0 23)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8436#(<= ~counter~0 23)} is VALID [2022-04-07 14:03:54,240 INFO L290 TraceCheckUtils]: 218: Hoare triple {8436#(<= ~counter~0 23)} ~cond := #in~cond; {8436#(<= ~counter~0 23)} is VALID [2022-04-07 14:03:54,241 INFO L290 TraceCheckUtils]: 219: Hoare triple {8436#(<= ~counter~0 23)} assume !(0 == ~cond); {8436#(<= ~counter~0 23)} is VALID [2022-04-07 14:03:54,241 INFO L290 TraceCheckUtils]: 220: Hoare triple {8436#(<= ~counter~0 23)} assume true; {8436#(<= ~counter~0 23)} is VALID [2022-04-07 14:03:54,241 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {8436#(<= ~counter~0 23)} {8436#(<= ~counter~0 23)} #63#return; {8436#(<= ~counter~0 23)} is VALID [2022-04-07 14:03:54,242 INFO L290 TraceCheckUtils]: 222: Hoare triple {8436#(<= ~counter~0 23)} assume !!(0 != ~r~0); {8436#(<= ~counter~0 23)} is VALID [2022-04-07 14:03:54,242 INFO L290 TraceCheckUtils]: 223: Hoare triple {8436#(<= ~counter~0 23)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8436#(<= ~counter~0 23)} is VALID [2022-04-07 14:03:54,242 INFO L290 TraceCheckUtils]: 224: Hoare triple {8436#(<= ~counter~0 23)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8464#(<= ~counter~0 24)} is VALID [2022-04-07 14:03:54,243 INFO L290 TraceCheckUtils]: 225: Hoare triple {8464#(<= ~counter~0 24)} assume !!(#t~post6 < 100);havoc #t~post6; {8464#(<= ~counter~0 24)} is VALID [2022-04-07 14:03:54,243 INFO L272 TraceCheckUtils]: 226: Hoare triple {8464#(<= ~counter~0 24)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8464#(<= ~counter~0 24)} is VALID [2022-04-07 14:03:54,243 INFO L290 TraceCheckUtils]: 227: Hoare triple {8464#(<= ~counter~0 24)} ~cond := #in~cond; {8464#(<= ~counter~0 24)} is VALID [2022-04-07 14:03:54,244 INFO L290 TraceCheckUtils]: 228: Hoare triple {8464#(<= ~counter~0 24)} assume !(0 == ~cond); {8464#(<= ~counter~0 24)} is VALID [2022-04-07 14:03:54,244 INFO L290 TraceCheckUtils]: 229: Hoare triple {8464#(<= ~counter~0 24)} assume true; {8464#(<= ~counter~0 24)} is VALID [2022-04-07 14:03:54,244 INFO L284 TraceCheckUtils]: 230: Hoare quadruple {8464#(<= ~counter~0 24)} {8464#(<= ~counter~0 24)} #63#return; {8464#(<= ~counter~0 24)} is VALID [2022-04-07 14:03:54,245 INFO L290 TraceCheckUtils]: 231: Hoare triple {8464#(<= ~counter~0 24)} assume !!(0 != ~r~0); {8464#(<= ~counter~0 24)} is VALID [2022-04-07 14:03:54,245 INFO L290 TraceCheckUtils]: 232: Hoare triple {8464#(<= ~counter~0 24)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8464#(<= ~counter~0 24)} is VALID [2022-04-07 14:03:54,246 INFO L290 TraceCheckUtils]: 233: Hoare triple {8464#(<= ~counter~0 24)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8492#(<= ~counter~0 25)} is VALID [2022-04-07 14:03:54,246 INFO L290 TraceCheckUtils]: 234: Hoare triple {8492#(<= ~counter~0 25)} assume !!(#t~post6 < 100);havoc #t~post6; {8492#(<= ~counter~0 25)} is VALID [2022-04-07 14:03:54,246 INFO L272 TraceCheckUtils]: 235: Hoare triple {8492#(<= ~counter~0 25)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8492#(<= ~counter~0 25)} is VALID [2022-04-07 14:03:54,247 INFO L290 TraceCheckUtils]: 236: Hoare triple {8492#(<= ~counter~0 25)} ~cond := #in~cond; {8492#(<= ~counter~0 25)} is VALID [2022-04-07 14:03:54,247 INFO L290 TraceCheckUtils]: 237: Hoare triple {8492#(<= ~counter~0 25)} assume !(0 == ~cond); {8492#(<= ~counter~0 25)} is VALID [2022-04-07 14:03:54,247 INFO L290 TraceCheckUtils]: 238: Hoare triple {8492#(<= ~counter~0 25)} assume true; {8492#(<= ~counter~0 25)} is VALID [2022-04-07 14:03:54,248 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {8492#(<= ~counter~0 25)} {8492#(<= ~counter~0 25)} #63#return; {8492#(<= ~counter~0 25)} is VALID [2022-04-07 14:03:54,248 INFO L290 TraceCheckUtils]: 240: Hoare triple {8492#(<= ~counter~0 25)} assume !!(0 != ~r~0); {8492#(<= ~counter~0 25)} is VALID [2022-04-07 14:03:54,248 INFO L290 TraceCheckUtils]: 241: Hoare triple {8492#(<= ~counter~0 25)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8492#(<= ~counter~0 25)} is VALID [2022-04-07 14:03:54,249 INFO L290 TraceCheckUtils]: 242: Hoare triple {8492#(<= ~counter~0 25)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8520#(<= ~counter~0 26)} is VALID [2022-04-07 14:03:54,249 INFO L290 TraceCheckUtils]: 243: Hoare triple {8520#(<= ~counter~0 26)} assume !!(#t~post6 < 100);havoc #t~post6; {8520#(<= ~counter~0 26)} is VALID [2022-04-07 14:03:54,249 INFO L272 TraceCheckUtils]: 244: Hoare triple {8520#(<= ~counter~0 26)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8520#(<= ~counter~0 26)} is VALID [2022-04-07 14:03:54,250 INFO L290 TraceCheckUtils]: 245: Hoare triple {8520#(<= ~counter~0 26)} ~cond := #in~cond; {8520#(<= ~counter~0 26)} is VALID [2022-04-07 14:03:54,250 INFO L290 TraceCheckUtils]: 246: Hoare triple {8520#(<= ~counter~0 26)} assume !(0 == ~cond); {8520#(<= ~counter~0 26)} is VALID [2022-04-07 14:03:54,250 INFO L290 TraceCheckUtils]: 247: Hoare triple {8520#(<= ~counter~0 26)} assume true; {8520#(<= ~counter~0 26)} is VALID [2022-04-07 14:03:54,251 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {8520#(<= ~counter~0 26)} {8520#(<= ~counter~0 26)} #63#return; {8520#(<= ~counter~0 26)} is VALID [2022-04-07 14:03:54,251 INFO L290 TraceCheckUtils]: 249: Hoare triple {8520#(<= ~counter~0 26)} assume !!(0 != ~r~0); {8520#(<= ~counter~0 26)} is VALID [2022-04-07 14:03:54,251 INFO L290 TraceCheckUtils]: 250: Hoare triple {8520#(<= ~counter~0 26)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8520#(<= ~counter~0 26)} is VALID [2022-04-07 14:03:54,252 INFO L290 TraceCheckUtils]: 251: Hoare triple {8520#(<= ~counter~0 26)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8548#(<= ~counter~0 27)} is VALID [2022-04-07 14:03:54,252 INFO L290 TraceCheckUtils]: 252: Hoare triple {8548#(<= ~counter~0 27)} assume !!(#t~post6 < 100);havoc #t~post6; {8548#(<= ~counter~0 27)} is VALID [2022-04-07 14:03:54,253 INFO L272 TraceCheckUtils]: 253: Hoare triple {8548#(<= ~counter~0 27)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8548#(<= ~counter~0 27)} is VALID [2022-04-07 14:03:54,253 INFO L290 TraceCheckUtils]: 254: Hoare triple {8548#(<= ~counter~0 27)} ~cond := #in~cond; {8548#(<= ~counter~0 27)} is VALID [2022-04-07 14:03:54,253 INFO L290 TraceCheckUtils]: 255: Hoare triple {8548#(<= ~counter~0 27)} assume !(0 == ~cond); {8548#(<= ~counter~0 27)} is VALID [2022-04-07 14:03:54,253 INFO L290 TraceCheckUtils]: 256: Hoare triple {8548#(<= ~counter~0 27)} assume true; {8548#(<= ~counter~0 27)} is VALID [2022-04-07 14:03:54,254 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {8548#(<= ~counter~0 27)} {8548#(<= ~counter~0 27)} #63#return; {8548#(<= ~counter~0 27)} is VALID [2022-04-07 14:03:54,254 INFO L290 TraceCheckUtils]: 258: Hoare triple {8548#(<= ~counter~0 27)} assume !!(0 != ~r~0); {8548#(<= ~counter~0 27)} is VALID [2022-04-07 14:03:54,254 INFO L290 TraceCheckUtils]: 259: Hoare triple {8548#(<= ~counter~0 27)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8548#(<= ~counter~0 27)} is VALID [2022-04-07 14:03:54,255 INFO L290 TraceCheckUtils]: 260: Hoare triple {8548#(<= ~counter~0 27)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8576#(<= ~counter~0 28)} is VALID [2022-04-07 14:03:54,255 INFO L290 TraceCheckUtils]: 261: Hoare triple {8576#(<= ~counter~0 28)} assume !!(#t~post6 < 100);havoc #t~post6; {8576#(<= ~counter~0 28)} is VALID [2022-04-07 14:03:54,256 INFO L272 TraceCheckUtils]: 262: Hoare triple {8576#(<= ~counter~0 28)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8576#(<= ~counter~0 28)} is VALID [2022-04-07 14:03:54,256 INFO L290 TraceCheckUtils]: 263: Hoare triple {8576#(<= ~counter~0 28)} ~cond := #in~cond; {8576#(<= ~counter~0 28)} is VALID [2022-04-07 14:03:54,256 INFO L290 TraceCheckUtils]: 264: Hoare triple {8576#(<= ~counter~0 28)} assume !(0 == ~cond); {8576#(<= ~counter~0 28)} is VALID [2022-04-07 14:03:54,256 INFO L290 TraceCheckUtils]: 265: Hoare triple {8576#(<= ~counter~0 28)} assume true; {8576#(<= ~counter~0 28)} is VALID [2022-04-07 14:03:54,257 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {8576#(<= ~counter~0 28)} {8576#(<= ~counter~0 28)} #63#return; {8576#(<= ~counter~0 28)} is VALID [2022-04-07 14:03:54,257 INFO L290 TraceCheckUtils]: 267: Hoare triple {8576#(<= ~counter~0 28)} assume !!(0 != ~r~0); {8576#(<= ~counter~0 28)} is VALID [2022-04-07 14:03:54,257 INFO L290 TraceCheckUtils]: 268: Hoare triple {8576#(<= ~counter~0 28)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8576#(<= ~counter~0 28)} is VALID [2022-04-07 14:03:54,258 INFO L290 TraceCheckUtils]: 269: Hoare triple {8576#(<= ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8604#(<= ~counter~0 29)} is VALID [2022-04-07 14:03:54,258 INFO L290 TraceCheckUtils]: 270: Hoare triple {8604#(<= ~counter~0 29)} assume !!(#t~post6 < 100);havoc #t~post6; {8604#(<= ~counter~0 29)} is VALID [2022-04-07 14:03:54,259 INFO L272 TraceCheckUtils]: 271: Hoare triple {8604#(<= ~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)); {8604#(<= ~counter~0 29)} is VALID [2022-04-07 14:03:54,259 INFO L290 TraceCheckUtils]: 272: Hoare triple {8604#(<= ~counter~0 29)} ~cond := #in~cond; {8604#(<= ~counter~0 29)} is VALID [2022-04-07 14:03:54,259 INFO L290 TraceCheckUtils]: 273: Hoare triple {8604#(<= ~counter~0 29)} assume !(0 == ~cond); {8604#(<= ~counter~0 29)} is VALID [2022-04-07 14:03:54,259 INFO L290 TraceCheckUtils]: 274: Hoare triple {8604#(<= ~counter~0 29)} assume true; {8604#(<= ~counter~0 29)} is VALID [2022-04-07 14:03:54,260 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {8604#(<= ~counter~0 29)} {8604#(<= ~counter~0 29)} #63#return; {8604#(<= ~counter~0 29)} is VALID [2022-04-07 14:03:54,260 INFO L290 TraceCheckUtils]: 276: Hoare triple {8604#(<= ~counter~0 29)} assume !!(0 != ~r~0); {8604#(<= ~counter~0 29)} is VALID [2022-04-07 14:03:54,260 INFO L290 TraceCheckUtils]: 277: Hoare triple {8604#(<= ~counter~0 29)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8604#(<= ~counter~0 29)} is VALID [2022-04-07 14:03:54,261 INFO L290 TraceCheckUtils]: 278: Hoare triple {8604#(<= ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8632#(<= ~counter~0 30)} is VALID [2022-04-07 14:03:54,261 INFO L290 TraceCheckUtils]: 279: Hoare triple {8632#(<= ~counter~0 30)} assume !!(#t~post6 < 100);havoc #t~post6; {8632#(<= ~counter~0 30)} is VALID [2022-04-07 14:03:54,262 INFO L272 TraceCheckUtils]: 280: Hoare triple {8632#(<= ~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)); {8632#(<= ~counter~0 30)} is VALID [2022-04-07 14:03:54,262 INFO L290 TraceCheckUtils]: 281: Hoare triple {8632#(<= ~counter~0 30)} ~cond := #in~cond; {8632#(<= ~counter~0 30)} is VALID [2022-04-07 14:03:54,262 INFO L290 TraceCheckUtils]: 282: Hoare triple {8632#(<= ~counter~0 30)} assume !(0 == ~cond); {8632#(<= ~counter~0 30)} is VALID [2022-04-07 14:03:54,262 INFO L290 TraceCheckUtils]: 283: Hoare triple {8632#(<= ~counter~0 30)} assume true; {8632#(<= ~counter~0 30)} is VALID [2022-04-07 14:03:54,263 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {8632#(<= ~counter~0 30)} {8632#(<= ~counter~0 30)} #63#return; {8632#(<= ~counter~0 30)} is VALID [2022-04-07 14:03:54,263 INFO L290 TraceCheckUtils]: 285: Hoare triple {8632#(<= ~counter~0 30)} assume !!(0 != ~r~0); {8632#(<= ~counter~0 30)} is VALID [2022-04-07 14:03:54,263 INFO L290 TraceCheckUtils]: 286: Hoare triple {8632#(<= ~counter~0 30)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8632#(<= ~counter~0 30)} is VALID [2022-04-07 14:03:54,264 INFO L290 TraceCheckUtils]: 287: Hoare triple {8632#(<= ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8660#(<= ~counter~0 31)} is VALID [2022-04-07 14:03:54,264 INFO L290 TraceCheckUtils]: 288: Hoare triple {8660#(<= ~counter~0 31)} assume !!(#t~post6 < 100);havoc #t~post6; {8660#(<= ~counter~0 31)} is VALID [2022-04-07 14:03:54,265 INFO L272 TraceCheckUtils]: 289: Hoare triple {8660#(<= ~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)); {8660#(<= ~counter~0 31)} is VALID [2022-04-07 14:03:54,265 INFO L290 TraceCheckUtils]: 290: Hoare triple {8660#(<= ~counter~0 31)} ~cond := #in~cond; {8660#(<= ~counter~0 31)} is VALID [2022-04-07 14:03:54,265 INFO L290 TraceCheckUtils]: 291: Hoare triple {8660#(<= ~counter~0 31)} assume !(0 == ~cond); {8660#(<= ~counter~0 31)} is VALID [2022-04-07 14:03:54,265 INFO L290 TraceCheckUtils]: 292: Hoare triple {8660#(<= ~counter~0 31)} assume true; {8660#(<= ~counter~0 31)} is VALID [2022-04-07 14:03:54,266 INFO L284 TraceCheckUtils]: 293: Hoare quadruple {8660#(<= ~counter~0 31)} {8660#(<= ~counter~0 31)} #63#return; {8660#(<= ~counter~0 31)} is VALID [2022-04-07 14:03:54,266 INFO L290 TraceCheckUtils]: 294: Hoare triple {8660#(<= ~counter~0 31)} assume !!(0 != ~r~0); {8660#(<= ~counter~0 31)} is VALID [2022-04-07 14:03:54,266 INFO L290 TraceCheckUtils]: 295: Hoare triple {8660#(<= ~counter~0 31)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8660#(<= ~counter~0 31)} is VALID [2022-04-07 14:03:54,267 INFO L290 TraceCheckUtils]: 296: Hoare triple {8660#(<= ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8688#(<= ~counter~0 32)} is VALID [2022-04-07 14:03:54,267 INFO L290 TraceCheckUtils]: 297: Hoare triple {8688#(<= ~counter~0 32)} assume !!(#t~post6 < 100);havoc #t~post6; {8688#(<= ~counter~0 32)} is VALID [2022-04-07 14:03:54,268 INFO L272 TraceCheckUtils]: 298: Hoare triple {8688#(<= ~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)); {8688#(<= ~counter~0 32)} is VALID [2022-04-07 14:03:54,268 INFO L290 TraceCheckUtils]: 299: Hoare triple {8688#(<= ~counter~0 32)} ~cond := #in~cond; {8688#(<= ~counter~0 32)} is VALID [2022-04-07 14:03:54,268 INFO L290 TraceCheckUtils]: 300: Hoare triple {8688#(<= ~counter~0 32)} assume !(0 == ~cond); {8688#(<= ~counter~0 32)} is VALID [2022-04-07 14:03:54,268 INFO L290 TraceCheckUtils]: 301: Hoare triple {8688#(<= ~counter~0 32)} assume true; {8688#(<= ~counter~0 32)} is VALID [2022-04-07 14:03:54,269 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {8688#(<= ~counter~0 32)} {8688#(<= ~counter~0 32)} #63#return; {8688#(<= ~counter~0 32)} is VALID [2022-04-07 14:03:54,269 INFO L290 TraceCheckUtils]: 303: Hoare triple {8688#(<= ~counter~0 32)} assume !!(0 != ~r~0); {8688#(<= ~counter~0 32)} is VALID [2022-04-07 14:03:54,269 INFO L290 TraceCheckUtils]: 304: Hoare triple {8688#(<= ~counter~0 32)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8688#(<= ~counter~0 32)} is VALID [2022-04-07 14:03:54,269 INFO L290 TraceCheckUtils]: 305: Hoare triple {8688#(<= ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8716#(<= ~counter~0 33)} is VALID [2022-04-07 14:03:54,270 INFO L290 TraceCheckUtils]: 306: Hoare triple {8716#(<= ~counter~0 33)} assume !!(#t~post6 < 100);havoc #t~post6; {8716#(<= ~counter~0 33)} is VALID [2022-04-07 14:03:54,270 INFO L272 TraceCheckUtils]: 307: Hoare triple {8716#(<= ~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)); {8716#(<= ~counter~0 33)} is VALID [2022-04-07 14:03:54,270 INFO L290 TraceCheckUtils]: 308: Hoare triple {8716#(<= ~counter~0 33)} ~cond := #in~cond; {8716#(<= ~counter~0 33)} is VALID [2022-04-07 14:03:54,271 INFO L290 TraceCheckUtils]: 309: Hoare triple {8716#(<= ~counter~0 33)} assume !(0 == ~cond); {8716#(<= ~counter~0 33)} is VALID [2022-04-07 14:03:54,271 INFO L290 TraceCheckUtils]: 310: Hoare triple {8716#(<= ~counter~0 33)} assume true; {8716#(<= ~counter~0 33)} is VALID [2022-04-07 14:03:54,271 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {8716#(<= ~counter~0 33)} {8716#(<= ~counter~0 33)} #63#return; {8716#(<= ~counter~0 33)} is VALID [2022-04-07 14:03:54,271 INFO L290 TraceCheckUtils]: 312: Hoare triple {8716#(<= ~counter~0 33)} assume !!(0 != ~r~0); {8716#(<= ~counter~0 33)} is VALID [2022-04-07 14:03:54,272 INFO L290 TraceCheckUtils]: 313: Hoare triple {8716#(<= ~counter~0 33)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8716#(<= ~counter~0 33)} is VALID [2022-04-07 14:03:54,273 INFO L290 TraceCheckUtils]: 314: Hoare triple {8716#(<= ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8744#(<= ~counter~0 34)} is VALID [2022-04-07 14:03:54,273 INFO L290 TraceCheckUtils]: 315: Hoare triple {8744#(<= ~counter~0 34)} assume !!(#t~post6 < 100);havoc #t~post6; {8744#(<= ~counter~0 34)} is VALID [2022-04-07 14:03:54,274 INFO L272 TraceCheckUtils]: 316: Hoare triple {8744#(<= ~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)); {8744#(<= ~counter~0 34)} is VALID [2022-04-07 14:03:54,278 INFO L290 TraceCheckUtils]: 317: Hoare triple {8744#(<= ~counter~0 34)} ~cond := #in~cond; {8744#(<= ~counter~0 34)} is VALID [2022-04-07 14:03:54,278 INFO L290 TraceCheckUtils]: 318: Hoare triple {8744#(<= ~counter~0 34)} assume !(0 == ~cond); {8744#(<= ~counter~0 34)} is VALID [2022-04-07 14:03:54,278 INFO L290 TraceCheckUtils]: 319: Hoare triple {8744#(<= ~counter~0 34)} assume true; {8744#(<= ~counter~0 34)} is VALID [2022-04-07 14:03:54,279 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {8744#(<= ~counter~0 34)} {8744#(<= ~counter~0 34)} #63#return; {8744#(<= ~counter~0 34)} is VALID [2022-04-07 14:03:54,279 INFO L290 TraceCheckUtils]: 321: Hoare triple {8744#(<= ~counter~0 34)} assume !!(0 != ~r~0); {8744#(<= ~counter~0 34)} is VALID [2022-04-07 14:03:54,279 INFO L290 TraceCheckUtils]: 322: Hoare triple {8744#(<= ~counter~0 34)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8744#(<= ~counter~0 34)} is VALID [2022-04-07 14:03:54,280 INFO L290 TraceCheckUtils]: 323: Hoare triple {8744#(<= ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8772#(<= ~counter~0 35)} is VALID [2022-04-07 14:03:54,280 INFO L290 TraceCheckUtils]: 324: Hoare triple {8772#(<= ~counter~0 35)} assume !!(#t~post6 < 100);havoc #t~post6; {8772#(<= ~counter~0 35)} is VALID [2022-04-07 14:03:54,280 INFO L272 TraceCheckUtils]: 325: Hoare triple {8772#(<= ~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)); {8772#(<= ~counter~0 35)} is VALID [2022-04-07 14:03:54,281 INFO L290 TraceCheckUtils]: 326: Hoare triple {8772#(<= ~counter~0 35)} ~cond := #in~cond; {8772#(<= ~counter~0 35)} is VALID [2022-04-07 14:03:54,281 INFO L290 TraceCheckUtils]: 327: Hoare triple {8772#(<= ~counter~0 35)} assume !(0 == ~cond); {8772#(<= ~counter~0 35)} is VALID [2022-04-07 14:03:54,281 INFO L290 TraceCheckUtils]: 328: Hoare triple {8772#(<= ~counter~0 35)} assume true; {8772#(<= ~counter~0 35)} is VALID [2022-04-07 14:03:54,282 INFO L284 TraceCheckUtils]: 329: Hoare quadruple {8772#(<= ~counter~0 35)} {8772#(<= ~counter~0 35)} #63#return; {8772#(<= ~counter~0 35)} is VALID [2022-04-07 14:03:54,282 INFO L290 TraceCheckUtils]: 330: Hoare triple {8772#(<= ~counter~0 35)} assume !!(0 != ~r~0); {8772#(<= ~counter~0 35)} is VALID [2022-04-07 14:03:54,282 INFO L290 TraceCheckUtils]: 331: Hoare triple {8772#(<= ~counter~0 35)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8772#(<= ~counter~0 35)} is VALID [2022-04-07 14:03:54,282 INFO L290 TraceCheckUtils]: 332: Hoare triple {8772#(<= ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8800#(<= ~counter~0 36)} is VALID [2022-04-07 14:03:54,283 INFO L290 TraceCheckUtils]: 333: Hoare triple {8800#(<= ~counter~0 36)} assume !!(#t~post6 < 100);havoc #t~post6; {8800#(<= ~counter~0 36)} is VALID [2022-04-07 14:03:54,283 INFO L272 TraceCheckUtils]: 334: Hoare triple {8800#(<= ~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)); {8800#(<= ~counter~0 36)} is VALID [2022-04-07 14:03:54,283 INFO L290 TraceCheckUtils]: 335: Hoare triple {8800#(<= ~counter~0 36)} ~cond := #in~cond; {8800#(<= ~counter~0 36)} is VALID [2022-04-07 14:03:54,284 INFO L290 TraceCheckUtils]: 336: Hoare triple {8800#(<= ~counter~0 36)} assume !(0 == ~cond); {8800#(<= ~counter~0 36)} is VALID [2022-04-07 14:03:54,284 INFO L290 TraceCheckUtils]: 337: Hoare triple {8800#(<= ~counter~0 36)} assume true; {8800#(<= ~counter~0 36)} is VALID [2022-04-07 14:03:54,284 INFO L284 TraceCheckUtils]: 338: Hoare quadruple {8800#(<= ~counter~0 36)} {8800#(<= ~counter~0 36)} #63#return; {8800#(<= ~counter~0 36)} is VALID [2022-04-07 14:03:54,284 INFO L290 TraceCheckUtils]: 339: Hoare triple {8800#(<= ~counter~0 36)} assume !!(0 != ~r~0); {8800#(<= ~counter~0 36)} is VALID [2022-04-07 14:03:54,285 INFO L290 TraceCheckUtils]: 340: Hoare triple {8800#(<= ~counter~0 36)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8800#(<= ~counter~0 36)} is VALID [2022-04-07 14:03:54,285 INFO L290 TraceCheckUtils]: 341: Hoare triple {8800#(<= ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8828#(<= ~counter~0 37)} is VALID [2022-04-07 14:03:54,285 INFO L290 TraceCheckUtils]: 342: Hoare triple {8828#(<= ~counter~0 37)} assume !!(#t~post6 < 100);havoc #t~post6; {8828#(<= ~counter~0 37)} is VALID [2022-04-07 14:03:54,286 INFO L272 TraceCheckUtils]: 343: Hoare triple {8828#(<= ~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)); {8828#(<= ~counter~0 37)} is VALID [2022-04-07 14:03:54,286 INFO L290 TraceCheckUtils]: 344: Hoare triple {8828#(<= ~counter~0 37)} ~cond := #in~cond; {8828#(<= ~counter~0 37)} is VALID [2022-04-07 14:03:54,286 INFO L290 TraceCheckUtils]: 345: Hoare triple {8828#(<= ~counter~0 37)} assume !(0 == ~cond); {8828#(<= ~counter~0 37)} is VALID [2022-04-07 14:03:54,287 INFO L290 TraceCheckUtils]: 346: Hoare triple {8828#(<= ~counter~0 37)} assume true; {8828#(<= ~counter~0 37)} is VALID [2022-04-07 14:03:54,287 INFO L284 TraceCheckUtils]: 347: Hoare quadruple {8828#(<= ~counter~0 37)} {8828#(<= ~counter~0 37)} #63#return; {8828#(<= ~counter~0 37)} is VALID [2022-04-07 14:03:54,287 INFO L290 TraceCheckUtils]: 348: Hoare triple {8828#(<= ~counter~0 37)} assume !!(0 != ~r~0); {8828#(<= ~counter~0 37)} is VALID [2022-04-07 14:03:54,287 INFO L290 TraceCheckUtils]: 349: Hoare triple {8828#(<= ~counter~0 37)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8828#(<= ~counter~0 37)} is VALID [2022-04-07 14:03:54,288 INFO L290 TraceCheckUtils]: 350: Hoare triple {8828#(<= ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8856#(<= ~counter~0 38)} is VALID [2022-04-07 14:03:54,288 INFO L290 TraceCheckUtils]: 351: Hoare triple {8856#(<= ~counter~0 38)} assume !!(#t~post6 < 100);havoc #t~post6; {8856#(<= ~counter~0 38)} is VALID [2022-04-07 14:03:54,289 INFO L272 TraceCheckUtils]: 352: Hoare triple {8856#(<= ~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)); {8856#(<= ~counter~0 38)} is VALID [2022-04-07 14:03:54,289 INFO L290 TraceCheckUtils]: 353: Hoare triple {8856#(<= ~counter~0 38)} ~cond := #in~cond; {8856#(<= ~counter~0 38)} is VALID [2022-04-07 14:03:54,289 INFO L290 TraceCheckUtils]: 354: Hoare triple {8856#(<= ~counter~0 38)} assume !(0 == ~cond); {8856#(<= ~counter~0 38)} is VALID [2022-04-07 14:03:54,289 INFO L290 TraceCheckUtils]: 355: Hoare triple {8856#(<= ~counter~0 38)} assume true; {8856#(<= ~counter~0 38)} is VALID [2022-04-07 14:03:54,290 INFO L284 TraceCheckUtils]: 356: Hoare quadruple {8856#(<= ~counter~0 38)} {8856#(<= ~counter~0 38)} #63#return; {8856#(<= ~counter~0 38)} is VALID [2022-04-07 14:03:54,290 INFO L290 TraceCheckUtils]: 357: Hoare triple {8856#(<= ~counter~0 38)} assume !!(0 != ~r~0); {8856#(<= ~counter~0 38)} is VALID [2022-04-07 14:03:54,290 INFO L290 TraceCheckUtils]: 358: Hoare triple {8856#(<= ~counter~0 38)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8856#(<= ~counter~0 38)} is VALID [2022-04-07 14:03:54,291 INFO L290 TraceCheckUtils]: 359: Hoare triple {8856#(<= ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8884#(<= ~counter~0 39)} is VALID [2022-04-07 14:03:54,291 INFO L290 TraceCheckUtils]: 360: Hoare triple {8884#(<= ~counter~0 39)} assume !!(#t~post6 < 100);havoc #t~post6; {8884#(<= ~counter~0 39)} is VALID [2022-04-07 14:03:54,291 INFO L272 TraceCheckUtils]: 361: Hoare triple {8884#(<= ~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)); {8884#(<= ~counter~0 39)} is VALID [2022-04-07 14:03:54,292 INFO L290 TraceCheckUtils]: 362: Hoare triple {8884#(<= ~counter~0 39)} ~cond := #in~cond; {8884#(<= ~counter~0 39)} is VALID [2022-04-07 14:03:54,292 INFO L290 TraceCheckUtils]: 363: Hoare triple {8884#(<= ~counter~0 39)} assume !(0 == ~cond); {8884#(<= ~counter~0 39)} is VALID [2022-04-07 14:03:54,292 INFO L290 TraceCheckUtils]: 364: Hoare triple {8884#(<= ~counter~0 39)} assume true; {8884#(<= ~counter~0 39)} is VALID [2022-04-07 14:03:54,292 INFO L284 TraceCheckUtils]: 365: Hoare quadruple {8884#(<= ~counter~0 39)} {8884#(<= ~counter~0 39)} #63#return; {8884#(<= ~counter~0 39)} is VALID [2022-04-07 14:03:54,293 INFO L290 TraceCheckUtils]: 366: Hoare triple {8884#(<= ~counter~0 39)} assume !!(0 != ~r~0); {8884#(<= ~counter~0 39)} is VALID [2022-04-07 14:03:54,293 INFO L290 TraceCheckUtils]: 367: Hoare triple {8884#(<= ~counter~0 39)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8884#(<= ~counter~0 39)} is VALID [2022-04-07 14:03:54,293 INFO L290 TraceCheckUtils]: 368: Hoare triple {8884#(<= ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8912#(<= ~counter~0 40)} is VALID [2022-04-07 14:03:54,294 INFO L290 TraceCheckUtils]: 369: Hoare triple {8912#(<= ~counter~0 40)} assume !!(#t~post6 < 100);havoc #t~post6; {8912#(<= ~counter~0 40)} is VALID [2022-04-07 14:03:54,294 INFO L272 TraceCheckUtils]: 370: Hoare triple {8912#(<= ~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)); {8912#(<= ~counter~0 40)} is VALID [2022-04-07 14:03:54,294 INFO L290 TraceCheckUtils]: 371: Hoare triple {8912#(<= ~counter~0 40)} ~cond := #in~cond; {8912#(<= ~counter~0 40)} is VALID [2022-04-07 14:03:54,294 INFO L290 TraceCheckUtils]: 372: Hoare triple {8912#(<= ~counter~0 40)} assume !(0 == ~cond); {8912#(<= ~counter~0 40)} is VALID [2022-04-07 14:03:54,295 INFO L290 TraceCheckUtils]: 373: Hoare triple {8912#(<= ~counter~0 40)} assume true; {8912#(<= ~counter~0 40)} is VALID [2022-04-07 14:03:54,295 INFO L284 TraceCheckUtils]: 374: Hoare quadruple {8912#(<= ~counter~0 40)} {8912#(<= ~counter~0 40)} #63#return; {8912#(<= ~counter~0 40)} is VALID [2022-04-07 14:03:54,295 INFO L290 TraceCheckUtils]: 375: Hoare triple {8912#(<= ~counter~0 40)} assume !!(0 != ~r~0); {8912#(<= ~counter~0 40)} is VALID [2022-04-07 14:03:54,296 INFO L290 TraceCheckUtils]: 376: Hoare triple {8912#(<= ~counter~0 40)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8912#(<= ~counter~0 40)} is VALID [2022-04-07 14:03:54,296 INFO L290 TraceCheckUtils]: 377: Hoare triple {8912#(<= ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8940#(<= ~counter~0 41)} is VALID [2022-04-07 14:03:54,296 INFO L290 TraceCheckUtils]: 378: Hoare triple {8940#(<= ~counter~0 41)} assume !!(#t~post6 < 100);havoc #t~post6; {8940#(<= ~counter~0 41)} is VALID [2022-04-07 14:03:54,297 INFO L272 TraceCheckUtils]: 379: Hoare triple {8940#(<= ~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)); {8940#(<= ~counter~0 41)} is VALID [2022-04-07 14:03:54,297 INFO L290 TraceCheckUtils]: 380: Hoare triple {8940#(<= ~counter~0 41)} ~cond := #in~cond; {8940#(<= ~counter~0 41)} is VALID [2022-04-07 14:03:54,297 INFO L290 TraceCheckUtils]: 381: Hoare triple {8940#(<= ~counter~0 41)} assume !(0 == ~cond); {8940#(<= ~counter~0 41)} is VALID [2022-04-07 14:03:54,297 INFO L290 TraceCheckUtils]: 382: Hoare triple {8940#(<= ~counter~0 41)} assume true; {8940#(<= ~counter~0 41)} is VALID [2022-04-07 14:03:54,298 INFO L284 TraceCheckUtils]: 383: Hoare quadruple {8940#(<= ~counter~0 41)} {8940#(<= ~counter~0 41)} #63#return; {8940#(<= ~counter~0 41)} is VALID [2022-04-07 14:03:54,298 INFO L290 TraceCheckUtils]: 384: Hoare triple {8940#(<= ~counter~0 41)} assume !!(0 != ~r~0); {8940#(<= ~counter~0 41)} is VALID [2022-04-07 14:03:54,298 INFO L290 TraceCheckUtils]: 385: Hoare triple {8940#(<= ~counter~0 41)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8940#(<= ~counter~0 41)} is VALID [2022-04-07 14:03:54,299 INFO L290 TraceCheckUtils]: 386: Hoare triple {8940#(<= ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8968#(<= ~counter~0 42)} is VALID [2022-04-07 14:03:54,299 INFO L290 TraceCheckUtils]: 387: Hoare triple {8968#(<= ~counter~0 42)} assume !!(#t~post6 < 100);havoc #t~post6; {8968#(<= ~counter~0 42)} is VALID [2022-04-07 14:03:54,299 INFO L272 TraceCheckUtils]: 388: Hoare triple {8968#(<= ~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)); {8968#(<= ~counter~0 42)} is VALID [2022-04-07 14:03:54,300 INFO L290 TraceCheckUtils]: 389: Hoare triple {8968#(<= ~counter~0 42)} ~cond := #in~cond; {8968#(<= ~counter~0 42)} is VALID [2022-04-07 14:03:54,300 INFO L290 TraceCheckUtils]: 390: Hoare triple {8968#(<= ~counter~0 42)} assume !(0 == ~cond); {8968#(<= ~counter~0 42)} is VALID [2022-04-07 14:03:54,300 INFO L290 TraceCheckUtils]: 391: Hoare triple {8968#(<= ~counter~0 42)} assume true; {8968#(<= ~counter~0 42)} is VALID [2022-04-07 14:03:54,300 INFO L284 TraceCheckUtils]: 392: Hoare quadruple {8968#(<= ~counter~0 42)} {8968#(<= ~counter~0 42)} #63#return; {8968#(<= ~counter~0 42)} is VALID [2022-04-07 14:03:54,301 INFO L290 TraceCheckUtils]: 393: Hoare triple {8968#(<= ~counter~0 42)} assume !!(0 != ~r~0); {8968#(<= ~counter~0 42)} is VALID [2022-04-07 14:03:54,301 INFO L290 TraceCheckUtils]: 394: Hoare triple {8968#(<= ~counter~0 42)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8968#(<= ~counter~0 42)} is VALID [2022-04-07 14:03:54,301 INFO L290 TraceCheckUtils]: 395: Hoare triple {8968#(<= ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8996#(<= ~counter~0 43)} is VALID [2022-04-07 14:03:54,302 INFO L290 TraceCheckUtils]: 396: Hoare triple {8996#(<= ~counter~0 43)} assume !!(#t~post6 < 100);havoc #t~post6; {8996#(<= ~counter~0 43)} is VALID [2022-04-07 14:03:54,302 INFO L272 TraceCheckUtils]: 397: Hoare triple {8996#(<= ~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)); {8996#(<= ~counter~0 43)} is VALID [2022-04-07 14:03:54,302 INFO L290 TraceCheckUtils]: 398: Hoare triple {8996#(<= ~counter~0 43)} ~cond := #in~cond; {8996#(<= ~counter~0 43)} is VALID [2022-04-07 14:03:54,302 INFO L290 TraceCheckUtils]: 399: Hoare triple {8996#(<= ~counter~0 43)} assume !(0 == ~cond); {8996#(<= ~counter~0 43)} is VALID [2022-04-07 14:03:54,303 INFO L290 TraceCheckUtils]: 400: Hoare triple {8996#(<= ~counter~0 43)} assume true; {8996#(<= ~counter~0 43)} is VALID [2022-04-07 14:03:54,303 INFO L284 TraceCheckUtils]: 401: Hoare quadruple {8996#(<= ~counter~0 43)} {8996#(<= ~counter~0 43)} #63#return; {8996#(<= ~counter~0 43)} is VALID [2022-04-07 14:03:54,303 INFO L290 TraceCheckUtils]: 402: Hoare triple {8996#(<= ~counter~0 43)} assume !!(0 != ~r~0); {8996#(<= ~counter~0 43)} is VALID [2022-04-07 14:03:54,303 INFO L290 TraceCheckUtils]: 403: Hoare triple {8996#(<= ~counter~0 43)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8996#(<= ~counter~0 43)} is VALID [2022-04-07 14:03:54,304 INFO L290 TraceCheckUtils]: 404: Hoare triple {8996#(<= ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9024#(<= ~counter~0 44)} is VALID [2022-04-07 14:03:54,304 INFO L290 TraceCheckUtils]: 405: Hoare triple {9024#(<= ~counter~0 44)} assume !!(#t~post6 < 100);havoc #t~post6; {9024#(<= ~counter~0 44)} is VALID [2022-04-07 14:03:54,305 INFO L272 TraceCheckUtils]: 406: Hoare triple {9024#(<= ~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)); {9024#(<= ~counter~0 44)} is VALID [2022-04-07 14:03:54,305 INFO L290 TraceCheckUtils]: 407: Hoare triple {9024#(<= ~counter~0 44)} ~cond := #in~cond; {9024#(<= ~counter~0 44)} is VALID [2022-04-07 14:03:54,305 INFO L290 TraceCheckUtils]: 408: Hoare triple {9024#(<= ~counter~0 44)} assume !(0 == ~cond); {9024#(<= ~counter~0 44)} is VALID [2022-04-07 14:03:54,305 INFO L290 TraceCheckUtils]: 409: Hoare triple {9024#(<= ~counter~0 44)} assume true; {9024#(<= ~counter~0 44)} is VALID [2022-04-07 14:03:54,306 INFO L284 TraceCheckUtils]: 410: Hoare quadruple {9024#(<= ~counter~0 44)} {9024#(<= ~counter~0 44)} #63#return; {9024#(<= ~counter~0 44)} is VALID [2022-04-07 14:03:54,306 INFO L290 TraceCheckUtils]: 411: Hoare triple {9024#(<= ~counter~0 44)} assume !!(0 != ~r~0); {9024#(<= ~counter~0 44)} is VALID [2022-04-07 14:03:54,306 INFO L290 TraceCheckUtils]: 412: Hoare triple {9024#(<= ~counter~0 44)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9024#(<= ~counter~0 44)} is VALID [2022-04-07 14:03:54,307 INFO L290 TraceCheckUtils]: 413: Hoare triple {9024#(<= ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9052#(<= ~counter~0 45)} is VALID [2022-04-07 14:03:54,307 INFO L290 TraceCheckUtils]: 414: Hoare triple {9052#(<= ~counter~0 45)} assume !!(#t~post6 < 100);havoc #t~post6; {9052#(<= ~counter~0 45)} is VALID [2022-04-07 14:03:54,307 INFO L272 TraceCheckUtils]: 415: Hoare triple {9052#(<= ~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)); {9052#(<= ~counter~0 45)} is VALID [2022-04-07 14:03:54,307 INFO L290 TraceCheckUtils]: 416: Hoare triple {9052#(<= ~counter~0 45)} ~cond := #in~cond; {9052#(<= ~counter~0 45)} is VALID [2022-04-07 14:03:54,308 INFO L290 TraceCheckUtils]: 417: Hoare triple {9052#(<= ~counter~0 45)} assume !(0 == ~cond); {9052#(<= ~counter~0 45)} is VALID [2022-04-07 14:03:54,308 INFO L290 TraceCheckUtils]: 418: Hoare triple {9052#(<= ~counter~0 45)} assume true; {9052#(<= ~counter~0 45)} is VALID [2022-04-07 14:03:54,308 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {9052#(<= ~counter~0 45)} {9052#(<= ~counter~0 45)} #63#return; {9052#(<= ~counter~0 45)} is VALID [2022-04-07 14:03:54,309 INFO L290 TraceCheckUtils]: 420: Hoare triple {9052#(<= ~counter~0 45)} assume !!(0 != ~r~0); {9052#(<= ~counter~0 45)} is VALID [2022-04-07 14:03:54,309 INFO L290 TraceCheckUtils]: 421: Hoare triple {9052#(<= ~counter~0 45)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9052#(<= ~counter~0 45)} is VALID [2022-04-07 14:03:54,309 INFO L290 TraceCheckUtils]: 422: Hoare triple {9052#(<= ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9080#(<= ~counter~0 46)} is VALID [2022-04-07 14:03:54,309 INFO L290 TraceCheckUtils]: 423: Hoare triple {9080#(<= ~counter~0 46)} assume !!(#t~post6 < 100);havoc #t~post6; {9080#(<= ~counter~0 46)} is VALID [2022-04-07 14:03:54,310 INFO L272 TraceCheckUtils]: 424: Hoare triple {9080#(<= ~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)); {9080#(<= ~counter~0 46)} is VALID [2022-04-07 14:03:54,310 INFO L290 TraceCheckUtils]: 425: Hoare triple {9080#(<= ~counter~0 46)} ~cond := #in~cond; {9080#(<= ~counter~0 46)} is VALID [2022-04-07 14:03:54,310 INFO L290 TraceCheckUtils]: 426: Hoare triple {9080#(<= ~counter~0 46)} assume !(0 == ~cond); {9080#(<= ~counter~0 46)} is VALID [2022-04-07 14:03:54,310 INFO L290 TraceCheckUtils]: 427: Hoare triple {9080#(<= ~counter~0 46)} assume true; {9080#(<= ~counter~0 46)} is VALID [2022-04-07 14:03:54,311 INFO L284 TraceCheckUtils]: 428: Hoare quadruple {9080#(<= ~counter~0 46)} {9080#(<= ~counter~0 46)} #63#return; {9080#(<= ~counter~0 46)} is VALID [2022-04-07 14:03:54,311 INFO L290 TraceCheckUtils]: 429: Hoare triple {9080#(<= ~counter~0 46)} assume !!(0 != ~r~0); {9080#(<= ~counter~0 46)} is VALID [2022-04-07 14:03:54,311 INFO L290 TraceCheckUtils]: 430: Hoare triple {9080#(<= ~counter~0 46)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9080#(<= ~counter~0 46)} is VALID [2022-04-07 14:03:54,312 INFO L290 TraceCheckUtils]: 431: Hoare triple {9080#(<= ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9108#(<= |main_#t~post6| 46)} is VALID [2022-04-07 14:03:54,312 INFO L290 TraceCheckUtils]: 432: Hoare triple {9108#(<= |main_#t~post6| 46)} assume !(#t~post6 < 100);havoc #t~post6; {7764#false} is VALID [2022-04-07 14:03:54,312 INFO L272 TraceCheckUtils]: 433: Hoare triple {7764#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7764#false} is VALID [2022-04-07 14:03:54,313 INFO L290 TraceCheckUtils]: 434: Hoare triple {7764#false} ~cond := #in~cond; {7764#false} is VALID [2022-04-07 14:03:54,313 INFO L290 TraceCheckUtils]: 435: Hoare triple {7764#false} assume 0 == ~cond; {7764#false} is VALID [2022-04-07 14:03:54,313 INFO L290 TraceCheckUtils]: 436: Hoare triple {7764#false} assume !false; {7764#false} is VALID [2022-04-07 14:03:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 14:03:54,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:03:58,019 INFO L290 TraceCheckUtils]: 436: Hoare triple {7764#false} assume !false; {7764#false} is VALID [2022-04-07 14:03:58,020 INFO L290 TraceCheckUtils]: 435: Hoare triple {7764#false} assume 0 == ~cond; {7764#false} is VALID [2022-04-07 14:03:58,020 INFO L290 TraceCheckUtils]: 434: Hoare triple {7764#false} ~cond := #in~cond; {7764#false} is VALID [2022-04-07 14:03:58,020 INFO L272 TraceCheckUtils]: 433: Hoare triple {7764#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7764#false} is VALID [2022-04-07 14:03:58,020 INFO L290 TraceCheckUtils]: 432: Hoare triple {9136#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {7764#false} is VALID [2022-04-07 14:03:58,020 INFO L290 TraceCheckUtils]: 431: Hoare triple {9140#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9136#(< |main_#t~post6| 100)} is VALID [2022-04-07 14:03:58,021 INFO L290 TraceCheckUtils]: 430: Hoare triple {9140#(< ~counter~0 100)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9140#(< ~counter~0 100)} is VALID [2022-04-07 14:03:58,021 INFO L290 TraceCheckUtils]: 429: Hoare triple {9140#(< ~counter~0 100)} assume !!(0 != ~r~0); {9140#(< ~counter~0 100)} is VALID [2022-04-07 14:03:58,021 INFO L284 TraceCheckUtils]: 428: Hoare quadruple {7763#true} {9140#(< ~counter~0 100)} #63#return; {9140#(< ~counter~0 100)} is VALID [2022-04-07 14:03:58,032 INFO L290 TraceCheckUtils]: 427: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,032 INFO L290 TraceCheckUtils]: 426: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,032 INFO L290 TraceCheckUtils]: 425: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,032 INFO L272 TraceCheckUtils]: 424: Hoare triple {9140#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,032 INFO L290 TraceCheckUtils]: 423: Hoare triple {9140#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {9140#(< ~counter~0 100)} is VALID [2022-04-07 14:03:58,033 INFO L290 TraceCheckUtils]: 422: Hoare triple {9168#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9140#(< ~counter~0 100)} is VALID [2022-04-07 14:03:58,033 INFO L290 TraceCheckUtils]: 421: Hoare triple {9168#(< ~counter~0 99)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9168#(< ~counter~0 99)} is VALID [2022-04-07 14:03:58,033 INFO L290 TraceCheckUtils]: 420: Hoare triple {9168#(< ~counter~0 99)} assume !!(0 != ~r~0); {9168#(< ~counter~0 99)} is VALID [2022-04-07 14:03:58,034 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {7763#true} {9168#(< ~counter~0 99)} #63#return; {9168#(< ~counter~0 99)} is VALID [2022-04-07 14:03:58,034 INFO L290 TraceCheckUtils]: 418: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,034 INFO L290 TraceCheckUtils]: 417: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,034 INFO L290 TraceCheckUtils]: 416: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,034 INFO L272 TraceCheckUtils]: 415: Hoare triple {9168#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,034 INFO L290 TraceCheckUtils]: 414: Hoare triple {9168#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {9168#(< ~counter~0 99)} is VALID [2022-04-07 14:03:58,035 INFO L290 TraceCheckUtils]: 413: Hoare triple {9196#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9168#(< ~counter~0 99)} is VALID [2022-04-07 14:03:58,035 INFO L290 TraceCheckUtils]: 412: Hoare triple {9196#(< ~counter~0 98)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9196#(< ~counter~0 98)} is VALID [2022-04-07 14:03:58,035 INFO L290 TraceCheckUtils]: 411: Hoare triple {9196#(< ~counter~0 98)} assume !!(0 != ~r~0); {9196#(< ~counter~0 98)} is VALID [2022-04-07 14:03:58,036 INFO L284 TraceCheckUtils]: 410: Hoare quadruple {7763#true} {9196#(< ~counter~0 98)} #63#return; {9196#(< ~counter~0 98)} is VALID [2022-04-07 14:03:58,036 INFO L290 TraceCheckUtils]: 409: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,036 INFO L290 TraceCheckUtils]: 408: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,036 INFO L290 TraceCheckUtils]: 407: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,036 INFO L272 TraceCheckUtils]: 406: Hoare triple {9196#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,036 INFO L290 TraceCheckUtils]: 405: Hoare triple {9196#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {9196#(< ~counter~0 98)} is VALID [2022-04-07 14:03:58,037 INFO L290 TraceCheckUtils]: 404: Hoare triple {9224#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9196#(< ~counter~0 98)} is VALID [2022-04-07 14:03:58,037 INFO L290 TraceCheckUtils]: 403: Hoare triple {9224#(< ~counter~0 97)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9224#(< ~counter~0 97)} is VALID [2022-04-07 14:03:58,037 INFO L290 TraceCheckUtils]: 402: Hoare triple {9224#(< ~counter~0 97)} assume !!(0 != ~r~0); {9224#(< ~counter~0 97)} is VALID [2022-04-07 14:03:58,038 INFO L284 TraceCheckUtils]: 401: Hoare quadruple {7763#true} {9224#(< ~counter~0 97)} #63#return; {9224#(< ~counter~0 97)} is VALID [2022-04-07 14:03:58,038 INFO L290 TraceCheckUtils]: 400: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,038 INFO L290 TraceCheckUtils]: 399: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,038 INFO L290 TraceCheckUtils]: 398: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,038 INFO L272 TraceCheckUtils]: 397: Hoare triple {9224#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,038 INFO L290 TraceCheckUtils]: 396: Hoare triple {9224#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {9224#(< ~counter~0 97)} is VALID [2022-04-07 14:03:58,038 INFO L290 TraceCheckUtils]: 395: Hoare triple {9252#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9224#(< ~counter~0 97)} is VALID [2022-04-07 14:03:58,039 INFO L290 TraceCheckUtils]: 394: Hoare triple {9252#(< ~counter~0 96)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9252#(< ~counter~0 96)} is VALID [2022-04-07 14:03:58,039 INFO L290 TraceCheckUtils]: 393: Hoare triple {9252#(< ~counter~0 96)} assume !!(0 != ~r~0); {9252#(< ~counter~0 96)} is VALID [2022-04-07 14:03:58,039 INFO L284 TraceCheckUtils]: 392: Hoare quadruple {7763#true} {9252#(< ~counter~0 96)} #63#return; {9252#(< ~counter~0 96)} is VALID [2022-04-07 14:03:58,039 INFO L290 TraceCheckUtils]: 391: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,039 INFO L290 TraceCheckUtils]: 390: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,039 INFO L290 TraceCheckUtils]: 389: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,039 INFO L272 TraceCheckUtils]: 388: Hoare triple {9252#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,040 INFO L290 TraceCheckUtils]: 387: Hoare triple {9252#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {9252#(< ~counter~0 96)} is VALID [2022-04-07 14:03:58,040 INFO L290 TraceCheckUtils]: 386: Hoare triple {9280#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9252#(< ~counter~0 96)} is VALID [2022-04-07 14:03:58,040 INFO L290 TraceCheckUtils]: 385: Hoare triple {9280#(< ~counter~0 95)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9280#(< ~counter~0 95)} is VALID [2022-04-07 14:03:58,041 INFO L290 TraceCheckUtils]: 384: Hoare triple {9280#(< ~counter~0 95)} assume !!(0 != ~r~0); {9280#(< ~counter~0 95)} is VALID [2022-04-07 14:03:58,041 INFO L284 TraceCheckUtils]: 383: Hoare quadruple {7763#true} {9280#(< ~counter~0 95)} #63#return; {9280#(< ~counter~0 95)} is VALID [2022-04-07 14:03:58,041 INFO L290 TraceCheckUtils]: 382: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,041 INFO L290 TraceCheckUtils]: 381: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,041 INFO L290 TraceCheckUtils]: 380: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,041 INFO L272 TraceCheckUtils]: 379: Hoare triple {9280#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,041 INFO L290 TraceCheckUtils]: 378: Hoare triple {9280#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {9280#(< ~counter~0 95)} is VALID [2022-04-07 14:03:58,042 INFO L290 TraceCheckUtils]: 377: Hoare triple {9308#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9280#(< ~counter~0 95)} is VALID [2022-04-07 14:03:58,042 INFO L290 TraceCheckUtils]: 376: Hoare triple {9308#(< ~counter~0 94)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9308#(< ~counter~0 94)} is VALID [2022-04-07 14:03:58,042 INFO L290 TraceCheckUtils]: 375: Hoare triple {9308#(< ~counter~0 94)} assume !!(0 != ~r~0); {9308#(< ~counter~0 94)} is VALID [2022-04-07 14:03:58,043 INFO L284 TraceCheckUtils]: 374: Hoare quadruple {7763#true} {9308#(< ~counter~0 94)} #63#return; {9308#(< ~counter~0 94)} is VALID [2022-04-07 14:03:58,043 INFO L290 TraceCheckUtils]: 373: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,043 INFO L290 TraceCheckUtils]: 372: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,043 INFO L290 TraceCheckUtils]: 371: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,043 INFO L272 TraceCheckUtils]: 370: Hoare triple {9308#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,043 INFO L290 TraceCheckUtils]: 369: Hoare triple {9308#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {9308#(< ~counter~0 94)} is VALID [2022-04-07 14:03:58,044 INFO L290 TraceCheckUtils]: 368: Hoare triple {9336#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9308#(< ~counter~0 94)} is VALID [2022-04-07 14:03:58,044 INFO L290 TraceCheckUtils]: 367: Hoare triple {9336#(< ~counter~0 93)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9336#(< ~counter~0 93)} is VALID [2022-04-07 14:03:58,044 INFO L290 TraceCheckUtils]: 366: Hoare triple {9336#(< ~counter~0 93)} assume !!(0 != ~r~0); {9336#(< ~counter~0 93)} is VALID [2022-04-07 14:03:58,045 INFO L284 TraceCheckUtils]: 365: Hoare quadruple {7763#true} {9336#(< ~counter~0 93)} #63#return; {9336#(< ~counter~0 93)} is VALID [2022-04-07 14:03:58,045 INFO L290 TraceCheckUtils]: 364: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,045 INFO L290 TraceCheckUtils]: 363: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,045 INFO L290 TraceCheckUtils]: 362: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,045 INFO L272 TraceCheckUtils]: 361: Hoare triple {9336#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,045 INFO L290 TraceCheckUtils]: 360: Hoare triple {9336#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {9336#(< ~counter~0 93)} is VALID [2022-04-07 14:03:58,045 INFO L290 TraceCheckUtils]: 359: Hoare triple {9364#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9336#(< ~counter~0 93)} is VALID [2022-04-07 14:03:58,046 INFO L290 TraceCheckUtils]: 358: Hoare triple {9364#(< ~counter~0 92)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9364#(< ~counter~0 92)} is VALID [2022-04-07 14:03:58,046 INFO L290 TraceCheckUtils]: 357: Hoare triple {9364#(< ~counter~0 92)} assume !!(0 != ~r~0); {9364#(< ~counter~0 92)} is VALID [2022-04-07 14:03:58,046 INFO L284 TraceCheckUtils]: 356: Hoare quadruple {7763#true} {9364#(< ~counter~0 92)} #63#return; {9364#(< ~counter~0 92)} is VALID [2022-04-07 14:03:58,046 INFO L290 TraceCheckUtils]: 355: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,046 INFO L290 TraceCheckUtils]: 354: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,046 INFO L290 TraceCheckUtils]: 353: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,046 INFO L272 TraceCheckUtils]: 352: Hoare triple {9364#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,047 INFO L290 TraceCheckUtils]: 351: Hoare triple {9364#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {9364#(< ~counter~0 92)} is VALID [2022-04-07 14:03:58,047 INFO L290 TraceCheckUtils]: 350: Hoare triple {9392#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9364#(< ~counter~0 92)} is VALID [2022-04-07 14:03:58,047 INFO L290 TraceCheckUtils]: 349: Hoare triple {9392#(< ~counter~0 91)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9392#(< ~counter~0 91)} is VALID [2022-04-07 14:03:58,048 INFO L290 TraceCheckUtils]: 348: Hoare triple {9392#(< ~counter~0 91)} assume !!(0 != ~r~0); {9392#(< ~counter~0 91)} is VALID [2022-04-07 14:03:58,048 INFO L284 TraceCheckUtils]: 347: Hoare quadruple {7763#true} {9392#(< ~counter~0 91)} #63#return; {9392#(< ~counter~0 91)} is VALID [2022-04-07 14:03:58,048 INFO L290 TraceCheckUtils]: 346: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,048 INFO L290 TraceCheckUtils]: 345: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,048 INFO L290 TraceCheckUtils]: 344: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,048 INFO L272 TraceCheckUtils]: 343: Hoare triple {9392#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,048 INFO L290 TraceCheckUtils]: 342: Hoare triple {9392#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {9392#(< ~counter~0 91)} is VALID [2022-04-07 14:03:58,049 INFO L290 TraceCheckUtils]: 341: Hoare triple {9420#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9392#(< ~counter~0 91)} is VALID [2022-04-07 14:03:58,049 INFO L290 TraceCheckUtils]: 340: Hoare triple {9420#(< ~counter~0 90)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9420#(< ~counter~0 90)} is VALID [2022-04-07 14:03:58,049 INFO L290 TraceCheckUtils]: 339: Hoare triple {9420#(< ~counter~0 90)} assume !!(0 != ~r~0); {9420#(< ~counter~0 90)} is VALID [2022-04-07 14:03:58,050 INFO L284 TraceCheckUtils]: 338: Hoare quadruple {7763#true} {9420#(< ~counter~0 90)} #63#return; {9420#(< ~counter~0 90)} is VALID [2022-04-07 14:03:58,050 INFO L290 TraceCheckUtils]: 337: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,050 INFO L290 TraceCheckUtils]: 336: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,050 INFO L290 TraceCheckUtils]: 335: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,050 INFO L272 TraceCheckUtils]: 334: Hoare triple {9420#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,050 INFO L290 TraceCheckUtils]: 333: Hoare triple {9420#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {9420#(< ~counter~0 90)} is VALID [2022-04-07 14:03:58,051 INFO L290 TraceCheckUtils]: 332: Hoare triple {9448#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9420#(< ~counter~0 90)} is VALID [2022-04-07 14:03:58,051 INFO L290 TraceCheckUtils]: 331: Hoare triple {9448#(< ~counter~0 89)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9448#(< ~counter~0 89)} is VALID [2022-04-07 14:03:58,051 INFO L290 TraceCheckUtils]: 330: Hoare triple {9448#(< ~counter~0 89)} assume !!(0 != ~r~0); {9448#(< ~counter~0 89)} is VALID [2022-04-07 14:03:58,052 INFO L284 TraceCheckUtils]: 329: Hoare quadruple {7763#true} {9448#(< ~counter~0 89)} #63#return; {9448#(< ~counter~0 89)} is VALID [2022-04-07 14:03:58,052 INFO L290 TraceCheckUtils]: 328: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,052 INFO L290 TraceCheckUtils]: 327: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,052 INFO L290 TraceCheckUtils]: 326: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,052 INFO L272 TraceCheckUtils]: 325: Hoare triple {9448#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,052 INFO L290 TraceCheckUtils]: 324: Hoare triple {9448#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {9448#(< ~counter~0 89)} is VALID [2022-04-07 14:03:58,052 INFO L290 TraceCheckUtils]: 323: Hoare triple {9476#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9448#(< ~counter~0 89)} is VALID [2022-04-07 14:03:58,053 INFO L290 TraceCheckUtils]: 322: Hoare triple {9476#(< ~counter~0 88)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9476#(< ~counter~0 88)} is VALID [2022-04-07 14:03:58,053 INFO L290 TraceCheckUtils]: 321: Hoare triple {9476#(< ~counter~0 88)} assume !!(0 != ~r~0); {9476#(< ~counter~0 88)} is VALID [2022-04-07 14:03:58,053 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {7763#true} {9476#(< ~counter~0 88)} #63#return; {9476#(< ~counter~0 88)} is VALID [2022-04-07 14:03:58,053 INFO L290 TraceCheckUtils]: 319: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,053 INFO L290 TraceCheckUtils]: 318: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,053 INFO L290 TraceCheckUtils]: 317: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,054 INFO L272 TraceCheckUtils]: 316: Hoare triple {9476#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,054 INFO L290 TraceCheckUtils]: 315: Hoare triple {9476#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {9476#(< ~counter~0 88)} is VALID [2022-04-07 14:03:58,054 INFO L290 TraceCheckUtils]: 314: Hoare triple {9504#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9476#(< ~counter~0 88)} is VALID [2022-04-07 14:03:58,054 INFO L290 TraceCheckUtils]: 313: Hoare triple {9504#(< ~counter~0 87)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9504#(< ~counter~0 87)} is VALID [2022-04-07 14:03:58,055 INFO L290 TraceCheckUtils]: 312: Hoare triple {9504#(< ~counter~0 87)} assume !!(0 != ~r~0); {9504#(< ~counter~0 87)} is VALID [2022-04-07 14:03:58,055 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {7763#true} {9504#(< ~counter~0 87)} #63#return; {9504#(< ~counter~0 87)} is VALID [2022-04-07 14:03:58,055 INFO L290 TraceCheckUtils]: 310: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,055 INFO L290 TraceCheckUtils]: 309: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,055 INFO L290 TraceCheckUtils]: 308: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,055 INFO L272 TraceCheckUtils]: 307: Hoare triple {9504#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,056 INFO L290 TraceCheckUtils]: 306: Hoare triple {9504#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {9504#(< ~counter~0 87)} is VALID [2022-04-07 14:03:58,056 INFO L290 TraceCheckUtils]: 305: Hoare triple {9532#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9504#(< ~counter~0 87)} is VALID [2022-04-07 14:03:58,056 INFO L290 TraceCheckUtils]: 304: Hoare triple {9532#(< ~counter~0 86)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9532#(< ~counter~0 86)} is VALID [2022-04-07 14:03:58,056 INFO L290 TraceCheckUtils]: 303: Hoare triple {9532#(< ~counter~0 86)} assume !!(0 != ~r~0); {9532#(< ~counter~0 86)} is VALID [2022-04-07 14:03:58,057 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {7763#true} {9532#(< ~counter~0 86)} #63#return; {9532#(< ~counter~0 86)} is VALID [2022-04-07 14:03:58,057 INFO L290 TraceCheckUtils]: 301: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,057 INFO L290 TraceCheckUtils]: 300: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,057 INFO L290 TraceCheckUtils]: 299: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,057 INFO L272 TraceCheckUtils]: 298: Hoare triple {9532#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,057 INFO L290 TraceCheckUtils]: 297: Hoare triple {9532#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {9532#(< ~counter~0 86)} is VALID [2022-04-07 14:03:58,058 INFO L290 TraceCheckUtils]: 296: Hoare triple {9560#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9532#(< ~counter~0 86)} is VALID [2022-04-07 14:03:58,058 INFO L290 TraceCheckUtils]: 295: Hoare triple {9560#(< ~counter~0 85)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9560#(< ~counter~0 85)} is VALID [2022-04-07 14:03:58,058 INFO L290 TraceCheckUtils]: 294: Hoare triple {9560#(< ~counter~0 85)} assume !!(0 != ~r~0); {9560#(< ~counter~0 85)} is VALID [2022-04-07 14:03:58,059 INFO L284 TraceCheckUtils]: 293: Hoare quadruple {7763#true} {9560#(< ~counter~0 85)} #63#return; {9560#(< ~counter~0 85)} is VALID [2022-04-07 14:03:58,059 INFO L290 TraceCheckUtils]: 292: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,059 INFO L290 TraceCheckUtils]: 291: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,059 INFO L290 TraceCheckUtils]: 290: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,059 INFO L272 TraceCheckUtils]: 289: Hoare triple {9560#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,059 INFO L290 TraceCheckUtils]: 288: Hoare triple {9560#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {9560#(< ~counter~0 85)} is VALID [2022-04-07 14:03:58,059 INFO L290 TraceCheckUtils]: 287: Hoare triple {9588#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9560#(< ~counter~0 85)} is VALID [2022-04-07 14:03:58,060 INFO L290 TraceCheckUtils]: 286: Hoare triple {9588#(< ~counter~0 84)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9588#(< ~counter~0 84)} is VALID [2022-04-07 14:03:58,060 INFO L290 TraceCheckUtils]: 285: Hoare triple {9588#(< ~counter~0 84)} assume !!(0 != ~r~0); {9588#(< ~counter~0 84)} is VALID [2022-04-07 14:03:58,060 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {7763#true} {9588#(< ~counter~0 84)} #63#return; {9588#(< ~counter~0 84)} is VALID [2022-04-07 14:03:58,060 INFO L290 TraceCheckUtils]: 283: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,060 INFO L290 TraceCheckUtils]: 282: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,060 INFO L290 TraceCheckUtils]: 281: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,061 INFO L272 TraceCheckUtils]: 280: Hoare triple {9588#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,061 INFO L290 TraceCheckUtils]: 279: Hoare triple {9588#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {9588#(< ~counter~0 84)} is VALID [2022-04-07 14:03:58,061 INFO L290 TraceCheckUtils]: 278: Hoare triple {9616#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9588#(< ~counter~0 84)} is VALID [2022-04-07 14:03:58,061 INFO L290 TraceCheckUtils]: 277: Hoare triple {9616#(< ~counter~0 83)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9616#(< ~counter~0 83)} is VALID [2022-04-07 14:03:58,062 INFO L290 TraceCheckUtils]: 276: Hoare triple {9616#(< ~counter~0 83)} assume !!(0 != ~r~0); {9616#(< ~counter~0 83)} is VALID [2022-04-07 14:03:58,062 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {7763#true} {9616#(< ~counter~0 83)} #63#return; {9616#(< ~counter~0 83)} is VALID [2022-04-07 14:03:58,062 INFO L290 TraceCheckUtils]: 274: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,062 INFO L290 TraceCheckUtils]: 273: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,062 INFO L290 TraceCheckUtils]: 272: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,062 INFO L272 TraceCheckUtils]: 271: Hoare triple {9616#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,062 INFO L290 TraceCheckUtils]: 270: Hoare triple {9616#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {9616#(< ~counter~0 83)} is VALID [2022-04-07 14:03:58,063 INFO L290 TraceCheckUtils]: 269: Hoare triple {9644#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9616#(< ~counter~0 83)} is VALID [2022-04-07 14:03:58,063 INFO L290 TraceCheckUtils]: 268: Hoare triple {9644#(< ~counter~0 82)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9644#(< ~counter~0 82)} is VALID [2022-04-07 14:03:58,063 INFO L290 TraceCheckUtils]: 267: Hoare triple {9644#(< ~counter~0 82)} assume !!(0 != ~r~0); {9644#(< ~counter~0 82)} is VALID [2022-04-07 14:03:58,064 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {7763#true} {9644#(< ~counter~0 82)} #63#return; {9644#(< ~counter~0 82)} is VALID [2022-04-07 14:03:58,064 INFO L290 TraceCheckUtils]: 265: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,064 INFO L290 TraceCheckUtils]: 264: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,064 INFO L290 TraceCheckUtils]: 263: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,064 INFO L272 TraceCheckUtils]: 262: Hoare triple {9644#(< ~counter~0 82)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,064 INFO L290 TraceCheckUtils]: 261: Hoare triple {9644#(< ~counter~0 82)} assume !!(#t~post6 < 100);havoc #t~post6; {9644#(< ~counter~0 82)} is VALID [2022-04-07 14:03:58,065 INFO L290 TraceCheckUtils]: 260: Hoare triple {9672#(< ~counter~0 81)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9644#(< ~counter~0 82)} is VALID [2022-04-07 14:03:58,065 INFO L290 TraceCheckUtils]: 259: Hoare triple {9672#(< ~counter~0 81)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9672#(< ~counter~0 81)} is VALID [2022-04-07 14:03:58,065 INFO L290 TraceCheckUtils]: 258: Hoare triple {9672#(< ~counter~0 81)} assume !!(0 != ~r~0); {9672#(< ~counter~0 81)} is VALID [2022-04-07 14:03:58,066 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {7763#true} {9672#(< ~counter~0 81)} #63#return; {9672#(< ~counter~0 81)} is VALID [2022-04-07 14:03:58,066 INFO L290 TraceCheckUtils]: 256: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,066 INFO L290 TraceCheckUtils]: 255: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,066 INFO L290 TraceCheckUtils]: 254: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,066 INFO L272 TraceCheckUtils]: 253: Hoare triple {9672#(< ~counter~0 81)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,066 INFO L290 TraceCheckUtils]: 252: Hoare triple {9672#(< ~counter~0 81)} assume !!(#t~post6 < 100);havoc #t~post6; {9672#(< ~counter~0 81)} is VALID [2022-04-07 14:03:58,066 INFO L290 TraceCheckUtils]: 251: Hoare triple {9700#(< ~counter~0 80)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9672#(< ~counter~0 81)} is VALID [2022-04-07 14:03:58,067 INFO L290 TraceCheckUtils]: 250: Hoare triple {9700#(< ~counter~0 80)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9700#(< ~counter~0 80)} is VALID [2022-04-07 14:03:58,067 INFO L290 TraceCheckUtils]: 249: Hoare triple {9700#(< ~counter~0 80)} assume !!(0 != ~r~0); {9700#(< ~counter~0 80)} is VALID [2022-04-07 14:03:58,067 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {7763#true} {9700#(< ~counter~0 80)} #63#return; {9700#(< ~counter~0 80)} is VALID [2022-04-07 14:03:58,067 INFO L290 TraceCheckUtils]: 247: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,067 INFO L290 TraceCheckUtils]: 246: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,067 INFO L290 TraceCheckUtils]: 245: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,068 INFO L272 TraceCheckUtils]: 244: Hoare triple {9700#(< ~counter~0 80)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,068 INFO L290 TraceCheckUtils]: 243: Hoare triple {9700#(< ~counter~0 80)} assume !!(#t~post6 < 100);havoc #t~post6; {9700#(< ~counter~0 80)} is VALID [2022-04-07 14:03:58,068 INFO L290 TraceCheckUtils]: 242: Hoare triple {9728#(< ~counter~0 79)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9700#(< ~counter~0 80)} is VALID [2022-04-07 14:03:58,068 INFO L290 TraceCheckUtils]: 241: Hoare triple {9728#(< ~counter~0 79)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9728#(< ~counter~0 79)} is VALID [2022-04-07 14:03:58,069 INFO L290 TraceCheckUtils]: 240: Hoare triple {9728#(< ~counter~0 79)} assume !!(0 != ~r~0); {9728#(< ~counter~0 79)} is VALID [2022-04-07 14:03:58,069 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {7763#true} {9728#(< ~counter~0 79)} #63#return; {9728#(< ~counter~0 79)} is VALID [2022-04-07 14:03:58,069 INFO L290 TraceCheckUtils]: 238: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,069 INFO L290 TraceCheckUtils]: 237: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,069 INFO L290 TraceCheckUtils]: 236: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,069 INFO L272 TraceCheckUtils]: 235: Hoare triple {9728#(< ~counter~0 79)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,069 INFO L290 TraceCheckUtils]: 234: Hoare triple {9728#(< ~counter~0 79)} assume !!(#t~post6 < 100);havoc #t~post6; {9728#(< ~counter~0 79)} is VALID [2022-04-07 14:03:58,070 INFO L290 TraceCheckUtils]: 233: Hoare triple {9756#(< ~counter~0 78)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9728#(< ~counter~0 79)} is VALID [2022-04-07 14:03:58,070 INFO L290 TraceCheckUtils]: 232: Hoare triple {9756#(< ~counter~0 78)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9756#(< ~counter~0 78)} is VALID [2022-04-07 14:03:58,070 INFO L290 TraceCheckUtils]: 231: Hoare triple {9756#(< ~counter~0 78)} assume !!(0 != ~r~0); {9756#(< ~counter~0 78)} is VALID [2022-04-07 14:03:58,071 INFO L284 TraceCheckUtils]: 230: Hoare quadruple {7763#true} {9756#(< ~counter~0 78)} #63#return; {9756#(< ~counter~0 78)} is VALID [2022-04-07 14:03:58,071 INFO L290 TraceCheckUtils]: 229: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,071 INFO L290 TraceCheckUtils]: 228: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,071 INFO L290 TraceCheckUtils]: 227: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,071 INFO L272 TraceCheckUtils]: 226: Hoare triple {9756#(< ~counter~0 78)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,071 INFO L290 TraceCheckUtils]: 225: Hoare triple {9756#(< ~counter~0 78)} assume !!(#t~post6 < 100);havoc #t~post6; {9756#(< ~counter~0 78)} is VALID [2022-04-07 14:03:58,072 INFO L290 TraceCheckUtils]: 224: Hoare triple {9784#(< ~counter~0 77)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9756#(< ~counter~0 78)} is VALID [2022-04-07 14:03:58,072 INFO L290 TraceCheckUtils]: 223: Hoare triple {9784#(< ~counter~0 77)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9784#(< ~counter~0 77)} is VALID [2022-04-07 14:03:58,072 INFO L290 TraceCheckUtils]: 222: Hoare triple {9784#(< ~counter~0 77)} assume !!(0 != ~r~0); {9784#(< ~counter~0 77)} is VALID [2022-04-07 14:03:58,073 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {7763#true} {9784#(< ~counter~0 77)} #63#return; {9784#(< ~counter~0 77)} is VALID [2022-04-07 14:03:58,073 INFO L290 TraceCheckUtils]: 220: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,073 INFO L290 TraceCheckUtils]: 219: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,073 INFO L290 TraceCheckUtils]: 218: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,073 INFO L272 TraceCheckUtils]: 217: Hoare triple {9784#(< ~counter~0 77)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,073 INFO L290 TraceCheckUtils]: 216: Hoare triple {9784#(< ~counter~0 77)} assume !!(#t~post6 < 100);havoc #t~post6; {9784#(< ~counter~0 77)} is VALID [2022-04-07 14:03:58,073 INFO L290 TraceCheckUtils]: 215: Hoare triple {9812#(< ~counter~0 76)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9784#(< ~counter~0 77)} is VALID [2022-04-07 14:03:58,074 INFO L290 TraceCheckUtils]: 214: Hoare triple {9812#(< ~counter~0 76)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9812#(< ~counter~0 76)} is VALID [2022-04-07 14:03:58,074 INFO L290 TraceCheckUtils]: 213: Hoare triple {9812#(< ~counter~0 76)} assume !!(0 != ~r~0); {9812#(< ~counter~0 76)} is VALID [2022-04-07 14:03:58,074 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {7763#true} {9812#(< ~counter~0 76)} #63#return; {9812#(< ~counter~0 76)} is VALID [2022-04-07 14:03:58,074 INFO L290 TraceCheckUtils]: 211: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,074 INFO L290 TraceCheckUtils]: 210: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,074 INFO L290 TraceCheckUtils]: 209: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,074 INFO L272 TraceCheckUtils]: 208: Hoare triple {9812#(< ~counter~0 76)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,075 INFO L290 TraceCheckUtils]: 207: Hoare triple {9812#(< ~counter~0 76)} assume !!(#t~post6 < 100);havoc #t~post6; {9812#(< ~counter~0 76)} is VALID [2022-04-07 14:03:58,075 INFO L290 TraceCheckUtils]: 206: Hoare triple {9840#(< ~counter~0 75)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9812#(< ~counter~0 76)} is VALID [2022-04-07 14:03:58,075 INFO L290 TraceCheckUtils]: 205: Hoare triple {9840#(< ~counter~0 75)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9840#(< ~counter~0 75)} is VALID [2022-04-07 14:03:58,076 INFO L290 TraceCheckUtils]: 204: Hoare triple {9840#(< ~counter~0 75)} assume !!(0 != ~r~0); {9840#(< ~counter~0 75)} is VALID [2022-04-07 14:03:58,076 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {7763#true} {9840#(< ~counter~0 75)} #63#return; {9840#(< ~counter~0 75)} is VALID [2022-04-07 14:03:58,076 INFO L290 TraceCheckUtils]: 202: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,076 INFO L290 TraceCheckUtils]: 201: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,076 INFO L290 TraceCheckUtils]: 200: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,076 INFO L272 TraceCheckUtils]: 199: Hoare triple {9840#(< ~counter~0 75)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,076 INFO L290 TraceCheckUtils]: 198: Hoare triple {9840#(< ~counter~0 75)} assume !!(#t~post6 < 100);havoc #t~post6; {9840#(< ~counter~0 75)} is VALID [2022-04-07 14:03:58,077 INFO L290 TraceCheckUtils]: 197: Hoare triple {9868#(< ~counter~0 74)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9840#(< ~counter~0 75)} is VALID [2022-04-07 14:03:58,077 INFO L290 TraceCheckUtils]: 196: Hoare triple {9868#(< ~counter~0 74)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9868#(< ~counter~0 74)} is VALID [2022-04-07 14:03:58,077 INFO L290 TraceCheckUtils]: 195: Hoare triple {9868#(< ~counter~0 74)} assume !!(0 != ~r~0); {9868#(< ~counter~0 74)} is VALID [2022-04-07 14:03:58,078 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {7763#true} {9868#(< ~counter~0 74)} #63#return; {9868#(< ~counter~0 74)} is VALID [2022-04-07 14:03:58,078 INFO L290 TraceCheckUtils]: 193: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,078 INFO L290 TraceCheckUtils]: 192: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,078 INFO L290 TraceCheckUtils]: 191: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,078 INFO L272 TraceCheckUtils]: 190: Hoare triple {9868#(< ~counter~0 74)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,078 INFO L290 TraceCheckUtils]: 189: Hoare triple {9868#(< ~counter~0 74)} assume !!(#t~post6 < 100);havoc #t~post6; {9868#(< ~counter~0 74)} is VALID [2022-04-07 14:03:58,079 INFO L290 TraceCheckUtils]: 188: Hoare triple {9896#(< ~counter~0 73)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9868#(< ~counter~0 74)} is VALID [2022-04-07 14:03:58,079 INFO L290 TraceCheckUtils]: 187: Hoare triple {9896#(< ~counter~0 73)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9896#(< ~counter~0 73)} is VALID [2022-04-07 14:03:58,079 INFO L290 TraceCheckUtils]: 186: Hoare triple {9896#(< ~counter~0 73)} assume !!(0 != ~r~0); {9896#(< ~counter~0 73)} is VALID [2022-04-07 14:03:58,080 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {7763#true} {9896#(< ~counter~0 73)} #63#return; {9896#(< ~counter~0 73)} is VALID [2022-04-07 14:03:58,080 INFO L290 TraceCheckUtils]: 184: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,080 INFO L290 TraceCheckUtils]: 183: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,080 INFO L290 TraceCheckUtils]: 182: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,080 INFO L272 TraceCheckUtils]: 181: Hoare triple {9896#(< ~counter~0 73)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,080 INFO L290 TraceCheckUtils]: 180: Hoare triple {9896#(< ~counter~0 73)} assume !!(#t~post6 < 100);havoc #t~post6; {9896#(< ~counter~0 73)} is VALID [2022-04-07 14:03:58,080 INFO L290 TraceCheckUtils]: 179: Hoare triple {9924#(< ~counter~0 72)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9896#(< ~counter~0 73)} is VALID [2022-04-07 14:03:58,081 INFO L290 TraceCheckUtils]: 178: Hoare triple {9924#(< ~counter~0 72)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9924#(< ~counter~0 72)} is VALID [2022-04-07 14:03:58,081 INFO L290 TraceCheckUtils]: 177: Hoare triple {9924#(< ~counter~0 72)} assume !!(0 != ~r~0); {9924#(< ~counter~0 72)} is VALID [2022-04-07 14:03:58,081 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {7763#true} {9924#(< ~counter~0 72)} #63#return; {9924#(< ~counter~0 72)} is VALID [2022-04-07 14:03:58,081 INFO L290 TraceCheckUtils]: 175: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,081 INFO L290 TraceCheckUtils]: 174: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,081 INFO L290 TraceCheckUtils]: 173: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,081 INFO L272 TraceCheckUtils]: 172: Hoare triple {9924#(< ~counter~0 72)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,082 INFO L290 TraceCheckUtils]: 171: Hoare triple {9924#(< ~counter~0 72)} assume !!(#t~post6 < 100);havoc #t~post6; {9924#(< ~counter~0 72)} is VALID [2022-04-07 14:03:58,082 INFO L290 TraceCheckUtils]: 170: Hoare triple {9952#(< ~counter~0 71)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9924#(< ~counter~0 72)} is VALID [2022-04-07 14:03:58,082 INFO L290 TraceCheckUtils]: 169: Hoare triple {9952#(< ~counter~0 71)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9952#(< ~counter~0 71)} is VALID [2022-04-07 14:03:58,083 INFO L290 TraceCheckUtils]: 168: Hoare triple {9952#(< ~counter~0 71)} assume !!(0 != ~r~0); {9952#(< ~counter~0 71)} is VALID [2022-04-07 14:03:58,083 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {7763#true} {9952#(< ~counter~0 71)} #63#return; {9952#(< ~counter~0 71)} is VALID [2022-04-07 14:03:58,083 INFO L290 TraceCheckUtils]: 166: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,083 INFO L290 TraceCheckUtils]: 165: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,083 INFO L290 TraceCheckUtils]: 164: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,083 INFO L272 TraceCheckUtils]: 163: Hoare triple {9952#(< ~counter~0 71)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,083 INFO L290 TraceCheckUtils]: 162: Hoare triple {9952#(< ~counter~0 71)} assume !!(#t~post6 < 100);havoc #t~post6; {9952#(< ~counter~0 71)} is VALID [2022-04-07 14:03:58,084 INFO L290 TraceCheckUtils]: 161: Hoare triple {9980#(< ~counter~0 70)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9952#(< ~counter~0 71)} is VALID [2022-04-07 14:03:58,084 INFO L290 TraceCheckUtils]: 160: Hoare triple {9980#(< ~counter~0 70)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9980#(< ~counter~0 70)} is VALID [2022-04-07 14:03:58,084 INFO L290 TraceCheckUtils]: 159: Hoare triple {9980#(< ~counter~0 70)} assume !!(0 != ~r~0); {9980#(< ~counter~0 70)} is VALID [2022-04-07 14:03:58,085 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {7763#true} {9980#(< ~counter~0 70)} #63#return; {9980#(< ~counter~0 70)} is VALID [2022-04-07 14:03:58,085 INFO L290 TraceCheckUtils]: 157: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,085 INFO L290 TraceCheckUtils]: 156: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,085 INFO L290 TraceCheckUtils]: 155: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,085 INFO L272 TraceCheckUtils]: 154: Hoare triple {9980#(< ~counter~0 70)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,085 INFO L290 TraceCheckUtils]: 153: Hoare triple {9980#(< ~counter~0 70)} assume !!(#t~post6 < 100);havoc #t~post6; {9980#(< ~counter~0 70)} is VALID [2022-04-07 14:03:58,086 INFO L290 TraceCheckUtils]: 152: Hoare triple {10008#(< ~counter~0 69)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9980#(< ~counter~0 70)} is VALID [2022-04-07 14:03:58,086 INFO L290 TraceCheckUtils]: 151: Hoare triple {10008#(< ~counter~0 69)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10008#(< ~counter~0 69)} is VALID [2022-04-07 14:03:58,086 INFO L290 TraceCheckUtils]: 150: Hoare triple {10008#(< ~counter~0 69)} assume !!(0 != ~r~0); {10008#(< ~counter~0 69)} is VALID [2022-04-07 14:03:58,087 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {7763#true} {10008#(< ~counter~0 69)} #63#return; {10008#(< ~counter~0 69)} is VALID [2022-04-07 14:03:58,087 INFO L290 TraceCheckUtils]: 148: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,087 INFO L290 TraceCheckUtils]: 147: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,087 INFO L290 TraceCheckUtils]: 146: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,087 INFO L272 TraceCheckUtils]: 145: Hoare triple {10008#(< ~counter~0 69)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,087 INFO L290 TraceCheckUtils]: 144: Hoare triple {10008#(< ~counter~0 69)} assume !!(#t~post6 < 100);havoc #t~post6; {10008#(< ~counter~0 69)} is VALID [2022-04-07 14:03:58,087 INFO L290 TraceCheckUtils]: 143: Hoare triple {10036#(< ~counter~0 68)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10008#(< ~counter~0 69)} is VALID [2022-04-07 14:03:58,088 INFO L290 TraceCheckUtils]: 142: Hoare triple {10036#(< ~counter~0 68)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10036#(< ~counter~0 68)} is VALID [2022-04-07 14:03:58,088 INFO L290 TraceCheckUtils]: 141: Hoare triple {10036#(< ~counter~0 68)} assume !!(0 != ~r~0); {10036#(< ~counter~0 68)} is VALID [2022-04-07 14:03:58,088 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {7763#true} {10036#(< ~counter~0 68)} #63#return; {10036#(< ~counter~0 68)} is VALID [2022-04-07 14:03:58,088 INFO L290 TraceCheckUtils]: 139: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,088 INFO L290 TraceCheckUtils]: 138: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,088 INFO L290 TraceCheckUtils]: 137: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,088 INFO L272 TraceCheckUtils]: 136: Hoare triple {10036#(< ~counter~0 68)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,089 INFO L290 TraceCheckUtils]: 135: Hoare triple {10036#(< ~counter~0 68)} assume !!(#t~post6 < 100);havoc #t~post6; {10036#(< ~counter~0 68)} is VALID [2022-04-07 14:03:58,089 INFO L290 TraceCheckUtils]: 134: Hoare triple {10064#(< ~counter~0 67)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10036#(< ~counter~0 68)} is VALID [2022-04-07 14:03:58,089 INFO L290 TraceCheckUtils]: 133: Hoare triple {10064#(< ~counter~0 67)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10064#(< ~counter~0 67)} is VALID [2022-04-07 14:03:58,090 INFO L290 TraceCheckUtils]: 132: Hoare triple {10064#(< ~counter~0 67)} assume !!(0 != ~r~0); {10064#(< ~counter~0 67)} is VALID [2022-04-07 14:03:58,090 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {7763#true} {10064#(< ~counter~0 67)} #63#return; {10064#(< ~counter~0 67)} is VALID [2022-04-07 14:03:58,090 INFO L290 TraceCheckUtils]: 130: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,090 INFO L290 TraceCheckUtils]: 129: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,090 INFO L290 TraceCheckUtils]: 128: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,090 INFO L272 TraceCheckUtils]: 127: Hoare triple {10064#(< ~counter~0 67)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,090 INFO L290 TraceCheckUtils]: 126: Hoare triple {10064#(< ~counter~0 67)} assume !!(#t~post6 < 100);havoc #t~post6; {10064#(< ~counter~0 67)} is VALID [2022-04-07 14:03:58,091 INFO L290 TraceCheckUtils]: 125: Hoare triple {10092#(< ~counter~0 66)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10064#(< ~counter~0 67)} is VALID [2022-04-07 14:03:58,091 INFO L290 TraceCheckUtils]: 124: Hoare triple {10092#(< ~counter~0 66)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10092#(< ~counter~0 66)} is VALID [2022-04-07 14:03:58,091 INFO L290 TraceCheckUtils]: 123: Hoare triple {10092#(< ~counter~0 66)} assume !!(0 != ~r~0); {10092#(< ~counter~0 66)} is VALID [2022-04-07 14:03:58,092 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {7763#true} {10092#(< ~counter~0 66)} #63#return; {10092#(< ~counter~0 66)} is VALID [2022-04-07 14:03:58,092 INFO L290 TraceCheckUtils]: 121: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,092 INFO L290 TraceCheckUtils]: 120: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,092 INFO L290 TraceCheckUtils]: 119: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,092 INFO L272 TraceCheckUtils]: 118: Hoare triple {10092#(< ~counter~0 66)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,092 INFO L290 TraceCheckUtils]: 117: Hoare triple {10092#(< ~counter~0 66)} assume !!(#t~post6 < 100);havoc #t~post6; {10092#(< ~counter~0 66)} is VALID [2022-04-07 14:03:58,093 INFO L290 TraceCheckUtils]: 116: Hoare triple {10120#(< ~counter~0 65)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10092#(< ~counter~0 66)} is VALID [2022-04-07 14:03:58,093 INFO L290 TraceCheckUtils]: 115: Hoare triple {10120#(< ~counter~0 65)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10120#(< ~counter~0 65)} is VALID [2022-04-07 14:03:58,093 INFO L290 TraceCheckUtils]: 114: Hoare triple {10120#(< ~counter~0 65)} assume !!(0 != ~r~0); {10120#(< ~counter~0 65)} is VALID [2022-04-07 14:03:58,101 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {7763#true} {10120#(< ~counter~0 65)} #63#return; {10120#(< ~counter~0 65)} is VALID [2022-04-07 14:03:58,101 INFO L290 TraceCheckUtils]: 112: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,101 INFO L290 TraceCheckUtils]: 111: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,101 INFO L290 TraceCheckUtils]: 110: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,101 INFO L272 TraceCheckUtils]: 109: Hoare triple {10120#(< ~counter~0 65)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,101 INFO L290 TraceCheckUtils]: 108: Hoare triple {10120#(< ~counter~0 65)} assume !!(#t~post6 < 100);havoc #t~post6; {10120#(< ~counter~0 65)} is VALID [2022-04-07 14:03:58,101 INFO L290 TraceCheckUtils]: 107: Hoare triple {10148#(< ~counter~0 64)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10120#(< ~counter~0 65)} is VALID [2022-04-07 14:03:58,102 INFO L290 TraceCheckUtils]: 106: Hoare triple {10148#(< ~counter~0 64)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10148#(< ~counter~0 64)} is VALID [2022-04-07 14:03:58,102 INFO L290 TraceCheckUtils]: 105: Hoare triple {10148#(< ~counter~0 64)} assume !!(0 != ~r~0); {10148#(< ~counter~0 64)} is VALID [2022-04-07 14:03:58,102 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {7763#true} {10148#(< ~counter~0 64)} #63#return; {10148#(< ~counter~0 64)} is VALID [2022-04-07 14:03:58,102 INFO L290 TraceCheckUtils]: 103: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,103 INFO L290 TraceCheckUtils]: 102: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,103 INFO L290 TraceCheckUtils]: 101: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,103 INFO L272 TraceCheckUtils]: 100: Hoare triple {10148#(< ~counter~0 64)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,103 INFO L290 TraceCheckUtils]: 99: Hoare triple {10148#(< ~counter~0 64)} assume !!(#t~post6 < 100);havoc #t~post6; {10148#(< ~counter~0 64)} is VALID [2022-04-07 14:03:58,103 INFO L290 TraceCheckUtils]: 98: Hoare triple {10176#(< ~counter~0 63)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10148#(< ~counter~0 64)} is VALID [2022-04-07 14:03:58,103 INFO L290 TraceCheckUtils]: 97: Hoare triple {10176#(< ~counter~0 63)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10176#(< ~counter~0 63)} is VALID [2022-04-07 14:03:58,104 INFO L290 TraceCheckUtils]: 96: Hoare triple {10176#(< ~counter~0 63)} assume !!(0 != ~r~0); {10176#(< ~counter~0 63)} is VALID [2022-04-07 14:03:58,104 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7763#true} {10176#(< ~counter~0 63)} #63#return; {10176#(< ~counter~0 63)} is VALID [2022-04-07 14:03:58,104 INFO L290 TraceCheckUtils]: 94: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,104 INFO L290 TraceCheckUtils]: 93: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,104 INFO L290 TraceCheckUtils]: 92: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,104 INFO L272 TraceCheckUtils]: 91: Hoare triple {10176#(< ~counter~0 63)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,105 INFO L290 TraceCheckUtils]: 90: Hoare triple {10176#(< ~counter~0 63)} assume !!(#t~post6 < 100);havoc #t~post6; {10176#(< ~counter~0 63)} is VALID [2022-04-07 14:03:58,105 INFO L290 TraceCheckUtils]: 89: Hoare triple {10204#(< ~counter~0 62)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10176#(< ~counter~0 63)} is VALID [2022-04-07 14:03:58,105 INFO L290 TraceCheckUtils]: 88: Hoare triple {10204#(< ~counter~0 62)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10204#(< ~counter~0 62)} is VALID [2022-04-07 14:03:58,105 INFO L290 TraceCheckUtils]: 87: Hoare triple {10204#(< ~counter~0 62)} assume !!(0 != ~r~0); {10204#(< ~counter~0 62)} is VALID [2022-04-07 14:03:58,106 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7763#true} {10204#(< ~counter~0 62)} #63#return; {10204#(< ~counter~0 62)} is VALID [2022-04-07 14:03:58,106 INFO L290 TraceCheckUtils]: 85: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,106 INFO L290 TraceCheckUtils]: 84: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,106 INFO L290 TraceCheckUtils]: 83: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,106 INFO L272 TraceCheckUtils]: 82: Hoare triple {10204#(< ~counter~0 62)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,106 INFO L290 TraceCheckUtils]: 81: Hoare triple {10204#(< ~counter~0 62)} assume !!(#t~post6 < 100);havoc #t~post6; {10204#(< ~counter~0 62)} is VALID [2022-04-07 14:03:58,107 INFO L290 TraceCheckUtils]: 80: Hoare triple {10232#(< ~counter~0 61)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10204#(< ~counter~0 62)} is VALID [2022-04-07 14:03:58,107 INFO L290 TraceCheckUtils]: 79: Hoare triple {10232#(< ~counter~0 61)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10232#(< ~counter~0 61)} is VALID [2022-04-07 14:03:58,107 INFO L290 TraceCheckUtils]: 78: Hoare triple {10232#(< ~counter~0 61)} assume !!(0 != ~r~0); {10232#(< ~counter~0 61)} is VALID [2022-04-07 14:03:58,111 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7763#true} {10232#(< ~counter~0 61)} #63#return; {10232#(< ~counter~0 61)} is VALID [2022-04-07 14:03:58,111 INFO L290 TraceCheckUtils]: 76: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,111 INFO L290 TraceCheckUtils]: 75: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,111 INFO L290 TraceCheckUtils]: 74: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,111 INFO L272 TraceCheckUtils]: 73: Hoare triple {10232#(< ~counter~0 61)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,112 INFO L290 TraceCheckUtils]: 72: Hoare triple {10232#(< ~counter~0 61)} assume !!(#t~post6 < 100);havoc #t~post6; {10232#(< ~counter~0 61)} is VALID [2022-04-07 14:03:58,112 INFO L290 TraceCheckUtils]: 71: Hoare triple {10260#(< ~counter~0 60)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10232#(< ~counter~0 61)} is VALID [2022-04-07 14:03:58,113 INFO L290 TraceCheckUtils]: 70: Hoare triple {10260#(< ~counter~0 60)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10260#(< ~counter~0 60)} is VALID [2022-04-07 14:03:58,113 INFO L290 TraceCheckUtils]: 69: Hoare triple {10260#(< ~counter~0 60)} assume !!(0 != ~r~0); {10260#(< ~counter~0 60)} is VALID [2022-04-07 14:03:58,113 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7763#true} {10260#(< ~counter~0 60)} #63#return; {10260#(< ~counter~0 60)} is VALID [2022-04-07 14:03:58,113 INFO L290 TraceCheckUtils]: 67: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,113 INFO L272 TraceCheckUtils]: 64: Hoare triple {10260#(< ~counter~0 60)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,114 INFO L290 TraceCheckUtils]: 63: Hoare triple {10260#(< ~counter~0 60)} assume !!(#t~post6 < 100);havoc #t~post6; {10260#(< ~counter~0 60)} is VALID [2022-04-07 14:03:58,114 INFO L290 TraceCheckUtils]: 62: Hoare triple {10288#(< ~counter~0 59)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10260#(< ~counter~0 60)} is VALID [2022-04-07 14:03:58,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {10288#(< ~counter~0 59)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10288#(< ~counter~0 59)} is VALID [2022-04-07 14:03:58,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {10288#(< ~counter~0 59)} assume !!(0 != ~r~0); {10288#(< ~counter~0 59)} is VALID [2022-04-07 14:03:58,115 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7763#true} {10288#(< ~counter~0 59)} #63#return; {10288#(< ~counter~0 59)} is VALID [2022-04-07 14:03:58,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,115 INFO L290 TraceCheckUtils]: 56: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,115 INFO L272 TraceCheckUtils]: 55: Hoare triple {10288#(< ~counter~0 59)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {10288#(< ~counter~0 59)} assume !!(#t~post6 < 100);havoc #t~post6; {10288#(< ~counter~0 59)} is VALID [2022-04-07 14:03:58,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {10316#(< ~counter~0 58)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10288#(< ~counter~0 59)} is VALID [2022-04-07 14:03:58,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {10316#(< ~counter~0 58)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10316#(< ~counter~0 58)} is VALID [2022-04-07 14:03:58,116 INFO L290 TraceCheckUtils]: 51: Hoare triple {10316#(< ~counter~0 58)} assume !!(0 != ~r~0); {10316#(< ~counter~0 58)} is VALID [2022-04-07 14:03:58,117 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7763#true} {10316#(< ~counter~0 58)} #63#return; {10316#(< ~counter~0 58)} is VALID [2022-04-07 14:03:58,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,117 INFO L272 TraceCheckUtils]: 46: Hoare triple {10316#(< ~counter~0 58)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {10316#(< ~counter~0 58)} assume !!(#t~post6 < 100);havoc #t~post6; {10316#(< ~counter~0 58)} is VALID [2022-04-07 14:03:58,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {10344#(< ~counter~0 57)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10316#(< ~counter~0 58)} is VALID [2022-04-07 14:03:58,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {10344#(< ~counter~0 57)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10344#(< ~counter~0 57)} is VALID [2022-04-07 14:03:58,118 INFO L290 TraceCheckUtils]: 42: Hoare triple {10344#(< ~counter~0 57)} assume !!(0 != ~r~0); {10344#(< ~counter~0 57)} is VALID [2022-04-07 14:03:58,119 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7763#true} {10344#(< ~counter~0 57)} #63#return; {10344#(< ~counter~0 57)} is VALID [2022-04-07 14:03:58,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,119 INFO L272 TraceCheckUtils]: 37: Hoare triple {10344#(< ~counter~0 57)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {10344#(< ~counter~0 57)} assume !!(#t~post6 < 100);havoc #t~post6; {10344#(< ~counter~0 57)} is VALID [2022-04-07 14:03:58,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {10372#(< ~counter~0 56)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10344#(< ~counter~0 57)} is VALID [2022-04-07 14:03:58,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {10372#(< ~counter~0 56)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10372#(< ~counter~0 56)} is VALID [2022-04-07 14:03:58,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {10372#(< ~counter~0 56)} assume !!(0 != ~r~0); {10372#(< ~counter~0 56)} is VALID [2022-04-07 14:03:58,121 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7763#true} {10372#(< ~counter~0 56)} #63#return; {10372#(< ~counter~0 56)} is VALID [2022-04-07 14:03:58,121 INFO L290 TraceCheckUtils]: 31: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,121 INFO L272 TraceCheckUtils]: 28: Hoare triple {10372#(< ~counter~0 56)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {10372#(< ~counter~0 56)} assume !!(#t~post6 < 100);havoc #t~post6; {10372#(< ~counter~0 56)} is VALID [2022-04-07 14:03:58,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {10400#(< ~counter~0 55)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10372#(< ~counter~0 56)} is VALID [2022-04-07 14:03:58,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {10400#(< ~counter~0 55)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10400#(< ~counter~0 55)} is VALID [2022-04-07 14:03:58,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {10400#(< ~counter~0 55)} assume !!(0 != ~r~0); {10400#(< ~counter~0 55)} is VALID [2022-04-07 14:03:58,122 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7763#true} {10400#(< ~counter~0 55)} #63#return; {10400#(< ~counter~0 55)} is VALID [2022-04-07 14:03:58,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,123 INFO L272 TraceCheckUtils]: 19: Hoare triple {10400#(< ~counter~0 55)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {10400#(< ~counter~0 55)} assume !!(#t~post6 < 100);havoc #t~post6; {10400#(< ~counter~0 55)} is VALID [2022-04-07 14:03:58,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {10428#(< ~counter~0 54)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10400#(< ~counter~0 55)} is VALID [2022-04-07 14:03:58,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {10428#(< ~counter~0 54)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10428#(< ~counter~0 54)} is VALID [2022-04-07 14:03:58,124 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7763#true} {10428#(< ~counter~0 54)} #61#return; {10428#(< ~counter~0 54)} is VALID [2022-04-07 14:03:58,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,125 INFO L272 TraceCheckUtils]: 11: Hoare triple {10428#(< ~counter~0 54)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7763#true} {10428#(< ~counter~0 54)} #59#return; {10428#(< ~counter~0 54)} is VALID [2022-04-07 14:03:58,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-07 14:03:58,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-07 14:03:58,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-07 14:03:58,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {10428#(< ~counter~0 54)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7763#true} is VALID [2022-04-07 14:03:58,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {10428#(< ~counter~0 54)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {10428#(< ~counter~0 54)} is VALID [2022-04-07 14:03:58,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {10428#(< ~counter~0 54)} call #t~ret7 := main(); {10428#(< ~counter~0 54)} is VALID [2022-04-07 14:03:58,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10428#(< ~counter~0 54)} {7763#true} #67#return; {10428#(< ~counter~0 54)} is VALID [2022-04-07 14:03:58,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {10428#(< ~counter~0 54)} assume true; {10428#(< ~counter~0 54)} is VALID [2022-04-07 14:03:58,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {7763#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10428#(< ~counter~0 54)} is VALID [2022-04-07 14:03:58,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {7763#true} call ULTIMATE.init(); {7763#true} is VALID [2022-04-07 14:03:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2022-04-07 14:03:58,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:58,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438034415] [2022-04-07 14:03:58,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:58,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205670351] [2022-04-07 14:03:58,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205670351] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:03:58,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:03:58,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2022-04-07 14:03:58,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120514604] [2022-04-07 14:03:58,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:03:58,133 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 5.408163265306122) internal successors, (530), 98 states have internal predecessors, (530), 96 states have call successors, (100), 50 states have call predecessors, (100), 49 states have return successors, (98), 94 states have call predecessors, (98), 95 states have call successors, (98) Word has length 437 [2022-04-07 14:03:58,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:58,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 98 states, 98 states have (on average 5.408163265306122) internal successors, (530), 98 states have internal predecessors, (530), 96 states have call successors, (100), 50 states have call predecessors, (100), 49 states have return successors, (98), 94 states have call predecessors, (98), 95 states have call successors, (98) [2022-04-07 14:03:58,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 728 edges. 728 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:03:58,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-07 14:03:58,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-07 14:03:58,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2022-04-07 14:03:58,575 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand has 98 states, 98 states have (on average 5.408163265306122) internal successors, (530), 98 states have internal predecessors, (530), 96 states have call successors, (100), 50 states have call predecessors, (100), 49 states have return successors, (98), 94 states have call predecessors, (98), 95 states have call successors, (98) [2022-04-07 14:04:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:04:05,339 INFO L93 Difference]: Finished difference Result 871 states and 1013 transitions. [2022-04-07 14:04:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-04-07 14:04:05,340 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 5.408163265306122) internal successors, (530), 98 states have internal predecessors, (530), 96 states have call successors, (100), 50 states have call predecessors, (100), 49 states have return successors, (98), 94 states have call predecessors, (98), 95 states have call successors, (98) Word has length 437 [2022-04-07 14:04:05,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:04:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 5.408163265306122) internal successors, (530), 98 states have internal predecessors, (530), 96 states have call successors, (100), 50 states have call predecessors, (100), 49 states have return successors, (98), 94 states have call predecessors, (98), 95 states have call successors, (98) [2022-04-07 14:04:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 1012 transitions. [2022-04-07 14:04:05,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 5.408163265306122) internal successors, (530), 98 states have internal predecessors, (530), 96 states have call successors, (100), 50 states have call predecessors, (100), 49 states have return successors, (98), 94 states have call predecessors, (98), 95 states have call successors, (98) [2022-04-07 14:04:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 1012 transitions. [2022-04-07 14:04:05,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 1012 transitions. [2022-04-07 14:04:06,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1012 edges. 1012 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:04:06,181 INFO L225 Difference]: With dead ends: 871 [2022-04-07 14:04:06,181 INFO L226 Difference]: Without dead ends: 866 [2022-04-07 14:04:06,190 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 777 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2022-04-07 14:04:06,190 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 1797 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-07 14:04:06,190 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1797 Valid, 832 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-07 14:04:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-04-07 14:04:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2022-04-07 14:04:06,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:04:06,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 866 states. Second operand has 866 states, 670 states have (on average 1.1417910447761195) internal successors, (765), 670 states have internal predecessors, (765), 99 states have call successors, (99), 98 states have call predecessors, (99), 96 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2022-04-07 14:04:06,441 INFO L74 IsIncluded]: Start isIncluded. First operand 866 states. Second operand has 866 states, 670 states have (on average 1.1417910447761195) internal successors, (765), 670 states have internal predecessors, (765), 99 states have call successors, (99), 98 states have call predecessors, (99), 96 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2022-04-07 14:04:06,442 INFO L87 Difference]: Start difference. First operand 866 states. Second operand has 866 states, 670 states have (on average 1.1417910447761195) internal successors, (765), 670 states have internal predecessors, (765), 99 states have call successors, (99), 98 states have call predecessors, (99), 96 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2022-04-07 14:04:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:04:06,467 INFO L93 Difference]: Finished difference Result 866 states and 961 transitions. [2022-04-07 14:04:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 961 transitions. [2022-04-07 14:04:06,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:04:06,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:04:06,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 866 states, 670 states have (on average 1.1417910447761195) internal successors, (765), 670 states have internal predecessors, (765), 99 states have call successors, (99), 98 states have call predecessors, (99), 96 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) Second operand 866 states. [2022-04-07 14:04:06,470 INFO L87 Difference]: Start difference. First operand has 866 states, 670 states have (on average 1.1417910447761195) internal successors, (765), 670 states have internal predecessors, (765), 99 states have call successors, (99), 98 states have call predecessors, (99), 96 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) Second operand 866 states. [2022-04-07 14:04:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:04:06,501 INFO L93 Difference]: Finished difference Result 866 states and 961 transitions. [2022-04-07 14:04:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 961 transitions. [2022-04-07 14:04:06,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:04:06,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:04:06,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:04:06,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:04:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 670 states have (on average 1.1417910447761195) internal successors, (765), 670 states have internal predecessors, (765), 99 states have call successors, (99), 98 states have call predecessors, (99), 96 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2022-04-07 14:04:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 961 transitions. [2022-04-07 14:04:06,533 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 961 transitions. Word has length 437 [2022-04-07 14:04:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:04:06,533 INFO L478 AbstractCegarLoop]: Abstraction has 866 states and 961 transitions. [2022-04-07 14:04:06,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 5.408163265306122) internal successors, (530), 98 states have internal predecessors, (530), 96 states have call successors, (100), 50 states have call predecessors, (100), 49 states have return successors, (98), 94 states have call predecessors, (98), 95 states have call successors, (98) [2022-04-07 14:04:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 961 transitions. [2022-04-07 14:04:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2022-04-07 14:04:06,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:04:06,549 INFO L499 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 94, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:04:06,561 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:04:06,757 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:04:06,757 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:04:06,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:04:06,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2015680598, now seen corresponding path program 6 times [2022-04-07 14:04:06,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:04:06,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416235927] [2022-04-07 14:04:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:04:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:04:06,835 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:04:06,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499185157] [2022-04-07 14:04:06,835 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 14:04:06,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:04:06,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:04:06,852 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:04:06,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process