/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-e106359-m [2022-04-14 16:16:28,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 16:16:28,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 16:16:28,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 16:16:28,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 16:16:28,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 16:16:28,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 16:16:28,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 16:16:28,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 16:16:28,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 16:16:28,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 16:16:28,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 16:16:28,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 16:16:28,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 16:16:28,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 16:16:28,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 16:16:28,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 16:16:28,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 16:16:28,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 16:16:28,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 16:16:28,908 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 16:16:28,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 16:16:28,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 16:16:28,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 16:16:28,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 16:16:28,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 16:16:28,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 16:16:28,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 16:16:28,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 16:16:28,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 16:16:28,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 16:16:28,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 16:16:28,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 16:16:28,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 16:16:28,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 16:16:28,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 16:16:28,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 16:16:28,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 16:16:28,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 16:16:28,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 16:16:28,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 16:16:28,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 16:16:28,926 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-14 16:16:28,957 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 16:16:28,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 16:16:28,958 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 16:16:28,958 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 16:16:28,959 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 16:16:28,959 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 16:16:28,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 16:16:28,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 16:16:28,960 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 16:16:28,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 16:16:28,961 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 16:16:28,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 16:16:28,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 16:16:28,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 16:16:28,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 16:16:28,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 16:16:28,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 16:16:28,963 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 16:16:28,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 16:16:28,963 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 16:16:28,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 16:16:28,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 16:16:28,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 16:16:28,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 16:16:28,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:16:28,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 16:16:28,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 16:16:28,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 16:16:28,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 16:16:28,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 16:16:28,965 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 16:16:28,965 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 16:16:28,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 16:16:28,965 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-14 16:16:29,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 16:16:29,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 16:16:29,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 16:16:29,196 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 16:16:29,198 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 16:16:29,199 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-14 16:16:29,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b3ad1f6/87ec491f5cba47ab8a13e231bfe89da5/FLAG60e56749e [2022-04-14 16:16:29,583 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 16:16:29,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound100.c [2022-04-14 16:16:29,591 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b3ad1f6/87ec491f5cba47ab8a13e231bfe89da5/FLAG60e56749e [2022-04-14 16:16:30,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b3ad1f6/87ec491f5cba47ab8a13e231bfe89da5 [2022-04-14 16:16:30,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 16:16:30,007 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 16:16:30,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 16:16:30,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 16:16:30,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 16:16:30,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:16:30" (1/1) ... [2022-04-14 16:16:30,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e84d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:30, skipping insertion in model container [2022-04-14 16:16:30,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:16:30" (1/1) ... [2022-04-14 16:16:30,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 16:16:30,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 16:16:30,178 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-14 16:16:30,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:16:30,219 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 16:16:30,239 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-14 16:16:30,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:16:30,271 INFO L208 MainTranslator]: Completed translation [2022-04-14 16:16:30,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:30 WrapperNode [2022-04-14 16:16:30,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 16:16:30,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 16:16:30,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 16:16:30,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 16:16:30,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:30" (1/1) ... [2022-04-14 16:16:30,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:30" (1/1) ... [2022-04-14 16:16:30,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:30" (1/1) ... [2022-04-14 16:16:30,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:30" (1/1) ... [2022-04-14 16:16:30,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:30" (1/1) ... [2022-04-14 16:16:30,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:30" (1/1) ... [2022-04-14 16:16:30,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:30" (1/1) ... [2022-04-14 16:16:30,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 16:16:30,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 16:16:30,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 16:16:30,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 16:16:30,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:30" (1/1) ... [2022-04-14 16:16:30,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:16:30,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:30,326 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-14 16:16:30,327 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-14 16:16:30,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 16:16:30,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 16:16:30,352 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 16:16:30,352 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 16:16:30,352 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 16:16:30,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 16:16:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 16:16:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 16:16:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 16:16:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 16:16:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 16:16:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 16:16:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 16:16:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 16:16:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 16:16:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 16:16:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 16:16:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 16:16:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 16:16:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 16:16:30,402 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 16:16:30,403 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 16:16:30,524 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 16:16:30,530 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 16:16:30,530 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 16:16:30,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:16:30 BoogieIcfgContainer [2022-04-14 16:16:30,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 16:16:30,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 16:16:30,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 16:16:30,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 16:16:30,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:16:30" (1/3) ... [2022-04-14 16:16:30,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a775f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:16:30, skipping insertion in model container [2022-04-14 16:16:30,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:30" (2/3) ... [2022-04-14 16:16:30,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a775f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:16:30, skipping insertion in model container [2022-04-14 16:16:30,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:16:30" (3/3) ... [2022-04-14 16:16:30,537 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound100.c [2022-04-14 16:16:30,541 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 16:16:30,542 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 16:16:30,576 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 16:16:30,581 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-14 16:16:30,582 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 16:16:30,598 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-14 16:16:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 16:16:30,603 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:30,603 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-14 16:16:30,604 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:30,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-14 16:16:30,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:30,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992597047] [2022-04-14 16:16:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:30,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:30,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560660410] [2022-04-14 16:16:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:30,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:30,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:30,719 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-14 16:16:30,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 16:16:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:30,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-14 16:16:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:30,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:30,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2022-04-14 16:16:30,970 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-14 16:16:30,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-14 16:16:30,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-14 16:16:30,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-14 16:16:30,972 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-14 16:16:30,973 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-14 16:16:30,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-14 16:16:30,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-14 16:16:30,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-14 16:16:30,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-14 16:16:30,976 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-14 16:16:30,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-14 16:16:30,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-14 16:16:30,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-14 16:16:30,977 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-14 16:16:30,977 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-14 16:16:30,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-14 16:16:30,978 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-14 16:16:30,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-14 16:16:30,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-14 16:16:30,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-14 16:16:30,980 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-14 16:16:30,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:16:30,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:30,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992597047] [2022-04-14 16:16:30,981 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:30,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560660410] [2022-04-14 16:16:30,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560660410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:16:30,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:16:30,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-14 16:16:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484775964] [2022-04-14 16:16:30,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:16:30,992 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-14 16:16:30,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:30,997 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-14 16:16:31,030 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-14 16:16:31,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-14 16:16:31,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:31,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-14 16:16:31,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-14 16:16:31,068 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-14 16:16:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:31,149 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-14 16:16:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-14 16:16:31,150 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-14 16:16:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:31,151 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-14 16:16:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-14 16:16:31,165 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-14 16:16:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-14 16:16:31,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-14 16:16:31,259 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-14 16:16:31,267 INFO L225 Difference]: With dead ends: 53 [2022-04-14 16:16:31,268 INFO L226 Difference]: Without dead ends: 25 [2022-04-14 16:16:31,271 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-14 16:16:31,274 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-14 16:16:31,276 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-14 16:16:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-14 16:16:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-14 16:16:31,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:31,305 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-14 16:16:31,305 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-14 16:16:31,306 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-14 16:16:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:31,311 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-14 16:16:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-14 16:16:31,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:31,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:31,321 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-14 16:16:31,321 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-14 16:16:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:31,325 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-14 16:16:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-14 16:16:31,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:31,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:31,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:31,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:31,327 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-14 16:16:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-14 16:16:31,332 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-14 16:16:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:31,332 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-14 16:16:31,333 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-14 16:16:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-14 16:16:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 16:16:31,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:31,334 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-14 16:16:31,358 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-14 16:16:31,555 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-14 16:16:31,556 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-14 16:16:31,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:31,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147979970] [2022-04-14 16:16:31,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:31,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:31,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:31,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046645797] [2022-04-14 16:16:31,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:31,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:31,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:31,579 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-14 16:16:31,594 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-14 16:16:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:31,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 16:16:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:31,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:31,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-14 16:16:31,868 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-14 16:16:31,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:31,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#(<= ~counter~0 0)} {256#true} #67#return; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:31,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#(<= ~counter~0 0)} call #t~ret7 := main(); {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:31,871 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-14 16:16:31,872 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-14 16:16:31,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:31,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:31,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:31,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #59#return; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:31,874 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-14 16:16:31,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:31,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:31,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:31,877 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #61#return; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:31,877 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-14 16:16:31,878 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-14 16:16:31,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {313#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {257#false} is VALID [2022-04-14 16:16:31,879 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-14 16:16:31,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2022-04-14 16:16:31,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2022-04-14 16:16:31,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-14 16:16:31,880 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-14 16:16:31,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:16:31,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:31,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147979970] [2022-04-14 16:16:31,880 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:31,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046645797] [2022-04-14 16:16:31,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046645797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:16:31,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:16:31,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 16:16:31,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458767286] [2022-04-14 16:16:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:16:31,883 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-14 16:16:31,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:31,884 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-14 16:16:31,903 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-14 16:16:31,904 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 16:16:31,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:31,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 16:16:31,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:16:31,905 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-14 16:16:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:31,960 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-14 16:16:31,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 16:16:31,961 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-14 16:16:31,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:31,961 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-14 16:16:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-14 16:16:31,966 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-14 16:16:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-14 16:16:31,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-14 16:16:32,002 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-14 16:16:32,003 INFO L225 Difference]: With dead ends: 34 [2022-04-14 16:16:32,004 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 16:16:32,004 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-14 16:16:32,005 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-14 16:16:32,006 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-14 16:16:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 16:16:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-14 16:16:32,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:32,015 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-14 16:16:32,015 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-14 16:16:32,015 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-14 16:16:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:32,017 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 16:16:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 16:16:32,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:32,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:32,018 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-14 16:16:32,019 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-14 16:16:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:32,020 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 16:16:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 16:16:32,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:32,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:32,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:32,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:32,022 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-14 16:16:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-14 16:16:32,023 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-14 16:16:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:32,024 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-14 16:16:32,024 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-14 16:16:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 16:16:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 16:16:32,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:32,025 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-14 16:16:32,053 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-14 16:16:32,248 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-14 16:16:32,248 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:32,249 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-14 16:16:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:32,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658487834] [2022-04-14 16:16:32,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:32,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:32,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:32,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986343729] [2022-04-14 16:16:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:32,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:32,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:32,268 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-14 16:16:32,278 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-14 16:16:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:32,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 16:16:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:32,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:32,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {469#true} is VALID [2022-04-14 16:16:32,768 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-14 16:16:32,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-14 16:16:32,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} #67#return; {469#true} is VALID [2022-04-14 16:16:32,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {469#true} call #t~ret7 := main(); {469#true} is VALID [2022-04-14 16:16:32,769 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-14 16:16:32,769 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-14 16:16:32,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-14 16:16:32,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-14 16:16:32,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-14 16:16:32,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {469#true} {469#true} #59#return; {469#true} is VALID [2022-04-14 16:16:32,770 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-14 16:16:32,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-14 16:16:32,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-14 16:16:32,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-14 16:16:32,771 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {469#true} {469#true} #61#return; {469#true} is VALID [2022-04-14 16:16:34,776 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-14 16:16:34,777 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-14 16:16:34,788 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-14 16:16:36,203 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-14 16:16:36,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:16:36,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {470#false} is VALID [2022-04-14 16:16:36,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-04-14 16:16:36,208 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-14 16:16:36,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:16:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:36,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658487834] [2022-04-14 16:16:36,209 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:36,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986343729] [2022-04-14 16:16:36,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986343729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:16:36,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:16:36,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:16:36,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863938388] [2022-04-14 16:16:36,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:16:36,210 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-14 16:16:36,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:36,210 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-14 16:16:38,324 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-14 16:16:38,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:16:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:38,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:16:38,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:16:38,326 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-14 16:16:39,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:16:42,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:16:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:42,190 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-14 16:16:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:16:42,190 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-14 16:16:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:42,191 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-14 16:16:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-14 16:16:42,192 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-14 16:16:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-14 16:16:42,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-14 16:16:44,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:44,993 INFO L225 Difference]: With dead ends: 37 [2022-04-14 16:16:44,994 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 16:16:44,994 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-14 16:16:44,995 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:44,995 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-14 16:16:44,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 16:16:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-14 16:16:45,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:45,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 16:16:45,005 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 16:16:45,005 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 16:16:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:45,007 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-14 16:16:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-14 16:16:45,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:45,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:45,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-14 16:16:45,008 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-14 16:16:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:45,010 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-14 16:16:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-14 16:16:45,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:45,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:45,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:45,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 16:16:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-14 16:16:45,013 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-14 16:16:45,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:45,013 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-14 16:16:45,013 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-14 16:16:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-14 16:16:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 16:16:45,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:45,014 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-14 16:16:45,033 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-14 16:16:45,223 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-14 16:16:45,224 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:45,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:45,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-14 16:16:45,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:45,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491111527] [2022-04-14 16:16:45,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:45,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:45,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1745067686] [2022-04-14 16:16:45,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:45,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:45,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:45,241 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-14 16:16:45,242 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-14 16:16:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:45,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 16:16:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:45,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:45,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2022-04-14 16:16:45,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {712#true} is VALID [2022-04-14 16:16:45,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-14 16:16:45,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #67#return; {712#true} is VALID [2022-04-14 16:16:45,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret7 := main(); {712#true} is VALID [2022-04-14 16:16:45,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#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; {712#true} is VALID [2022-04-14 16:16:45,471 INFO L272 TraceCheckUtils]: 6: Hoare triple {712#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {712#true} is VALID [2022-04-14 16:16:45,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-14 16:16:45,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-14 16:16:45,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-14 16:16:45,472 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {712#true} {712#true} #59#return; {712#true} is VALID [2022-04-14 16:16:45,472 INFO L272 TraceCheckUtils]: 11: Hoare triple {712#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)); {712#true} is VALID [2022-04-14 16:16:45,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-14 16:16:45,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-14 16:16:45,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-14 16:16:45,472 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {712#true} {712#true} #61#return; {712#true} is VALID [2022-04-14 16:16:45,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#true} is VALID [2022-04-14 16:16:45,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#true} is VALID [2022-04-14 16:16:45,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#true} assume !!(#t~post6 < 100);havoc #t~post6; {712#true} is VALID [2022-04-14 16:16:45,473 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#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)); {712#true} is VALID [2022-04-14 16:16:45,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {712#true} ~cond := #in~cond; {777#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:16:45,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {777#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:16:45,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:16:45,475 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} {712#true} #63#return; {788#(= (+ (* 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-14 16:16:45,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {788#(= (+ (* 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); {792#(= (+ (* 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-14 16:16:45,477 INFO L272 TraceCheckUtils]: 25: Hoare triple {792#(= (+ (* 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)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:16:45,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:16:45,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {713#false} is VALID [2022-04-14 16:16:45,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-14 16:16:45,478 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-14 16:16:45,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:16:45,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-14 16:16:45,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {713#false} is VALID [2022-04-14 16:16:45,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:16:45,951 INFO L272 TraceCheckUtils]: 25: Hoare triple {792#(= (+ (* 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)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:16:45,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {819#(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); {792#(= (+ (* 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-14 16:16:45,955 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} {712#true} #63#return; {819#(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-14 16:16:45,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:16:45,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:16:45,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {712#true} ~cond := #in~cond; {832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:16:45,956 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#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)); {712#true} is VALID [2022-04-14 16:16:45,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#true} assume !!(#t~post6 < 100);havoc #t~post6; {712#true} is VALID [2022-04-14 16:16:45,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#true} is VALID [2022-04-14 16:16:45,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#true} is VALID [2022-04-14 16:16:45,957 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {712#true} {712#true} #61#return; {712#true} is VALID [2022-04-14 16:16:45,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-14 16:16:45,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-14 16:16:45,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-14 16:16:45,957 INFO L272 TraceCheckUtils]: 11: Hoare triple {712#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)); {712#true} is VALID [2022-04-14 16:16:45,958 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {712#true} {712#true} #59#return; {712#true} is VALID [2022-04-14 16:16:45,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-14 16:16:45,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-14 16:16:45,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-14 16:16:45,958 INFO L272 TraceCheckUtils]: 6: Hoare triple {712#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {712#true} is VALID [2022-04-14 16:16:45,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#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; {712#true} is VALID [2022-04-14 16:16:45,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret7 := main(); {712#true} is VALID [2022-04-14 16:16:45,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #67#return; {712#true} is VALID [2022-04-14 16:16:45,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-14 16:16:45,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {712#true} is VALID [2022-04-14 16:16:45,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2022-04-14 16:16:45,959 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-14 16:16:45,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:45,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491111527] [2022-04-14 16:16:45,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:45,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745067686] [2022-04-14 16:16:45,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745067686] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:16:45,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:16:45,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-14 16:16:45,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200851891] [2022-04-14 16:16:45,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:16:45,961 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-14 16:16:45,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:45,962 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-14 16:16:45,987 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-14 16:16:45,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 16:16:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:45,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 16:16:45,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:16:45,988 INFO L87 Difference]: Start difference. First operand 32 states and 36 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-14 16:16:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:46,310 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-14 16:16:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 16:16:46,311 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-14 16:16:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:46,311 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-14 16:16:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-14 16:16:46,312 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-14 16:16:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-14 16:16:46,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-14 16:16:46,359 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-14 16:16:46,361 INFO L225 Difference]: With dead ends: 39 [2022-04-14 16:16:46,361 INFO L226 Difference]: Without dead ends: 34 [2022-04-14 16:16:46,361 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-14 16:16:46,362 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:46,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 16:16:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-14 16:16:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-14 16:16:46,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:46,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 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-14 16:16:46,372 INFO L74 IsIncluded]: Start isIncluded. First operand 34 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-14 16:16:46,372 INFO L87 Difference]: Start difference. First operand 34 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-14 16:16:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:46,373 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-14 16:16:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-14 16:16:46,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:46,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:46,374 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 34 states. [2022-04-14 16:16:46,374 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 34 states. [2022-04-14 16:16:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:46,376 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-14 16:16:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-14 16:16:46,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:46,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:46,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:46,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:46,377 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-14 16:16:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-14 16:16:46,378 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-14 16:16:46,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:46,378 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-14 16:16:46,378 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-14 16:16:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-14 16:16:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 16:16:46,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:46,379 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-14 16:16:46,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 16:16:46,580 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-14 16:16:46,580 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:46,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:46,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-14 16:16:46,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:46,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466148416] [2022-04-14 16:16:46,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:46,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:46,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:46,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [609025753] [2022-04-14 16:16:46,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:46,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:46,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:46,595 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-14 16:16:46,600 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-14 16:16:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:46,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 16:16:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:46,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:46,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2022-04-14 16:16:46,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#(<= ~counter~0 0)} {1066#true} #67#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#(<= ~counter~0 0)} call #t~ret7 := main(); {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#(<= ~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; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,837 INFO L272 TraceCheckUtils]: 6: Hoare triple {1074#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,839 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} #59#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,839 INFO L272 TraceCheckUtils]: 11: Hoare triple {1074#(<= ~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)); {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,841 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} #61#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {1074#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:46,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {1074#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:46,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {1123#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:46,844 INFO L272 TraceCheckUtils]: 19: Hoare triple {1123#(<= ~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)); {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:46,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {1123#(<= ~counter~0 1)} ~cond := #in~cond; {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:46,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {1123#(<= ~counter~0 1)} assume !(0 == ~cond); {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:46,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {1123#(<= ~counter~0 1)} assume true; {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:46,846 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1123#(<= ~counter~0 1)} {1123#(<= ~counter~0 1)} #63#return; {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:46,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {1123#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:46,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {1123#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:46,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {1123#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1151#(<= |main_#t~post6| 1)} is VALID [2022-04-14 16:16:46,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {1151#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {1067#false} is VALID [2022-04-14 16:16:46,847 INFO L272 TraceCheckUtils]: 28: Hoare triple {1067#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1067#false} is VALID [2022-04-14 16:16:46,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2022-04-14 16:16:46,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {1067#false} assume 0 == ~cond; {1067#false} is VALID [2022-04-14 16:16:46,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-14 16:16:46,848 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-14 16:16:46,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:16:47,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-14 16:16:47,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {1067#false} assume 0 == ~cond; {1067#false} is VALID [2022-04-14 16:16:47,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2022-04-14 16:16:47,032 INFO L272 TraceCheckUtils]: 28: Hoare triple {1067#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1067#false} is VALID [2022-04-14 16:16:47,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {1179#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {1067#false} is VALID [2022-04-14 16:16:47,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {1183#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1179#(< |main_#t~post6| 100)} is VALID [2022-04-14 16:16:47,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {1183#(< ~counter~0 100)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1183#(< ~counter~0 100)} is VALID [2022-04-14 16:16:47,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {1183#(< ~counter~0 100)} assume !!(0 != ~r~0); {1183#(< ~counter~0 100)} is VALID [2022-04-14 16:16:47,035 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1066#true} {1183#(< ~counter~0 100)} #63#return; {1183#(< ~counter~0 100)} is VALID [2022-04-14 16:16:47,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-14 16:16:47,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-14 16:16:47,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-14 16:16:47,035 INFO L272 TraceCheckUtils]: 19: Hoare triple {1183#(< ~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)); {1066#true} is VALID [2022-04-14 16:16:47,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {1183#(< ~counter~0 100)} is VALID [2022-04-14 16:16:47,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1183#(< ~counter~0 100)} is VALID [2022-04-14 16:16:47,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(< ~counter~0 99)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1211#(< ~counter~0 99)} is VALID [2022-04-14 16:16:47,037 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1066#true} {1211#(< ~counter~0 99)} #61#return; {1211#(< ~counter~0 99)} is VALID [2022-04-14 16:16:47,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-14 16:16:47,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-14 16:16:47,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-14 16:16:47,038 INFO L272 TraceCheckUtils]: 11: Hoare triple {1211#(< ~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)); {1066#true} is VALID [2022-04-14 16:16:47,039 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1066#true} {1211#(< ~counter~0 99)} #59#return; {1211#(< ~counter~0 99)} is VALID [2022-04-14 16:16:47,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-14 16:16:47,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-14 16:16:47,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-14 16:16:47,039 INFO L272 TraceCheckUtils]: 6: Hoare triple {1211#(< ~counter~0 99)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1066#true} is VALID [2022-04-14 16:16:47,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#(< ~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; {1211#(< ~counter~0 99)} is VALID [2022-04-14 16:16:47,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#(< ~counter~0 99)} call #t~ret7 := main(); {1211#(< ~counter~0 99)} is VALID [2022-04-14 16:16:47,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#(< ~counter~0 99)} {1066#true} #67#return; {1211#(< ~counter~0 99)} is VALID [2022-04-14 16:16:47,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#(< ~counter~0 99)} assume true; {1211#(< ~counter~0 99)} is VALID [2022-04-14 16:16:47,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1211#(< ~counter~0 99)} is VALID [2022-04-14 16:16:47,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2022-04-14 16:16:47,045 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-14 16:16:47,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:47,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466148416] [2022-04-14 16:16:47,046 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:47,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609025753] [2022-04-14 16:16:47,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609025753] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:16:47,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:16:47,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 16:16:47,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309532081] [2022-04-14 16:16:47,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:16:47,047 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-14 16:16:47,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:47,048 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-14 16:16:47,094 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-14 16:16:47,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 16:16:47,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:47,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 16:16:47,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 16:16:47,095 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-14 16:16:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:47,307 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-14 16:16:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 16:16:47,308 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-14 16:16:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:47,308 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-14 16:16:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-14 16:16:47,311 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-14 16:16:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-14 16:16:47,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-14 16:16:47,368 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-14 16:16:47,369 INFO L225 Difference]: With dead ends: 61 [2022-04-14 16:16:47,369 INFO L226 Difference]: Without dead ends: 56 [2022-04-14 16:16:47,370 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-14 16:16:47,370 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:47,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 128 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:16:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-14 16:16:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-14 16:16:47,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:47,388 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-14 16:16:47,388 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-14 16:16:47,388 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-14 16:16:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:47,391 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-14 16:16:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-14 16:16:47,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:47,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:47,392 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-14 16:16:47,392 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-14 16:16:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:47,394 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-14 16:16:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-14 16:16:47,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:47,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:47,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:47,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:47,395 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-14 16:16:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-14 16:16:47,397 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-14 16:16:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:47,397 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-14 16:16:47,398 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-14 16:16:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-14 16:16:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-14 16:16:47,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:47,399 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-14 16:16:47,426 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-14 16:16:47,617 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-14 16:16:47,618 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:47,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 2 times [2022-04-14 16:16:47,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:47,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582090544] [2022-04-14 16:16:47,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:47,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:47,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:47,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46835105] [2022-04-14 16:16:47,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 16:16:47,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:47,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:47,635 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-14 16:16:47,643 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-14 16:16:47,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 16:16:47,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:16:47,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 16:16:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:47,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:48,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {1546#true} call ULTIMATE.init(); {1546#true} is VALID [2022-04-14 16:16:48,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {1546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {1554#(<= ~counter~0 0)} assume true; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1554#(<= ~counter~0 0)} {1546#true} #67#return; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {1554#(<= ~counter~0 0)} call #t~ret7 := main(); {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {1554#(<= ~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; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {1554#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {1554#(<= ~counter~0 0)} ~cond := #in~cond; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {1554#(<= ~counter~0 0)} assume !(0 == ~cond); {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {1554#(<= ~counter~0 0)} assume true; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1554#(<= ~counter~0 0)} {1554#(<= ~counter~0 0)} #59#return; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,100 INFO L272 TraceCheckUtils]: 11: Hoare triple {1554#(<= ~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)); {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {1554#(<= ~counter~0 0)} ~cond := #in~cond; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {1554#(<= ~counter~0 0)} assume !(0 == ~cond); {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {1554#(<= ~counter~0 0)} assume true; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,102 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1554#(<= ~counter~0 0)} {1554#(<= ~counter~0 0)} #61#return; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {1554#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:48,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {1554#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:48,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {1603#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:48,105 INFO L272 TraceCheckUtils]: 19: Hoare triple {1603#(<= ~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)); {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:48,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {1603#(<= ~counter~0 1)} ~cond := #in~cond; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:48,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {1603#(<= ~counter~0 1)} assume !(0 == ~cond); {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:48,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {1603#(<= ~counter~0 1)} assume true; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:48,106 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1603#(<= ~counter~0 1)} {1603#(<= ~counter~0 1)} #63#return; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:48,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {1603#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:48,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {1603#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:48,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:48,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:48,110 INFO L272 TraceCheckUtils]: 28: Hoare triple {1631#(<= ~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)); {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:48,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {1631#(<= ~counter~0 2)} ~cond := #in~cond; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:48,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {1631#(<= ~counter~0 2)} assume !(0 == ~cond); {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:48,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {1631#(<= ~counter~0 2)} assume true; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:48,112 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1631#(<= ~counter~0 2)} {1631#(<= ~counter~0 2)} #63#return; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:48,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {1631#(<= ~counter~0 2)} assume !!(0 != ~r~0); {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:48,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {1631#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:48,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {1631#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:48,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {1659#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:48,115 INFO L272 TraceCheckUtils]: 37: Hoare triple {1659#(<= ~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)); {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:48,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {1659#(<= ~counter~0 3)} ~cond := #in~cond; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:48,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {1659#(<= ~counter~0 3)} assume !(0 == ~cond); {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:48,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {1659#(<= ~counter~0 3)} assume true; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:48,116 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1659#(<= ~counter~0 3)} {1659#(<= ~counter~0 3)} #63#return; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:48,117 INFO L290 TraceCheckUtils]: 42: Hoare triple {1659#(<= ~counter~0 3)} assume !!(0 != ~r~0); {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:48,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {1659#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:48,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {1659#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:48,118 INFO L290 TraceCheckUtils]: 45: Hoare triple {1687#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:48,119 INFO L272 TraceCheckUtils]: 46: Hoare triple {1687#(<= ~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)); {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:48,119 INFO L290 TraceCheckUtils]: 47: Hoare triple {1687#(<= ~counter~0 4)} ~cond := #in~cond; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:48,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {1687#(<= ~counter~0 4)} assume !(0 == ~cond); {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:48,120 INFO L290 TraceCheckUtils]: 49: Hoare triple {1687#(<= ~counter~0 4)} assume true; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:48,121 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1687#(<= ~counter~0 4)} {1687#(<= ~counter~0 4)} #63#return; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:48,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {1687#(<= ~counter~0 4)} assume !!(0 != ~r~0); {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:48,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {1687#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:48,122 INFO L290 TraceCheckUtils]: 53: Hoare triple {1687#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1715#(<= |main_#t~post6| 4)} is VALID [2022-04-14 16:16:48,122 INFO L290 TraceCheckUtils]: 54: Hoare triple {1715#(<= |main_#t~post6| 4)} assume !(#t~post6 < 100);havoc #t~post6; {1547#false} is VALID [2022-04-14 16:16:48,123 INFO L272 TraceCheckUtils]: 55: Hoare triple {1547#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1547#false} is VALID [2022-04-14 16:16:48,123 INFO L290 TraceCheckUtils]: 56: Hoare triple {1547#false} ~cond := #in~cond; {1547#false} is VALID [2022-04-14 16:16:48,123 INFO L290 TraceCheckUtils]: 57: Hoare triple {1547#false} assume 0 == ~cond; {1547#false} is VALID [2022-04-14 16:16:48,123 INFO L290 TraceCheckUtils]: 58: Hoare triple {1547#false} assume !false; {1547#false} is VALID [2022-04-14 16:16:48,123 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-14 16:16:48,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:16:48,484 INFO L290 TraceCheckUtils]: 58: Hoare triple {1547#false} assume !false; {1547#false} is VALID [2022-04-14 16:16:48,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {1547#false} assume 0 == ~cond; {1547#false} is VALID [2022-04-14 16:16:48,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {1547#false} ~cond := #in~cond; {1547#false} is VALID [2022-04-14 16:16:48,484 INFO L272 TraceCheckUtils]: 55: Hoare triple {1547#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1547#false} is VALID [2022-04-14 16:16:48,485 INFO L290 TraceCheckUtils]: 54: Hoare triple {1743#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {1547#false} is VALID [2022-04-14 16:16:48,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {1747#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1743#(< |main_#t~post6| 100)} is VALID [2022-04-14 16:16:48,488 INFO L290 TraceCheckUtils]: 52: Hoare triple {1747#(< ~counter~0 100)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1747#(< ~counter~0 100)} is VALID [2022-04-14 16:16:48,497 INFO L290 TraceCheckUtils]: 51: Hoare triple {1747#(< ~counter~0 100)} assume !!(0 != ~r~0); {1747#(< ~counter~0 100)} is VALID [2022-04-14 16:16:48,498 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1546#true} {1747#(< ~counter~0 100)} #63#return; {1747#(< ~counter~0 100)} is VALID [2022-04-14 16:16:48,498 INFO L290 TraceCheckUtils]: 49: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-14 16:16:48,498 INFO L290 TraceCheckUtils]: 48: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-14 16:16:48,498 INFO L290 TraceCheckUtils]: 47: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-14 16:16:48,498 INFO L272 TraceCheckUtils]: 46: Hoare triple {1747#(< ~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)); {1546#true} is VALID [2022-04-14 16:16:48,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {1747#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {1747#(< ~counter~0 100)} is VALID [2022-04-14 16:16:48,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {1775#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1747#(< ~counter~0 100)} is VALID [2022-04-14 16:16:48,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#(< ~counter~0 99)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1775#(< ~counter~0 99)} is VALID [2022-04-14 16:16:48,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#(< ~counter~0 99)} assume !!(0 != ~r~0); {1775#(< ~counter~0 99)} is VALID [2022-04-14 16:16:48,500 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1546#true} {1775#(< ~counter~0 99)} #63#return; {1775#(< ~counter~0 99)} is VALID [2022-04-14 16:16:48,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-14 16:16:48,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-14 16:16:48,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-14 16:16:48,501 INFO L272 TraceCheckUtils]: 37: Hoare triple {1775#(< ~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)); {1546#true} is VALID [2022-04-14 16:16:48,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {1775#(< ~counter~0 99)} is VALID [2022-04-14 16:16:48,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {1803#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1775#(< ~counter~0 99)} is VALID [2022-04-14 16:16:48,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {1803#(< ~counter~0 98)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1803#(< ~counter~0 98)} is VALID [2022-04-14 16:16:48,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {1803#(< ~counter~0 98)} assume !!(0 != ~r~0); {1803#(< ~counter~0 98)} is VALID [2022-04-14 16:16:48,505 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1546#true} {1803#(< ~counter~0 98)} #63#return; {1803#(< ~counter~0 98)} is VALID [2022-04-14 16:16:48,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-14 16:16:48,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-14 16:16:48,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-14 16:16:48,505 INFO L272 TraceCheckUtils]: 28: Hoare triple {1803#(< ~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)); {1546#true} is VALID [2022-04-14 16:16:48,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {1803#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {1803#(< ~counter~0 98)} is VALID [2022-04-14 16:16:48,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {1831#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1803#(< ~counter~0 98)} is VALID [2022-04-14 16:16:48,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {1831#(< ~counter~0 97)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1831#(< ~counter~0 97)} is VALID [2022-04-14 16:16:48,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {1831#(< ~counter~0 97)} assume !!(0 != ~r~0); {1831#(< ~counter~0 97)} is VALID [2022-04-14 16:16:48,507 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1546#true} {1831#(< ~counter~0 97)} #63#return; {1831#(< ~counter~0 97)} is VALID [2022-04-14 16:16:48,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-14 16:16:48,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-14 16:16:48,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-14 16:16:48,508 INFO L272 TraceCheckUtils]: 19: Hoare triple {1831#(< ~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)); {1546#true} is VALID [2022-04-14 16:16:48,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {1831#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {1831#(< ~counter~0 97)} is VALID [2022-04-14 16:16:48,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {1859#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1831#(< ~counter~0 97)} is VALID [2022-04-14 16:16:48,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {1859#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1859#(< ~counter~0 96)} is VALID [2022-04-14 16:16:48,510 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1546#true} {1859#(< ~counter~0 96)} #61#return; {1859#(< ~counter~0 96)} is VALID [2022-04-14 16:16:48,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-14 16:16:48,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-14 16:16:48,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-14 16:16:48,510 INFO L272 TraceCheckUtils]: 11: Hoare triple {1859#(< ~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)); {1546#true} is VALID [2022-04-14 16:16:48,511 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1546#true} {1859#(< ~counter~0 96)} #59#return; {1859#(< ~counter~0 96)} is VALID [2022-04-14 16:16:48,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-14 16:16:48,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-14 16:16:48,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-14 16:16:48,511 INFO L272 TraceCheckUtils]: 6: Hoare triple {1859#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1546#true} is VALID [2022-04-14 16:16:48,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {1859#(< ~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; {1859#(< ~counter~0 96)} is VALID [2022-04-14 16:16:48,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {1859#(< ~counter~0 96)} call #t~ret7 := main(); {1859#(< ~counter~0 96)} is VALID [2022-04-14 16:16:48,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1859#(< ~counter~0 96)} {1546#true} #67#return; {1859#(< ~counter~0 96)} is VALID [2022-04-14 16:16:48,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {1859#(< ~counter~0 96)} assume true; {1859#(< ~counter~0 96)} is VALID [2022-04-14 16:16:48,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {1546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1859#(< ~counter~0 96)} is VALID [2022-04-14 16:16:48,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {1546#true} call ULTIMATE.init(); {1546#true} is VALID [2022-04-14 16:16:48,514 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-14 16:16:48,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:48,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582090544] [2022-04-14 16:16:48,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:48,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46835105] [2022-04-14 16:16:48,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46835105] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:16:48,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:16:48,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-14 16:16:48,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642126692] [2022-04-14 16:16:48,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:16:48,516 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-14 16:16:48,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:48,517 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-14 16:16:48,595 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-14 16:16:48,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 16:16:48,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:48,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 16:16:48,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-14 16:16:48,601 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-14 16:16:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:49,025 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-04-14 16:16:49,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-14 16:16:49,026 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-14 16:16:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:49,026 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-14 16:16:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-14 16:16:49,031 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-14 16:16:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-14 16:16:49,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 130 transitions. [2022-04-14 16:16:49,153 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-14 16:16:49,156 INFO L225 Difference]: With dead ends: 115 [2022-04-14 16:16:49,156 INFO L226 Difference]: Without dead ends: 110 [2022-04-14 16:16:49,156 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-14 16:16:49,157 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 88 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:49,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 142 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 16:16:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-14 16:16:49,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-14 16:16:49,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:49,206 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-14 16:16:49,207 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-14 16:16:49,208 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-14 16:16:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:49,212 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-14 16:16:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-14 16:16:49,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:49,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:49,213 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-14 16:16:49,213 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-14 16:16:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:49,219 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-14 16:16:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-14 16:16:49,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:49,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:49,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:49,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:49,221 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-14 16:16:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-14 16:16:49,224 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-14 16:16:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:49,224 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-14 16:16:49,225 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-14 16:16:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-14 16:16:49,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-14 16:16:49,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:49,227 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-14 16:16:49,252 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-14 16:16:49,443 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-14 16:16:49,444 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 3 times [2022-04-14 16:16:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:49,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164580820] [2022-04-14 16:16:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:49,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:49,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364861165] [2022-04-14 16:16:49,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 16:16:49,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:49,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:49,465 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-14 16:16:49,477 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-14 16:16:51,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-14 16:16:51,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:16:51,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 16:16:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:51,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:52,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {2458#true} call ULTIMATE.init(); {2458#true} is VALID [2022-04-14 16:16:52,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {2458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {2466#(<= ~counter~0 0)} assume true; {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2466#(<= ~counter~0 0)} {2458#true} #67#return; {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {2466#(<= ~counter~0 0)} call #t~ret7 := main(); {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {2466#(<= ~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; {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,250 INFO L272 TraceCheckUtils]: 6: Hoare triple {2466#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {2466#(<= ~counter~0 0)} ~cond := #in~cond; {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {2466#(<= ~counter~0 0)} assume !(0 == ~cond); {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {2466#(<= ~counter~0 0)} assume true; {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,252 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2466#(<= ~counter~0 0)} {2466#(<= ~counter~0 0)} #59#return; {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,252 INFO L272 TraceCheckUtils]: 11: Hoare triple {2466#(<= ~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)); {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {2466#(<= ~counter~0 0)} ~cond := #in~cond; {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {2466#(<= ~counter~0 0)} assume !(0 == ~cond); {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {2466#(<= ~counter~0 0)} assume true; {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,254 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2466#(<= ~counter~0 0)} {2466#(<= ~counter~0 0)} #61#return; {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {2466#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2466#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:52,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {2466#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2515#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:52,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {2515#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {2515#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:52,256 INFO L272 TraceCheckUtils]: 19: Hoare triple {2515#(<= ~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)); {2515#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:52,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {2515#(<= ~counter~0 1)} ~cond := #in~cond; {2515#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:52,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {2515#(<= ~counter~0 1)} assume !(0 == ~cond); {2515#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:52,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {2515#(<= ~counter~0 1)} assume true; {2515#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:52,260 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2515#(<= ~counter~0 1)} {2515#(<= ~counter~0 1)} #63#return; {2515#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:52,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {2515#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2515#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:52,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {2515#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2515#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:52,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {2515#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2543#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:52,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {2543#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {2543#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:52,262 INFO L272 TraceCheckUtils]: 28: Hoare triple {2543#(<= ~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)); {2543#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:52,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {2543#(<= ~counter~0 2)} ~cond := #in~cond; {2543#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:52,263 INFO L290 TraceCheckUtils]: 30: Hoare triple {2543#(<= ~counter~0 2)} assume !(0 == ~cond); {2543#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:52,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {2543#(<= ~counter~0 2)} assume true; {2543#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:52,264 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2543#(<= ~counter~0 2)} {2543#(<= ~counter~0 2)} #63#return; {2543#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:52,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {2543#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2543#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:52,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {2543#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2543#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:52,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {2543#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2571#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:52,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {2571#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {2571#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:52,266 INFO L272 TraceCheckUtils]: 37: Hoare triple {2571#(<= ~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)); {2571#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:52,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {2571#(<= ~counter~0 3)} ~cond := #in~cond; {2571#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:52,266 INFO L290 TraceCheckUtils]: 39: Hoare triple {2571#(<= ~counter~0 3)} assume !(0 == ~cond); {2571#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:52,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {2571#(<= ~counter~0 3)} assume true; {2571#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:52,267 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2571#(<= ~counter~0 3)} {2571#(<= ~counter~0 3)} #63#return; {2571#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:52,268 INFO L290 TraceCheckUtils]: 42: Hoare triple {2571#(<= ~counter~0 3)} assume !!(0 != ~r~0); {2571#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:52,268 INFO L290 TraceCheckUtils]: 43: Hoare triple {2571#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2571#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:52,269 INFO L290 TraceCheckUtils]: 44: Hoare triple {2571#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2599#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:52,269 INFO L290 TraceCheckUtils]: 45: Hoare triple {2599#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {2599#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:52,269 INFO L272 TraceCheckUtils]: 46: Hoare triple {2599#(<= ~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)); {2599#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:52,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {2599#(<= ~counter~0 4)} ~cond := #in~cond; {2599#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:52,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {2599#(<= ~counter~0 4)} assume !(0 == ~cond); {2599#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:52,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {2599#(<= ~counter~0 4)} assume true; {2599#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:52,271 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2599#(<= ~counter~0 4)} {2599#(<= ~counter~0 4)} #63#return; {2599#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:52,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {2599#(<= ~counter~0 4)} assume !!(0 != ~r~0); {2599#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:52,271 INFO L290 TraceCheckUtils]: 52: Hoare triple {2599#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2599#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:52,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {2599#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2627#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:52,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {2627#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {2627#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:52,273 INFO L272 TraceCheckUtils]: 55: Hoare triple {2627#(<= ~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)); {2627#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:52,273 INFO L290 TraceCheckUtils]: 56: Hoare triple {2627#(<= ~counter~0 5)} ~cond := #in~cond; {2627#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:52,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {2627#(<= ~counter~0 5)} assume !(0 == ~cond); {2627#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:52,274 INFO L290 TraceCheckUtils]: 58: Hoare triple {2627#(<= ~counter~0 5)} assume true; {2627#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:52,274 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2627#(<= ~counter~0 5)} {2627#(<= ~counter~0 5)} #63#return; {2627#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:52,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {2627#(<= ~counter~0 5)} assume !!(0 != ~r~0); {2627#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:52,276 INFO L290 TraceCheckUtils]: 61: Hoare triple {2627#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2627#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:52,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {2627#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2655#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:52,277 INFO L290 TraceCheckUtils]: 63: Hoare triple {2655#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {2655#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:52,277 INFO L272 TraceCheckUtils]: 64: Hoare triple {2655#(<= ~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)); {2655#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:52,278 INFO L290 TraceCheckUtils]: 65: Hoare triple {2655#(<= ~counter~0 6)} ~cond := #in~cond; {2655#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:52,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {2655#(<= ~counter~0 6)} assume !(0 == ~cond); {2655#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:52,281 INFO L290 TraceCheckUtils]: 67: Hoare triple {2655#(<= ~counter~0 6)} assume true; {2655#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:52,290 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2655#(<= ~counter~0 6)} {2655#(<= ~counter~0 6)} #63#return; {2655#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:52,291 INFO L290 TraceCheckUtils]: 69: Hoare triple {2655#(<= ~counter~0 6)} assume !!(0 != ~r~0); {2655#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:52,292 INFO L290 TraceCheckUtils]: 70: Hoare triple {2655#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2655#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:52,293 INFO L290 TraceCheckUtils]: 71: Hoare triple {2655#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2683#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:52,293 INFO L290 TraceCheckUtils]: 72: Hoare triple {2683#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {2683#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:52,294 INFO L272 TraceCheckUtils]: 73: Hoare triple {2683#(<= ~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)); {2683#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:52,296 INFO L290 TraceCheckUtils]: 74: Hoare triple {2683#(<= ~counter~0 7)} ~cond := #in~cond; {2683#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:52,296 INFO L290 TraceCheckUtils]: 75: Hoare triple {2683#(<= ~counter~0 7)} assume !(0 == ~cond); {2683#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:52,296 INFO L290 TraceCheckUtils]: 76: Hoare triple {2683#(<= ~counter~0 7)} assume true; {2683#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:52,297 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2683#(<= ~counter~0 7)} {2683#(<= ~counter~0 7)} #63#return; {2683#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:52,297 INFO L290 TraceCheckUtils]: 78: Hoare triple {2683#(<= ~counter~0 7)} assume !!(0 != ~r~0); {2683#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:52,298 INFO L290 TraceCheckUtils]: 79: Hoare triple {2683#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2683#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:52,298 INFO L290 TraceCheckUtils]: 80: Hoare triple {2683#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2711#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:52,298 INFO L290 TraceCheckUtils]: 81: Hoare triple {2711#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {2711#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:52,299 INFO L272 TraceCheckUtils]: 82: Hoare triple {2711#(<= ~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)); {2711#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:52,299 INFO L290 TraceCheckUtils]: 83: Hoare triple {2711#(<= ~counter~0 8)} ~cond := #in~cond; {2711#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:52,300 INFO L290 TraceCheckUtils]: 84: Hoare triple {2711#(<= ~counter~0 8)} assume !(0 == ~cond); {2711#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:52,300 INFO L290 TraceCheckUtils]: 85: Hoare triple {2711#(<= ~counter~0 8)} assume true; {2711#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:52,301 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2711#(<= ~counter~0 8)} {2711#(<= ~counter~0 8)} #63#return; {2711#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:52,301 INFO L290 TraceCheckUtils]: 87: Hoare triple {2711#(<= ~counter~0 8)} assume !!(0 != ~r~0); {2711#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:52,301 INFO L290 TraceCheckUtils]: 88: Hoare triple {2711#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2711#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:52,302 INFO L290 TraceCheckUtils]: 89: Hoare triple {2711#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2739#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:52,302 INFO L290 TraceCheckUtils]: 90: Hoare triple {2739#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {2739#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:52,303 INFO L272 TraceCheckUtils]: 91: Hoare triple {2739#(<= ~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)); {2739#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:52,303 INFO L290 TraceCheckUtils]: 92: Hoare triple {2739#(<= ~counter~0 9)} ~cond := #in~cond; {2739#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:52,303 INFO L290 TraceCheckUtils]: 93: Hoare triple {2739#(<= ~counter~0 9)} assume !(0 == ~cond); {2739#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:52,304 INFO L290 TraceCheckUtils]: 94: Hoare triple {2739#(<= ~counter~0 9)} assume true; {2739#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:52,304 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2739#(<= ~counter~0 9)} {2739#(<= ~counter~0 9)} #63#return; {2739#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:52,304 INFO L290 TraceCheckUtils]: 96: Hoare triple {2739#(<= ~counter~0 9)} assume !!(0 != ~r~0); {2739#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:52,305 INFO L290 TraceCheckUtils]: 97: Hoare triple {2739#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2739#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:52,305 INFO L290 TraceCheckUtils]: 98: Hoare triple {2739#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2767#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:52,306 INFO L290 TraceCheckUtils]: 99: Hoare triple {2767#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {2767#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:52,306 INFO L272 TraceCheckUtils]: 100: Hoare triple {2767#(<= ~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)); {2767#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:52,307 INFO L290 TraceCheckUtils]: 101: Hoare triple {2767#(<= ~counter~0 10)} ~cond := #in~cond; {2767#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:52,307 INFO L290 TraceCheckUtils]: 102: Hoare triple {2767#(<= ~counter~0 10)} assume !(0 == ~cond); {2767#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:52,307 INFO L290 TraceCheckUtils]: 103: Hoare triple {2767#(<= ~counter~0 10)} assume true; {2767#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:52,308 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2767#(<= ~counter~0 10)} {2767#(<= ~counter~0 10)} #63#return; {2767#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:52,308 INFO L290 TraceCheckUtils]: 105: Hoare triple {2767#(<= ~counter~0 10)} assume !!(0 != ~r~0); {2767#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:52,308 INFO L290 TraceCheckUtils]: 106: Hoare triple {2767#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2767#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:52,309 INFO L290 TraceCheckUtils]: 107: Hoare triple {2767#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2795#(<= |main_#t~post6| 10)} is VALID [2022-04-14 16:16:52,309 INFO L290 TraceCheckUtils]: 108: Hoare triple {2795#(<= |main_#t~post6| 10)} assume !(#t~post6 < 100);havoc #t~post6; {2459#false} is VALID [2022-04-14 16:16:52,309 INFO L272 TraceCheckUtils]: 109: Hoare triple {2459#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2459#false} is VALID [2022-04-14 16:16:52,309 INFO L290 TraceCheckUtils]: 110: Hoare triple {2459#false} ~cond := #in~cond; {2459#false} is VALID [2022-04-14 16:16:52,310 INFO L290 TraceCheckUtils]: 111: Hoare triple {2459#false} assume 0 == ~cond; {2459#false} is VALID [2022-04-14 16:16:52,310 INFO L290 TraceCheckUtils]: 112: Hoare triple {2459#false} assume !false; {2459#false} is VALID [2022-04-14 16:16:52,312 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-14 16:16:52,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:16:53,082 INFO L290 TraceCheckUtils]: 112: Hoare triple {2459#false} assume !false; {2459#false} is VALID [2022-04-14 16:16:53,083 INFO L290 TraceCheckUtils]: 111: Hoare triple {2459#false} assume 0 == ~cond; {2459#false} is VALID [2022-04-14 16:16:53,083 INFO L290 TraceCheckUtils]: 110: Hoare triple {2459#false} ~cond := #in~cond; {2459#false} is VALID [2022-04-14 16:16:53,083 INFO L272 TraceCheckUtils]: 109: Hoare triple {2459#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2459#false} is VALID [2022-04-14 16:16:53,083 INFO L290 TraceCheckUtils]: 108: Hoare triple {2823#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {2459#false} is VALID [2022-04-14 16:16:53,084 INFO L290 TraceCheckUtils]: 107: Hoare triple {2827#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2823#(< |main_#t~post6| 100)} is VALID [2022-04-14 16:16:53,084 INFO L290 TraceCheckUtils]: 106: Hoare triple {2827#(< ~counter~0 100)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2827#(< ~counter~0 100)} is VALID [2022-04-14 16:16:53,084 INFO L290 TraceCheckUtils]: 105: Hoare triple {2827#(< ~counter~0 100)} assume !!(0 != ~r~0); {2827#(< ~counter~0 100)} is VALID [2022-04-14 16:16:53,085 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2458#true} {2827#(< ~counter~0 100)} #63#return; {2827#(< ~counter~0 100)} is VALID [2022-04-14 16:16:53,085 INFO L290 TraceCheckUtils]: 103: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-14 16:16:53,085 INFO L290 TraceCheckUtils]: 102: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-14 16:16:53,085 INFO L290 TraceCheckUtils]: 101: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-14 16:16:53,086 INFO L272 TraceCheckUtils]: 100: Hoare triple {2827#(< ~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)); {2458#true} is VALID [2022-04-14 16:16:53,086 INFO L290 TraceCheckUtils]: 99: Hoare triple {2827#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {2827#(< ~counter~0 100)} is VALID [2022-04-14 16:16:53,086 INFO L290 TraceCheckUtils]: 98: Hoare triple {2855#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2827#(< ~counter~0 100)} is VALID [2022-04-14 16:16:53,087 INFO L290 TraceCheckUtils]: 97: Hoare triple {2855#(< ~counter~0 99)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2855#(< ~counter~0 99)} is VALID [2022-04-14 16:16:53,087 INFO L290 TraceCheckUtils]: 96: Hoare triple {2855#(< ~counter~0 99)} assume !!(0 != ~r~0); {2855#(< ~counter~0 99)} is VALID [2022-04-14 16:16:53,088 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2458#true} {2855#(< ~counter~0 99)} #63#return; {2855#(< ~counter~0 99)} is VALID [2022-04-14 16:16:53,088 INFO L290 TraceCheckUtils]: 94: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-14 16:16:53,088 INFO L290 TraceCheckUtils]: 93: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-14 16:16:53,088 INFO L290 TraceCheckUtils]: 92: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-14 16:16:53,088 INFO L272 TraceCheckUtils]: 91: Hoare triple {2855#(< ~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)); {2458#true} is VALID [2022-04-14 16:16:53,089 INFO L290 TraceCheckUtils]: 90: Hoare triple {2855#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {2855#(< ~counter~0 99)} is VALID [2022-04-14 16:16:53,089 INFO L290 TraceCheckUtils]: 89: Hoare triple {2883#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2855#(< ~counter~0 99)} is VALID [2022-04-14 16:16:53,090 INFO L290 TraceCheckUtils]: 88: Hoare triple {2883#(< ~counter~0 98)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2883#(< ~counter~0 98)} is VALID [2022-04-14 16:16:53,090 INFO L290 TraceCheckUtils]: 87: Hoare triple {2883#(< ~counter~0 98)} assume !!(0 != ~r~0); {2883#(< ~counter~0 98)} is VALID [2022-04-14 16:16:53,091 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2458#true} {2883#(< ~counter~0 98)} #63#return; {2883#(< ~counter~0 98)} is VALID [2022-04-14 16:16:53,091 INFO L290 TraceCheckUtils]: 85: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-14 16:16:53,091 INFO L290 TraceCheckUtils]: 84: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-14 16:16:53,091 INFO L290 TraceCheckUtils]: 83: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-14 16:16:53,091 INFO L272 TraceCheckUtils]: 82: Hoare triple {2883#(< ~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)); {2458#true} is VALID [2022-04-14 16:16:53,091 INFO L290 TraceCheckUtils]: 81: Hoare triple {2883#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {2883#(< ~counter~0 98)} is VALID [2022-04-14 16:16:53,092 INFO L290 TraceCheckUtils]: 80: Hoare triple {2911#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2883#(< ~counter~0 98)} is VALID [2022-04-14 16:16:53,092 INFO L290 TraceCheckUtils]: 79: Hoare triple {2911#(< ~counter~0 97)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2911#(< ~counter~0 97)} is VALID [2022-04-14 16:16:53,093 INFO L290 TraceCheckUtils]: 78: Hoare triple {2911#(< ~counter~0 97)} assume !!(0 != ~r~0); {2911#(< ~counter~0 97)} is VALID [2022-04-14 16:16:53,093 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2458#true} {2911#(< ~counter~0 97)} #63#return; {2911#(< ~counter~0 97)} is VALID [2022-04-14 16:16:53,093 INFO L290 TraceCheckUtils]: 76: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-14 16:16:53,093 INFO L290 TraceCheckUtils]: 75: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-14 16:16:53,093 INFO L290 TraceCheckUtils]: 74: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-14 16:16:53,094 INFO L272 TraceCheckUtils]: 73: Hoare triple {2911#(< ~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)); {2458#true} is VALID [2022-04-14 16:16:53,094 INFO L290 TraceCheckUtils]: 72: Hoare triple {2911#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {2911#(< ~counter~0 97)} is VALID [2022-04-14 16:16:53,095 INFO L290 TraceCheckUtils]: 71: Hoare triple {2939#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2911#(< ~counter~0 97)} is VALID [2022-04-14 16:16:53,095 INFO L290 TraceCheckUtils]: 70: Hoare triple {2939#(< ~counter~0 96)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2939#(< ~counter~0 96)} is VALID [2022-04-14 16:16:53,095 INFO L290 TraceCheckUtils]: 69: Hoare triple {2939#(< ~counter~0 96)} assume !!(0 != ~r~0); {2939#(< ~counter~0 96)} is VALID [2022-04-14 16:16:53,096 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2458#true} {2939#(< ~counter~0 96)} #63#return; {2939#(< ~counter~0 96)} is VALID [2022-04-14 16:16:53,096 INFO L290 TraceCheckUtils]: 67: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-14 16:16:53,096 INFO L290 TraceCheckUtils]: 66: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-14 16:16:53,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-14 16:16:53,096 INFO L272 TraceCheckUtils]: 64: Hoare triple {2939#(< ~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)); {2458#true} is VALID [2022-04-14 16:16:53,097 INFO L290 TraceCheckUtils]: 63: Hoare triple {2939#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {2939#(< ~counter~0 96)} is VALID [2022-04-14 16:16:53,097 INFO L290 TraceCheckUtils]: 62: Hoare triple {2967#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2939#(< ~counter~0 96)} is VALID [2022-04-14 16:16:53,098 INFO L290 TraceCheckUtils]: 61: Hoare triple {2967#(< ~counter~0 95)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2967#(< ~counter~0 95)} is VALID [2022-04-14 16:16:53,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {2967#(< ~counter~0 95)} assume !!(0 != ~r~0); {2967#(< ~counter~0 95)} is VALID [2022-04-14 16:16:53,099 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2458#true} {2967#(< ~counter~0 95)} #63#return; {2967#(< ~counter~0 95)} is VALID [2022-04-14 16:16:53,099 INFO L290 TraceCheckUtils]: 58: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-14 16:16:53,099 INFO L290 TraceCheckUtils]: 57: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-14 16:16:53,099 INFO L290 TraceCheckUtils]: 56: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-14 16:16:53,099 INFO L272 TraceCheckUtils]: 55: Hoare triple {2967#(< ~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)); {2458#true} is VALID [2022-04-14 16:16:53,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {2967#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {2967#(< ~counter~0 95)} is VALID [2022-04-14 16:16:53,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {2995#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2967#(< ~counter~0 95)} is VALID [2022-04-14 16:16:53,101 INFO L290 TraceCheckUtils]: 52: Hoare triple {2995#(< ~counter~0 94)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2995#(< ~counter~0 94)} is VALID [2022-04-14 16:16:53,101 INFO L290 TraceCheckUtils]: 51: Hoare triple {2995#(< ~counter~0 94)} assume !!(0 != ~r~0); {2995#(< ~counter~0 94)} is VALID [2022-04-14 16:16:53,102 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2458#true} {2995#(< ~counter~0 94)} #63#return; {2995#(< ~counter~0 94)} is VALID [2022-04-14 16:16:53,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-14 16:16:53,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-14 16:16:53,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-14 16:16:53,102 INFO L272 TraceCheckUtils]: 46: Hoare triple {2995#(< ~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)); {2458#true} is VALID [2022-04-14 16:16:53,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {2995#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {2995#(< ~counter~0 94)} is VALID [2022-04-14 16:16:53,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {3023#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2995#(< ~counter~0 94)} is VALID [2022-04-14 16:16:53,103 INFO L290 TraceCheckUtils]: 43: Hoare triple {3023#(< ~counter~0 93)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3023#(< ~counter~0 93)} is VALID [2022-04-14 16:16:53,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {3023#(< ~counter~0 93)} assume !!(0 != ~r~0); {3023#(< ~counter~0 93)} is VALID [2022-04-14 16:16:53,105 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2458#true} {3023#(< ~counter~0 93)} #63#return; {3023#(< ~counter~0 93)} is VALID [2022-04-14 16:16:53,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-14 16:16:53,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-14 16:16:53,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-14 16:16:53,105 INFO L272 TraceCheckUtils]: 37: Hoare triple {3023#(< ~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)); {2458#true} is VALID [2022-04-14 16:16:53,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {3023#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {3023#(< ~counter~0 93)} is VALID [2022-04-14 16:16:53,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {3051#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3023#(< ~counter~0 93)} is VALID [2022-04-14 16:16:53,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {3051#(< ~counter~0 92)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3051#(< ~counter~0 92)} is VALID [2022-04-14 16:16:53,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {3051#(< ~counter~0 92)} assume !!(0 != ~r~0); {3051#(< ~counter~0 92)} is VALID [2022-04-14 16:16:53,107 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2458#true} {3051#(< ~counter~0 92)} #63#return; {3051#(< ~counter~0 92)} is VALID [2022-04-14 16:16:53,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-14 16:16:53,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-14 16:16:53,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-14 16:16:53,110 INFO L272 TraceCheckUtils]: 28: Hoare triple {3051#(< ~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)); {2458#true} is VALID [2022-04-14 16:16:53,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {3051#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {3051#(< ~counter~0 92)} is VALID [2022-04-14 16:16:53,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {3079#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3051#(< ~counter~0 92)} is VALID [2022-04-14 16:16:53,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {3079#(< ~counter~0 91)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3079#(< ~counter~0 91)} is VALID [2022-04-14 16:16:53,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {3079#(< ~counter~0 91)} assume !!(0 != ~r~0); {3079#(< ~counter~0 91)} is VALID [2022-04-14 16:16:53,112 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2458#true} {3079#(< ~counter~0 91)} #63#return; {3079#(< ~counter~0 91)} is VALID [2022-04-14 16:16:53,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-14 16:16:53,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-14 16:16:53,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-14 16:16:53,113 INFO L272 TraceCheckUtils]: 19: Hoare triple {3079#(< ~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)); {2458#true} is VALID [2022-04-14 16:16:53,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {3079#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {3079#(< ~counter~0 91)} is VALID [2022-04-14 16:16:53,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {3107#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3079#(< ~counter~0 91)} is VALID [2022-04-14 16:16:53,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {3107#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3107#(< ~counter~0 90)} is VALID [2022-04-14 16:16:53,115 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2458#true} {3107#(< ~counter~0 90)} #61#return; {3107#(< ~counter~0 90)} is VALID [2022-04-14 16:16:53,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-14 16:16:53,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-14 16:16:53,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-14 16:16:53,115 INFO L272 TraceCheckUtils]: 11: Hoare triple {3107#(< ~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)); {2458#true} is VALID [2022-04-14 16:16:53,116 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2458#true} {3107#(< ~counter~0 90)} #59#return; {3107#(< ~counter~0 90)} is VALID [2022-04-14 16:16:53,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-14 16:16:53,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-14 16:16:53,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-14 16:16:53,116 INFO L272 TraceCheckUtils]: 6: Hoare triple {3107#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2458#true} is VALID [2022-04-14 16:16:53,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {3107#(< ~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; {3107#(< ~counter~0 90)} is VALID [2022-04-14 16:16:53,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {3107#(< ~counter~0 90)} call #t~ret7 := main(); {3107#(< ~counter~0 90)} is VALID [2022-04-14 16:16:53,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3107#(< ~counter~0 90)} {2458#true} #67#return; {3107#(< ~counter~0 90)} is VALID [2022-04-14 16:16:53,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {3107#(< ~counter~0 90)} assume true; {3107#(< ~counter~0 90)} is VALID [2022-04-14 16:16:53,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {2458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3107#(< ~counter~0 90)} is VALID [2022-04-14 16:16:53,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {2458#true} call ULTIMATE.init(); {2458#true} is VALID [2022-04-14 16:16:53,119 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-14 16:16:53,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:53,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164580820] [2022-04-14 16:16:53,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:53,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364861165] [2022-04-14 16:16:53,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364861165] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:16:53,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:16:53,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-14 16:16:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937380539] [2022-04-14 16:16:53,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:16:53,124 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-14 16:16:53,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:53,126 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-14 16:16:53,274 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-14 16:16:53,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-14 16:16:53,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:53,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-14 16:16:53,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-14 16:16:53,276 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-14 16:16:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:54,371 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2022-04-14 16:16:54,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-14 16:16:54,371 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-14 16:16:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:54,372 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-14 16:16:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 256 transitions. [2022-04-14 16:16:54,381 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-14 16:16:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 256 transitions. [2022-04-14 16:16:54,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 256 transitions. [2022-04-14 16:16:54,576 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-14 16:16:54,583 INFO L225 Difference]: With dead ends: 223 [2022-04-14 16:16:54,583 INFO L226 Difference]: Without dead ends: 218 [2022-04-14 16:16:54,584 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-14 16:16:54,584 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 292 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:54,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 296 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 16:16:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-14 16:16:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-04-14 16:16:54,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:54,671 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-14 16:16:54,672 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-14 16:16:54,672 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-14 16:16:54,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:54,680 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-04-14 16:16:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-14 16:16:54,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:54,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:54,681 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-14 16:16:54,681 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-14 16:16:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:54,696 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-04-14 16:16:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-14 16:16:54,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:54,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:54,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:54,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:54,698 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-14 16:16:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2022-04-14 16:16:54,704 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 113 [2022-04-14 16:16:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:54,704 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions. [2022-04-14 16:16:54,705 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-14 16:16:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-14 16:16:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-04-14 16:16:54,707 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:54,708 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-14 16:16:54,717 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-14 16:16:54,914 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-14 16:16:54,915 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:54,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:54,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1234385578, now seen corresponding path program 4 times [2022-04-14 16:16:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:54,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709248379] [2022-04-14 16:16:54,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:54,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:54,955 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:54,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628807265] [2022-04-14 16:16:54,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 16:16:54,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:54,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:54,957 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-14 16:16:54,979 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-14 16:16:55,218 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 16:16:55,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:16:55,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-14 16:16:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:55,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:56,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {4234#true} call ULTIMATE.init(); {4234#true} is VALID [2022-04-14 16:16:56,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {4234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {4242#(<= ~counter~0 0)} assume true; {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4242#(<= ~counter~0 0)} {4234#true} #67#return; {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {4242#(<= ~counter~0 0)} call #t~ret7 := main(); {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {4242#(<= ~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; {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {4242#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {4242#(<= ~counter~0 0)} ~cond := #in~cond; {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {4242#(<= ~counter~0 0)} assume !(0 == ~cond); {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {4242#(<= ~counter~0 0)} assume true; {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,653 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4242#(<= ~counter~0 0)} {4242#(<= ~counter~0 0)} #59#return; {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,656 INFO L272 TraceCheckUtils]: 11: Hoare triple {4242#(<= ~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)); {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {4242#(<= ~counter~0 0)} ~cond := #in~cond; {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {4242#(<= ~counter~0 0)} assume !(0 == ~cond); {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {4242#(<= ~counter~0 0)} assume true; {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,658 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4242#(<= ~counter~0 0)} {4242#(<= ~counter~0 0)} #61#return; {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {4242#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4242#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:56,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {4242#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4291#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:56,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {4291#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {4291#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:56,660 INFO L272 TraceCheckUtils]: 19: Hoare triple {4291#(<= ~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)); {4291#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:56,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {4291#(<= ~counter~0 1)} ~cond := #in~cond; {4291#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:56,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {4291#(<= ~counter~0 1)} assume !(0 == ~cond); {4291#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:56,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {4291#(<= ~counter~0 1)} assume true; {4291#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:56,662 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4291#(<= ~counter~0 1)} {4291#(<= ~counter~0 1)} #63#return; {4291#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:56,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {4291#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4291#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:56,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {4291#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4291#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:56,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {4291#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4319#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:56,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {4319#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {4319#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:56,664 INFO L272 TraceCheckUtils]: 28: Hoare triple {4319#(<= ~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)); {4319#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:56,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {4319#(<= ~counter~0 2)} ~cond := #in~cond; {4319#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:56,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {4319#(<= ~counter~0 2)} assume !(0 == ~cond); {4319#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:56,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {4319#(<= ~counter~0 2)} assume true; {4319#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:56,665 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4319#(<= ~counter~0 2)} {4319#(<= ~counter~0 2)} #63#return; {4319#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:56,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {4319#(<= ~counter~0 2)} assume !!(0 != ~r~0); {4319#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:56,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {4319#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4319#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:56,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {4319#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4347#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:56,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {4347#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {4347#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:56,668 INFO L272 TraceCheckUtils]: 37: Hoare triple {4347#(<= ~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)); {4347#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:56,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {4347#(<= ~counter~0 3)} ~cond := #in~cond; {4347#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:56,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {4347#(<= ~counter~0 3)} assume !(0 == ~cond); {4347#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:56,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {4347#(<= ~counter~0 3)} assume true; {4347#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:56,669 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4347#(<= ~counter~0 3)} {4347#(<= ~counter~0 3)} #63#return; {4347#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:56,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {4347#(<= ~counter~0 3)} assume !!(0 != ~r~0); {4347#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:56,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {4347#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4347#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:56,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {4347#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4375#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:56,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {4375#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {4375#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:56,671 INFO L272 TraceCheckUtils]: 46: Hoare triple {4375#(<= ~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)); {4375#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:56,672 INFO L290 TraceCheckUtils]: 47: Hoare triple {4375#(<= ~counter~0 4)} ~cond := #in~cond; {4375#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:56,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {4375#(<= ~counter~0 4)} assume !(0 == ~cond); {4375#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:56,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {4375#(<= ~counter~0 4)} assume true; {4375#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:56,673 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4375#(<= ~counter~0 4)} {4375#(<= ~counter~0 4)} #63#return; {4375#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:56,673 INFO L290 TraceCheckUtils]: 51: Hoare triple {4375#(<= ~counter~0 4)} assume !!(0 != ~r~0); {4375#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:56,674 INFO L290 TraceCheckUtils]: 52: Hoare triple {4375#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4375#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:56,674 INFO L290 TraceCheckUtils]: 53: Hoare triple {4375#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4403#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:56,675 INFO L290 TraceCheckUtils]: 54: Hoare triple {4403#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {4403#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:56,675 INFO L272 TraceCheckUtils]: 55: Hoare triple {4403#(<= ~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)); {4403#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:56,676 INFO L290 TraceCheckUtils]: 56: Hoare triple {4403#(<= ~counter~0 5)} ~cond := #in~cond; {4403#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:56,676 INFO L290 TraceCheckUtils]: 57: Hoare triple {4403#(<= ~counter~0 5)} assume !(0 == ~cond); {4403#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:56,676 INFO L290 TraceCheckUtils]: 58: Hoare triple {4403#(<= ~counter~0 5)} assume true; {4403#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:56,682 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4403#(<= ~counter~0 5)} {4403#(<= ~counter~0 5)} #63#return; {4403#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:56,682 INFO L290 TraceCheckUtils]: 60: Hoare triple {4403#(<= ~counter~0 5)} assume !!(0 != ~r~0); {4403#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:56,683 INFO L290 TraceCheckUtils]: 61: Hoare triple {4403#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4403#(<= ~counter~0 5)} is VALID [2022-04-14 16:16:56,683 INFO L290 TraceCheckUtils]: 62: Hoare triple {4403#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4431#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:56,684 INFO L290 TraceCheckUtils]: 63: Hoare triple {4431#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {4431#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:56,684 INFO L272 TraceCheckUtils]: 64: Hoare triple {4431#(<= ~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)); {4431#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:56,685 INFO L290 TraceCheckUtils]: 65: Hoare triple {4431#(<= ~counter~0 6)} ~cond := #in~cond; {4431#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:56,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {4431#(<= ~counter~0 6)} assume !(0 == ~cond); {4431#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:56,685 INFO L290 TraceCheckUtils]: 67: Hoare triple {4431#(<= ~counter~0 6)} assume true; {4431#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:56,686 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4431#(<= ~counter~0 6)} {4431#(<= ~counter~0 6)} #63#return; {4431#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:56,686 INFO L290 TraceCheckUtils]: 69: Hoare triple {4431#(<= ~counter~0 6)} assume !!(0 != ~r~0); {4431#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:56,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {4431#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4431#(<= ~counter~0 6)} is VALID [2022-04-14 16:16:56,687 INFO L290 TraceCheckUtils]: 71: Hoare triple {4431#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4459#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:56,688 INFO L290 TraceCheckUtils]: 72: Hoare triple {4459#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {4459#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:56,688 INFO L272 TraceCheckUtils]: 73: Hoare triple {4459#(<= ~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)); {4459#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:56,689 INFO L290 TraceCheckUtils]: 74: Hoare triple {4459#(<= ~counter~0 7)} ~cond := #in~cond; {4459#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:56,689 INFO L290 TraceCheckUtils]: 75: Hoare triple {4459#(<= ~counter~0 7)} assume !(0 == ~cond); {4459#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:56,689 INFO L290 TraceCheckUtils]: 76: Hoare triple {4459#(<= ~counter~0 7)} assume true; {4459#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:56,690 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4459#(<= ~counter~0 7)} {4459#(<= ~counter~0 7)} #63#return; {4459#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:56,690 INFO L290 TraceCheckUtils]: 78: Hoare triple {4459#(<= ~counter~0 7)} assume !!(0 != ~r~0); {4459#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:56,691 INFO L290 TraceCheckUtils]: 79: Hoare triple {4459#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4459#(<= ~counter~0 7)} is VALID [2022-04-14 16:16:56,691 INFO L290 TraceCheckUtils]: 80: Hoare triple {4459#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4487#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:56,692 INFO L290 TraceCheckUtils]: 81: Hoare triple {4487#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {4487#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:56,692 INFO L272 TraceCheckUtils]: 82: Hoare triple {4487#(<= ~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)); {4487#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:56,693 INFO L290 TraceCheckUtils]: 83: Hoare triple {4487#(<= ~counter~0 8)} ~cond := #in~cond; {4487#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:56,693 INFO L290 TraceCheckUtils]: 84: Hoare triple {4487#(<= ~counter~0 8)} assume !(0 == ~cond); {4487#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:56,693 INFO L290 TraceCheckUtils]: 85: Hoare triple {4487#(<= ~counter~0 8)} assume true; {4487#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:56,694 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4487#(<= ~counter~0 8)} {4487#(<= ~counter~0 8)} #63#return; {4487#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:56,694 INFO L290 TraceCheckUtils]: 87: Hoare triple {4487#(<= ~counter~0 8)} assume !!(0 != ~r~0); {4487#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:56,694 INFO L290 TraceCheckUtils]: 88: Hoare triple {4487#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4487#(<= ~counter~0 8)} is VALID [2022-04-14 16:16:56,695 INFO L290 TraceCheckUtils]: 89: Hoare triple {4487#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4515#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:56,695 INFO L290 TraceCheckUtils]: 90: Hoare triple {4515#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {4515#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:56,695 INFO L272 TraceCheckUtils]: 91: Hoare triple {4515#(<= ~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)); {4515#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:56,696 INFO L290 TraceCheckUtils]: 92: Hoare triple {4515#(<= ~counter~0 9)} ~cond := #in~cond; {4515#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:56,696 INFO L290 TraceCheckUtils]: 93: Hoare triple {4515#(<= ~counter~0 9)} assume !(0 == ~cond); {4515#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:56,696 INFO L290 TraceCheckUtils]: 94: Hoare triple {4515#(<= ~counter~0 9)} assume true; {4515#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:56,697 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {4515#(<= ~counter~0 9)} {4515#(<= ~counter~0 9)} #63#return; {4515#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:56,697 INFO L290 TraceCheckUtils]: 96: Hoare triple {4515#(<= ~counter~0 9)} assume !!(0 != ~r~0); {4515#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:56,697 INFO L290 TraceCheckUtils]: 97: Hoare triple {4515#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4515#(<= ~counter~0 9)} is VALID [2022-04-14 16:16:56,698 INFO L290 TraceCheckUtils]: 98: Hoare triple {4515#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4543#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:56,698 INFO L290 TraceCheckUtils]: 99: Hoare triple {4543#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {4543#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:56,698 INFO L272 TraceCheckUtils]: 100: Hoare triple {4543#(<= ~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)); {4543#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:56,699 INFO L290 TraceCheckUtils]: 101: Hoare triple {4543#(<= ~counter~0 10)} ~cond := #in~cond; {4543#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:56,699 INFO L290 TraceCheckUtils]: 102: Hoare triple {4543#(<= ~counter~0 10)} assume !(0 == ~cond); {4543#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:56,699 INFO L290 TraceCheckUtils]: 103: Hoare triple {4543#(<= ~counter~0 10)} assume true; {4543#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:56,700 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {4543#(<= ~counter~0 10)} {4543#(<= ~counter~0 10)} #63#return; {4543#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:56,700 INFO L290 TraceCheckUtils]: 105: Hoare triple {4543#(<= ~counter~0 10)} assume !!(0 != ~r~0); {4543#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:56,700 INFO L290 TraceCheckUtils]: 106: Hoare triple {4543#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4543#(<= ~counter~0 10)} is VALID [2022-04-14 16:16:56,701 INFO L290 TraceCheckUtils]: 107: Hoare triple {4543#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4571#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:56,701 INFO L290 TraceCheckUtils]: 108: Hoare triple {4571#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {4571#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:56,701 INFO L272 TraceCheckUtils]: 109: Hoare triple {4571#(<= ~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)); {4571#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:56,702 INFO L290 TraceCheckUtils]: 110: Hoare triple {4571#(<= ~counter~0 11)} ~cond := #in~cond; {4571#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:56,702 INFO L290 TraceCheckUtils]: 111: Hoare triple {4571#(<= ~counter~0 11)} assume !(0 == ~cond); {4571#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:56,702 INFO L290 TraceCheckUtils]: 112: Hoare triple {4571#(<= ~counter~0 11)} assume true; {4571#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:56,703 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {4571#(<= ~counter~0 11)} {4571#(<= ~counter~0 11)} #63#return; {4571#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:56,703 INFO L290 TraceCheckUtils]: 114: Hoare triple {4571#(<= ~counter~0 11)} assume !!(0 != ~r~0); {4571#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:56,703 INFO L290 TraceCheckUtils]: 115: Hoare triple {4571#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4571#(<= ~counter~0 11)} is VALID [2022-04-14 16:16:56,704 INFO L290 TraceCheckUtils]: 116: Hoare triple {4571#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4599#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:56,704 INFO L290 TraceCheckUtils]: 117: Hoare triple {4599#(<= ~counter~0 12)} assume !!(#t~post6 < 100);havoc #t~post6; {4599#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:56,705 INFO L272 TraceCheckUtils]: 118: Hoare triple {4599#(<= ~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)); {4599#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:56,705 INFO L290 TraceCheckUtils]: 119: Hoare triple {4599#(<= ~counter~0 12)} ~cond := #in~cond; {4599#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:56,706 INFO L290 TraceCheckUtils]: 120: Hoare triple {4599#(<= ~counter~0 12)} assume !(0 == ~cond); {4599#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:56,706 INFO L290 TraceCheckUtils]: 121: Hoare triple {4599#(<= ~counter~0 12)} assume true; {4599#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:56,707 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {4599#(<= ~counter~0 12)} {4599#(<= ~counter~0 12)} #63#return; {4599#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:56,707 INFO L290 TraceCheckUtils]: 123: Hoare triple {4599#(<= ~counter~0 12)} assume !!(0 != ~r~0); {4599#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:56,707 INFO L290 TraceCheckUtils]: 124: Hoare triple {4599#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4599#(<= ~counter~0 12)} is VALID [2022-04-14 16:16:56,710 INFO L290 TraceCheckUtils]: 125: Hoare triple {4599#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4627#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:56,711 INFO L290 TraceCheckUtils]: 126: Hoare triple {4627#(<= ~counter~0 13)} assume !!(#t~post6 < 100);havoc #t~post6; {4627#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:56,711 INFO L272 TraceCheckUtils]: 127: Hoare triple {4627#(<= ~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)); {4627#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:56,712 INFO L290 TraceCheckUtils]: 128: Hoare triple {4627#(<= ~counter~0 13)} ~cond := #in~cond; {4627#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:56,712 INFO L290 TraceCheckUtils]: 129: Hoare triple {4627#(<= ~counter~0 13)} assume !(0 == ~cond); {4627#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:56,712 INFO L290 TraceCheckUtils]: 130: Hoare triple {4627#(<= ~counter~0 13)} assume true; {4627#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:56,713 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {4627#(<= ~counter~0 13)} {4627#(<= ~counter~0 13)} #63#return; {4627#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:56,713 INFO L290 TraceCheckUtils]: 132: Hoare triple {4627#(<= ~counter~0 13)} assume !!(0 != ~r~0); {4627#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:56,714 INFO L290 TraceCheckUtils]: 133: Hoare triple {4627#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4627#(<= ~counter~0 13)} is VALID [2022-04-14 16:16:56,714 INFO L290 TraceCheckUtils]: 134: Hoare triple {4627#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4655#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:56,715 INFO L290 TraceCheckUtils]: 135: Hoare triple {4655#(<= ~counter~0 14)} assume !!(#t~post6 < 100);havoc #t~post6; {4655#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:56,715 INFO L272 TraceCheckUtils]: 136: Hoare triple {4655#(<= ~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)); {4655#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:56,716 INFO L290 TraceCheckUtils]: 137: Hoare triple {4655#(<= ~counter~0 14)} ~cond := #in~cond; {4655#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:56,716 INFO L290 TraceCheckUtils]: 138: Hoare triple {4655#(<= ~counter~0 14)} assume !(0 == ~cond); {4655#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:56,716 INFO L290 TraceCheckUtils]: 139: Hoare triple {4655#(<= ~counter~0 14)} assume true; {4655#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:56,717 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {4655#(<= ~counter~0 14)} {4655#(<= ~counter~0 14)} #63#return; {4655#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:56,717 INFO L290 TraceCheckUtils]: 141: Hoare triple {4655#(<= ~counter~0 14)} assume !!(0 != ~r~0); {4655#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:56,718 INFO L290 TraceCheckUtils]: 142: Hoare triple {4655#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4655#(<= ~counter~0 14)} is VALID [2022-04-14 16:16:56,718 INFO L290 TraceCheckUtils]: 143: Hoare triple {4655#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4683#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:56,718 INFO L290 TraceCheckUtils]: 144: Hoare triple {4683#(<= ~counter~0 15)} assume !!(#t~post6 < 100);havoc #t~post6; {4683#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:56,719 INFO L272 TraceCheckUtils]: 145: Hoare triple {4683#(<= ~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)); {4683#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:56,719 INFO L290 TraceCheckUtils]: 146: Hoare triple {4683#(<= ~counter~0 15)} ~cond := #in~cond; {4683#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:56,720 INFO L290 TraceCheckUtils]: 147: Hoare triple {4683#(<= ~counter~0 15)} assume !(0 == ~cond); {4683#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:56,720 INFO L290 TraceCheckUtils]: 148: Hoare triple {4683#(<= ~counter~0 15)} assume true; {4683#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:56,721 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {4683#(<= ~counter~0 15)} {4683#(<= ~counter~0 15)} #63#return; {4683#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:56,721 INFO L290 TraceCheckUtils]: 150: Hoare triple {4683#(<= ~counter~0 15)} assume !!(0 != ~r~0); {4683#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:56,721 INFO L290 TraceCheckUtils]: 151: Hoare triple {4683#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4683#(<= ~counter~0 15)} is VALID [2022-04-14 16:16:56,722 INFO L290 TraceCheckUtils]: 152: Hoare triple {4683#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4711#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:56,722 INFO L290 TraceCheckUtils]: 153: Hoare triple {4711#(<= ~counter~0 16)} assume !!(#t~post6 < 100);havoc #t~post6; {4711#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:56,723 INFO L272 TraceCheckUtils]: 154: Hoare triple {4711#(<= ~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)); {4711#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:56,723 INFO L290 TraceCheckUtils]: 155: Hoare triple {4711#(<= ~counter~0 16)} ~cond := #in~cond; {4711#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:56,723 INFO L290 TraceCheckUtils]: 156: Hoare triple {4711#(<= ~counter~0 16)} assume !(0 == ~cond); {4711#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:56,723 INFO L290 TraceCheckUtils]: 157: Hoare triple {4711#(<= ~counter~0 16)} assume true; {4711#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:56,725 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4711#(<= ~counter~0 16)} {4711#(<= ~counter~0 16)} #63#return; {4711#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:56,725 INFO L290 TraceCheckUtils]: 159: Hoare triple {4711#(<= ~counter~0 16)} assume !!(0 != ~r~0); {4711#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:56,726 INFO L290 TraceCheckUtils]: 160: Hoare triple {4711#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4711#(<= ~counter~0 16)} is VALID [2022-04-14 16:16:56,726 INFO L290 TraceCheckUtils]: 161: Hoare triple {4711#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4739#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:56,726 INFO L290 TraceCheckUtils]: 162: Hoare triple {4739#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {4739#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:56,727 INFO L272 TraceCheckUtils]: 163: Hoare triple {4739#(<= ~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)); {4739#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:56,727 INFO L290 TraceCheckUtils]: 164: Hoare triple {4739#(<= ~counter~0 17)} ~cond := #in~cond; {4739#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:56,728 INFO L290 TraceCheckUtils]: 165: Hoare triple {4739#(<= ~counter~0 17)} assume !(0 == ~cond); {4739#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:56,728 INFO L290 TraceCheckUtils]: 166: Hoare triple {4739#(<= ~counter~0 17)} assume true; {4739#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:56,728 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {4739#(<= ~counter~0 17)} {4739#(<= ~counter~0 17)} #63#return; {4739#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:56,729 INFO L290 TraceCheckUtils]: 168: Hoare triple {4739#(<= ~counter~0 17)} assume !!(0 != ~r~0); {4739#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:56,729 INFO L290 TraceCheckUtils]: 169: Hoare triple {4739#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4739#(<= ~counter~0 17)} is VALID [2022-04-14 16:16:56,741 INFO L290 TraceCheckUtils]: 170: Hoare triple {4739#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4767#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:56,742 INFO L290 TraceCheckUtils]: 171: Hoare triple {4767#(<= ~counter~0 18)} assume !!(#t~post6 < 100);havoc #t~post6; {4767#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:56,742 INFO L272 TraceCheckUtils]: 172: Hoare triple {4767#(<= ~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)); {4767#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:56,743 INFO L290 TraceCheckUtils]: 173: Hoare triple {4767#(<= ~counter~0 18)} ~cond := #in~cond; {4767#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:56,743 INFO L290 TraceCheckUtils]: 174: Hoare triple {4767#(<= ~counter~0 18)} assume !(0 == ~cond); {4767#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:56,743 INFO L290 TraceCheckUtils]: 175: Hoare triple {4767#(<= ~counter~0 18)} assume true; {4767#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:56,744 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {4767#(<= ~counter~0 18)} {4767#(<= ~counter~0 18)} #63#return; {4767#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:56,744 INFO L290 TraceCheckUtils]: 177: Hoare triple {4767#(<= ~counter~0 18)} assume !!(0 != ~r~0); {4767#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:56,744 INFO L290 TraceCheckUtils]: 178: Hoare triple {4767#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4767#(<= ~counter~0 18)} is VALID [2022-04-14 16:16:56,745 INFO L290 TraceCheckUtils]: 179: Hoare triple {4767#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4795#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:56,745 INFO L290 TraceCheckUtils]: 180: Hoare triple {4795#(<= ~counter~0 19)} assume !!(#t~post6 < 100);havoc #t~post6; {4795#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:56,746 INFO L272 TraceCheckUtils]: 181: Hoare triple {4795#(<= ~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)); {4795#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:56,746 INFO L290 TraceCheckUtils]: 182: Hoare triple {4795#(<= ~counter~0 19)} ~cond := #in~cond; {4795#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:56,746 INFO L290 TraceCheckUtils]: 183: Hoare triple {4795#(<= ~counter~0 19)} assume !(0 == ~cond); {4795#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:56,747 INFO L290 TraceCheckUtils]: 184: Hoare triple {4795#(<= ~counter~0 19)} assume true; {4795#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:56,747 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {4795#(<= ~counter~0 19)} {4795#(<= ~counter~0 19)} #63#return; {4795#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:56,747 INFO L290 TraceCheckUtils]: 186: Hoare triple {4795#(<= ~counter~0 19)} assume !!(0 != ~r~0); {4795#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:56,748 INFO L290 TraceCheckUtils]: 187: Hoare triple {4795#(<= ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4795#(<= ~counter~0 19)} is VALID [2022-04-14 16:16:56,748 INFO L290 TraceCheckUtils]: 188: Hoare triple {4795#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4823#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:56,749 INFO L290 TraceCheckUtils]: 189: Hoare triple {4823#(<= ~counter~0 20)} assume !!(#t~post6 < 100);havoc #t~post6; {4823#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:56,749 INFO L272 TraceCheckUtils]: 190: Hoare triple {4823#(<= ~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)); {4823#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:56,749 INFO L290 TraceCheckUtils]: 191: Hoare triple {4823#(<= ~counter~0 20)} ~cond := #in~cond; {4823#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:56,750 INFO L290 TraceCheckUtils]: 192: Hoare triple {4823#(<= ~counter~0 20)} assume !(0 == ~cond); {4823#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:56,750 INFO L290 TraceCheckUtils]: 193: Hoare triple {4823#(<= ~counter~0 20)} assume true; {4823#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:56,750 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {4823#(<= ~counter~0 20)} {4823#(<= ~counter~0 20)} #63#return; {4823#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:56,751 INFO L290 TraceCheckUtils]: 195: Hoare triple {4823#(<= ~counter~0 20)} assume !!(0 != ~r~0); {4823#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:56,751 INFO L290 TraceCheckUtils]: 196: Hoare triple {4823#(<= ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4823#(<= ~counter~0 20)} is VALID [2022-04-14 16:16:56,752 INFO L290 TraceCheckUtils]: 197: Hoare triple {4823#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4851#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:56,752 INFO L290 TraceCheckUtils]: 198: Hoare triple {4851#(<= ~counter~0 21)} assume !!(#t~post6 < 100);havoc #t~post6; {4851#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:56,752 INFO L272 TraceCheckUtils]: 199: Hoare triple {4851#(<= ~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)); {4851#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:56,759 INFO L290 TraceCheckUtils]: 200: Hoare triple {4851#(<= ~counter~0 21)} ~cond := #in~cond; {4851#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:56,759 INFO L290 TraceCheckUtils]: 201: Hoare triple {4851#(<= ~counter~0 21)} assume !(0 == ~cond); {4851#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:56,760 INFO L290 TraceCheckUtils]: 202: Hoare triple {4851#(<= ~counter~0 21)} assume true; {4851#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:56,760 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {4851#(<= ~counter~0 21)} {4851#(<= ~counter~0 21)} #63#return; {4851#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:56,761 INFO L290 TraceCheckUtils]: 204: Hoare triple {4851#(<= ~counter~0 21)} assume !!(0 != ~r~0); {4851#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:56,761 INFO L290 TraceCheckUtils]: 205: Hoare triple {4851#(<= ~counter~0 21)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4851#(<= ~counter~0 21)} is VALID [2022-04-14 16:16:56,762 INFO L290 TraceCheckUtils]: 206: Hoare triple {4851#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4879#(<= ~counter~0 22)} is VALID [2022-04-14 16:16:56,762 INFO L290 TraceCheckUtils]: 207: Hoare triple {4879#(<= ~counter~0 22)} assume !!(#t~post6 < 100);havoc #t~post6; {4879#(<= ~counter~0 22)} is VALID [2022-04-14 16:16:56,763 INFO L272 TraceCheckUtils]: 208: Hoare triple {4879#(<= ~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)); {4879#(<= ~counter~0 22)} is VALID [2022-04-14 16:16:56,763 INFO L290 TraceCheckUtils]: 209: Hoare triple {4879#(<= ~counter~0 22)} ~cond := #in~cond; {4879#(<= ~counter~0 22)} is VALID [2022-04-14 16:16:56,763 INFO L290 TraceCheckUtils]: 210: Hoare triple {4879#(<= ~counter~0 22)} assume !(0 == ~cond); {4879#(<= ~counter~0 22)} is VALID [2022-04-14 16:16:56,764 INFO L290 TraceCheckUtils]: 211: Hoare triple {4879#(<= ~counter~0 22)} assume true; {4879#(<= ~counter~0 22)} is VALID [2022-04-14 16:16:56,764 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {4879#(<= ~counter~0 22)} {4879#(<= ~counter~0 22)} #63#return; {4879#(<= ~counter~0 22)} is VALID [2022-04-14 16:16:56,765 INFO L290 TraceCheckUtils]: 213: Hoare triple {4879#(<= ~counter~0 22)} assume !!(0 != ~r~0); {4879#(<= ~counter~0 22)} is VALID [2022-04-14 16:16:56,765 INFO L290 TraceCheckUtils]: 214: Hoare triple {4879#(<= ~counter~0 22)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4879#(<= ~counter~0 22)} is VALID [2022-04-14 16:16:56,765 INFO L290 TraceCheckUtils]: 215: Hoare triple {4879#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4907#(<= |main_#t~post6| 22)} is VALID [2022-04-14 16:16:56,766 INFO L290 TraceCheckUtils]: 216: Hoare triple {4907#(<= |main_#t~post6| 22)} assume !(#t~post6 < 100);havoc #t~post6; {4235#false} is VALID [2022-04-14 16:16:56,766 INFO L272 TraceCheckUtils]: 217: Hoare triple {4235#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4235#false} is VALID [2022-04-14 16:16:56,766 INFO L290 TraceCheckUtils]: 218: Hoare triple {4235#false} ~cond := #in~cond; {4235#false} is VALID [2022-04-14 16:16:56,766 INFO L290 TraceCheckUtils]: 219: Hoare triple {4235#false} assume 0 == ~cond; {4235#false} is VALID [2022-04-14 16:16:56,766 INFO L290 TraceCheckUtils]: 220: Hoare triple {4235#false} assume !false; {4235#false} is VALID [2022-04-14 16:16:56,768 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-14 16:16:56,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:16:58,482 INFO L290 TraceCheckUtils]: 220: Hoare triple {4235#false} assume !false; {4235#false} is VALID [2022-04-14 16:16:58,483 INFO L290 TraceCheckUtils]: 219: Hoare triple {4235#false} assume 0 == ~cond; {4235#false} is VALID [2022-04-14 16:16:58,483 INFO L290 TraceCheckUtils]: 218: Hoare triple {4235#false} ~cond := #in~cond; {4235#false} is VALID [2022-04-14 16:16:58,483 INFO L272 TraceCheckUtils]: 217: Hoare triple {4235#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4235#false} is VALID [2022-04-14 16:16:58,483 INFO L290 TraceCheckUtils]: 216: Hoare triple {4935#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {4235#false} is VALID [2022-04-14 16:16:58,484 INFO L290 TraceCheckUtils]: 215: Hoare triple {4939#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4935#(< |main_#t~post6| 100)} is VALID [2022-04-14 16:16:58,484 INFO L290 TraceCheckUtils]: 214: Hoare triple {4939#(< ~counter~0 100)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4939#(< ~counter~0 100)} is VALID [2022-04-14 16:16:58,485 INFO L290 TraceCheckUtils]: 213: Hoare triple {4939#(< ~counter~0 100)} assume !!(0 != ~r~0); {4939#(< ~counter~0 100)} is VALID [2022-04-14 16:16:58,485 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {4234#true} {4939#(< ~counter~0 100)} #63#return; {4939#(< ~counter~0 100)} is VALID [2022-04-14 16:16:58,485 INFO L290 TraceCheckUtils]: 211: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,485 INFO L290 TraceCheckUtils]: 210: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,486 INFO L290 TraceCheckUtils]: 209: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,486 INFO L272 TraceCheckUtils]: 208: Hoare triple {4939#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,486 INFO L290 TraceCheckUtils]: 207: Hoare triple {4939#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {4939#(< ~counter~0 100)} is VALID [2022-04-14 16:16:58,487 INFO L290 TraceCheckUtils]: 206: Hoare triple {4967#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4939#(< ~counter~0 100)} is VALID [2022-04-14 16:16:58,487 INFO L290 TraceCheckUtils]: 205: Hoare triple {4967#(< ~counter~0 99)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4967#(< ~counter~0 99)} is VALID [2022-04-14 16:16:58,487 INFO L290 TraceCheckUtils]: 204: Hoare triple {4967#(< ~counter~0 99)} assume !!(0 != ~r~0); {4967#(< ~counter~0 99)} is VALID [2022-04-14 16:16:58,488 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {4234#true} {4967#(< ~counter~0 99)} #63#return; {4967#(< ~counter~0 99)} is VALID [2022-04-14 16:16:58,488 INFO L290 TraceCheckUtils]: 202: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,488 INFO L290 TraceCheckUtils]: 201: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,488 INFO L290 TraceCheckUtils]: 200: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,488 INFO L272 TraceCheckUtils]: 199: Hoare triple {4967#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,489 INFO L290 TraceCheckUtils]: 198: Hoare triple {4967#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {4967#(< ~counter~0 99)} is VALID [2022-04-14 16:16:58,489 INFO L290 TraceCheckUtils]: 197: Hoare triple {4995#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4967#(< ~counter~0 99)} is VALID [2022-04-14 16:16:58,490 INFO L290 TraceCheckUtils]: 196: Hoare triple {4995#(< ~counter~0 98)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4995#(< ~counter~0 98)} is VALID [2022-04-14 16:16:58,490 INFO L290 TraceCheckUtils]: 195: Hoare triple {4995#(< ~counter~0 98)} assume !!(0 != ~r~0); {4995#(< ~counter~0 98)} is VALID [2022-04-14 16:16:58,491 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {4234#true} {4995#(< ~counter~0 98)} #63#return; {4995#(< ~counter~0 98)} is VALID [2022-04-14 16:16:58,491 INFO L290 TraceCheckUtils]: 193: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,491 INFO L290 TraceCheckUtils]: 192: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,491 INFO L290 TraceCheckUtils]: 191: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,491 INFO L272 TraceCheckUtils]: 190: Hoare triple {4995#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,491 INFO L290 TraceCheckUtils]: 189: Hoare triple {4995#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {4995#(< ~counter~0 98)} is VALID [2022-04-14 16:16:58,492 INFO L290 TraceCheckUtils]: 188: Hoare triple {5023#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4995#(< ~counter~0 98)} is VALID [2022-04-14 16:16:58,492 INFO L290 TraceCheckUtils]: 187: Hoare triple {5023#(< ~counter~0 97)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5023#(< ~counter~0 97)} is VALID [2022-04-14 16:16:58,493 INFO L290 TraceCheckUtils]: 186: Hoare triple {5023#(< ~counter~0 97)} assume !!(0 != ~r~0); {5023#(< ~counter~0 97)} is VALID [2022-04-14 16:16:58,493 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {4234#true} {5023#(< ~counter~0 97)} #63#return; {5023#(< ~counter~0 97)} is VALID [2022-04-14 16:16:58,493 INFO L290 TraceCheckUtils]: 184: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,493 INFO L290 TraceCheckUtils]: 183: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,494 INFO L290 TraceCheckUtils]: 182: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,494 INFO L272 TraceCheckUtils]: 181: Hoare triple {5023#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,494 INFO L290 TraceCheckUtils]: 180: Hoare triple {5023#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {5023#(< ~counter~0 97)} is VALID [2022-04-14 16:16:58,495 INFO L290 TraceCheckUtils]: 179: Hoare triple {5051#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5023#(< ~counter~0 97)} is VALID [2022-04-14 16:16:58,495 INFO L290 TraceCheckUtils]: 178: Hoare triple {5051#(< ~counter~0 96)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5051#(< ~counter~0 96)} is VALID [2022-04-14 16:16:58,495 INFO L290 TraceCheckUtils]: 177: Hoare triple {5051#(< ~counter~0 96)} assume !!(0 != ~r~0); {5051#(< ~counter~0 96)} is VALID [2022-04-14 16:16:58,496 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {4234#true} {5051#(< ~counter~0 96)} #63#return; {5051#(< ~counter~0 96)} is VALID [2022-04-14 16:16:58,496 INFO L290 TraceCheckUtils]: 175: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,496 INFO L290 TraceCheckUtils]: 174: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,496 INFO L290 TraceCheckUtils]: 173: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,496 INFO L272 TraceCheckUtils]: 172: Hoare triple {5051#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,497 INFO L290 TraceCheckUtils]: 171: Hoare triple {5051#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {5051#(< ~counter~0 96)} is VALID [2022-04-14 16:16:58,497 INFO L290 TraceCheckUtils]: 170: Hoare triple {5079#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5051#(< ~counter~0 96)} is VALID [2022-04-14 16:16:58,497 INFO L290 TraceCheckUtils]: 169: Hoare triple {5079#(< ~counter~0 95)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5079#(< ~counter~0 95)} is VALID [2022-04-14 16:16:58,498 INFO L290 TraceCheckUtils]: 168: Hoare triple {5079#(< ~counter~0 95)} assume !!(0 != ~r~0); {5079#(< ~counter~0 95)} is VALID [2022-04-14 16:16:58,498 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {4234#true} {5079#(< ~counter~0 95)} #63#return; {5079#(< ~counter~0 95)} is VALID [2022-04-14 16:16:58,499 INFO L290 TraceCheckUtils]: 166: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,499 INFO L290 TraceCheckUtils]: 165: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,499 INFO L290 TraceCheckUtils]: 164: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,499 INFO L272 TraceCheckUtils]: 163: Hoare triple {5079#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,499 INFO L290 TraceCheckUtils]: 162: Hoare triple {5079#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {5079#(< ~counter~0 95)} is VALID [2022-04-14 16:16:58,500 INFO L290 TraceCheckUtils]: 161: Hoare triple {5107#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5079#(< ~counter~0 95)} is VALID [2022-04-14 16:16:58,500 INFO L290 TraceCheckUtils]: 160: Hoare triple {5107#(< ~counter~0 94)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5107#(< ~counter~0 94)} is VALID [2022-04-14 16:16:58,500 INFO L290 TraceCheckUtils]: 159: Hoare triple {5107#(< ~counter~0 94)} assume !!(0 != ~r~0); {5107#(< ~counter~0 94)} is VALID [2022-04-14 16:16:58,501 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4234#true} {5107#(< ~counter~0 94)} #63#return; {5107#(< ~counter~0 94)} is VALID [2022-04-14 16:16:58,501 INFO L290 TraceCheckUtils]: 157: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,501 INFO L290 TraceCheckUtils]: 156: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,501 INFO L290 TraceCheckUtils]: 155: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,501 INFO L272 TraceCheckUtils]: 154: Hoare triple {5107#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,502 INFO L290 TraceCheckUtils]: 153: Hoare triple {5107#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {5107#(< ~counter~0 94)} is VALID [2022-04-14 16:16:58,502 INFO L290 TraceCheckUtils]: 152: Hoare triple {5135#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5107#(< ~counter~0 94)} is VALID [2022-04-14 16:16:58,503 INFO L290 TraceCheckUtils]: 151: Hoare triple {5135#(< ~counter~0 93)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5135#(< ~counter~0 93)} is VALID [2022-04-14 16:16:58,503 INFO L290 TraceCheckUtils]: 150: Hoare triple {5135#(< ~counter~0 93)} assume !!(0 != ~r~0); {5135#(< ~counter~0 93)} is VALID [2022-04-14 16:16:58,504 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {4234#true} {5135#(< ~counter~0 93)} #63#return; {5135#(< ~counter~0 93)} is VALID [2022-04-14 16:16:58,504 INFO L290 TraceCheckUtils]: 148: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,504 INFO L290 TraceCheckUtils]: 147: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,504 INFO L290 TraceCheckUtils]: 146: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,504 INFO L272 TraceCheckUtils]: 145: Hoare triple {5135#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,505 INFO L290 TraceCheckUtils]: 144: Hoare triple {5135#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {5135#(< ~counter~0 93)} is VALID [2022-04-14 16:16:58,505 INFO L290 TraceCheckUtils]: 143: Hoare triple {5163#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5135#(< ~counter~0 93)} is VALID [2022-04-14 16:16:58,506 INFO L290 TraceCheckUtils]: 142: Hoare triple {5163#(< ~counter~0 92)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5163#(< ~counter~0 92)} is VALID [2022-04-14 16:16:58,506 INFO L290 TraceCheckUtils]: 141: Hoare triple {5163#(< ~counter~0 92)} assume !!(0 != ~r~0); {5163#(< ~counter~0 92)} is VALID [2022-04-14 16:16:58,507 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {4234#true} {5163#(< ~counter~0 92)} #63#return; {5163#(< ~counter~0 92)} is VALID [2022-04-14 16:16:58,507 INFO L290 TraceCheckUtils]: 139: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,507 INFO L290 TraceCheckUtils]: 138: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,507 INFO L290 TraceCheckUtils]: 137: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,507 INFO L272 TraceCheckUtils]: 136: Hoare triple {5163#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,507 INFO L290 TraceCheckUtils]: 135: Hoare triple {5163#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {5163#(< ~counter~0 92)} is VALID [2022-04-14 16:16:58,508 INFO L290 TraceCheckUtils]: 134: Hoare triple {5191#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5163#(< ~counter~0 92)} is VALID [2022-04-14 16:16:58,508 INFO L290 TraceCheckUtils]: 133: Hoare triple {5191#(< ~counter~0 91)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5191#(< ~counter~0 91)} is VALID [2022-04-14 16:16:58,508 INFO L290 TraceCheckUtils]: 132: Hoare triple {5191#(< ~counter~0 91)} assume !!(0 != ~r~0); {5191#(< ~counter~0 91)} is VALID [2022-04-14 16:16:58,509 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {4234#true} {5191#(< ~counter~0 91)} #63#return; {5191#(< ~counter~0 91)} is VALID [2022-04-14 16:16:58,509 INFO L290 TraceCheckUtils]: 130: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,509 INFO L290 TraceCheckUtils]: 129: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,509 INFO L290 TraceCheckUtils]: 128: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,509 INFO L272 TraceCheckUtils]: 127: Hoare triple {5191#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,510 INFO L290 TraceCheckUtils]: 126: Hoare triple {5191#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {5191#(< ~counter~0 91)} is VALID [2022-04-14 16:16:58,510 INFO L290 TraceCheckUtils]: 125: Hoare triple {5219#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5191#(< ~counter~0 91)} is VALID [2022-04-14 16:16:58,511 INFO L290 TraceCheckUtils]: 124: Hoare triple {5219#(< ~counter~0 90)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5219#(< ~counter~0 90)} is VALID [2022-04-14 16:16:58,511 INFO L290 TraceCheckUtils]: 123: Hoare triple {5219#(< ~counter~0 90)} assume !!(0 != ~r~0); {5219#(< ~counter~0 90)} is VALID [2022-04-14 16:16:58,512 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {4234#true} {5219#(< ~counter~0 90)} #63#return; {5219#(< ~counter~0 90)} is VALID [2022-04-14 16:16:58,512 INFO L290 TraceCheckUtils]: 121: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,512 INFO L290 TraceCheckUtils]: 120: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,512 INFO L290 TraceCheckUtils]: 119: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,512 INFO L272 TraceCheckUtils]: 118: Hoare triple {5219#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,512 INFO L290 TraceCheckUtils]: 117: Hoare triple {5219#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {5219#(< ~counter~0 90)} is VALID [2022-04-14 16:16:58,513 INFO L290 TraceCheckUtils]: 116: Hoare triple {5247#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5219#(< ~counter~0 90)} is VALID [2022-04-14 16:16:58,513 INFO L290 TraceCheckUtils]: 115: Hoare triple {5247#(< ~counter~0 89)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5247#(< ~counter~0 89)} is VALID [2022-04-14 16:16:58,514 INFO L290 TraceCheckUtils]: 114: Hoare triple {5247#(< ~counter~0 89)} assume !!(0 != ~r~0); {5247#(< ~counter~0 89)} is VALID [2022-04-14 16:16:58,514 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {4234#true} {5247#(< ~counter~0 89)} #63#return; {5247#(< ~counter~0 89)} is VALID [2022-04-14 16:16:58,514 INFO L290 TraceCheckUtils]: 112: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,514 INFO L290 TraceCheckUtils]: 111: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,515 INFO L290 TraceCheckUtils]: 110: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,515 INFO L272 TraceCheckUtils]: 109: Hoare triple {5247#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,515 INFO L290 TraceCheckUtils]: 108: Hoare triple {5247#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {5247#(< ~counter~0 89)} is VALID [2022-04-14 16:16:58,516 INFO L290 TraceCheckUtils]: 107: Hoare triple {5275#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5247#(< ~counter~0 89)} is VALID [2022-04-14 16:16:58,516 INFO L290 TraceCheckUtils]: 106: Hoare triple {5275#(< ~counter~0 88)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5275#(< ~counter~0 88)} is VALID [2022-04-14 16:16:58,516 INFO L290 TraceCheckUtils]: 105: Hoare triple {5275#(< ~counter~0 88)} assume !!(0 != ~r~0); {5275#(< ~counter~0 88)} is VALID [2022-04-14 16:16:58,517 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {4234#true} {5275#(< ~counter~0 88)} #63#return; {5275#(< ~counter~0 88)} is VALID [2022-04-14 16:16:58,517 INFO L290 TraceCheckUtils]: 103: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,517 INFO L290 TraceCheckUtils]: 102: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,517 INFO L290 TraceCheckUtils]: 101: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,517 INFO L272 TraceCheckUtils]: 100: Hoare triple {5275#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,518 INFO L290 TraceCheckUtils]: 99: Hoare triple {5275#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {5275#(< ~counter~0 88)} is VALID [2022-04-14 16:16:58,518 INFO L290 TraceCheckUtils]: 98: Hoare triple {5303#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5275#(< ~counter~0 88)} is VALID [2022-04-14 16:16:58,518 INFO L290 TraceCheckUtils]: 97: Hoare triple {5303#(< ~counter~0 87)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5303#(< ~counter~0 87)} is VALID [2022-04-14 16:16:58,519 INFO L290 TraceCheckUtils]: 96: Hoare triple {5303#(< ~counter~0 87)} assume !!(0 != ~r~0); {5303#(< ~counter~0 87)} is VALID [2022-04-14 16:16:58,519 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {4234#true} {5303#(< ~counter~0 87)} #63#return; {5303#(< ~counter~0 87)} is VALID [2022-04-14 16:16:58,520 INFO L290 TraceCheckUtils]: 94: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,520 INFO L290 TraceCheckUtils]: 93: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,520 INFO L290 TraceCheckUtils]: 92: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,520 INFO L272 TraceCheckUtils]: 91: Hoare triple {5303#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,520 INFO L290 TraceCheckUtils]: 90: Hoare triple {5303#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {5303#(< ~counter~0 87)} is VALID [2022-04-14 16:16:58,521 INFO L290 TraceCheckUtils]: 89: Hoare triple {5331#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5303#(< ~counter~0 87)} is VALID [2022-04-14 16:16:58,521 INFO L290 TraceCheckUtils]: 88: Hoare triple {5331#(< ~counter~0 86)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5331#(< ~counter~0 86)} is VALID [2022-04-14 16:16:58,522 INFO L290 TraceCheckUtils]: 87: Hoare triple {5331#(< ~counter~0 86)} assume !!(0 != ~r~0); {5331#(< ~counter~0 86)} is VALID [2022-04-14 16:16:58,522 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4234#true} {5331#(< ~counter~0 86)} #63#return; {5331#(< ~counter~0 86)} is VALID [2022-04-14 16:16:58,523 INFO L290 TraceCheckUtils]: 85: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,523 INFO L290 TraceCheckUtils]: 84: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,523 INFO L290 TraceCheckUtils]: 83: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,523 INFO L272 TraceCheckUtils]: 82: Hoare triple {5331#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,523 INFO L290 TraceCheckUtils]: 81: Hoare triple {5331#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {5331#(< ~counter~0 86)} is VALID [2022-04-14 16:16:58,524 INFO L290 TraceCheckUtils]: 80: Hoare triple {5359#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5331#(< ~counter~0 86)} is VALID [2022-04-14 16:16:58,524 INFO L290 TraceCheckUtils]: 79: Hoare triple {5359#(< ~counter~0 85)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5359#(< ~counter~0 85)} is VALID [2022-04-14 16:16:58,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {5359#(< ~counter~0 85)} assume !!(0 != ~r~0); {5359#(< ~counter~0 85)} is VALID [2022-04-14 16:16:58,525 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4234#true} {5359#(< ~counter~0 85)} #63#return; {5359#(< ~counter~0 85)} is VALID [2022-04-14 16:16:58,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,526 INFO L290 TraceCheckUtils]: 75: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,526 INFO L290 TraceCheckUtils]: 74: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,526 INFO L272 TraceCheckUtils]: 73: Hoare triple {5359#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,526 INFO L290 TraceCheckUtils]: 72: Hoare triple {5359#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {5359#(< ~counter~0 85)} is VALID [2022-04-14 16:16:58,527 INFO L290 TraceCheckUtils]: 71: Hoare triple {5387#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5359#(< ~counter~0 85)} is VALID [2022-04-14 16:16:58,527 INFO L290 TraceCheckUtils]: 70: Hoare triple {5387#(< ~counter~0 84)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5387#(< ~counter~0 84)} is VALID [2022-04-14 16:16:58,527 INFO L290 TraceCheckUtils]: 69: Hoare triple {5387#(< ~counter~0 84)} assume !!(0 != ~r~0); {5387#(< ~counter~0 84)} is VALID [2022-04-14 16:16:58,528 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4234#true} {5387#(< ~counter~0 84)} #63#return; {5387#(< ~counter~0 84)} is VALID [2022-04-14 16:16:58,528 INFO L290 TraceCheckUtils]: 67: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,528 INFO L290 TraceCheckUtils]: 66: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,529 INFO L272 TraceCheckUtils]: 64: Hoare triple {5387#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,529 INFO L290 TraceCheckUtils]: 63: Hoare triple {5387#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {5387#(< ~counter~0 84)} is VALID [2022-04-14 16:16:58,530 INFO L290 TraceCheckUtils]: 62: Hoare triple {5415#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5387#(< ~counter~0 84)} is VALID [2022-04-14 16:16:58,530 INFO L290 TraceCheckUtils]: 61: Hoare triple {5415#(< ~counter~0 83)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5415#(< ~counter~0 83)} is VALID [2022-04-14 16:16:58,530 INFO L290 TraceCheckUtils]: 60: Hoare triple {5415#(< ~counter~0 83)} assume !!(0 != ~r~0); {5415#(< ~counter~0 83)} is VALID [2022-04-14 16:16:58,531 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4234#true} {5415#(< ~counter~0 83)} #63#return; {5415#(< ~counter~0 83)} is VALID [2022-04-14 16:16:58,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,531 INFO L290 TraceCheckUtils]: 57: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,532 INFO L272 TraceCheckUtils]: 55: Hoare triple {5415#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,532 INFO L290 TraceCheckUtils]: 54: Hoare triple {5415#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {5415#(< ~counter~0 83)} is VALID [2022-04-14 16:16:58,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {5443#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5415#(< ~counter~0 83)} is VALID [2022-04-14 16:16:58,533 INFO L290 TraceCheckUtils]: 52: Hoare triple {5443#(< ~counter~0 82)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5443#(< ~counter~0 82)} is VALID [2022-04-14 16:16:58,533 INFO L290 TraceCheckUtils]: 51: Hoare triple {5443#(< ~counter~0 82)} assume !!(0 != ~r~0); {5443#(< ~counter~0 82)} is VALID [2022-04-14 16:16:58,534 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4234#true} {5443#(< ~counter~0 82)} #63#return; {5443#(< ~counter~0 82)} is VALID [2022-04-14 16:16:58,534 INFO L290 TraceCheckUtils]: 49: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,534 INFO L290 TraceCheckUtils]: 48: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,534 INFO L290 TraceCheckUtils]: 47: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,534 INFO L272 TraceCheckUtils]: 46: Hoare triple {5443#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {5443#(< ~counter~0 82)} assume !!(#t~post6 < 100);havoc #t~post6; {5443#(< ~counter~0 82)} is VALID [2022-04-14 16:16:58,535 INFO L290 TraceCheckUtils]: 44: Hoare triple {5471#(< ~counter~0 81)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5443#(< ~counter~0 82)} is VALID [2022-04-14 16:16:58,536 INFO L290 TraceCheckUtils]: 43: Hoare triple {5471#(< ~counter~0 81)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5471#(< ~counter~0 81)} is VALID [2022-04-14 16:16:58,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {5471#(< ~counter~0 81)} assume !!(0 != ~r~0); {5471#(< ~counter~0 81)} is VALID [2022-04-14 16:16:58,537 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4234#true} {5471#(< ~counter~0 81)} #63#return; {5471#(< ~counter~0 81)} is VALID [2022-04-14 16:16:58,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,537 INFO L272 TraceCheckUtils]: 37: Hoare triple {5471#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {5471#(< ~counter~0 81)} assume !!(#t~post6 < 100);havoc #t~post6; {5471#(< ~counter~0 81)} is VALID [2022-04-14 16:16:58,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {5499#(< ~counter~0 80)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5471#(< ~counter~0 81)} is VALID [2022-04-14 16:16:58,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {5499#(< ~counter~0 80)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5499#(< ~counter~0 80)} is VALID [2022-04-14 16:16:58,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {5499#(< ~counter~0 80)} assume !!(0 != ~r~0); {5499#(< ~counter~0 80)} is VALID [2022-04-14 16:16:58,539 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4234#true} {5499#(< ~counter~0 80)} #63#return; {5499#(< ~counter~0 80)} is VALID [2022-04-14 16:16:58,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,540 INFO L272 TraceCheckUtils]: 28: Hoare triple {5499#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {5499#(< ~counter~0 80)} assume !!(#t~post6 < 100);havoc #t~post6; {5499#(< ~counter~0 80)} is VALID [2022-04-14 16:16:58,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {5527#(< ~counter~0 79)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5499#(< ~counter~0 80)} is VALID [2022-04-14 16:16:58,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {5527#(< ~counter~0 79)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5527#(< ~counter~0 79)} is VALID [2022-04-14 16:16:58,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {5527#(< ~counter~0 79)} assume !!(0 != ~r~0); {5527#(< ~counter~0 79)} is VALID [2022-04-14 16:16:58,542 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4234#true} {5527#(< ~counter~0 79)} #63#return; {5527#(< ~counter~0 79)} is VALID [2022-04-14 16:16:58,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,542 INFO L272 TraceCheckUtils]: 19: Hoare triple {5527#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {5527#(< ~counter~0 79)} assume !!(#t~post6 < 100);havoc #t~post6; {5527#(< ~counter~0 79)} is VALID [2022-04-14 16:16:58,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {5555#(< ~counter~0 78)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5527#(< ~counter~0 79)} is VALID [2022-04-14 16:16:58,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {5555#(< ~counter~0 78)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5555#(< ~counter~0 78)} is VALID [2022-04-14 16:16:58,544 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4234#true} {5555#(< ~counter~0 78)} #61#return; {5555#(< ~counter~0 78)} is VALID [2022-04-14 16:16:58,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,544 INFO L272 TraceCheckUtils]: 11: Hoare triple {5555#(< ~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)); {4234#true} is VALID [2022-04-14 16:16:58,545 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4234#true} {5555#(< ~counter~0 78)} #59#return; {5555#(< ~counter~0 78)} is VALID [2022-04-14 16:16:58,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-14 16:16:58,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-14 16:16:58,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-14 16:16:58,545 INFO L272 TraceCheckUtils]: 6: Hoare triple {5555#(< ~counter~0 78)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4234#true} is VALID [2022-04-14 16:16:58,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {5555#(< ~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; {5555#(< ~counter~0 78)} is VALID [2022-04-14 16:16:58,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {5555#(< ~counter~0 78)} call #t~ret7 := main(); {5555#(< ~counter~0 78)} is VALID [2022-04-14 16:16:58,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5555#(< ~counter~0 78)} {4234#true} #67#return; {5555#(< ~counter~0 78)} is VALID [2022-04-14 16:16:58,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {5555#(< ~counter~0 78)} assume true; {5555#(< ~counter~0 78)} is VALID [2022-04-14 16:16:58,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {4234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5555#(< ~counter~0 78)} is VALID [2022-04-14 16:16:58,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {4234#true} call ULTIMATE.init(); {4234#true} is VALID [2022-04-14 16:16:58,549 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-14 16:16:58,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:58,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709248379] [2022-04-14 16:16:58,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:58,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628807265] [2022-04-14 16:16:58,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628807265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:16:58,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:16:58,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-14 16:16:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267952363] [2022-04-14 16:16:58,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:16:58,554 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-14 16:16:58,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:58,558 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-14 16:16:58,845 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-14 16:16:58,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-14 16:16:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:58,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-14 16:16:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-14 16:16:58,848 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-14 16:17:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:01,581 INFO L93 Difference]: Finished difference Result 439 states and 509 transitions. [2022-04-14 16:17:01,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-14 16:17:01,582 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-14 16:17:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:17:01,583 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-14 16:17:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 508 transitions. [2022-04-14 16:17:01,608 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-14 16:17:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 508 transitions. [2022-04-14 16:17:01,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 508 transitions. [2022-04-14 16:17:02,070 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-14 16:17:02,084 INFO L225 Difference]: With dead ends: 439 [2022-04-14 16:17:02,085 INFO L226 Difference]: Without dead ends: 434 [2022-04-14 16:17:02,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-04-14 16:17:02,087 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 724 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-14 16:17:02,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [724 Valid, 448 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-14 16:17:02,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-04-14 16:17:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-04-14 16:17:02,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:17:02,242 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-14 16:17:02,247 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-14 16:17:02,248 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-14 16:17:02,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:02,265 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-04-14 16:17:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-14 16:17:02,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:02,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:02,269 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-14 16:17:02,270 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-14 16:17:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:02,285 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-04-14 16:17:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-14 16:17:02,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:02,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:02,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:17:02,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:17:02,288 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-14 16:17:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2022-04-14 16:17:02,316 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 221 [2022-04-14 16:17:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:17:02,316 INFO L478 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2022-04-14 16:17:02,317 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-14 16:17:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-14 16:17:02,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-04-14 16:17:02,328 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:17:02,329 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-14 16:17:02,355 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-14 16:17:02,553 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-14 16:17:02,553 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:17:02,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:17:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1876588118, now seen corresponding path program 5 times [2022-04-14 16:17:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:17:02,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663447375] [2022-04-14 16:17:02,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:17:02,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:17:02,599 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:17:02,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6279786] [2022-04-14 16:17:02,599 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-14 16:17:02,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:17:02,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:17:02,600 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-14 16:17:02,623 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-14 16:17:04,818 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-04-14 16:17:04,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:17:04,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-14 16:17:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:17:04,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:17:07,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {7738#true} call ULTIMATE.init(); {7738#true} is VALID [2022-04-14 16:17:07,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {7738#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {7746#(<= ~counter~0 0)} assume true; {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7746#(<= ~counter~0 0)} {7738#true} #67#return; {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {7746#(<= ~counter~0 0)} call #t~ret7 := main(); {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {7746#(<= ~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; {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,851 INFO L272 TraceCheckUtils]: 6: Hoare triple {7746#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {7746#(<= ~counter~0 0)} ~cond := #in~cond; {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {7746#(<= ~counter~0 0)} assume !(0 == ~cond); {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {7746#(<= ~counter~0 0)} assume true; {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,853 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7746#(<= ~counter~0 0)} {7746#(<= ~counter~0 0)} #59#return; {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,853 INFO L272 TraceCheckUtils]: 11: Hoare triple {7746#(<= ~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)); {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {7746#(<= ~counter~0 0)} ~cond := #in~cond; {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {7746#(<= ~counter~0 0)} assume !(0 == ~cond); {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {7746#(<= ~counter~0 0)} assume true; {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,854 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7746#(<= ~counter~0 0)} {7746#(<= ~counter~0 0)} #61#return; {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {7746#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7746#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {7746#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7795#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {7795#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {7795#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,856 INFO L272 TraceCheckUtils]: 19: Hoare triple {7795#(<= ~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)); {7795#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {7795#(<= ~counter~0 1)} ~cond := #in~cond; {7795#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {7795#(<= ~counter~0 1)} assume !(0 == ~cond); {7795#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {7795#(<= ~counter~0 1)} assume true; {7795#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,857 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7795#(<= ~counter~0 1)} {7795#(<= ~counter~0 1)} #63#return; {7795#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {7795#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7795#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {7795#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7795#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {7795#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7823#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:07,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {7823#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {7823#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:07,860 INFO L272 TraceCheckUtils]: 28: Hoare triple {7823#(<= ~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)); {7823#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:07,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {7823#(<= ~counter~0 2)} ~cond := #in~cond; {7823#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:07,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {7823#(<= ~counter~0 2)} assume !(0 == ~cond); {7823#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:07,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {7823#(<= ~counter~0 2)} assume true; {7823#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:07,861 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7823#(<= ~counter~0 2)} {7823#(<= ~counter~0 2)} #63#return; {7823#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:07,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {7823#(<= ~counter~0 2)} assume !!(0 != ~r~0); {7823#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:07,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {7823#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7823#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:07,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {7823#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7851#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:07,863 INFO L290 TraceCheckUtils]: 36: Hoare triple {7851#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {7851#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:07,863 INFO L272 TraceCheckUtils]: 37: Hoare triple {7851#(<= ~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)); {7851#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:07,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {7851#(<= ~counter~0 3)} ~cond := #in~cond; {7851#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:07,864 INFO L290 TraceCheckUtils]: 39: Hoare triple {7851#(<= ~counter~0 3)} assume !(0 == ~cond); {7851#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:07,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {7851#(<= ~counter~0 3)} assume true; {7851#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:07,865 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7851#(<= ~counter~0 3)} {7851#(<= ~counter~0 3)} #63#return; {7851#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:07,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {7851#(<= ~counter~0 3)} assume !!(0 != ~r~0); {7851#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:07,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {7851#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7851#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:07,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {7851#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7879#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:07,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {7879#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {7879#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:07,868 INFO L272 TraceCheckUtils]: 46: Hoare triple {7879#(<= ~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)); {7879#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:07,868 INFO L290 TraceCheckUtils]: 47: Hoare triple {7879#(<= ~counter~0 4)} ~cond := #in~cond; {7879#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:07,868 INFO L290 TraceCheckUtils]: 48: Hoare triple {7879#(<= ~counter~0 4)} assume !(0 == ~cond); {7879#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:07,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {7879#(<= ~counter~0 4)} assume true; {7879#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:07,869 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7879#(<= ~counter~0 4)} {7879#(<= ~counter~0 4)} #63#return; {7879#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:07,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {7879#(<= ~counter~0 4)} assume !!(0 != ~r~0); {7879#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:07,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {7879#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7879#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:07,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {7879#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7907#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:07,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {7907#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {7907#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:07,871 INFO L272 TraceCheckUtils]: 55: Hoare triple {7907#(<= ~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)); {7907#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:07,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {7907#(<= ~counter~0 5)} ~cond := #in~cond; {7907#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:07,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {7907#(<= ~counter~0 5)} assume !(0 == ~cond); {7907#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:07,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {7907#(<= ~counter~0 5)} assume true; {7907#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:07,872 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7907#(<= ~counter~0 5)} {7907#(<= ~counter~0 5)} #63#return; {7907#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:07,872 INFO L290 TraceCheckUtils]: 60: Hoare triple {7907#(<= ~counter~0 5)} assume !!(0 != ~r~0); {7907#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:07,873 INFO L290 TraceCheckUtils]: 61: Hoare triple {7907#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7907#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:07,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {7907#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7935#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:07,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {7935#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {7935#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:07,874 INFO L272 TraceCheckUtils]: 64: Hoare triple {7935#(<= ~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)); {7935#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:07,874 INFO L290 TraceCheckUtils]: 65: Hoare triple {7935#(<= ~counter~0 6)} ~cond := #in~cond; {7935#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:07,875 INFO L290 TraceCheckUtils]: 66: Hoare triple {7935#(<= ~counter~0 6)} assume !(0 == ~cond); {7935#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:07,875 INFO L290 TraceCheckUtils]: 67: Hoare triple {7935#(<= ~counter~0 6)} assume true; {7935#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:07,875 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7935#(<= ~counter~0 6)} {7935#(<= ~counter~0 6)} #63#return; {7935#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:07,876 INFO L290 TraceCheckUtils]: 69: Hoare triple {7935#(<= ~counter~0 6)} assume !!(0 != ~r~0); {7935#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:07,876 INFO L290 TraceCheckUtils]: 70: Hoare triple {7935#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7935#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:07,876 INFO L290 TraceCheckUtils]: 71: Hoare triple {7935#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7963#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:07,877 INFO L290 TraceCheckUtils]: 72: Hoare triple {7963#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {7963#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:07,877 INFO L272 TraceCheckUtils]: 73: Hoare triple {7963#(<= ~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)); {7963#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:07,877 INFO L290 TraceCheckUtils]: 74: Hoare triple {7963#(<= ~counter~0 7)} ~cond := #in~cond; {7963#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:07,878 INFO L290 TraceCheckUtils]: 75: Hoare triple {7963#(<= ~counter~0 7)} assume !(0 == ~cond); {7963#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:07,878 INFO L290 TraceCheckUtils]: 76: Hoare triple {7963#(<= ~counter~0 7)} assume true; {7963#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:07,878 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7963#(<= ~counter~0 7)} {7963#(<= ~counter~0 7)} #63#return; {7963#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:07,879 INFO L290 TraceCheckUtils]: 78: Hoare triple {7963#(<= ~counter~0 7)} assume !!(0 != ~r~0); {7963#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:07,879 INFO L290 TraceCheckUtils]: 79: Hoare triple {7963#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7963#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:07,879 INFO L290 TraceCheckUtils]: 80: Hoare triple {7963#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7991#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:07,880 INFO L290 TraceCheckUtils]: 81: Hoare triple {7991#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {7991#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:07,880 INFO L272 TraceCheckUtils]: 82: Hoare triple {7991#(<= ~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)); {7991#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:07,881 INFO L290 TraceCheckUtils]: 83: Hoare triple {7991#(<= ~counter~0 8)} ~cond := #in~cond; {7991#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:07,881 INFO L290 TraceCheckUtils]: 84: Hoare triple {7991#(<= ~counter~0 8)} assume !(0 == ~cond); {7991#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:07,881 INFO L290 TraceCheckUtils]: 85: Hoare triple {7991#(<= ~counter~0 8)} assume true; {7991#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:07,882 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7991#(<= ~counter~0 8)} {7991#(<= ~counter~0 8)} #63#return; {7991#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:07,882 INFO L290 TraceCheckUtils]: 87: Hoare triple {7991#(<= ~counter~0 8)} assume !!(0 != ~r~0); {7991#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:07,882 INFO L290 TraceCheckUtils]: 88: Hoare triple {7991#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7991#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:07,883 INFO L290 TraceCheckUtils]: 89: Hoare triple {7991#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8019#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:07,883 INFO L290 TraceCheckUtils]: 90: Hoare triple {8019#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {8019#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:07,883 INFO L272 TraceCheckUtils]: 91: Hoare triple {8019#(<= ~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)); {8019#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:07,884 INFO L290 TraceCheckUtils]: 92: Hoare triple {8019#(<= ~counter~0 9)} ~cond := #in~cond; {8019#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:07,884 INFO L290 TraceCheckUtils]: 93: Hoare triple {8019#(<= ~counter~0 9)} assume !(0 == ~cond); {8019#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:07,884 INFO L290 TraceCheckUtils]: 94: Hoare triple {8019#(<= ~counter~0 9)} assume true; {8019#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:07,885 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8019#(<= ~counter~0 9)} {8019#(<= ~counter~0 9)} #63#return; {8019#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:07,885 INFO L290 TraceCheckUtils]: 96: Hoare triple {8019#(<= ~counter~0 9)} assume !!(0 != ~r~0); {8019#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:07,885 INFO L290 TraceCheckUtils]: 97: Hoare triple {8019#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8019#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:07,886 INFO L290 TraceCheckUtils]: 98: Hoare triple {8019#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8047#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:07,886 INFO L290 TraceCheckUtils]: 99: Hoare triple {8047#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {8047#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:07,887 INFO L272 TraceCheckUtils]: 100: Hoare triple {8047#(<= ~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)); {8047#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:07,887 INFO L290 TraceCheckUtils]: 101: Hoare triple {8047#(<= ~counter~0 10)} ~cond := #in~cond; {8047#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:07,887 INFO L290 TraceCheckUtils]: 102: Hoare triple {8047#(<= ~counter~0 10)} assume !(0 == ~cond); {8047#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:07,887 INFO L290 TraceCheckUtils]: 103: Hoare triple {8047#(<= ~counter~0 10)} assume true; {8047#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:07,888 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {8047#(<= ~counter~0 10)} {8047#(<= ~counter~0 10)} #63#return; {8047#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:07,888 INFO L290 TraceCheckUtils]: 105: Hoare triple {8047#(<= ~counter~0 10)} assume !!(0 != ~r~0); {8047#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:07,888 INFO L290 TraceCheckUtils]: 106: Hoare triple {8047#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8047#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:07,889 INFO L290 TraceCheckUtils]: 107: Hoare triple {8047#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:07,889 INFO L290 TraceCheckUtils]: 108: Hoare triple {8075#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {8075#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:07,890 INFO L272 TraceCheckUtils]: 109: Hoare triple {8075#(<= ~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)); {8075#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:07,890 INFO L290 TraceCheckUtils]: 110: Hoare triple {8075#(<= ~counter~0 11)} ~cond := #in~cond; {8075#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:07,890 INFO L290 TraceCheckUtils]: 111: Hoare triple {8075#(<= ~counter~0 11)} assume !(0 == ~cond); {8075#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:07,890 INFO L290 TraceCheckUtils]: 112: Hoare triple {8075#(<= ~counter~0 11)} assume true; {8075#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:07,891 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {8075#(<= ~counter~0 11)} {8075#(<= ~counter~0 11)} #63#return; {8075#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:07,891 INFO L290 TraceCheckUtils]: 114: Hoare triple {8075#(<= ~counter~0 11)} assume !!(0 != ~r~0); {8075#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:07,892 INFO L290 TraceCheckUtils]: 115: Hoare triple {8075#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8075#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:07,892 INFO L290 TraceCheckUtils]: 116: Hoare triple {8075#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8103#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:07,892 INFO L290 TraceCheckUtils]: 117: Hoare triple {8103#(<= ~counter~0 12)} assume !!(#t~post6 < 100);havoc #t~post6; {8103#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:07,893 INFO L272 TraceCheckUtils]: 118: Hoare triple {8103#(<= ~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)); {8103#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:07,893 INFO L290 TraceCheckUtils]: 119: Hoare triple {8103#(<= ~counter~0 12)} ~cond := #in~cond; {8103#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:07,893 INFO L290 TraceCheckUtils]: 120: Hoare triple {8103#(<= ~counter~0 12)} assume !(0 == ~cond); {8103#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:07,894 INFO L290 TraceCheckUtils]: 121: Hoare triple {8103#(<= ~counter~0 12)} assume true; {8103#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:07,894 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {8103#(<= ~counter~0 12)} {8103#(<= ~counter~0 12)} #63#return; {8103#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:07,894 INFO L290 TraceCheckUtils]: 123: Hoare triple {8103#(<= ~counter~0 12)} assume !!(0 != ~r~0); {8103#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:07,895 INFO L290 TraceCheckUtils]: 124: Hoare triple {8103#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8103#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:07,895 INFO L290 TraceCheckUtils]: 125: Hoare triple {8103#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8131#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:07,895 INFO L290 TraceCheckUtils]: 126: Hoare triple {8131#(<= ~counter~0 13)} assume !!(#t~post6 < 100);havoc #t~post6; {8131#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:07,896 INFO L272 TraceCheckUtils]: 127: Hoare triple {8131#(<= ~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)); {8131#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:07,896 INFO L290 TraceCheckUtils]: 128: Hoare triple {8131#(<= ~counter~0 13)} ~cond := #in~cond; {8131#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:07,896 INFO L290 TraceCheckUtils]: 129: Hoare triple {8131#(<= ~counter~0 13)} assume !(0 == ~cond); {8131#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:07,897 INFO L290 TraceCheckUtils]: 130: Hoare triple {8131#(<= ~counter~0 13)} assume true; {8131#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:07,897 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {8131#(<= ~counter~0 13)} {8131#(<= ~counter~0 13)} #63#return; {8131#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:07,897 INFO L290 TraceCheckUtils]: 132: Hoare triple {8131#(<= ~counter~0 13)} assume !!(0 != ~r~0); {8131#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:07,898 INFO L290 TraceCheckUtils]: 133: Hoare triple {8131#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8131#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:07,898 INFO L290 TraceCheckUtils]: 134: Hoare triple {8131#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8159#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:07,898 INFO L290 TraceCheckUtils]: 135: Hoare triple {8159#(<= ~counter~0 14)} assume !!(#t~post6 < 100);havoc #t~post6; {8159#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:07,899 INFO L272 TraceCheckUtils]: 136: Hoare triple {8159#(<= ~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)); {8159#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:07,899 INFO L290 TraceCheckUtils]: 137: Hoare triple {8159#(<= ~counter~0 14)} ~cond := #in~cond; {8159#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:07,900 INFO L290 TraceCheckUtils]: 138: Hoare triple {8159#(<= ~counter~0 14)} assume !(0 == ~cond); {8159#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:07,900 INFO L290 TraceCheckUtils]: 139: Hoare triple {8159#(<= ~counter~0 14)} assume true; {8159#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:07,900 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {8159#(<= ~counter~0 14)} {8159#(<= ~counter~0 14)} #63#return; {8159#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:07,901 INFO L290 TraceCheckUtils]: 141: Hoare triple {8159#(<= ~counter~0 14)} assume !!(0 != ~r~0); {8159#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:07,901 INFO L290 TraceCheckUtils]: 142: Hoare triple {8159#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8159#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:07,901 INFO L290 TraceCheckUtils]: 143: Hoare triple {8159#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8187#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:07,902 INFO L290 TraceCheckUtils]: 144: Hoare triple {8187#(<= ~counter~0 15)} assume !!(#t~post6 < 100);havoc #t~post6; {8187#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:07,902 INFO L272 TraceCheckUtils]: 145: Hoare triple {8187#(<= ~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)); {8187#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:07,902 INFO L290 TraceCheckUtils]: 146: Hoare triple {8187#(<= ~counter~0 15)} ~cond := #in~cond; {8187#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:07,903 INFO L290 TraceCheckUtils]: 147: Hoare triple {8187#(<= ~counter~0 15)} assume !(0 == ~cond); {8187#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:07,903 INFO L290 TraceCheckUtils]: 148: Hoare triple {8187#(<= ~counter~0 15)} assume true; {8187#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:07,903 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {8187#(<= ~counter~0 15)} {8187#(<= ~counter~0 15)} #63#return; {8187#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:07,904 INFO L290 TraceCheckUtils]: 150: Hoare triple {8187#(<= ~counter~0 15)} assume !!(0 != ~r~0); {8187#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:07,904 INFO L290 TraceCheckUtils]: 151: Hoare triple {8187#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8187#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:07,904 INFO L290 TraceCheckUtils]: 152: Hoare triple {8187#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8215#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:07,905 INFO L290 TraceCheckUtils]: 153: Hoare triple {8215#(<= ~counter~0 16)} assume !!(#t~post6 < 100);havoc #t~post6; {8215#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:07,905 INFO L272 TraceCheckUtils]: 154: Hoare triple {8215#(<= ~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)); {8215#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:07,905 INFO L290 TraceCheckUtils]: 155: Hoare triple {8215#(<= ~counter~0 16)} ~cond := #in~cond; {8215#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:07,906 INFO L290 TraceCheckUtils]: 156: Hoare triple {8215#(<= ~counter~0 16)} assume !(0 == ~cond); {8215#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:07,906 INFO L290 TraceCheckUtils]: 157: Hoare triple {8215#(<= ~counter~0 16)} assume true; {8215#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:07,907 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {8215#(<= ~counter~0 16)} {8215#(<= ~counter~0 16)} #63#return; {8215#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:07,907 INFO L290 TraceCheckUtils]: 159: Hoare triple {8215#(<= ~counter~0 16)} assume !!(0 != ~r~0); {8215#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:07,907 INFO L290 TraceCheckUtils]: 160: Hoare triple {8215#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8215#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:07,908 INFO L290 TraceCheckUtils]: 161: Hoare triple {8215#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8243#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:07,908 INFO L290 TraceCheckUtils]: 162: Hoare triple {8243#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {8243#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:07,908 INFO L272 TraceCheckUtils]: 163: Hoare triple {8243#(<= ~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)); {8243#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:07,909 INFO L290 TraceCheckUtils]: 164: Hoare triple {8243#(<= ~counter~0 17)} ~cond := #in~cond; {8243#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:07,909 INFO L290 TraceCheckUtils]: 165: Hoare triple {8243#(<= ~counter~0 17)} assume !(0 == ~cond); {8243#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:07,909 INFO L290 TraceCheckUtils]: 166: Hoare triple {8243#(<= ~counter~0 17)} assume true; {8243#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:07,910 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {8243#(<= ~counter~0 17)} {8243#(<= ~counter~0 17)} #63#return; {8243#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:07,910 INFO L290 TraceCheckUtils]: 168: Hoare triple {8243#(<= ~counter~0 17)} assume !!(0 != ~r~0); {8243#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:07,910 INFO L290 TraceCheckUtils]: 169: Hoare triple {8243#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8243#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:07,911 INFO L290 TraceCheckUtils]: 170: Hoare triple {8243#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8271#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:07,911 INFO L290 TraceCheckUtils]: 171: Hoare triple {8271#(<= ~counter~0 18)} assume !!(#t~post6 < 100);havoc #t~post6; {8271#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:07,912 INFO L272 TraceCheckUtils]: 172: Hoare triple {8271#(<= ~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)); {8271#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:07,912 INFO L290 TraceCheckUtils]: 173: Hoare triple {8271#(<= ~counter~0 18)} ~cond := #in~cond; {8271#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:07,912 INFO L290 TraceCheckUtils]: 174: Hoare triple {8271#(<= ~counter~0 18)} assume !(0 == ~cond); {8271#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:07,912 INFO L290 TraceCheckUtils]: 175: Hoare triple {8271#(<= ~counter~0 18)} assume true; {8271#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:07,913 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {8271#(<= ~counter~0 18)} {8271#(<= ~counter~0 18)} #63#return; {8271#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:07,913 INFO L290 TraceCheckUtils]: 177: Hoare triple {8271#(<= ~counter~0 18)} assume !!(0 != ~r~0); {8271#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:07,913 INFO L290 TraceCheckUtils]: 178: Hoare triple {8271#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8271#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:07,914 INFO L290 TraceCheckUtils]: 179: Hoare triple {8271#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8299#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:07,914 INFO L290 TraceCheckUtils]: 180: Hoare triple {8299#(<= ~counter~0 19)} assume !!(#t~post6 < 100);havoc #t~post6; {8299#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:07,915 INFO L272 TraceCheckUtils]: 181: Hoare triple {8299#(<= ~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)); {8299#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:07,915 INFO L290 TraceCheckUtils]: 182: Hoare triple {8299#(<= ~counter~0 19)} ~cond := #in~cond; {8299#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:07,915 INFO L290 TraceCheckUtils]: 183: Hoare triple {8299#(<= ~counter~0 19)} assume !(0 == ~cond); {8299#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:07,917 INFO L290 TraceCheckUtils]: 184: Hoare triple {8299#(<= ~counter~0 19)} assume true; {8299#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:07,917 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {8299#(<= ~counter~0 19)} {8299#(<= ~counter~0 19)} #63#return; {8299#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:07,921 INFO L290 TraceCheckUtils]: 186: Hoare triple {8299#(<= ~counter~0 19)} assume !!(0 != ~r~0); {8299#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:07,922 INFO L290 TraceCheckUtils]: 187: Hoare triple {8299#(<= ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8299#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:07,922 INFO L290 TraceCheckUtils]: 188: Hoare triple {8299#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8327#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:07,922 INFO L290 TraceCheckUtils]: 189: Hoare triple {8327#(<= ~counter~0 20)} assume !!(#t~post6 < 100);havoc #t~post6; {8327#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:07,923 INFO L272 TraceCheckUtils]: 190: Hoare triple {8327#(<= ~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)); {8327#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:07,923 INFO L290 TraceCheckUtils]: 191: Hoare triple {8327#(<= ~counter~0 20)} ~cond := #in~cond; {8327#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:07,923 INFO L290 TraceCheckUtils]: 192: Hoare triple {8327#(<= ~counter~0 20)} assume !(0 == ~cond); {8327#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:07,924 INFO L290 TraceCheckUtils]: 193: Hoare triple {8327#(<= ~counter~0 20)} assume true; {8327#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:07,924 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {8327#(<= ~counter~0 20)} {8327#(<= ~counter~0 20)} #63#return; {8327#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:07,924 INFO L290 TraceCheckUtils]: 195: Hoare triple {8327#(<= ~counter~0 20)} assume !!(0 != ~r~0); {8327#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:07,925 INFO L290 TraceCheckUtils]: 196: Hoare triple {8327#(<= ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8327#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:07,925 INFO L290 TraceCheckUtils]: 197: Hoare triple {8327#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8355#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:07,926 INFO L290 TraceCheckUtils]: 198: Hoare triple {8355#(<= ~counter~0 21)} assume !!(#t~post6 < 100);havoc #t~post6; {8355#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:07,926 INFO L272 TraceCheckUtils]: 199: Hoare triple {8355#(<= ~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)); {8355#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:07,927 INFO L290 TraceCheckUtils]: 200: Hoare triple {8355#(<= ~counter~0 21)} ~cond := #in~cond; {8355#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:07,927 INFO L290 TraceCheckUtils]: 201: Hoare triple {8355#(<= ~counter~0 21)} assume !(0 == ~cond); {8355#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:07,928 INFO L290 TraceCheckUtils]: 202: Hoare triple {8355#(<= ~counter~0 21)} assume true; {8355#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:07,928 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {8355#(<= ~counter~0 21)} {8355#(<= ~counter~0 21)} #63#return; {8355#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:07,928 INFO L290 TraceCheckUtils]: 204: Hoare triple {8355#(<= ~counter~0 21)} assume !!(0 != ~r~0); {8355#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:07,929 INFO L290 TraceCheckUtils]: 205: Hoare triple {8355#(<= ~counter~0 21)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8355#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:07,929 INFO L290 TraceCheckUtils]: 206: Hoare triple {8355#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8383#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:07,929 INFO L290 TraceCheckUtils]: 207: Hoare triple {8383#(<= ~counter~0 22)} assume !!(#t~post6 < 100);havoc #t~post6; {8383#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:07,930 INFO L272 TraceCheckUtils]: 208: Hoare triple {8383#(<= ~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)); {8383#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:07,930 INFO L290 TraceCheckUtils]: 209: Hoare triple {8383#(<= ~counter~0 22)} ~cond := #in~cond; {8383#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:07,931 INFO L290 TraceCheckUtils]: 210: Hoare triple {8383#(<= ~counter~0 22)} assume !(0 == ~cond); {8383#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:07,931 INFO L290 TraceCheckUtils]: 211: Hoare triple {8383#(<= ~counter~0 22)} assume true; {8383#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:07,931 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {8383#(<= ~counter~0 22)} {8383#(<= ~counter~0 22)} #63#return; {8383#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:07,932 INFO L290 TraceCheckUtils]: 213: Hoare triple {8383#(<= ~counter~0 22)} assume !!(0 != ~r~0); {8383#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:07,932 INFO L290 TraceCheckUtils]: 214: Hoare triple {8383#(<= ~counter~0 22)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8383#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:07,932 INFO L290 TraceCheckUtils]: 215: Hoare triple {8383#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8411#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:07,933 INFO L290 TraceCheckUtils]: 216: Hoare triple {8411#(<= ~counter~0 23)} assume !!(#t~post6 < 100);havoc #t~post6; {8411#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:07,933 INFO L272 TraceCheckUtils]: 217: Hoare triple {8411#(<= ~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)); {8411#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:07,933 INFO L290 TraceCheckUtils]: 218: Hoare triple {8411#(<= ~counter~0 23)} ~cond := #in~cond; {8411#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:07,934 INFO L290 TraceCheckUtils]: 219: Hoare triple {8411#(<= ~counter~0 23)} assume !(0 == ~cond); {8411#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:07,934 INFO L290 TraceCheckUtils]: 220: Hoare triple {8411#(<= ~counter~0 23)} assume true; {8411#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:07,935 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {8411#(<= ~counter~0 23)} {8411#(<= ~counter~0 23)} #63#return; {8411#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:07,935 INFO L290 TraceCheckUtils]: 222: Hoare triple {8411#(<= ~counter~0 23)} assume !!(0 != ~r~0); {8411#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:07,935 INFO L290 TraceCheckUtils]: 223: Hoare triple {8411#(<= ~counter~0 23)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8411#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:07,936 INFO L290 TraceCheckUtils]: 224: Hoare triple {8411#(<= ~counter~0 23)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8439#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:07,936 INFO L290 TraceCheckUtils]: 225: Hoare triple {8439#(<= ~counter~0 24)} assume !!(#t~post6 < 100);havoc #t~post6; {8439#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:07,936 INFO L272 TraceCheckUtils]: 226: Hoare triple {8439#(<= ~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)); {8439#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:07,937 INFO L290 TraceCheckUtils]: 227: Hoare triple {8439#(<= ~counter~0 24)} ~cond := #in~cond; {8439#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:07,937 INFO L290 TraceCheckUtils]: 228: Hoare triple {8439#(<= ~counter~0 24)} assume !(0 == ~cond); {8439#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:07,937 INFO L290 TraceCheckUtils]: 229: Hoare triple {8439#(<= ~counter~0 24)} assume true; {8439#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:07,938 INFO L284 TraceCheckUtils]: 230: Hoare quadruple {8439#(<= ~counter~0 24)} {8439#(<= ~counter~0 24)} #63#return; {8439#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:07,938 INFO L290 TraceCheckUtils]: 231: Hoare triple {8439#(<= ~counter~0 24)} assume !!(0 != ~r~0); {8439#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:07,938 INFO L290 TraceCheckUtils]: 232: Hoare triple {8439#(<= ~counter~0 24)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8439#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:07,939 INFO L290 TraceCheckUtils]: 233: Hoare triple {8439#(<= ~counter~0 24)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8467#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:07,939 INFO L290 TraceCheckUtils]: 234: Hoare triple {8467#(<= ~counter~0 25)} assume !!(#t~post6 < 100);havoc #t~post6; {8467#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:07,940 INFO L272 TraceCheckUtils]: 235: Hoare triple {8467#(<= ~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)); {8467#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:07,940 INFO L290 TraceCheckUtils]: 236: Hoare triple {8467#(<= ~counter~0 25)} ~cond := #in~cond; {8467#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:07,940 INFO L290 TraceCheckUtils]: 237: Hoare triple {8467#(<= ~counter~0 25)} assume !(0 == ~cond); {8467#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:07,940 INFO L290 TraceCheckUtils]: 238: Hoare triple {8467#(<= ~counter~0 25)} assume true; {8467#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:07,941 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {8467#(<= ~counter~0 25)} {8467#(<= ~counter~0 25)} #63#return; {8467#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:07,941 INFO L290 TraceCheckUtils]: 240: Hoare triple {8467#(<= ~counter~0 25)} assume !!(0 != ~r~0); {8467#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:07,941 INFO L290 TraceCheckUtils]: 241: Hoare triple {8467#(<= ~counter~0 25)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8467#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:07,942 INFO L290 TraceCheckUtils]: 242: Hoare triple {8467#(<= ~counter~0 25)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8495#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:07,942 INFO L290 TraceCheckUtils]: 243: Hoare triple {8495#(<= ~counter~0 26)} assume !!(#t~post6 < 100);havoc #t~post6; {8495#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:07,943 INFO L272 TraceCheckUtils]: 244: Hoare triple {8495#(<= ~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)); {8495#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:07,943 INFO L290 TraceCheckUtils]: 245: Hoare triple {8495#(<= ~counter~0 26)} ~cond := #in~cond; {8495#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:07,943 INFO L290 TraceCheckUtils]: 246: Hoare triple {8495#(<= ~counter~0 26)} assume !(0 == ~cond); {8495#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:07,944 INFO L290 TraceCheckUtils]: 247: Hoare triple {8495#(<= ~counter~0 26)} assume true; {8495#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:07,944 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {8495#(<= ~counter~0 26)} {8495#(<= ~counter~0 26)} #63#return; {8495#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:07,944 INFO L290 TraceCheckUtils]: 249: Hoare triple {8495#(<= ~counter~0 26)} assume !!(0 != ~r~0); {8495#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:07,945 INFO L290 TraceCheckUtils]: 250: Hoare triple {8495#(<= ~counter~0 26)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8495#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:07,945 INFO L290 TraceCheckUtils]: 251: Hoare triple {8495#(<= ~counter~0 26)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8523#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:07,945 INFO L290 TraceCheckUtils]: 252: Hoare triple {8523#(<= ~counter~0 27)} assume !!(#t~post6 < 100);havoc #t~post6; {8523#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:07,946 INFO L272 TraceCheckUtils]: 253: Hoare triple {8523#(<= ~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)); {8523#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:07,946 INFO L290 TraceCheckUtils]: 254: Hoare triple {8523#(<= ~counter~0 27)} ~cond := #in~cond; {8523#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:07,946 INFO L290 TraceCheckUtils]: 255: Hoare triple {8523#(<= ~counter~0 27)} assume !(0 == ~cond); {8523#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:07,947 INFO L290 TraceCheckUtils]: 256: Hoare triple {8523#(<= ~counter~0 27)} assume true; {8523#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:07,947 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {8523#(<= ~counter~0 27)} {8523#(<= ~counter~0 27)} #63#return; {8523#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:07,948 INFO L290 TraceCheckUtils]: 258: Hoare triple {8523#(<= ~counter~0 27)} assume !!(0 != ~r~0); {8523#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:07,948 INFO L290 TraceCheckUtils]: 259: Hoare triple {8523#(<= ~counter~0 27)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8523#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:07,948 INFO L290 TraceCheckUtils]: 260: Hoare triple {8523#(<= ~counter~0 27)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8551#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:07,949 INFO L290 TraceCheckUtils]: 261: Hoare triple {8551#(<= ~counter~0 28)} assume !!(#t~post6 < 100);havoc #t~post6; {8551#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:07,949 INFO L272 TraceCheckUtils]: 262: Hoare triple {8551#(<= ~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)); {8551#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:07,949 INFO L290 TraceCheckUtils]: 263: Hoare triple {8551#(<= ~counter~0 28)} ~cond := #in~cond; {8551#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:07,950 INFO L290 TraceCheckUtils]: 264: Hoare triple {8551#(<= ~counter~0 28)} assume !(0 == ~cond); {8551#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:07,950 INFO L290 TraceCheckUtils]: 265: Hoare triple {8551#(<= ~counter~0 28)} assume true; {8551#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:07,950 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {8551#(<= ~counter~0 28)} {8551#(<= ~counter~0 28)} #63#return; {8551#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:07,951 INFO L290 TraceCheckUtils]: 267: Hoare triple {8551#(<= ~counter~0 28)} assume !!(0 != ~r~0); {8551#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:07,951 INFO L290 TraceCheckUtils]: 268: Hoare triple {8551#(<= ~counter~0 28)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8551#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:07,951 INFO L290 TraceCheckUtils]: 269: Hoare triple {8551#(<= ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8579#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:07,952 INFO L290 TraceCheckUtils]: 270: Hoare triple {8579#(<= ~counter~0 29)} assume !!(#t~post6 < 100);havoc #t~post6; {8579#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:07,952 INFO L272 TraceCheckUtils]: 271: Hoare triple {8579#(<= ~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)); {8579#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:07,953 INFO L290 TraceCheckUtils]: 272: Hoare triple {8579#(<= ~counter~0 29)} ~cond := #in~cond; {8579#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:07,953 INFO L290 TraceCheckUtils]: 273: Hoare triple {8579#(<= ~counter~0 29)} assume !(0 == ~cond); {8579#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:07,953 INFO L290 TraceCheckUtils]: 274: Hoare triple {8579#(<= ~counter~0 29)} assume true; {8579#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:07,954 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {8579#(<= ~counter~0 29)} {8579#(<= ~counter~0 29)} #63#return; {8579#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:07,954 INFO L290 TraceCheckUtils]: 276: Hoare triple {8579#(<= ~counter~0 29)} assume !!(0 != ~r~0); {8579#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:07,954 INFO L290 TraceCheckUtils]: 277: Hoare triple {8579#(<= ~counter~0 29)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8579#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:07,955 INFO L290 TraceCheckUtils]: 278: Hoare triple {8579#(<= ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8607#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:07,955 INFO L290 TraceCheckUtils]: 279: Hoare triple {8607#(<= ~counter~0 30)} assume !!(#t~post6 < 100);havoc #t~post6; {8607#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:07,955 INFO L272 TraceCheckUtils]: 280: Hoare triple {8607#(<= ~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)); {8607#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:07,956 INFO L290 TraceCheckUtils]: 281: Hoare triple {8607#(<= ~counter~0 30)} ~cond := #in~cond; {8607#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:07,956 INFO L290 TraceCheckUtils]: 282: Hoare triple {8607#(<= ~counter~0 30)} assume !(0 == ~cond); {8607#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:07,956 INFO L290 TraceCheckUtils]: 283: Hoare triple {8607#(<= ~counter~0 30)} assume true; {8607#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:07,957 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {8607#(<= ~counter~0 30)} {8607#(<= ~counter~0 30)} #63#return; {8607#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:07,957 INFO L290 TraceCheckUtils]: 285: Hoare triple {8607#(<= ~counter~0 30)} assume !!(0 != ~r~0); {8607#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:07,957 INFO L290 TraceCheckUtils]: 286: Hoare triple {8607#(<= ~counter~0 30)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8607#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:07,958 INFO L290 TraceCheckUtils]: 287: Hoare triple {8607#(<= ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8635#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:07,958 INFO L290 TraceCheckUtils]: 288: Hoare triple {8635#(<= ~counter~0 31)} assume !!(#t~post6 < 100);havoc #t~post6; {8635#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:07,959 INFO L272 TraceCheckUtils]: 289: Hoare triple {8635#(<= ~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)); {8635#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:07,959 INFO L290 TraceCheckUtils]: 290: Hoare triple {8635#(<= ~counter~0 31)} ~cond := #in~cond; {8635#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:07,959 INFO L290 TraceCheckUtils]: 291: Hoare triple {8635#(<= ~counter~0 31)} assume !(0 == ~cond); {8635#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:07,959 INFO L290 TraceCheckUtils]: 292: Hoare triple {8635#(<= ~counter~0 31)} assume true; {8635#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:07,960 INFO L284 TraceCheckUtils]: 293: Hoare quadruple {8635#(<= ~counter~0 31)} {8635#(<= ~counter~0 31)} #63#return; {8635#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:07,960 INFO L290 TraceCheckUtils]: 294: Hoare triple {8635#(<= ~counter~0 31)} assume !!(0 != ~r~0); {8635#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:07,961 INFO L290 TraceCheckUtils]: 295: Hoare triple {8635#(<= ~counter~0 31)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8635#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:07,961 INFO L290 TraceCheckUtils]: 296: Hoare triple {8635#(<= ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8663#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:07,961 INFO L290 TraceCheckUtils]: 297: Hoare triple {8663#(<= ~counter~0 32)} assume !!(#t~post6 < 100);havoc #t~post6; {8663#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:07,962 INFO L272 TraceCheckUtils]: 298: Hoare triple {8663#(<= ~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)); {8663#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:07,962 INFO L290 TraceCheckUtils]: 299: Hoare triple {8663#(<= ~counter~0 32)} ~cond := #in~cond; {8663#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:07,962 INFO L290 TraceCheckUtils]: 300: Hoare triple {8663#(<= ~counter~0 32)} assume !(0 == ~cond); {8663#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:07,963 INFO L290 TraceCheckUtils]: 301: Hoare triple {8663#(<= ~counter~0 32)} assume true; {8663#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:07,963 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {8663#(<= ~counter~0 32)} {8663#(<= ~counter~0 32)} #63#return; {8663#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:07,964 INFO L290 TraceCheckUtils]: 303: Hoare triple {8663#(<= ~counter~0 32)} assume !!(0 != ~r~0); {8663#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:07,964 INFO L290 TraceCheckUtils]: 304: Hoare triple {8663#(<= ~counter~0 32)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8663#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:07,965 INFO L290 TraceCheckUtils]: 305: Hoare triple {8663#(<= ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8691#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:07,965 INFO L290 TraceCheckUtils]: 306: Hoare triple {8691#(<= ~counter~0 33)} assume !!(#t~post6 < 100);havoc #t~post6; {8691#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:07,965 INFO L272 TraceCheckUtils]: 307: Hoare triple {8691#(<= ~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)); {8691#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:07,966 INFO L290 TraceCheckUtils]: 308: Hoare triple {8691#(<= ~counter~0 33)} ~cond := #in~cond; {8691#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:07,966 INFO L290 TraceCheckUtils]: 309: Hoare triple {8691#(<= ~counter~0 33)} assume !(0 == ~cond); {8691#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:07,966 INFO L290 TraceCheckUtils]: 310: Hoare triple {8691#(<= ~counter~0 33)} assume true; {8691#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:07,967 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {8691#(<= ~counter~0 33)} {8691#(<= ~counter~0 33)} #63#return; {8691#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:07,967 INFO L290 TraceCheckUtils]: 312: Hoare triple {8691#(<= ~counter~0 33)} assume !!(0 != ~r~0); {8691#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:07,968 INFO L290 TraceCheckUtils]: 313: Hoare triple {8691#(<= ~counter~0 33)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8691#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:07,968 INFO L290 TraceCheckUtils]: 314: Hoare triple {8691#(<= ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8719#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:07,969 INFO L290 TraceCheckUtils]: 315: Hoare triple {8719#(<= ~counter~0 34)} assume !!(#t~post6 < 100);havoc #t~post6; {8719#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:07,973 INFO L272 TraceCheckUtils]: 316: Hoare triple {8719#(<= ~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)); {8719#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:07,973 INFO L290 TraceCheckUtils]: 317: Hoare triple {8719#(<= ~counter~0 34)} ~cond := #in~cond; {8719#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:07,974 INFO L290 TraceCheckUtils]: 318: Hoare triple {8719#(<= ~counter~0 34)} assume !(0 == ~cond); {8719#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:07,974 INFO L290 TraceCheckUtils]: 319: Hoare triple {8719#(<= ~counter~0 34)} assume true; {8719#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:07,974 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {8719#(<= ~counter~0 34)} {8719#(<= ~counter~0 34)} #63#return; {8719#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:07,975 INFO L290 TraceCheckUtils]: 321: Hoare triple {8719#(<= ~counter~0 34)} assume !!(0 != ~r~0); {8719#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:07,975 INFO L290 TraceCheckUtils]: 322: Hoare triple {8719#(<= ~counter~0 34)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8719#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:07,975 INFO L290 TraceCheckUtils]: 323: Hoare triple {8719#(<= ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8747#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:07,976 INFO L290 TraceCheckUtils]: 324: Hoare triple {8747#(<= ~counter~0 35)} assume !!(#t~post6 < 100);havoc #t~post6; {8747#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:07,976 INFO L272 TraceCheckUtils]: 325: Hoare triple {8747#(<= ~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)); {8747#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:07,977 INFO L290 TraceCheckUtils]: 326: Hoare triple {8747#(<= ~counter~0 35)} ~cond := #in~cond; {8747#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:07,979 INFO L290 TraceCheckUtils]: 327: Hoare triple {8747#(<= ~counter~0 35)} assume !(0 == ~cond); {8747#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:07,982 INFO L290 TraceCheckUtils]: 328: Hoare triple {8747#(<= ~counter~0 35)} assume true; {8747#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:07,982 INFO L284 TraceCheckUtils]: 329: Hoare quadruple {8747#(<= ~counter~0 35)} {8747#(<= ~counter~0 35)} #63#return; {8747#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:07,983 INFO L290 TraceCheckUtils]: 330: Hoare triple {8747#(<= ~counter~0 35)} assume !!(0 != ~r~0); {8747#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:07,983 INFO L290 TraceCheckUtils]: 331: Hoare triple {8747#(<= ~counter~0 35)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8747#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:07,983 INFO L290 TraceCheckUtils]: 332: Hoare triple {8747#(<= ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8775#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:07,984 INFO L290 TraceCheckUtils]: 333: Hoare triple {8775#(<= ~counter~0 36)} assume !!(#t~post6 < 100);havoc #t~post6; {8775#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:07,984 INFO L272 TraceCheckUtils]: 334: Hoare triple {8775#(<= ~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)); {8775#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:07,984 INFO L290 TraceCheckUtils]: 335: Hoare triple {8775#(<= ~counter~0 36)} ~cond := #in~cond; {8775#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:07,985 INFO L290 TraceCheckUtils]: 336: Hoare triple {8775#(<= ~counter~0 36)} assume !(0 == ~cond); {8775#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:07,985 INFO L290 TraceCheckUtils]: 337: Hoare triple {8775#(<= ~counter~0 36)} assume true; {8775#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:07,986 INFO L284 TraceCheckUtils]: 338: Hoare quadruple {8775#(<= ~counter~0 36)} {8775#(<= ~counter~0 36)} #63#return; {8775#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:07,986 INFO L290 TraceCheckUtils]: 339: Hoare triple {8775#(<= ~counter~0 36)} assume !!(0 != ~r~0); {8775#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:07,986 INFO L290 TraceCheckUtils]: 340: Hoare triple {8775#(<= ~counter~0 36)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8775#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:07,988 INFO L290 TraceCheckUtils]: 341: Hoare triple {8775#(<= ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8803#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:07,988 INFO L290 TraceCheckUtils]: 342: Hoare triple {8803#(<= ~counter~0 37)} assume !!(#t~post6 < 100);havoc #t~post6; {8803#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:07,989 INFO L272 TraceCheckUtils]: 343: Hoare triple {8803#(<= ~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)); {8803#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:07,989 INFO L290 TraceCheckUtils]: 344: Hoare triple {8803#(<= ~counter~0 37)} ~cond := #in~cond; {8803#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:07,989 INFO L290 TraceCheckUtils]: 345: Hoare triple {8803#(<= ~counter~0 37)} assume !(0 == ~cond); {8803#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:07,991 INFO L290 TraceCheckUtils]: 346: Hoare triple {8803#(<= ~counter~0 37)} assume true; {8803#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:07,996 INFO L284 TraceCheckUtils]: 347: Hoare quadruple {8803#(<= ~counter~0 37)} {8803#(<= ~counter~0 37)} #63#return; {8803#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:07,996 INFO L290 TraceCheckUtils]: 348: Hoare triple {8803#(<= ~counter~0 37)} assume !!(0 != ~r~0); {8803#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:07,996 INFO L290 TraceCheckUtils]: 349: Hoare triple {8803#(<= ~counter~0 37)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8803#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:07,997 INFO L290 TraceCheckUtils]: 350: Hoare triple {8803#(<= ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8831#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:07,997 INFO L290 TraceCheckUtils]: 351: Hoare triple {8831#(<= ~counter~0 38)} assume !!(#t~post6 < 100);havoc #t~post6; {8831#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:07,998 INFO L272 TraceCheckUtils]: 352: Hoare triple {8831#(<= ~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)); {8831#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:07,998 INFO L290 TraceCheckUtils]: 353: Hoare triple {8831#(<= ~counter~0 38)} ~cond := #in~cond; {8831#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:07,999 INFO L290 TraceCheckUtils]: 354: Hoare triple {8831#(<= ~counter~0 38)} assume !(0 == ~cond); {8831#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:07,999 INFO L290 TraceCheckUtils]: 355: Hoare triple {8831#(<= ~counter~0 38)} assume true; {8831#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:08,000 INFO L284 TraceCheckUtils]: 356: Hoare quadruple {8831#(<= ~counter~0 38)} {8831#(<= ~counter~0 38)} #63#return; {8831#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:08,000 INFO L290 TraceCheckUtils]: 357: Hoare triple {8831#(<= ~counter~0 38)} assume !!(0 != ~r~0); {8831#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:08,001 INFO L290 TraceCheckUtils]: 358: Hoare triple {8831#(<= ~counter~0 38)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8831#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:08,001 INFO L290 TraceCheckUtils]: 359: Hoare triple {8831#(<= ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8859#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:08,002 INFO L290 TraceCheckUtils]: 360: Hoare triple {8859#(<= ~counter~0 39)} assume !!(#t~post6 < 100);havoc #t~post6; {8859#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:08,002 INFO L272 TraceCheckUtils]: 361: Hoare triple {8859#(<= ~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)); {8859#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:08,003 INFO L290 TraceCheckUtils]: 362: Hoare triple {8859#(<= ~counter~0 39)} ~cond := #in~cond; {8859#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:08,003 INFO L290 TraceCheckUtils]: 363: Hoare triple {8859#(<= ~counter~0 39)} assume !(0 == ~cond); {8859#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:08,003 INFO L290 TraceCheckUtils]: 364: Hoare triple {8859#(<= ~counter~0 39)} assume true; {8859#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:08,004 INFO L284 TraceCheckUtils]: 365: Hoare quadruple {8859#(<= ~counter~0 39)} {8859#(<= ~counter~0 39)} #63#return; {8859#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:08,005 INFO L290 TraceCheckUtils]: 366: Hoare triple {8859#(<= ~counter~0 39)} assume !!(0 != ~r~0); {8859#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:08,005 INFO L290 TraceCheckUtils]: 367: Hoare triple {8859#(<= ~counter~0 39)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8859#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:08,005 INFO L290 TraceCheckUtils]: 368: Hoare triple {8859#(<= ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8887#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:08,006 INFO L290 TraceCheckUtils]: 369: Hoare triple {8887#(<= ~counter~0 40)} assume !!(#t~post6 < 100);havoc #t~post6; {8887#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:08,007 INFO L272 TraceCheckUtils]: 370: Hoare triple {8887#(<= ~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)); {8887#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:08,007 INFO L290 TraceCheckUtils]: 371: Hoare triple {8887#(<= ~counter~0 40)} ~cond := #in~cond; {8887#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:08,007 INFO L290 TraceCheckUtils]: 372: Hoare triple {8887#(<= ~counter~0 40)} assume !(0 == ~cond); {8887#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:08,008 INFO L290 TraceCheckUtils]: 373: Hoare triple {8887#(<= ~counter~0 40)} assume true; {8887#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:08,008 INFO L284 TraceCheckUtils]: 374: Hoare quadruple {8887#(<= ~counter~0 40)} {8887#(<= ~counter~0 40)} #63#return; {8887#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:08,009 INFO L290 TraceCheckUtils]: 375: Hoare triple {8887#(<= ~counter~0 40)} assume !!(0 != ~r~0); {8887#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:08,009 INFO L290 TraceCheckUtils]: 376: Hoare triple {8887#(<= ~counter~0 40)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8887#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:08,010 INFO L290 TraceCheckUtils]: 377: Hoare triple {8887#(<= ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8915#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:08,010 INFO L290 TraceCheckUtils]: 378: Hoare triple {8915#(<= ~counter~0 41)} assume !!(#t~post6 < 100);havoc #t~post6; {8915#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:08,011 INFO L272 TraceCheckUtils]: 379: Hoare triple {8915#(<= ~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)); {8915#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:08,020 INFO L290 TraceCheckUtils]: 380: Hoare triple {8915#(<= ~counter~0 41)} ~cond := #in~cond; {8915#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:08,021 INFO L290 TraceCheckUtils]: 381: Hoare triple {8915#(<= ~counter~0 41)} assume !(0 == ~cond); {8915#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:08,021 INFO L290 TraceCheckUtils]: 382: Hoare triple {8915#(<= ~counter~0 41)} assume true; {8915#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:08,022 INFO L284 TraceCheckUtils]: 383: Hoare quadruple {8915#(<= ~counter~0 41)} {8915#(<= ~counter~0 41)} #63#return; {8915#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:08,022 INFO L290 TraceCheckUtils]: 384: Hoare triple {8915#(<= ~counter~0 41)} assume !!(0 != ~r~0); {8915#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:08,023 INFO L290 TraceCheckUtils]: 385: Hoare triple {8915#(<= ~counter~0 41)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8915#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:08,023 INFO L290 TraceCheckUtils]: 386: Hoare triple {8915#(<= ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8943#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:08,024 INFO L290 TraceCheckUtils]: 387: Hoare triple {8943#(<= ~counter~0 42)} assume !!(#t~post6 < 100);havoc #t~post6; {8943#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:08,024 INFO L272 TraceCheckUtils]: 388: Hoare triple {8943#(<= ~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)); {8943#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:08,025 INFO L290 TraceCheckUtils]: 389: Hoare triple {8943#(<= ~counter~0 42)} ~cond := #in~cond; {8943#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:08,025 INFO L290 TraceCheckUtils]: 390: Hoare triple {8943#(<= ~counter~0 42)} assume !(0 == ~cond); {8943#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:08,025 INFO L290 TraceCheckUtils]: 391: Hoare triple {8943#(<= ~counter~0 42)} assume true; {8943#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:08,026 INFO L284 TraceCheckUtils]: 392: Hoare quadruple {8943#(<= ~counter~0 42)} {8943#(<= ~counter~0 42)} #63#return; {8943#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:08,026 INFO L290 TraceCheckUtils]: 393: Hoare triple {8943#(<= ~counter~0 42)} assume !!(0 != ~r~0); {8943#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:08,026 INFO L290 TraceCheckUtils]: 394: Hoare triple {8943#(<= ~counter~0 42)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8943#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:08,027 INFO L290 TraceCheckUtils]: 395: Hoare triple {8943#(<= ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8971#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:08,027 INFO L290 TraceCheckUtils]: 396: Hoare triple {8971#(<= ~counter~0 43)} assume !!(#t~post6 < 100);havoc #t~post6; {8971#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:08,028 INFO L272 TraceCheckUtils]: 397: Hoare triple {8971#(<= ~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)); {8971#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:08,028 INFO L290 TraceCheckUtils]: 398: Hoare triple {8971#(<= ~counter~0 43)} ~cond := #in~cond; {8971#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:08,029 INFO L290 TraceCheckUtils]: 399: Hoare triple {8971#(<= ~counter~0 43)} assume !(0 == ~cond); {8971#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:08,029 INFO L290 TraceCheckUtils]: 400: Hoare triple {8971#(<= ~counter~0 43)} assume true; {8971#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:08,029 INFO L284 TraceCheckUtils]: 401: Hoare quadruple {8971#(<= ~counter~0 43)} {8971#(<= ~counter~0 43)} #63#return; {8971#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:08,030 INFO L290 TraceCheckUtils]: 402: Hoare triple {8971#(<= ~counter~0 43)} assume !!(0 != ~r~0); {8971#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:08,030 INFO L290 TraceCheckUtils]: 403: Hoare triple {8971#(<= ~counter~0 43)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8971#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:08,031 INFO L290 TraceCheckUtils]: 404: Hoare triple {8971#(<= ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8999#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:08,031 INFO L290 TraceCheckUtils]: 405: Hoare triple {8999#(<= ~counter~0 44)} assume !!(#t~post6 < 100);havoc #t~post6; {8999#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:08,032 INFO L272 TraceCheckUtils]: 406: Hoare triple {8999#(<= ~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)); {8999#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:08,032 INFO L290 TraceCheckUtils]: 407: Hoare triple {8999#(<= ~counter~0 44)} ~cond := #in~cond; {8999#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:08,033 INFO L290 TraceCheckUtils]: 408: Hoare triple {8999#(<= ~counter~0 44)} assume !(0 == ~cond); {8999#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:08,033 INFO L290 TraceCheckUtils]: 409: Hoare triple {8999#(<= ~counter~0 44)} assume true; {8999#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:08,034 INFO L284 TraceCheckUtils]: 410: Hoare quadruple {8999#(<= ~counter~0 44)} {8999#(<= ~counter~0 44)} #63#return; {8999#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:08,034 INFO L290 TraceCheckUtils]: 411: Hoare triple {8999#(<= ~counter~0 44)} assume !!(0 != ~r~0); {8999#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:08,034 INFO L290 TraceCheckUtils]: 412: Hoare triple {8999#(<= ~counter~0 44)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8999#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:08,035 INFO L290 TraceCheckUtils]: 413: Hoare triple {8999#(<= ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9027#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:08,035 INFO L290 TraceCheckUtils]: 414: Hoare triple {9027#(<= ~counter~0 45)} assume !!(#t~post6 < 100);havoc #t~post6; {9027#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:08,036 INFO L272 TraceCheckUtils]: 415: Hoare triple {9027#(<= ~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)); {9027#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:08,036 INFO L290 TraceCheckUtils]: 416: Hoare triple {9027#(<= ~counter~0 45)} ~cond := #in~cond; {9027#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:08,037 INFO L290 TraceCheckUtils]: 417: Hoare triple {9027#(<= ~counter~0 45)} assume !(0 == ~cond); {9027#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:08,037 INFO L290 TraceCheckUtils]: 418: Hoare triple {9027#(<= ~counter~0 45)} assume true; {9027#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:08,038 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {9027#(<= ~counter~0 45)} {9027#(<= ~counter~0 45)} #63#return; {9027#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:08,038 INFO L290 TraceCheckUtils]: 420: Hoare triple {9027#(<= ~counter~0 45)} assume !!(0 != ~r~0); {9027#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:08,038 INFO L290 TraceCheckUtils]: 421: Hoare triple {9027#(<= ~counter~0 45)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9027#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:08,039 INFO L290 TraceCheckUtils]: 422: Hoare triple {9027#(<= ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9055#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:08,039 INFO L290 TraceCheckUtils]: 423: Hoare triple {9055#(<= ~counter~0 46)} assume !!(#t~post6 < 100);havoc #t~post6; {9055#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:08,040 INFO L272 TraceCheckUtils]: 424: Hoare triple {9055#(<= ~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)); {9055#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:08,040 INFO L290 TraceCheckUtils]: 425: Hoare triple {9055#(<= ~counter~0 46)} ~cond := #in~cond; {9055#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:08,041 INFO L290 TraceCheckUtils]: 426: Hoare triple {9055#(<= ~counter~0 46)} assume !(0 == ~cond); {9055#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:08,041 INFO L290 TraceCheckUtils]: 427: Hoare triple {9055#(<= ~counter~0 46)} assume true; {9055#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:08,042 INFO L284 TraceCheckUtils]: 428: Hoare quadruple {9055#(<= ~counter~0 46)} {9055#(<= ~counter~0 46)} #63#return; {9055#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:08,043 INFO L290 TraceCheckUtils]: 429: Hoare triple {9055#(<= ~counter~0 46)} assume !!(0 != ~r~0); {9055#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:08,043 INFO L290 TraceCheckUtils]: 430: Hoare triple {9055#(<= ~counter~0 46)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9055#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:08,043 INFO L290 TraceCheckUtils]: 431: Hoare triple {9055#(<= ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9083#(<= |main_#t~post6| 46)} is VALID [2022-04-14 16:17:08,044 INFO L290 TraceCheckUtils]: 432: Hoare triple {9083#(<= |main_#t~post6| 46)} assume !(#t~post6 < 100);havoc #t~post6; {7739#false} is VALID [2022-04-14 16:17:08,044 INFO L272 TraceCheckUtils]: 433: Hoare triple {7739#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7739#false} is VALID [2022-04-14 16:17:08,044 INFO L290 TraceCheckUtils]: 434: Hoare triple {7739#false} ~cond := #in~cond; {7739#false} is VALID [2022-04-14 16:17:08,044 INFO L290 TraceCheckUtils]: 435: Hoare triple {7739#false} assume 0 == ~cond; {7739#false} is VALID [2022-04-14 16:17:08,044 INFO L290 TraceCheckUtils]: 436: Hoare triple {7739#false} assume !false; {7739#false} is VALID [2022-04-14 16:17:08,049 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-14 16:17:08,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:17:12,079 INFO L290 TraceCheckUtils]: 436: Hoare triple {7739#false} assume !false; {7739#false} is VALID [2022-04-14 16:17:12,079 INFO L290 TraceCheckUtils]: 435: Hoare triple {7739#false} assume 0 == ~cond; {7739#false} is VALID [2022-04-14 16:17:12,079 INFO L290 TraceCheckUtils]: 434: Hoare triple {7739#false} ~cond := #in~cond; {7739#false} is VALID [2022-04-14 16:17:12,079 INFO L272 TraceCheckUtils]: 433: Hoare triple {7739#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7739#false} is VALID [2022-04-14 16:17:12,080 INFO L290 TraceCheckUtils]: 432: Hoare triple {9111#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {7739#false} is VALID [2022-04-14 16:17:12,080 INFO L290 TraceCheckUtils]: 431: Hoare triple {9115#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9111#(< |main_#t~post6| 100)} is VALID [2022-04-14 16:17:12,080 INFO L290 TraceCheckUtils]: 430: Hoare triple {9115#(< ~counter~0 100)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9115#(< ~counter~0 100)} is VALID [2022-04-14 16:17:12,081 INFO L290 TraceCheckUtils]: 429: Hoare triple {9115#(< ~counter~0 100)} assume !!(0 != ~r~0); {9115#(< ~counter~0 100)} is VALID [2022-04-14 16:17:12,081 INFO L284 TraceCheckUtils]: 428: Hoare quadruple {7738#true} {9115#(< ~counter~0 100)} #63#return; {9115#(< ~counter~0 100)} is VALID [2022-04-14 16:17:12,081 INFO L290 TraceCheckUtils]: 427: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,081 INFO L290 TraceCheckUtils]: 426: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,081 INFO L290 TraceCheckUtils]: 425: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,081 INFO L272 TraceCheckUtils]: 424: Hoare triple {9115#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,082 INFO L290 TraceCheckUtils]: 423: Hoare triple {9115#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {9115#(< ~counter~0 100)} is VALID [2022-04-14 16:17:12,082 INFO L290 TraceCheckUtils]: 422: Hoare triple {9143#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9115#(< ~counter~0 100)} is VALID [2022-04-14 16:17:12,082 INFO L290 TraceCheckUtils]: 421: Hoare triple {9143#(< ~counter~0 99)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9143#(< ~counter~0 99)} is VALID [2022-04-14 16:17:12,083 INFO L290 TraceCheckUtils]: 420: Hoare triple {9143#(< ~counter~0 99)} assume !!(0 != ~r~0); {9143#(< ~counter~0 99)} is VALID [2022-04-14 16:17:12,083 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {7738#true} {9143#(< ~counter~0 99)} #63#return; {9143#(< ~counter~0 99)} is VALID [2022-04-14 16:17:12,083 INFO L290 TraceCheckUtils]: 418: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,083 INFO L290 TraceCheckUtils]: 417: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,083 INFO L290 TraceCheckUtils]: 416: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,084 INFO L272 TraceCheckUtils]: 415: Hoare triple {9143#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,084 INFO L290 TraceCheckUtils]: 414: Hoare triple {9143#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {9143#(< ~counter~0 99)} is VALID [2022-04-14 16:17:12,084 INFO L290 TraceCheckUtils]: 413: Hoare triple {9171#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9143#(< ~counter~0 99)} is VALID [2022-04-14 16:17:12,085 INFO L290 TraceCheckUtils]: 412: Hoare triple {9171#(< ~counter~0 98)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9171#(< ~counter~0 98)} is VALID [2022-04-14 16:17:12,085 INFO L290 TraceCheckUtils]: 411: Hoare triple {9171#(< ~counter~0 98)} assume !!(0 != ~r~0); {9171#(< ~counter~0 98)} is VALID [2022-04-14 16:17:12,085 INFO L284 TraceCheckUtils]: 410: Hoare quadruple {7738#true} {9171#(< ~counter~0 98)} #63#return; {9171#(< ~counter~0 98)} is VALID [2022-04-14 16:17:12,085 INFO L290 TraceCheckUtils]: 409: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,085 INFO L290 TraceCheckUtils]: 408: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,086 INFO L290 TraceCheckUtils]: 407: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,086 INFO L272 TraceCheckUtils]: 406: Hoare triple {9171#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,086 INFO L290 TraceCheckUtils]: 405: Hoare triple {9171#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {9171#(< ~counter~0 98)} is VALID [2022-04-14 16:17:12,086 INFO L290 TraceCheckUtils]: 404: Hoare triple {9199#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9171#(< ~counter~0 98)} is VALID [2022-04-14 16:17:12,087 INFO L290 TraceCheckUtils]: 403: Hoare triple {9199#(< ~counter~0 97)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9199#(< ~counter~0 97)} is VALID [2022-04-14 16:17:12,087 INFO L290 TraceCheckUtils]: 402: Hoare triple {9199#(< ~counter~0 97)} assume !!(0 != ~r~0); {9199#(< ~counter~0 97)} is VALID [2022-04-14 16:17:12,087 INFO L284 TraceCheckUtils]: 401: Hoare quadruple {7738#true} {9199#(< ~counter~0 97)} #63#return; {9199#(< ~counter~0 97)} is VALID [2022-04-14 16:17:12,087 INFO L290 TraceCheckUtils]: 400: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,087 INFO L290 TraceCheckUtils]: 399: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,088 INFO L290 TraceCheckUtils]: 398: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,088 INFO L272 TraceCheckUtils]: 397: Hoare triple {9199#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,088 INFO L290 TraceCheckUtils]: 396: Hoare triple {9199#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {9199#(< ~counter~0 97)} is VALID [2022-04-14 16:17:12,088 INFO L290 TraceCheckUtils]: 395: Hoare triple {9227#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9199#(< ~counter~0 97)} is VALID [2022-04-14 16:17:12,089 INFO L290 TraceCheckUtils]: 394: Hoare triple {9227#(< ~counter~0 96)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9227#(< ~counter~0 96)} is VALID [2022-04-14 16:17:12,089 INFO L290 TraceCheckUtils]: 393: Hoare triple {9227#(< ~counter~0 96)} assume !!(0 != ~r~0); {9227#(< ~counter~0 96)} is VALID [2022-04-14 16:17:12,089 INFO L284 TraceCheckUtils]: 392: Hoare quadruple {7738#true} {9227#(< ~counter~0 96)} #63#return; {9227#(< ~counter~0 96)} is VALID [2022-04-14 16:17:12,089 INFO L290 TraceCheckUtils]: 391: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,089 INFO L290 TraceCheckUtils]: 390: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,090 INFO L290 TraceCheckUtils]: 389: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,090 INFO L272 TraceCheckUtils]: 388: Hoare triple {9227#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,090 INFO L290 TraceCheckUtils]: 387: Hoare triple {9227#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {9227#(< ~counter~0 96)} is VALID [2022-04-14 16:17:12,090 INFO L290 TraceCheckUtils]: 386: Hoare triple {9255#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9227#(< ~counter~0 96)} is VALID [2022-04-14 16:17:12,091 INFO L290 TraceCheckUtils]: 385: Hoare triple {9255#(< ~counter~0 95)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9255#(< ~counter~0 95)} is VALID [2022-04-14 16:17:12,091 INFO L290 TraceCheckUtils]: 384: Hoare triple {9255#(< ~counter~0 95)} assume !!(0 != ~r~0); {9255#(< ~counter~0 95)} is VALID [2022-04-14 16:17:12,091 INFO L284 TraceCheckUtils]: 383: Hoare quadruple {7738#true} {9255#(< ~counter~0 95)} #63#return; {9255#(< ~counter~0 95)} is VALID [2022-04-14 16:17:12,091 INFO L290 TraceCheckUtils]: 382: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,092 INFO L290 TraceCheckUtils]: 381: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,092 INFO L290 TraceCheckUtils]: 380: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,092 INFO L272 TraceCheckUtils]: 379: Hoare triple {9255#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,095 INFO L290 TraceCheckUtils]: 378: Hoare triple {9255#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {9255#(< ~counter~0 95)} is VALID [2022-04-14 16:17:12,096 INFO L290 TraceCheckUtils]: 377: Hoare triple {9283#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9255#(< ~counter~0 95)} is VALID [2022-04-14 16:17:12,096 INFO L290 TraceCheckUtils]: 376: Hoare triple {9283#(< ~counter~0 94)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9283#(< ~counter~0 94)} is VALID [2022-04-14 16:17:12,097 INFO L290 TraceCheckUtils]: 375: Hoare triple {9283#(< ~counter~0 94)} assume !!(0 != ~r~0); {9283#(< ~counter~0 94)} is VALID [2022-04-14 16:17:12,097 INFO L284 TraceCheckUtils]: 374: Hoare quadruple {7738#true} {9283#(< ~counter~0 94)} #63#return; {9283#(< ~counter~0 94)} is VALID [2022-04-14 16:17:12,097 INFO L290 TraceCheckUtils]: 373: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,098 INFO L290 TraceCheckUtils]: 372: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,098 INFO L290 TraceCheckUtils]: 371: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,098 INFO L272 TraceCheckUtils]: 370: Hoare triple {9283#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,098 INFO L290 TraceCheckUtils]: 369: Hoare triple {9283#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {9283#(< ~counter~0 94)} is VALID [2022-04-14 16:17:12,099 INFO L290 TraceCheckUtils]: 368: Hoare triple {9311#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9283#(< ~counter~0 94)} is VALID [2022-04-14 16:17:12,099 INFO L290 TraceCheckUtils]: 367: Hoare triple {9311#(< ~counter~0 93)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9311#(< ~counter~0 93)} is VALID [2022-04-14 16:17:12,099 INFO L290 TraceCheckUtils]: 366: Hoare triple {9311#(< ~counter~0 93)} assume !!(0 != ~r~0); {9311#(< ~counter~0 93)} is VALID [2022-04-14 16:17:12,100 INFO L284 TraceCheckUtils]: 365: Hoare quadruple {7738#true} {9311#(< ~counter~0 93)} #63#return; {9311#(< ~counter~0 93)} is VALID [2022-04-14 16:17:12,100 INFO L290 TraceCheckUtils]: 364: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,100 INFO L290 TraceCheckUtils]: 363: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,101 INFO L290 TraceCheckUtils]: 362: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,101 INFO L272 TraceCheckUtils]: 361: Hoare triple {9311#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,101 INFO L290 TraceCheckUtils]: 360: Hoare triple {9311#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {9311#(< ~counter~0 93)} is VALID [2022-04-14 16:17:12,102 INFO L290 TraceCheckUtils]: 359: Hoare triple {9339#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9311#(< ~counter~0 93)} is VALID [2022-04-14 16:17:12,102 INFO L290 TraceCheckUtils]: 358: Hoare triple {9339#(< ~counter~0 92)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9339#(< ~counter~0 92)} is VALID [2022-04-14 16:17:12,102 INFO L290 TraceCheckUtils]: 357: Hoare triple {9339#(< ~counter~0 92)} assume !!(0 != ~r~0); {9339#(< ~counter~0 92)} is VALID [2022-04-14 16:17:12,103 INFO L284 TraceCheckUtils]: 356: Hoare quadruple {7738#true} {9339#(< ~counter~0 92)} #63#return; {9339#(< ~counter~0 92)} is VALID [2022-04-14 16:17:12,103 INFO L290 TraceCheckUtils]: 355: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,103 INFO L290 TraceCheckUtils]: 354: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,103 INFO L290 TraceCheckUtils]: 353: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,104 INFO L272 TraceCheckUtils]: 352: Hoare triple {9339#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,104 INFO L290 TraceCheckUtils]: 351: Hoare triple {9339#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {9339#(< ~counter~0 92)} is VALID [2022-04-14 16:17:12,105 INFO L290 TraceCheckUtils]: 350: Hoare triple {9367#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9339#(< ~counter~0 92)} is VALID [2022-04-14 16:17:12,105 INFO L290 TraceCheckUtils]: 349: Hoare triple {9367#(< ~counter~0 91)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9367#(< ~counter~0 91)} is VALID [2022-04-14 16:17:12,105 INFO L290 TraceCheckUtils]: 348: Hoare triple {9367#(< ~counter~0 91)} assume !!(0 != ~r~0); {9367#(< ~counter~0 91)} is VALID [2022-04-14 16:17:12,106 INFO L284 TraceCheckUtils]: 347: Hoare quadruple {7738#true} {9367#(< ~counter~0 91)} #63#return; {9367#(< ~counter~0 91)} is VALID [2022-04-14 16:17:12,106 INFO L290 TraceCheckUtils]: 346: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,106 INFO L290 TraceCheckUtils]: 345: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,106 INFO L290 TraceCheckUtils]: 344: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,106 INFO L272 TraceCheckUtils]: 343: Hoare triple {9367#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,107 INFO L290 TraceCheckUtils]: 342: Hoare triple {9367#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {9367#(< ~counter~0 91)} is VALID [2022-04-14 16:17:12,107 INFO L290 TraceCheckUtils]: 341: Hoare triple {9395#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#(< ~counter~0 91)} is VALID [2022-04-14 16:17:12,108 INFO L290 TraceCheckUtils]: 340: Hoare triple {9395#(< ~counter~0 90)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9395#(< ~counter~0 90)} is VALID [2022-04-14 16:17:12,108 INFO L290 TraceCheckUtils]: 339: Hoare triple {9395#(< ~counter~0 90)} assume !!(0 != ~r~0); {9395#(< ~counter~0 90)} is VALID [2022-04-14 16:17:12,109 INFO L284 TraceCheckUtils]: 338: Hoare quadruple {7738#true} {9395#(< ~counter~0 90)} #63#return; {9395#(< ~counter~0 90)} is VALID [2022-04-14 16:17:12,109 INFO L290 TraceCheckUtils]: 337: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,109 INFO L290 TraceCheckUtils]: 336: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,109 INFO L290 TraceCheckUtils]: 335: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,109 INFO L272 TraceCheckUtils]: 334: Hoare triple {9395#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,110 INFO L290 TraceCheckUtils]: 333: Hoare triple {9395#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {9395#(< ~counter~0 90)} is VALID [2022-04-14 16:17:12,110 INFO L290 TraceCheckUtils]: 332: Hoare triple {9423#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9395#(< ~counter~0 90)} is VALID [2022-04-14 16:17:12,111 INFO L290 TraceCheckUtils]: 331: Hoare triple {9423#(< ~counter~0 89)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9423#(< ~counter~0 89)} is VALID [2022-04-14 16:17:12,111 INFO L290 TraceCheckUtils]: 330: Hoare triple {9423#(< ~counter~0 89)} assume !!(0 != ~r~0); {9423#(< ~counter~0 89)} is VALID [2022-04-14 16:17:12,112 INFO L284 TraceCheckUtils]: 329: Hoare quadruple {7738#true} {9423#(< ~counter~0 89)} #63#return; {9423#(< ~counter~0 89)} is VALID [2022-04-14 16:17:12,112 INFO L290 TraceCheckUtils]: 328: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,112 INFO L290 TraceCheckUtils]: 327: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,112 INFO L290 TraceCheckUtils]: 326: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,112 INFO L272 TraceCheckUtils]: 325: Hoare triple {9423#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,112 INFO L290 TraceCheckUtils]: 324: Hoare triple {9423#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {9423#(< ~counter~0 89)} is VALID [2022-04-14 16:17:12,113 INFO L290 TraceCheckUtils]: 323: Hoare triple {9451#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9423#(< ~counter~0 89)} is VALID [2022-04-14 16:17:12,113 INFO L290 TraceCheckUtils]: 322: Hoare triple {9451#(< ~counter~0 88)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9451#(< ~counter~0 88)} is VALID [2022-04-14 16:17:12,113 INFO L290 TraceCheckUtils]: 321: Hoare triple {9451#(< ~counter~0 88)} assume !!(0 != ~r~0); {9451#(< ~counter~0 88)} is VALID [2022-04-14 16:17:12,114 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {7738#true} {9451#(< ~counter~0 88)} #63#return; {9451#(< ~counter~0 88)} is VALID [2022-04-14 16:17:12,114 INFO L290 TraceCheckUtils]: 319: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,114 INFO L290 TraceCheckUtils]: 318: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,114 INFO L290 TraceCheckUtils]: 317: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,114 INFO L272 TraceCheckUtils]: 316: Hoare triple {9451#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,115 INFO L290 TraceCheckUtils]: 315: Hoare triple {9451#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {9451#(< ~counter~0 88)} is VALID [2022-04-14 16:17:12,115 INFO L290 TraceCheckUtils]: 314: Hoare triple {9479#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9451#(< ~counter~0 88)} is VALID [2022-04-14 16:17:12,116 INFO L290 TraceCheckUtils]: 313: Hoare triple {9479#(< ~counter~0 87)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9479#(< ~counter~0 87)} is VALID [2022-04-14 16:17:12,116 INFO L290 TraceCheckUtils]: 312: Hoare triple {9479#(< ~counter~0 87)} assume !!(0 != ~r~0); {9479#(< ~counter~0 87)} is VALID [2022-04-14 16:17:12,117 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {7738#true} {9479#(< ~counter~0 87)} #63#return; {9479#(< ~counter~0 87)} is VALID [2022-04-14 16:17:12,117 INFO L290 TraceCheckUtils]: 310: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,117 INFO L290 TraceCheckUtils]: 309: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,117 INFO L290 TraceCheckUtils]: 308: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,117 INFO L272 TraceCheckUtils]: 307: Hoare triple {9479#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,117 INFO L290 TraceCheckUtils]: 306: Hoare triple {9479#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {9479#(< ~counter~0 87)} is VALID [2022-04-14 16:17:12,118 INFO L290 TraceCheckUtils]: 305: Hoare triple {9507#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9479#(< ~counter~0 87)} is VALID [2022-04-14 16:17:12,118 INFO L290 TraceCheckUtils]: 304: Hoare triple {9507#(< ~counter~0 86)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9507#(< ~counter~0 86)} is VALID [2022-04-14 16:17:12,119 INFO L290 TraceCheckUtils]: 303: Hoare triple {9507#(< ~counter~0 86)} assume !!(0 != ~r~0); {9507#(< ~counter~0 86)} is VALID [2022-04-14 16:17:12,119 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {7738#true} {9507#(< ~counter~0 86)} #63#return; {9507#(< ~counter~0 86)} is VALID [2022-04-14 16:17:12,119 INFO L290 TraceCheckUtils]: 301: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,119 INFO L290 TraceCheckUtils]: 300: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,120 INFO L290 TraceCheckUtils]: 299: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,120 INFO L272 TraceCheckUtils]: 298: Hoare triple {9507#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,120 INFO L290 TraceCheckUtils]: 297: Hoare triple {9507#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {9507#(< ~counter~0 86)} is VALID [2022-04-14 16:17:12,120 INFO L290 TraceCheckUtils]: 296: Hoare triple {9535#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9507#(< ~counter~0 86)} is VALID [2022-04-14 16:17:12,121 INFO L290 TraceCheckUtils]: 295: Hoare triple {9535#(< ~counter~0 85)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9535#(< ~counter~0 85)} is VALID [2022-04-14 16:17:12,121 INFO L290 TraceCheckUtils]: 294: Hoare triple {9535#(< ~counter~0 85)} assume !!(0 != ~r~0); {9535#(< ~counter~0 85)} is VALID [2022-04-14 16:17:12,122 INFO L284 TraceCheckUtils]: 293: Hoare quadruple {7738#true} {9535#(< ~counter~0 85)} #63#return; {9535#(< ~counter~0 85)} is VALID [2022-04-14 16:17:12,122 INFO L290 TraceCheckUtils]: 292: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,122 INFO L290 TraceCheckUtils]: 291: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,122 INFO L290 TraceCheckUtils]: 290: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,122 INFO L272 TraceCheckUtils]: 289: Hoare triple {9535#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,123 INFO L290 TraceCheckUtils]: 288: Hoare triple {9535#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {9535#(< ~counter~0 85)} is VALID [2022-04-14 16:17:12,123 INFO L290 TraceCheckUtils]: 287: Hoare triple {9563#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9535#(< ~counter~0 85)} is VALID [2022-04-14 16:17:12,123 INFO L290 TraceCheckUtils]: 286: Hoare triple {9563#(< ~counter~0 84)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9563#(< ~counter~0 84)} is VALID [2022-04-14 16:17:12,124 INFO L290 TraceCheckUtils]: 285: Hoare triple {9563#(< ~counter~0 84)} assume !!(0 != ~r~0); {9563#(< ~counter~0 84)} is VALID [2022-04-14 16:17:12,124 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {7738#true} {9563#(< ~counter~0 84)} #63#return; {9563#(< ~counter~0 84)} is VALID [2022-04-14 16:17:12,124 INFO L290 TraceCheckUtils]: 283: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,125 INFO L290 TraceCheckUtils]: 282: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,125 INFO L290 TraceCheckUtils]: 281: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,125 INFO L272 TraceCheckUtils]: 280: Hoare triple {9563#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,125 INFO L290 TraceCheckUtils]: 279: Hoare triple {9563#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {9563#(< ~counter~0 84)} is VALID [2022-04-14 16:17:12,126 INFO L290 TraceCheckUtils]: 278: Hoare triple {9591#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9563#(< ~counter~0 84)} is VALID [2022-04-14 16:17:12,126 INFO L290 TraceCheckUtils]: 277: Hoare triple {9591#(< ~counter~0 83)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9591#(< ~counter~0 83)} is VALID [2022-04-14 16:17:12,126 INFO L290 TraceCheckUtils]: 276: Hoare triple {9591#(< ~counter~0 83)} assume !!(0 != ~r~0); {9591#(< ~counter~0 83)} is VALID [2022-04-14 16:17:12,127 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {7738#true} {9591#(< ~counter~0 83)} #63#return; {9591#(< ~counter~0 83)} is VALID [2022-04-14 16:17:12,127 INFO L290 TraceCheckUtils]: 274: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,127 INFO L290 TraceCheckUtils]: 273: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,127 INFO L290 TraceCheckUtils]: 272: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,127 INFO L272 TraceCheckUtils]: 271: Hoare triple {9591#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,128 INFO L290 TraceCheckUtils]: 270: Hoare triple {9591#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {9591#(< ~counter~0 83)} is VALID [2022-04-14 16:17:12,128 INFO L290 TraceCheckUtils]: 269: Hoare triple {9619#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9591#(< ~counter~0 83)} is VALID [2022-04-14 16:17:12,129 INFO L290 TraceCheckUtils]: 268: Hoare triple {9619#(< ~counter~0 82)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9619#(< ~counter~0 82)} is VALID [2022-04-14 16:17:12,129 INFO L290 TraceCheckUtils]: 267: Hoare triple {9619#(< ~counter~0 82)} assume !!(0 != ~r~0); {9619#(< ~counter~0 82)} is VALID [2022-04-14 16:17:12,130 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {7738#true} {9619#(< ~counter~0 82)} #63#return; {9619#(< ~counter~0 82)} is VALID [2022-04-14 16:17:12,130 INFO L290 TraceCheckUtils]: 265: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,130 INFO L290 TraceCheckUtils]: 264: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,130 INFO L290 TraceCheckUtils]: 263: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,130 INFO L272 TraceCheckUtils]: 262: Hoare triple {9619#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,130 INFO L290 TraceCheckUtils]: 261: Hoare triple {9619#(< ~counter~0 82)} assume !!(#t~post6 < 100);havoc #t~post6; {9619#(< ~counter~0 82)} is VALID [2022-04-14 16:17:12,131 INFO L290 TraceCheckUtils]: 260: Hoare triple {9647#(< ~counter~0 81)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9619#(< ~counter~0 82)} is VALID [2022-04-14 16:17:12,131 INFO L290 TraceCheckUtils]: 259: Hoare triple {9647#(< ~counter~0 81)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9647#(< ~counter~0 81)} is VALID [2022-04-14 16:17:12,131 INFO L290 TraceCheckUtils]: 258: Hoare triple {9647#(< ~counter~0 81)} assume !!(0 != ~r~0); {9647#(< ~counter~0 81)} is VALID [2022-04-14 16:17:12,132 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {7738#true} {9647#(< ~counter~0 81)} #63#return; {9647#(< ~counter~0 81)} is VALID [2022-04-14 16:17:12,132 INFO L290 TraceCheckUtils]: 256: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,132 INFO L290 TraceCheckUtils]: 255: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,132 INFO L290 TraceCheckUtils]: 254: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,132 INFO L272 TraceCheckUtils]: 253: Hoare triple {9647#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,133 INFO L290 TraceCheckUtils]: 252: Hoare triple {9647#(< ~counter~0 81)} assume !!(#t~post6 < 100);havoc #t~post6; {9647#(< ~counter~0 81)} is VALID [2022-04-14 16:17:12,133 INFO L290 TraceCheckUtils]: 251: Hoare triple {9675#(< ~counter~0 80)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9647#(< ~counter~0 81)} is VALID [2022-04-14 16:17:12,134 INFO L290 TraceCheckUtils]: 250: Hoare triple {9675#(< ~counter~0 80)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9675#(< ~counter~0 80)} is VALID [2022-04-14 16:17:12,134 INFO L290 TraceCheckUtils]: 249: Hoare triple {9675#(< ~counter~0 80)} assume !!(0 != ~r~0); {9675#(< ~counter~0 80)} is VALID [2022-04-14 16:17:12,134 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {7738#true} {9675#(< ~counter~0 80)} #63#return; {9675#(< ~counter~0 80)} is VALID [2022-04-14 16:17:12,135 INFO L290 TraceCheckUtils]: 247: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,135 INFO L290 TraceCheckUtils]: 246: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,135 INFO L290 TraceCheckUtils]: 245: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,135 INFO L272 TraceCheckUtils]: 244: Hoare triple {9675#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,135 INFO L290 TraceCheckUtils]: 243: Hoare triple {9675#(< ~counter~0 80)} assume !!(#t~post6 < 100);havoc #t~post6; {9675#(< ~counter~0 80)} is VALID [2022-04-14 16:17:12,136 INFO L290 TraceCheckUtils]: 242: Hoare triple {9703#(< ~counter~0 79)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9675#(< ~counter~0 80)} is VALID [2022-04-14 16:17:12,136 INFO L290 TraceCheckUtils]: 241: Hoare triple {9703#(< ~counter~0 79)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9703#(< ~counter~0 79)} is VALID [2022-04-14 16:17:12,136 INFO L290 TraceCheckUtils]: 240: Hoare triple {9703#(< ~counter~0 79)} assume !!(0 != ~r~0); {9703#(< ~counter~0 79)} is VALID [2022-04-14 16:17:12,137 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {7738#true} {9703#(< ~counter~0 79)} #63#return; {9703#(< ~counter~0 79)} is VALID [2022-04-14 16:17:12,137 INFO L290 TraceCheckUtils]: 238: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,137 INFO L290 TraceCheckUtils]: 237: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,137 INFO L290 TraceCheckUtils]: 236: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,137 INFO L272 TraceCheckUtils]: 235: Hoare triple {9703#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,138 INFO L290 TraceCheckUtils]: 234: Hoare triple {9703#(< ~counter~0 79)} assume !!(#t~post6 < 100);havoc #t~post6; {9703#(< ~counter~0 79)} is VALID [2022-04-14 16:17:12,138 INFO L290 TraceCheckUtils]: 233: Hoare triple {9731#(< ~counter~0 78)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9703#(< ~counter~0 79)} is VALID [2022-04-14 16:17:12,138 INFO L290 TraceCheckUtils]: 232: Hoare triple {9731#(< ~counter~0 78)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9731#(< ~counter~0 78)} is VALID [2022-04-14 16:17:12,139 INFO L290 TraceCheckUtils]: 231: Hoare triple {9731#(< ~counter~0 78)} assume !!(0 != ~r~0); {9731#(< ~counter~0 78)} is VALID [2022-04-14 16:17:12,139 INFO L284 TraceCheckUtils]: 230: Hoare quadruple {7738#true} {9731#(< ~counter~0 78)} #63#return; {9731#(< ~counter~0 78)} is VALID [2022-04-14 16:17:12,139 INFO L290 TraceCheckUtils]: 229: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,139 INFO L290 TraceCheckUtils]: 228: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,140 INFO L290 TraceCheckUtils]: 227: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,140 INFO L272 TraceCheckUtils]: 226: Hoare triple {9731#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,140 INFO L290 TraceCheckUtils]: 225: Hoare triple {9731#(< ~counter~0 78)} assume !!(#t~post6 < 100);havoc #t~post6; {9731#(< ~counter~0 78)} is VALID [2022-04-14 16:17:12,140 INFO L290 TraceCheckUtils]: 224: Hoare triple {9759#(< ~counter~0 77)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9731#(< ~counter~0 78)} is VALID [2022-04-14 16:17:12,141 INFO L290 TraceCheckUtils]: 223: Hoare triple {9759#(< ~counter~0 77)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9759#(< ~counter~0 77)} is VALID [2022-04-14 16:17:12,141 INFO L290 TraceCheckUtils]: 222: Hoare triple {9759#(< ~counter~0 77)} assume !!(0 != ~r~0); {9759#(< ~counter~0 77)} is VALID [2022-04-14 16:17:12,142 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {7738#true} {9759#(< ~counter~0 77)} #63#return; {9759#(< ~counter~0 77)} is VALID [2022-04-14 16:17:12,142 INFO L290 TraceCheckUtils]: 220: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,142 INFO L290 TraceCheckUtils]: 219: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,142 INFO L290 TraceCheckUtils]: 218: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,142 INFO L272 TraceCheckUtils]: 217: Hoare triple {9759#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,142 INFO L290 TraceCheckUtils]: 216: Hoare triple {9759#(< ~counter~0 77)} assume !!(#t~post6 < 100);havoc #t~post6; {9759#(< ~counter~0 77)} is VALID [2022-04-14 16:17:12,143 INFO L290 TraceCheckUtils]: 215: Hoare triple {9787#(< ~counter~0 76)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9759#(< ~counter~0 77)} is VALID [2022-04-14 16:17:12,143 INFO L290 TraceCheckUtils]: 214: Hoare triple {9787#(< ~counter~0 76)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9787#(< ~counter~0 76)} is VALID [2022-04-14 16:17:12,143 INFO L290 TraceCheckUtils]: 213: Hoare triple {9787#(< ~counter~0 76)} assume !!(0 != ~r~0); {9787#(< ~counter~0 76)} is VALID [2022-04-14 16:17:12,144 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {7738#true} {9787#(< ~counter~0 76)} #63#return; {9787#(< ~counter~0 76)} is VALID [2022-04-14 16:17:12,144 INFO L290 TraceCheckUtils]: 211: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,144 INFO L290 TraceCheckUtils]: 210: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,144 INFO L290 TraceCheckUtils]: 209: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,144 INFO L272 TraceCheckUtils]: 208: Hoare triple {9787#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,145 INFO L290 TraceCheckUtils]: 207: Hoare triple {9787#(< ~counter~0 76)} assume !!(#t~post6 < 100);havoc #t~post6; {9787#(< ~counter~0 76)} is VALID [2022-04-14 16:17:12,145 INFO L290 TraceCheckUtils]: 206: Hoare triple {9815#(< ~counter~0 75)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9787#(< ~counter~0 76)} is VALID [2022-04-14 16:17:12,146 INFO L290 TraceCheckUtils]: 205: Hoare triple {9815#(< ~counter~0 75)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9815#(< ~counter~0 75)} is VALID [2022-04-14 16:17:12,146 INFO L290 TraceCheckUtils]: 204: Hoare triple {9815#(< ~counter~0 75)} assume !!(0 != ~r~0); {9815#(< ~counter~0 75)} is VALID [2022-04-14 16:17:12,146 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {7738#true} {9815#(< ~counter~0 75)} #63#return; {9815#(< ~counter~0 75)} is VALID [2022-04-14 16:17:12,147 INFO L290 TraceCheckUtils]: 202: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,147 INFO L290 TraceCheckUtils]: 201: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,147 INFO L290 TraceCheckUtils]: 200: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,147 INFO L272 TraceCheckUtils]: 199: Hoare triple {9815#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,147 INFO L290 TraceCheckUtils]: 198: Hoare triple {9815#(< ~counter~0 75)} assume !!(#t~post6 < 100);havoc #t~post6; {9815#(< ~counter~0 75)} is VALID [2022-04-14 16:17:12,148 INFO L290 TraceCheckUtils]: 197: Hoare triple {9843#(< ~counter~0 74)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9815#(< ~counter~0 75)} is VALID [2022-04-14 16:17:12,148 INFO L290 TraceCheckUtils]: 196: Hoare triple {9843#(< ~counter~0 74)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9843#(< ~counter~0 74)} is VALID [2022-04-14 16:17:12,148 INFO L290 TraceCheckUtils]: 195: Hoare triple {9843#(< ~counter~0 74)} assume !!(0 != ~r~0); {9843#(< ~counter~0 74)} is VALID [2022-04-14 16:17:12,149 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {7738#true} {9843#(< ~counter~0 74)} #63#return; {9843#(< ~counter~0 74)} is VALID [2022-04-14 16:17:12,149 INFO L290 TraceCheckUtils]: 193: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,149 INFO L290 TraceCheckUtils]: 192: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,149 INFO L290 TraceCheckUtils]: 191: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,149 INFO L272 TraceCheckUtils]: 190: Hoare triple {9843#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,150 INFO L290 TraceCheckUtils]: 189: Hoare triple {9843#(< ~counter~0 74)} assume !!(#t~post6 < 100);havoc #t~post6; {9843#(< ~counter~0 74)} is VALID [2022-04-14 16:17:12,150 INFO L290 TraceCheckUtils]: 188: Hoare triple {9871#(< ~counter~0 73)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9843#(< ~counter~0 74)} is VALID [2022-04-14 16:17:12,150 INFO L290 TraceCheckUtils]: 187: Hoare triple {9871#(< ~counter~0 73)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9871#(< ~counter~0 73)} is VALID [2022-04-14 16:17:12,151 INFO L290 TraceCheckUtils]: 186: Hoare triple {9871#(< ~counter~0 73)} assume !!(0 != ~r~0); {9871#(< ~counter~0 73)} is VALID [2022-04-14 16:17:12,151 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {7738#true} {9871#(< ~counter~0 73)} #63#return; {9871#(< ~counter~0 73)} is VALID [2022-04-14 16:17:12,151 INFO L290 TraceCheckUtils]: 184: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,151 INFO L290 TraceCheckUtils]: 183: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,152 INFO L290 TraceCheckUtils]: 182: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,152 INFO L272 TraceCheckUtils]: 181: Hoare triple {9871#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,152 INFO L290 TraceCheckUtils]: 180: Hoare triple {9871#(< ~counter~0 73)} assume !!(#t~post6 < 100);havoc #t~post6; {9871#(< ~counter~0 73)} is VALID [2022-04-14 16:17:12,152 INFO L290 TraceCheckUtils]: 179: Hoare triple {9899#(< ~counter~0 72)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9871#(< ~counter~0 73)} is VALID [2022-04-14 16:17:12,153 INFO L290 TraceCheckUtils]: 178: Hoare triple {9899#(< ~counter~0 72)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9899#(< ~counter~0 72)} is VALID [2022-04-14 16:17:12,153 INFO L290 TraceCheckUtils]: 177: Hoare triple {9899#(< ~counter~0 72)} assume !!(0 != ~r~0); {9899#(< ~counter~0 72)} is VALID [2022-04-14 16:17:12,154 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {7738#true} {9899#(< ~counter~0 72)} #63#return; {9899#(< ~counter~0 72)} is VALID [2022-04-14 16:17:12,154 INFO L290 TraceCheckUtils]: 175: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,154 INFO L290 TraceCheckUtils]: 174: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,154 INFO L290 TraceCheckUtils]: 173: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,154 INFO L272 TraceCheckUtils]: 172: Hoare triple {9899#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,154 INFO L290 TraceCheckUtils]: 171: Hoare triple {9899#(< ~counter~0 72)} assume !!(#t~post6 < 100);havoc #t~post6; {9899#(< ~counter~0 72)} is VALID [2022-04-14 16:17:12,155 INFO L290 TraceCheckUtils]: 170: Hoare triple {9927#(< ~counter~0 71)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9899#(< ~counter~0 72)} is VALID [2022-04-14 16:17:12,155 INFO L290 TraceCheckUtils]: 169: Hoare triple {9927#(< ~counter~0 71)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9927#(< ~counter~0 71)} is VALID [2022-04-14 16:17:12,155 INFO L290 TraceCheckUtils]: 168: Hoare triple {9927#(< ~counter~0 71)} assume !!(0 != ~r~0); {9927#(< ~counter~0 71)} is VALID [2022-04-14 16:17:12,156 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {7738#true} {9927#(< ~counter~0 71)} #63#return; {9927#(< ~counter~0 71)} is VALID [2022-04-14 16:17:12,156 INFO L290 TraceCheckUtils]: 166: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,156 INFO L290 TraceCheckUtils]: 165: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,156 INFO L290 TraceCheckUtils]: 164: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,156 INFO L272 TraceCheckUtils]: 163: Hoare triple {9927#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,157 INFO L290 TraceCheckUtils]: 162: Hoare triple {9927#(< ~counter~0 71)} assume !!(#t~post6 < 100);havoc #t~post6; {9927#(< ~counter~0 71)} is VALID [2022-04-14 16:17:12,157 INFO L290 TraceCheckUtils]: 161: Hoare triple {9955#(< ~counter~0 70)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9927#(< ~counter~0 71)} is VALID [2022-04-14 16:17:12,158 INFO L290 TraceCheckUtils]: 160: Hoare triple {9955#(< ~counter~0 70)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9955#(< ~counter~0 70)} is VALID [2022-04-14 16:17:12,168 INFO L290 TraceCheckUtils]: 159: Hoare triple {9955#(< ~counter~0 70)} assume !!(0 != ~r~0); {9955#(< ~counter~0 70)} is VALID [2022-04-14 16:17:12,169 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {7738#true} {9955#(< ~counter~0 70)} #63#return; {9955#(< ~counter~0 70)} is VALID [2022-04-14 16:17:12,169 INFO L290 TraceCheckUtils]: 157: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,169 INFO L290 TraceCheckUtils]: 156: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,169 INFO L290 TraceCheckUtils]: 155: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,169 INFO L272 TraceCheckUtils]: 154: Hoare triple {9955#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,170 INFO L290 TraceCheckUtils]: 153: Hoare triple {9955#(< ~counter~0 70)} assume !!(#t~post6 < 100);havoc #t~post6; {9955#(< ~counter~0 70)} is VALID [2022-04-14 16:17:12,170 INFO L290 TraceCheckUtils]: 152: Hoare triple {9983#(< ~counter~0 69)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9955#(< ~counter~0 70)} is VALID [2022-04-14 16:17:12,171 INFO L290 TraceCheckUtils]: 151: Hoare triple {9983#(< ~counter~0 69)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9983#(< ~counter~0 69)} is VALID [2022-04-14 16:17:12,171 INFO L290 TraceCheckUtils]: 150: Hoare triple {9983#(< ~counter~0 69)} assume !!(0 != ~r~0); {9983#(< ~counter~0 69)} is VALID [2022-04-14 16:17:12,172 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {7738#true} {9983#(< ~counter~0 69)} #63#return; {9983#(< ~counter~0 69)} is VALID [2022-04-14 16:17:12,172 INFO L290 TraceCheckUtils]: 148: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,172 INFO L290 TraceCheckUtils]: 147: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,172 INFO L290 TraceCheckUtils]: 146: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,172 INFO L272 TraceCheckUtils]: 145: Hoare triple {9983#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,172 INFO L290 TraceCheckUtils]: 144: Hoare triple {9983#(< ~counter~0 69)} assume !!(#t~post6 < 100);havoc #t~post6; {9983#(< ~counter~0 69)} is VALID [2022-04-14 16:17:12,173 INFO L290 TraceCheckUtils]: 143: Hoare triple {10011#(< ~counter~0 68)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9983#(< ~counter~0 69)} is VALID [2022-04-14 16:17:12,173 INFO L290 TraceCheckUtils]: 142: Hoare triple {10011#(< ~counter~0 68)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10011#(< ~counter~0 68)} is VALID [2022-04-14 16:17:12,173 INFO L290 TraceCheckUtils]: 141: Hoare triple {10011#(< ~counter~0 68)} assume !!(0 != ~r~0); {10011#(< ~counter~0 68)} is VALID [2022-04-14 16:17:12,174 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {7738#true} {10011#(< ~counter~0 68)} #63#return; {10011#(< ~counter~0 68)} is VALID [2022-04-14 16:17:12,174 INFO L290 TraceCheckUtils]: 139: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,174 INFO L290 TraceCheckUtils]: 138: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,174 INFO L290 TraceCheckUtils]: 137: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,174 INFO L272 TraceCheckUtils]: 136: Hoare triple {10011#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,175 INFO L290 TraceCheckUtils]: 135: Hoare triple {10011#(< ~counter~0 68)} assume !!(#t~post6 < 100);havoc #t~post6; {10011#(< ~counter~0 68)} is VALID [2022-04-14 16:17:12,175 INFO L290 TraceCheckUtils]: 134: Hoare triple {10039#(< ~counter~0 67)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10011#(< ~counter~0 68)} is VALID [2022-04-14 16:17:12,175 INFO L290 TraceCheckUtils]: 133: Hoare triple {10039#(< ~counter~0 67)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10039#(< ~counter~0 67)} is VALID [2022-04-14 16:17:12,176 INFO L290 TraceCheckUtils]: 132: Hoare triple {10039#(< ~counter~0 67)} assume !!(0 != ~r~0); {10039#(< ~counter~0 67)} is VALID [2022-04-14 16:17:12,176 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {7738#true} {10039#(< ~counter~0 67)} #63#return; {10039#(< ~counter~0 67)} is VALID [2022-04-14 16:17:12,176 INFO L290 TraceCheckUtils]: 130: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,176 INFO L290 TraceCheckUtils]: 129: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,177 INFO L290 TraceCheckUtils]: 128: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,177 INFO L272 TraceCheckUtils]: 127: Hoare triple {10039#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,177 INFO L290 TraceCheckUtils]: 126: Hoare triple {10039#(< ~counter~0 67)} assume !!(#t~post6 < 100);havoc #t~post6; {10039#(< ~counter~0 67)} is VALID [2022-04-14 16:17:12,177 INFO L290 TraceCheckUtils]: 125: Hoare triple {10067#(< ~counter~0 66)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10039#(< ~counter~0 67)} is VALID [2022-04-14 16:17:12,178 INFO L290 TraceCheckUtils]: 124: Hoare triple {10067#(< ~counter~0 66)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10067#(< ~counter~0 66)} is VALID [2022-04-14 16:17:12,178 INFO L290 TraceCheckUtils]: 123: Hoare triple {10067#(< ~counter~0 66)} assume !!(0 != ~r~0); {10067#(< ~counter~0 66)} is VALID [2022-04-14 16:17:12,179 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {7738#true} {10067#(< ~counter~0 66)} #63#return; {10067#(< ~counter~0 66)} is VALID [2022-04-14 16:17:12,179 INFO L290 TraceCheckUtils]: 121: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,179 INFO L290 TraceCheckUtils]: 120: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,179 INFO L290 TraceCheckUtils]: 119: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,179 INFO L272 TraceCheckUtils]: 118: Hoare triple {10067#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,179 INFO L290 TraceCheckUtils]: 117: Hoare triple {10067#(< ~counter~0 66)} assume !!(#t~post6 < 100);havoc #t~post6; {10067#(< ~counter~0 66)} is VALID [2022-04-14 16:17:12,180 INFO L290 TraceCheckUtils]: 116: Hoare triple {10095#(< ~counter~0 65)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10067#(< ~counter~0 66)} is VALID [2022-04-14 16:17:12,180 INFO L290 TraceCheckUtils]: 115: Hoare triple {10095#(< ~counter~0 65)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10095#(< ~counter~0 65)} is VALID [2022-04-14 16:17:12,181 INFO L290 TraceCheckUtils]: 114: Hoare triple {10095#(< ~counter~0 65)} assume !!(0 != ~r~0); {10095#(< ~counter~0 65)} is VALID [2022-04-14 16:17:12,181 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {7738#true} {10095#(< ~counter~0 65)} #63#return; {10095#(< ~counter~0 65)} is VALID [2022-04-14 16:17:12,181 INFO L290 TraceCheckUtils]: 112: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,181 INFO L290 TraceCheckUtils]: 111: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,182 INFO L290 TraceCheckUtils]: 110: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,182 INFO L272 TraceCheckUtils]: 109: Hoare triple {10095#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,182 INFO L290 TraceCheckUtils]: 108: Hoare triple {10095#(< ~counter~0 65)} assume !!(#t~post6 < 100);havoc #t~post6; {10095#(< ~counter~0 65)} is VALID [2022-04-14 16:17:12,182 INFO L290 TraceCheckUtils]: 107: Hoare triple {10123#(< ~counter~0 64)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10095#(< ~counter~0 65)} is VALID [2022-04-14 16:17:12,183 INFO L290 TraceCheckUtils]: 106: Hoare triple {10123#(< ~counter~0 64)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10123#(< ~counter~0 64)} is VALID [2022-04-14 16:17:12,183 INFO L290 TraceCheckUtils]: 105: Hoare triple {10123#(< ~counter~0 64)} assume !!(0 != ~r~0); {10123#(< ~counter~0 64)} is VALID [2022-04-14 16:17:12,184 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {7738#true} {10123#(< ~counter~0 64)} #63#return; {10123#(< ~counter~0 64)} is VALID [2022-04-14 16:17:12,184 INFO L290 TraceCheckUtils]: 103: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,184 INFO L290 TraceCheckUtils]: 102: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,184 INFO L290 TraceCheckUtils]: 101: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,184 INFO L272 TraceCheckUtils]: 100: Hoare triple {10123#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,184 INFO L290 TraceCheckUtils]: 99: Hoare triple {10123#(< ~counter~0 64)} assume !!(#t~post6 < 100);havoc #t~post6; {10123#(< ~counter~0 64)} is VALID [2022-04-14 16:17:12,185 INFO L290 TraceCheckUtils]: 98: Hoare triple {10151#(< ~counter~0 63)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10123#(< ~counter~0 64)} is VALID [2022-04-14 16:17:12,185 INFO L290 TraceCheckUtils]: 97: Hoare triple {10151#(< ~counter~0 63)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10151#(< ~counter~0 63)} is VALID [2022-04-14 16:17:12,185 INFO L290 TraceCheckUtils]: 96: Hoare triple {10151#(< ~counter~0 63)} assume !!(0 != ~r~0); {10151#(< ~counter~0 63)} is VALID [2022-04-14 16:17:12,186 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7738#true} {10151#(< ~counter~0 63)} #63#return; {10151#(< ~counter~0 63)} is VALID [2022-04-14 16:17:12,186 INFO L290 TraceCheckUtils]: 94: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,186 INFO L290 TraceCheckUtils]: 93: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,186 INFO L290 TraceCheckUtils]: 92: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,186 INFO L272 TraceCheckUtils]: 91: Hoare triple {10151#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,187 INFO L290 TraceCheckUtils]: 90: Hoare triple {10151#(< ~counter~0 63)} assume !!(#t~post6 < 100);havoc #t~post6; {10151#(< ~counter~0 63)} is VALID [2022-04-14 16:17:12,187 INFO L290 TraceCheckUtils]: 89: Hoare triple {10179#(< ~counter~0 62)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10151#(< ~counter~0 63)} is VALID [2022-04-14 16:17:12,188 INFO L290 TraceCheckUtils]: 88: Hoare triple {10179#(< ~counter~0 62)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10179#(< ~counter~0 62)} is VALID [2022-04-14 16:17:12,188 INFO L290 TraceCheckUtils]: 87: Hoare triple {10179#(< ~counter~0 62)} assume !!(0 != ~r~0); {10179#(< ~counter~0 62)} is VALID [2022-04-14 16:17:12,188 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7738#true} {10179#(< ~counter~0 62)} #63#return; {10179#(< ~counter~0 62)} is VALID [2022-04-14 16:17:12,189 INFO L290 TraceCheckUtils]: 85: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,189 INFO L290 TraceCheckUtils]: 84: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,189 INFO L290 TraceCheckUtils]: 83: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,189 INFO L272 TraceCheckUtils]: 82: Hoare triple {10179#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,189 INFO L290 TraceCheckUtils]: 81: Hoare triple {10179#(< ~counter~0 62)} assume !!(#t~post6 < 100);havoc #t~post6; {10179#(< ~counter~0 62)} is VALID [2022-04-14 16:17:12,190 INFO L290 TraceCheckUtils]: 80: Hoare triple {10207#(< ~counter~0 61)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10179#(< ~counter~0 62)} is VALID [2022-04-14 16:17:12,190 INFO L290 TraceCheckUtils]: 79: Hoare triple {10207#(< ~counter~0 61)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10207#(< ~counter~0 61)} is VALID [2022-04-14 16:17:12,190 INFO L290 TraceCheckUtils]: 78: Hoare triple {10207#(< ~counter~0 61)} assume !!(0 != ~r~0); {10207#(< ~counter~0 61)} is VALID [2022-04-14 16:17:12,191 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7738#true} {10207#(< ~counter~0 61)} #63#return; {10207#(< ~counter~0 61)} is VALID [2022-04-14 16:17:12,191 INFO L290 TraceCheckUtils]: 76: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,191 INFO L290 TraceCheckUtils]: 75: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,191 INFO L290 TraceCheckUtils]: 74: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,191 INFO L272 TraceCheckUtils]: 73: Hoare triple {10207#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,191 INFO L290 TraceCheckUtils]: 72: Hoare triple {10207#(< ~counter~0 61)} assume !!(#t~post6 < 100);havoc #t~post6; {10207#(< ~counter~0 61)} is VALID [2022-04-14 16:17:12,192 INFO L290 TraceCheckUtils]: 71: Hoare triple {10235#(< ~counter~0 60)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10207#(< ~counter~0 61)} is VALID [2022-04-14 16:17:12,192 INFO L290 TraceCheckUtils]: 70: Hoare triple {10235#(< ~counter~0 60)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10235#(< ~counter~0 60)} is VALID [2022-04-14 16:17:12,193 INFO L290 TraceCheckUtils]: 69: Hoare triple {10235#(< ~counter~0 60)} assume !!(0 != ~r~0); {10235#(< ~counter~0 60)} is VALID [2022-04-14 16:17:12,193 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7738#true} {10235#(< ~counter~0 60)} #63#return; {10235#(< ~counter~0 60)} is VALID [2022-04-14 16:17:12,193 INFO L290 TraceCheckUtils]: 67: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,193 INFO L290 TraceCheckUtils]: 66: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,193 INFO L290 TraceCheckUtils]: 65: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,194 INFO L272 TraceCheckUtils]: 64: Hoare triple {10235#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,194 INFO L290 TraceCheckUtils]: 63: Hoare triple {10235#(< ~counter~0 60)} assume !!(#t~post6 < 100);havoc #t~post6; {10235#(< ~counter~0 60)} is VALID [2022-04-14 16:17:12,194 INFO L290 TraceCheckUtils]: 62: Hoare triple {10263#(< ~counter~0 59)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10235#(< ~counter~0 60)} is VALID [2022-04-14 16:17:12,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {10263#(< ~counter~0 59)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10263#(< ~counter~0 59)} is VALID [2022-04-14 16:17:12,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {10263#(< ~counter~0 59)} assume !!(0 != ~r~0); {10263#(< ~counter~0 59)} is VALID [2022-04-14 16:17:12,196 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7738#true} {10263#(< ~counter~0 59)} #63#return; {10263#(< ~counter~0 59)} is VALID [2022-04-14 16:17:12,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,196 INFO L272 TraceCheckUtils]: 55: Hoare triple {10263#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,196 INFO L290 TraceCheckUtils]: 54: Hoare triple {10263#(< ~counter~0 59)} assume !!(#t~post6 < 100);havoc #t~post6; {10263#(< ~counter~0 59)} is VALID [2022-04-14 16:17:12,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {10291#(< ~counter~0 58)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10263#(< ~counter~0 59)} is VALID [2022-04-14 16:17:12,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {10291#(< ~counter~0 58)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10291#(< ~counter~0 58)} is VALID [2022-04-14 16:17:12,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {10291#(< ~counter~0 58)} assume !!(0 != ~r~0); {10291#(< ~counter~0 58)} is VALID [2022-04-14 16:17:12,198 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7738#true} {10291#(< ~counter~0 58)} #63#return; {10291#(< ~counter~0 58)} is VALID [2022-04-14 16:17:12,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,198 INFO L272 TraceCheckUtils]: 46: Hoare triple {10291#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {10291#(< ~counter~0 58)} assume !!(#t~post6 < 100);havoc #t~post6; {10291#(< ~counter~0 58)} is VALID [2022-04-14 16:17:12,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {10319#(< ~counter~0 57)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10291#(< ~counter~0 58)} is VALID [2022-04-14 16:17:12,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {10319#(< ~counter~0 57)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10319#(< ~counter~0 57)} is VALID [2022-04-14 16:17:12,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {10319#(< ~counter~0 57)} assume !!(0 != ~r~0); {10319#(< ~counter~0 57)} is VALID [2022-04-14 16:17:12,200 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7738#true} {10319#(< ~counter~0 57)} #63#return; {10319#(< ~counter~0 57)} is VALID [2022-04-14 16:17:12,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,201 INFO L272 TraceCheckUtils]: 37: Hoare triple {10319#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {10319#(< ~counter~0 57)} assume !!(#t~post6 < 100);havoc #t~post6; {10319#(< ~counter~0 57)} is VALID [2022-04-14 16:17:12,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {10347#(< ~counter~0 56)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10319#(< ~counter~0 57)} is VALID [2022-04-14 16:17:12,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {10347#(< ~counter~0 56)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10347#(< ~counter~0 56)} is VALID [2022-04-14 16:17:12,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {10347#(< ~counter~0 56)} assume !!(0 != ~r~0); {10347#(< ~counter~0 56)} is VALID [2022-04-14 16:17:12,203 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7738#true} {10347#(< ~counter~0 56)} #63#return; {10347#(< ~counter~0 56)} is VALID [2022-04-14 16:17:12,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,203 INFO L272 TraceCheckUtils]: 28: Hoare triple {10347#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {10347#(< ~counter~0 56)} assume !!(#t~post6 < 100);havoc #t~post6; {10347#(< ~counter~0 56)} is VALID [2022-04-14 16:17:12,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {10375#(< ~counter~0 55)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10347#(< ~counter~0 56)} is VALID [2022-04-14 16:17:12,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {10375#(< ~counter~0 55)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10375#(< ~counter~0 55)} is VALID [2022-04-14 16:17:12,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {10375#(< ~counter~0 55)} assume !!(0 != ~r~0); {10375#(< ~counter~0 55)} is VALID [2022-04-14 16:17:12,205 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7738#true} {10375#(< ~counter~0 55)} #63#return; {10375#(< ~counter~0 55)} is VALID [2022-04-14 16:17:12,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,205 INFO L272 TraceCheckUtils]: 19: Hoare triple {10375#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {10375#(< ~counter~0 55)} assume !!(#t~post6 < 100);havoc #t~post6; {10375#(< ~counter~0 55)} is VALID [2022-04-14 16:17:12,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {10403#(< ~counter~0 54)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10375#(< ~counter~0 55)} is VALID [2022-04-14 16:17:12,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {10403#(< ~counter~0 54)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10403#(< ~counter~0 54)} is VALID [2022-04-14 16:17:12,207 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7738#true} {10403#(< ~counter~0 54)} #61#return; {10403#(< ~counter~0 54)} is VALID [2022-04-14 16:17:12,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,207 INFO L272 TraceCheckUtils]: 11: Hoare triple {10403#(< ~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)); {7738#true} is VALID [2022-04-14 16:17:12,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7738#true} {10403#(< ~counter~0 54)} #59#return; {10403#(< ~counter~0 54)} is VALID [2022-04-14 16:17:12,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-14 16:17:12,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-14 16:17:12,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-14 16:17:12,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {10403#(< ~counter~0 54)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7738#true} is VALID [2022-04-14 16:17:12,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {10403#(< ~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; {10403#(< ~counter~0 54)} is VALID [2022-04-14 16:17:12,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {10403#(< ~counter~0 54)} call #t~ret7 := main(); {10403#(< ~counter~0 54)} is VALID [2022-04-14 16:17:12,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10403#(< ~counter~0 54)} {7738#true} #67#return; {10403#(< ~counter~0 54)} is VALID [2022-04-14 16:17:12,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {10403#(< ~counter~0 54)} assume true; {10403#(< ~counter~0 54)} is VALID [2022-04-14 16:17:12,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {7738#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10403#(< ~counter~0 54)} is VALID [2022-04-14 16:17:12,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {7738#true} call ULTIMATE.init(); {7738#true} is VALID [2022-04-14 16:17:12,214 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-14 16:17:12,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:17:12,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663447375] [2022-04-14 16:17:12,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:17:12,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6279786] [2022-04-14 16:17:12,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6279786] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:17:12,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:17:12,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2022-04-14 16:17:12,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647443033] [2022-04-14 16:17:12,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:17:12,217 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-14 16:17:12,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:17:12,219 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-14 16:17:12,728 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-14 16:17:12,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-14 16:17:12,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:17:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-14 16:17:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2022-04-14 16:17:12,732 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-14 16:17:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:20,348 INFO L93 Difference]: Finished difference Result 871 states and 1013 transitions. [2022-04-14 16:17:20,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-04-14 16:17:20,349 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-14 16:17:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:17:20,350 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-14 16:17:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 1012 transitions. [2022-04-14 16:17:20,418 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-14 16:17:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 1012 transitions. [2022-04-14 16:17:20,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 1012 transitions. [2022-04-14 16:17:21,265 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-14 16:17:21,310 INFO L225 Difference]: With dead ends: 871 [2022-04-14 16:17:21,310 INFO L226 Difference]: Without dead ends: 866 [2022-04-14 16:17:21,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 777 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2022-04-14 16:17:21,318 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 1896 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:17:21,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1896 Valid, 938 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-14 16:17:21,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-04-14 16:17:21,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2022-04-14 16:17:21,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:17:21,568 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-14 16:17:21,569 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-14 16:17:21,570 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-14 16:17:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:21,606 INFO L93 Difference]: Finished difference Result 866 states and 961 transitions. [2022-04-14 16:17:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 961 transitions. [2022-04-14 16:17:21,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:21,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:21,609 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-14 16:17:21,611 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-14 16:17:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:21,644 INFO L93 Difference]: Finished difference Result 866 states and 961 transitions. [2022-04-14 16:17:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 961 transitions. [2022-04-14 16:17:21,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:21,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:21,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:17:21,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:17:21,647 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-14 16:17:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 961 transitions. [2022-04-14 16:17:21,692 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 961 transitions. Word has length 437 [2022-04-14 16:17:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:17:21,693 INFO L478 AbstractCegarLoop]: Abstraction has 866 states and 961 transitions. [2022-04-14 16:17:21,694 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-14 16:17:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 961 transitions. [2022-04-14 16:17:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2022-04-14 16:17:21,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:17:21,716 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-14 16:17:21,726 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-14 16:17:21,926 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-14 16:17:21,926 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:17:21,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:17:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2015680598, now seen corresponding path program 6 times [2022-04-14 16:17:21,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:17:21,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551205828] [2022-04-14 16:17:21,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:17:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:17:22,017 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:17:22,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700356153] [2022-04-14 16:17:22,017 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-14 16:17:22,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:17:22,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:17:22,019 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-14 16:17:22,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process